Near-Optimal Nonconvex Matrix Completion

arXiv:2609.17048 · math.NA, cs.LG, cs.NA · Submitted 2026-09-15 · Read on arXiv

math.NA, cs.LG, cs.NA

Submitted: 2026-09-15

Updated: 2026-09-15

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

Terminology

• Matrix Completion — 35× in this paper · explained in 3 episodes
• Core — 11× in this paper · explained in 2 episodes
• Sample Complexity — 9× in this paper · explained in 15 episodes
• Accuracy — 7× in this paper · explained in 1 episode
• Alternating Minimization — 3× in this paper · explained in 1 episode
• Reconstruction Error — 3× in this paper · explained in 2 episodes
• Regularization — 3× in this paper · explained in 3 episodes
• Inverse Problem — 2× in this paper · explained in 2 episodes
• Alignment — 1× in this paper · explained in 1 episode
• Clustering — 1× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• Generative AI — 1× in this paper · explained in 2 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Homogeneity — 1× in this paper · explained in 2 episodes
• Riemannian Gauss--Newton — 1× in this paper
• Riemannian optimization — 1× in this paper · explained in 2 episodes
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes

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