Karbasi, Amin
109 publications
ICML
2023
Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning
NeurIPS
2023
Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
NeurIPS
2022
Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes
NeurIPS
2020
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition
ICML
2020
More Data Can Expand the Generalization Gap Between Adversarially Robust and Standard Models
JMLR
2020
Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization
ICML
2019
Submodular Maximization Beyond Non-Negativity: Guarantees, Fast Algorithms, and Applications
ICML
2018
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity
ICML
2018
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
ICML
2017
Deletion-Robust Submodular Maximization: Data Summarization with “the Right to Be Forgotten”