Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity

arXiv:2610.12328 · cs.LG, math.OC, stat.ML · Submitted 2026-10-08 · Read on arXiv

cs.LG, math.OC, stat.ML

Submitted: 2026-10-08

Updated: 2026-10-08

Terminology

• Regret — 16× in this paper · explained in 3 episodes
• Query Complexity — 14× in this paper · explained in 2 episodes
• Adam — 5× in this paper · explained in 2 episodes
• Regularization — 2× in this paper · explained in 3 episodes
• Computational overhead — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Inverse Problem — 1× in this paper · explained in 2 episodes

Sources

• Zeroth-Order Methods for Stochastic Nonconvex Nonsmooth Composite Optimization
• Muon with Finite Newton-Schulz: The Smoothing Benefit in Nonsmooth Nonconvex Optimization

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: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks