complexity bound

Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization JMLR 2026 Accelerated Over-Relaxation Heavy-Ball Method: Achieving Global Accelerated Convergence with Broad Generalization ICLR 2025 Circuit Complexity Bounds for RoPE-based Transformer Architecture EMNLP 2025 Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems AISTATS 2024 Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints NeurIPS 2024 Hardness of Learning Neural Networks under the Manifold Hypothesis NeurIPS 2024 High-probability complexity bounds for stochastic non-convex minimax optimization NeurIPS 2024 Low Degree Hardness for Broadcasting on Trees NeurIPS 2024 On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis COLT 2024 The Fine-Grained Complexity of Gradient Computation for Training Large Language Models NeurIPS 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 NeurIPS 2023 Efficient displacement convex optimization with particle gradient descent ICML 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 A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimization NeurIPS 2022 Faster Stochastic Algorithms for Minimax Optimization under Polyak-{\L}ojasiewicz Condition NeurIPS 2022 Improved Bounds on Neural Complexity for Representing Piecewise Linear Functions NeurIPS 2022 On the Complexity of Approximating Multimarginal Optimal Transport JMLR 2022 On the Efficiency of Entropic Regularized Algorithms for Optimal Transport JMLR 2022 Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(ε^-7/4)$ Complexity ICML 2022 High Probability Complexity Bounds for Line Search Based on Stochastic Oracles NeurIPS 2021 On the Expected Complexity of Maxout Networks NeurIPS 2021 On the Representation of Solutions to Elliptic PDEs in Barron Spaces NeurIPS 2021 PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization ICML 2021