conftrace_

oracle complexity

65 papers

Explore in graph

Co-occurring keywords

stochastic optimization (1060) convex optimization (1321) variance reduction (523) nonconvex optimization (316) non-convex optimization (547) gradient descent (1144) lower bound (173) convergence rate (607) stationary point (44) stochastic gradient (296)

Papers

Faster Double Adaptive Gradient Methods AAAI 2025
VFOSA: Variance-Reduced Fast Operator Splitting Algorithms for Generalized Equations JMLR 2025
A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization AISTATS 2024
An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness NIPS 2024
Accelerating Matroid Optimization through Fast Imprecise Oracles NIPS 2024
Auditable Algorithms for Approximate Model Counting AAAI 2024
Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization NIPS 2024
Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions JMLR 2024
Zeroth-order Stochastic Approximation Algorithms for DR-submodular Optimization JMLR 2024
A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplers NIPS 2024
Is Efficient PAC Learning Possible with an Oracle That Responds "Yes" or "No"? COLT 2024
Improper Multiclass Boosting COLT 2023
Memory-Constrained Algorithms for Convex Optimization NIPS 2023
Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization NIPS 2023
Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model NIPS 2023
Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold COLT 2023
A Unified Approach for Maximizing Continuous DR-submodular Functions NIPS 2023
An Optimal Algorithm for Strongly Convex Minimization under Affine Constraints AISTATS 2022
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization AISTATS 2022
SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems NIPS 2022
The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization NIPS 2022
Dimension-free Complexity Bounds for High-order Nonconvex Finite-sum Optimization ICML 2022
Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applications ICML 2022
Oracle Complexity in Nonsmooth Nonconvex Optimization JMLR 2022
Beyond Worst-Case Analysis in Stochastic Approximation: Moment Estimation Improves Instance Complexity ICML 2022