stochastic convex optimization

Asynchronous Distributed Learning : Adapting to Gradient Delays without Prior Knowledge ICML 2021 From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021 Learning with User-Level Privacy NeurIPS 2021 Never Go Full Batch (in Stochastic Convex Optimization) NeurIPS 2021 Non-Euclidean Differentially Private Stochastic Convex Optimization COLT 2021 Private Non-smooth ERM and SCO in Subquadratic Steps NeurIPS 2021 Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry ICML 2021 SGD Generalizes Better Than GD (And Regularization Doesn’t Help) COLT 2021 SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs NeurIPS 2021 The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication COLT 2021 A Data Efficient and Feasible Level Set Method for Stochastic Convex Optimization with Expectation Constraints JMLR 2020 Amortized Nesterov’s Momentum: A Robust Momentum and Its Application to Deep Learning UAI 2020 Can Implicit Bias Explain Generalization? Stochastic Convex Optimization as a Case Study NeurIPS 2020 High probability guarantees for stochastic convex optimization COLT 2020 Minibatch Stochastic Approximate Proximal Point Methods NeurIPS 2020 On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data ICML 2020 Optimal Query Complexity of Secure Stochastic Convex Optimization NeurIPS 2020 Anytime Online-to-Batch, Optimism and Acceleration ICML 2019 Distributed Learning with Sublinear Communication ICML 2019 Open Problem: Do Good Algorithms Necessarily Query Bad Points? COLT 2019 Private Stochastic Convex Optimization with Optimal Rates NeurIPS 2019 The Complexity of Making the Gradient Small in Stochastic Convex Optimization COLT 2019 Faster Online Learning of Optimal Threshold for Consistent F-measure Optimization NeurIPS 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