Aviad Rubinstein
7 papers · 2016–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
π Cross-Pollinator (15) π Academic Marathon (9) π Interdisciplinary Bridge π£ Hot Topic Early Bird π Conference Polyglot (3)
πΊοΈ
Taxonomy Completionist
(13)
π§
Keyword Pioneer
π
Keyword Champion
(2)
π
Trend Setter
Conferences
COLT (3)
NIPS (3)
ICML (1)
Top co-authors
Keywords
approximation algorithm
(5)
computational complexity
(2)
monotone function
(2)
cardinality constraint
(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)
lower bound
(1)
littlestone dimension
(1)
bayesian game
(1)
correlated equilibrium
(1)
submodular function
(1)
probabilistic analysis
(1)
order statistic
(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
NIPS 2021
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics
NIPS 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
NIPS 2016