conftrace_

iteration complexity

70 papers

Explore in graph

Co-occurring keywords

convex optimization (1321) stochastic optimization (1060) non-convex optimization (547) stochastic gradient descent (1091) convergence rate (607) gradient descent (1144) primal-dual method (58) bilevel optimization (194) variance reduction (523) empirical risk minimization (352)

Papers

Decentralized Bilevel Optimization: A Perspective from Transient Iteration Complexity JMLR 2025
A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization JMLR 2025
Stochastic Interior-Point Methods for Smooth Conic Optimization with Applications JMLR 2025
From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes AAAI 2025
Optimizing over Multiple Distributions under Generalized Quasar-Convexity Condition NIPS 2024
Penalized Overdamped and Underdamped Langevin Monte Carlo Algorithms for Constrained Sampling JMLR 2024
Mean-Square Analysis of Discretized Itô Diffusions for Heavy-tailed Sampling JMLR 2024
Dueling Optimization with a Monotone Adversary ALT 2024
The complexity of approximate (coarse) correlated equilibrium for incomplete information games COLT 2024
Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes AISTATS 2024
An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization NIPS 2024
OptEx: Expediting First-Order Optimization with Approximately Parallelized Iterations NIPS 2024
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems JMLR 2023
Decentralized Learning: Theoretical Optimality and Practical Improvements JMLR 2023
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization ICML 2023
Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning ICML 2023
Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization NIPS 2023
Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees JMLR 2023
A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem AISTATS 2023
Closing the gap between the upper bound and lower bound of Adam's iteration complexity NIPS 2023
On the Accelerated Noise-Tolerant Power Method AISTATS 2023
Zeroth-Order Alternating Gradient Descent Ascent Algorithms for A Class of Nonconvex-Nonconcave Minimax Problems JMLR 2023
Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization AISTATS 2022
The power of first-order smooth optimization for black-box non-smooth problems ICML 2022
Accelerating Adaptive Cubic Regularization of Newton's Method via Random Sampling JMLR 2022