conftrace_

strongly convex

89 papers

Explore in graph

Co-occurring keywords

convex optimization (1321) stochastic optimization (1060) stochastic gradient descent (1091) regret bound (1926) convergence rate (607) variance reduction (523) online convex optimization (165) online learning (1777) strong convexity (59) gradient descent (1144)

Papers

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization JMLR 2025
Optimal Decentralized Composite Optimization for Strongly Convex Functions JMLR 2025
Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles JMLR 2025
Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints NIPS 2024
Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity NIPS 2024
Achieving Linear Convergence with Parameter-Free Algorithms in Decentralized Optimization NIPS 2024
Stochastic Newton Proximal Extragradient Method NIPS 2024
Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search NIPS 2024
Linearly Constrained Bilevel Optimization: A Smoothed Implicit Gradient Approach ICML 2023
Unifying Nesterov’s Accelerated Gradient Methods for Convex and Strongly Convex Objective Functions ICML 2023
Improved Dynamic Regret for Online Frank-Wolfe COLT 2023
On User-Level Private Convex Optimization ICML 2023
Optimal Extragradient-Based Algorithms for Stochastic Variational Inequalities with Separable Structure NIPS 2023
Stochastic Reweighted Gradient Descent ICML 2022
A Regret-Variance Trade-Off in Online Learning NIPS 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 NIPS 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond AISTATS 2022
Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization AISTATS 2022
Online Frank-Wolfe with Arbitrary Delays NIPS 2022
Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization NIPS 2022
From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021
Projection-free Online Learning in Dynamic Environments AAAI 2021
On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021
Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$ NIPS 2021