conftrace_

complexity bound

50 papers

Explore in graph

Co-occurring keywords

stochastic optimization (1060) convex optimization (1321) nonconvex optimization (316) lower bound (173) gradient descent (1144) non-convex optimization (547) first-order method (89) accelerated gradient descent (29) minimax optimization (186) optimal transport (948)

Papers

Circuit Complexity Bounds for RoPE-based Transformer Architecture EMNLP 2025
Hardness of Learning Neural Networks under the Manifold Hypothesis NIPS 2024
On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis COLT 2024
Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints NIPS 2024
High-probability complexity bounds for stochastic non-convex minimax optimization NIPS 2024
Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems AISTATS 2024
The Fine-Grained Complexity of Gradient Computation for Training Large Language Models NIPS 2024
Low Degree Hardness for Broadcasting on Trees NIPS 2024
Accelerated Infeasibility Detection of Constrained Optimization and Fixed-Point Iterations ICML 2023
A Single-Loop Accelerated Extra-Gradient Difference Algorithm with Improved Complexity Bounds for Constrained Minimax Optimization NIPS 2023
Lower Bounds and Accelerated Algorithms for Bilevel Optimization JMLR 2023
Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion ICML 2023
Efficient displacement convex optimization with particle gradient descent ICML 2023
Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(ε^-7/4)$ Complexity ICML 2022
Faster Stochastic Algorithms for Minimax Optimization under Polyak-{\L}ojasiewicz Condition NIPS 2022
Improved Bounds on Neural Complexity for Representing Piecewise Linear Functions NIPS 2022
A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimization NIPS 2022
On the Complexity of Approximating Multimarginal Optimal Transport JMLR 2022
On the Efficiency of Entropic Regularized Algorithms for Optimal Transport JMLR 2022
Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization AISTATS 2021
Riemannian Stochastic Recursive Momentum Method for non-Convex Optimization IJCAI 2021
The complexity of nonconvex-strongly-concave minimax optimization UAI 2021
PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization ICML 2021
High Probability Complexity Bounds for Line Search Based on Stochastic Oracles NIPS 2021
On the Representation of Solutions to Elliptic PDEs in Barron Spaces NIPS 2021