Shamir, Ohad
129 publications
COLT
2025
The Oracle Complexity of Simplex-Based Matrix Games: Linear Separability and Nash Equilibria
NeurIPS
2023
Accelerated Zeroth-Order Method for Non-Smooth Stochastic Convex Optimization Problem with Infinite Variance
NeurIPSW
2023
An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization
COLT
2021
The Connection Between Approximation, Depth Separation and Learnability in Neural Networks
COLT
2021
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication
COLT
2019
Exponential Convergence Time of Gradient Descent for One-Dimensional Deep Linear Neural Networks
JMLR
2017
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
ICML
2017
Communication-Efficient Algorithms for Distributed Stochastic Principal Component Analysis
COLT
2016
Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016
NeurIPS
2014
Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation
AISTATS
2012
There’s a Hole in My Data Space: Piecewise Predictors for Heterogeneous Learning Problems