Tight Majorizations and Convergence Rates of Nuclear Norm Minimization IRLS
cs.LG, cs.NA, math.NA, math.OC
Submitted: 2026-08-24
Updated: 2026-08-24
Comments: 97 pages, 9 figures, 2 tables
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- IRLS for Sparse Recovery Revisited: Examples of Failure and a Remedy
- Muon Optimizes Under Spectral Norm Constraints
- DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence
- Kimi K2: Open Agentic Intelligence
- Global Convergence of Iteratively Reweighted Least Squares for Robust Subspace Recovery
- Muon is Scalable for LLM Training
- Iteratively reweighted kernel machines efficiently learn sparse functions
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