Research map / Optimization / Nonconvex and smooth optimization
Gradient Descent Learns Linear Dynamical Systems
Moritz Hardt, Tengyu Ma, Benjamin Recht
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Learning Linear Dynamical Systems via Spectral Filtering (NeurIPS 2017 · similarity 0.90)
- Singular-limit analysis of gradient descent with noise injection (JMLR 2026 · similarity 0.89)
- Universal Learning of Nonlinear Dynamics (ICML 2026 · similarity 0.89)
- Robust System Identification: Finite-sample Guarantees and Connection to Regularization (ICLR 2025 · similarity 0.89)
- The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations (ICML 2025 · similarity 0.88)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
