first-order oracle

Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles JMLR 2025 Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization JMLR 2024 Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss ICLR 2024 Deterministic Nonsmooth Nonconvex Optimization COLT 2023 Efficient Convex Optimization Requires Superlinear Memory (Extended Abstract) IJCAI 2023 On the Lower Bound of Minimizing Polyak-Łojasiewicz functions COLT 2023 Open Problem: Polynomial linearly-convergent method for g-convex optimization? COLT 2023 Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal COLT 2023 A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimization NeurIPS 2022 Distributionally Robust Optimization via Ball Oracle Acceleration NeurIPS 2022 Negative curvature obstructs acceleration for strongly geodesically convex optimization, even with exact first-order oracles COLT 2022 A Faster Decentralized Algorithm for Nonconvex Minimax Problems NeurIPS 2021 Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization NeurIPS 2021 Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach ICML 2021 Significance of Gradient Information in Bayesian Optimization AISTATS 2021 Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss COLT 2021 Can Stochastic Zeroth-Order Frank-Wolfe Method Converge Faster for Non-Convex Problems? ICML 2020 Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method NeurIPS 2020 Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimization ICML 2019 NEON2: Finding Local Minima via First-Order Oracles NeurIPS 2018 Finite-Time Analysis of Projected Langevin Monte Carlo NeurIPS 2015 Optimal rates for stochastic convex optimization under Tsybakov noise condition ICML 2013