Aviad Rubinstein
7 papers · 2016–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+3 more ↓ Show less ↑
🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (14) 🐣 Hot Topic Early Bird
🏆
Keyword Champion
(2)
🧬
Topic Evolution
📈
Trend Setter
Venues
Top co-authors
Research topics
Keywords
approximation algorithm
(5)
cardinality constraint
(2)
computational complexity
(2)
lower bound
(2)
monotone function
(2)
vc dimension
(1)
sparse pca
(1)
function learning
(1)
optimization theory
(1)
subset selection
(1)
submodular maximization
(1)
streaming algorithm
(1)
extensive-form game
(1)
iteration complexity
(1)
littlestone dimension
(1)
bayesian game
(1)
correlated equilibrium
(1)
submodular function
(1)
coarse correlated equilibrium
(1)
probabilistic analysis
(1)
Papers
A Near Linear Query Lower Bound for Submodular Maximization
ICML 2025
The complexity of approximate (coarse) correlated equilibrium for incomplete information games
COLT 2024
Cardinality constrained submodular maximization for random streams
NeurIPS 2021
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics
NeurIPS 2020
Inapproximability of VC Dimension and Littlestone’s Dimension
COLT 2017
On the Approximability of Sparse PCA
COLT 2016
The Power of Optimization from Samples
NeurIPS 2016