arxiv
PublishedApril 6, 2026 at 4:00 AM
—neutral
Optimal Projection-Free Adaptive SGD for Matrix Optimization
Publisher summary· verbatim
arXiv:2604.02505v1 Announce Type: cross Abstract: Recently, Jiang et al. [2026] developed Leon, a practical variant of One-sided Shampoo [Xie et al., 2025a, An et al., 2025] algorithm for online convex optimization, which does not require computing a costly quadratic projection at each iteration. Un
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivFrom Local to Cluster: A Unified Framework for Causal Discovery with Latent Variables9harxivConsequentialist Objectives and Catastrophe9harxivEgoMAGIC- An Egocentric Video Field Medicine Dataset for Training Perception Algorithms9harxivReCast: Recasting Learning Signals for Reinforcement Learning in Generative Recommendation9hOriginally published on arxiv ↗