On the Oracle Complexity of Interpolation-Based Gradient Descent
Dongmin Lee, William Lu, Anuran Makur
cs.LG, math.OC, stat.ML
Submitted: 2026-06-18
Comments: 16 pages, 2 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- A simpler approach to obtaining an O(1/t) convergence rate for the projected stochastic subgradient method
- Gradient Descent Happens in a Tiny Subspace
- The Full Spectrum of Deepnet Hessians at Scale: Dynamics with SGD Training and Sample Size
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks