Research map / Optimization / Implicit bias and generalization
Least Squares Regression with Markovian Data: Fundamental Limits and Algorithms
Dheeraj Nagaraj, Xian Wu, Guy Bresler, Prateek Jain, Praneeth Netrapalli
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use experience replay (SGD-ER) instead of vanilla constant-step SGD | SGD on Gaussian AR chain · Gaussian AR simulation (d=10, epsilon=.01) | estimation error | Improved |
| use vanilla constant-step SGD instead of data drop (SGD-DD) | SGD-DD · Gaussian AR simulation (d=10, epsilon=.01) | estimation error | No clear effect |
Closest papers by meaning
- Adapting to Mixing Time in Stochastic Optimization with Markovian Data (ICML 2022 · similarity 0.88)
- Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression (JMLR 2017 · similarity 0.88)
- Stochastic Gradient Descent under Markovian Sampling Schemes (ICML 2023 · similarity 0.88)
- Stochastic Optimization with Arbitrary Recurrent Data Sampling (ICML 2024 · similarity 0.86)
- Two-timescale Derivative Free Optimization for Performative Prediction with Markovian Data (ICML 2024 · similarity 0.85)
- Optimal Rates in Continual Linear Regression via Increasing Regularization (NeurIPS 2025 · similarity 0.85)
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.
