strongly convex

On User-Level Private Convex Optimization ICML 2023 Optimal Extragradient-Based Algorithms for Stochastic Variational Inequalities with Separable Structure NeurIPS 2023 Unifying Nesterov’s Accelerated Gradient Methods for Convex and Strongly Convex Objective Functions ICML 2023 A Regret-Variance Trade-Off in Online Learning NeurIPS 2022 Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization AISTATS 2022 Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization NeurIPS 2022 On Almost Sure Convergence Rates of Stochastic Gradient Methods COLT 2022 Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond NeurIPS 2022 Online Frank-Wolfe with Arbitrary Delays NeurIPS 2022 Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond AISTATS 2022 Stochastic Reweighted Gradient Descent ICML 2022 Affine Invariant Analysis of Frank-Wolfe on Strongly Convex Sets ICML 2021 Fast convergence of stochastic subgradient method under interpolation ICLR 2021 From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021 Online Convex Optimization with Continuous Switching Constraint NeurIPS 2021 On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021 Projection-free Online Learning in Dynamic Environments AAAI 2021 Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021 Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$ NeurIPS 2021 The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains NeurIPS 2021 A Class of Parallel Doubly Stochastic Algorithms for Large-Scale Learning JMLR 2020 Adapting to Smoothness: A More Universal Algorithm for Online Convex Optimization AAAI 2020 An Improved Analysis of Stochastic Gradient Descent with Momentum NeurIPS 2020 Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits NeurIPS 2020 High probability guarantees for stochastic convex optimization COLT 2020