Subspace Levenberg Marquardt Algorithms in Training Neural Networks

arXiv:2609.00789 · cs.LG, math.OC · Submitted 2026-09-01 · Read on arXiv

cs.LG, math.OC

Submitted: 2026-09-01

Updated: 2026-09-01

Terminology

• Adam — 19× in this paper · explained in 2 episodes
• Accuracy — 17× in this paper · explained in 1 episode
• Robustness — 4× in this paper · explained in 5 episodes
• Loss Function — 2× in this paper · explained in 2 episodes
• Stochastic Gradient Descent (SGD) — 2× in this paper · explained in 5 episodes
• Activation Function — 1× in this paper · explained in 1 episode
• Core — 1× in this paper · explained in 2 episodes
• Local Optimization — 1× in this paper · explained in 2 episodes

Sources

• Adaptive Hybrid Subspace Levenberg Marquardt Algorithm with Adequacy Monitor for Large Scale Least Squares Problems

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