A simple adaptive accelerated optimistic dual averaging method for unconstrained convex optimization in p-norm geometry
math.OC, cs.AI, cs.LG, stat.ML
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Muon$^p$: Muon with Fractional Spectral Powers
- A Few Accelerated Algorithms for Convex Optimization under $(H_0,H_1)$-Smoothness
- Schattor: Schatten-family methods for deep learning optimization
- When to use what Schatten-$p$ norm in deep learning?
- An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization
- On Accelerated Methods in Optimization
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