conftrace_

stochastic convex optimization

69 papers

Explore in graph

Also known as

SCO

Co-occurring keywords

differential privacy (1016) sample complexity (1169) gradient descent (1144) convex optimization (1321) stochastic optimization (1060) empirical risk minimization (352) stochastic gradient descent (1091) user-level privacy (17) mirror descent (148) convergence rate (607)

Papers

Open Problem: Do Good Algorithms Necessarily Query Bad Points? COLT 2019
The Complexity of Making the Gradient Small in Stochastic Convex Optimization COLT 2019
Distributed Learning with Sublinear Communication ICML 2019
Faster Online Learning of Optimal Threshold for Consistent F-measure Optimization NIPS 2018
Information Theoretic Guarantees for Empirical Risk Minimization with Applications to Model Selection and Large-Scale Optimization ICML 2018
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback JMLR 2017
Empirical Risk Minimization for Stochastic Convex Optimization: $O(1/n)$- and $O(1/n^2)$-type of Risk Bounds COLT 2017
Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence ICML 2017
Dealing with Range Anxiety in Mean Estimation via Statistical Queries ALT 2017
Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back NIPS 2016
Local Minimax Complexity of Stochastic Convex Optimization NIPS 2016
Asynchronous stochastic convex optimization: the noise is in the noise and SGD don't care NIPS 2015
Linear Programming for Large-Scale Markov Decision Problems ICML 2014
Optimal rates for stochastic convex optimization under Tsybakov noise condition ICML 2013
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013
Stochastic convex optimization with bandit feedback NIPS 2011
Better Mini-Batch Algorithms via Accelerated Gradient Methods NIPS 2011
Smoothness, Low Noise and Fast Rates NIPS 2010
Fast Rates for Regularized Objectives NIPS 2008