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

arXiv:2608.25524 · math.NA, cs.LG, cs.NA, math.OC · Submitted 2026-08-26 · Read on arXiv

math.NA, cs.LG, cs.NA, math.OC

Submitted: 2026-08-26

Updated: 2026-08-26

Comments: 28 pages, 5 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regularization — 9× in this paper · explained in 3 episodes
• Robustness — 7× in this paper · explained in 5 episodes
• Inverse Problem — 3× in this paper · explained in 2 episodes
• Local Optimization — 2× in this paper · explained in 2 episodes
• Objective Function — 2× in this paper · explained in 2 episodes
• Activation Function — 1× in this paper · explained in 1 episode
• Alignment — 1× in this paper · explained in 1 episode
• Approximation Bound — 1× in this paper · explained in 1 episode
• Benchmark — 1× in this paper · explained in 2 episodes
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• Decoupling — 1× in this paper · explained in 2 episodes
• Embeddings — 1× in this paper · explained in 2 episodes

Sources

• A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares

Related papers

• Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
• A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
• Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
• Windowed thinning and query complexity for the bouncy particle and Zigzag samplers
• Data-efficient Kernel Methods for Learning Hamiltonian Systems
• Adjoint Method versus Physics-Informed Neural Networks in PDE-Constrained Inverse Problems