Eric Balkanski
20 papers · 2016–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+10 more ↓ Show less ↑
π Conference Polyglot (4) πΊοΈ Taxonomy Completionist (12) π§ Keyword Pioneer π Interdisciplinary Bridge π Academic Marathon (9)
π
Conference Polyglot
(4)
π
Academic Marathon
(9)
π€
Dynamic Duo
(11)
π¬
Deep Specialist
(11)
π§¬
Topic Evolution
π
Keyword Champion
(2)
ποΈ
Keyword Collector
(68)
π₯
Unstoppable
(10)
π
Century Club
(20)
π
Trend Setter
Conferences
NIPS (11)
ICML (5)
ALT (2)
COLT (2)
Top co-authors
Research topics
Keywords
approximation algorithm
(7)
submodular maximization
(6)
cardinality constraint
(5)
combinatorial optimization
(5)
online algorithm
(5)
approximation guarantee
(5)
learning-augmented algorithm
(4)
sample complexity
(4)
parallel algorithm
(3)
submodular function
(3)
learning-augmented prediction
(2)
submodular optimization
(2)
secretary problem
(2)
facility location
(2)
strongly convex
(1)
algorithm design
(1)
hypergraph learning
(1)
function learning
(1)
sparse representation
(1)
mechanism design
(1)
Papers
Strategyproof Learning with Advice
ALT 2025
Cost-Free Fairness in Online Correlation Clustering
ALT 2025
Fair Secretaries with Unfair Predictions
NIPS 2024
Randomized Strategic Facility Location with Predictions
NIPS 2024
Learning-Augmented Dynamic Submodular Maximization
NIPS 2024
Energy-Efficient Scheduling with Predictions
NIPS 2023
Learning Low Degree Hypergraphs
COLT 2022
Instance Specific Approximations for Submodular Maximization
ICML 2021
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation
NIPS 2020
The FAST Algorithm for Submodular Maximization
ICML 2020
Secretary Ranking with Minimal Inversions
NIPS 2019
Approximation Guarantees for Adaptive Sampling
ICML 2018
Learning to Optimize Combinatorial Functions
ICML 2018
Non-monotone Submodular Maximization in Exponentially Fewer Iterations
NIPS 2018
Statistical Cost Sharing
NIPS 2017
Minimizing a Submodular Function from Samples
NIPS 2017
The Importance of Communities for Learning to Influence
NIPS 2017
The Sample Complexity of Optimizing a Convex Function
COLT 2017
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization
ICML 2016
The Power of Optimization from Samples
NIPS 2016