The Query Complexity of Unknown Sparse Gradient Residuals
math.OC
Submitted: 2026-11-12
Updated: 2026-11-12
Terminology
Sources
- A Fast, Principled Working Set Algorithm for Exploiting Piecewise Linear Structure in Convex Problems
- SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator
- Lower Bounds for Finding Stationary Points I
- Federated Multi-Task Learning under a Mixture of Distributions
- Near-Optimal Complexity of Finding Approximate Local Minima of Nonconvex Finite Sums
- Dense Weak Hiding: Closing Complexity Gaps in Nonconvex and PL Finite-Sum Optimization under Individual Smoothness
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise