The noise level in linear regression with dependent data
Ingvar M. Ziemann, Stephen Tu, George J. Pappas, Nikolai Matni
Abstract
We derive upper bounds for random design linear regression with dependent (β-mixing) data absent any realizability assumptions. In contrast to the strictly realizable martingale noise regime, no sharp instance-optimal non-asymptotics are available in the literature. Up to constant factors, our analysis correctly recovers the variance term predicted by the Central Limit Theorem-the noise level of the problem-and thus exhibits graceful degradation as we introduce misspecification. Past a burn-in, our result is sharp in the moderate deviations regime, and in particular does not inflate the leading order term by mixing time factors. 1 A distribution PX,Y is (linearly) realizable if the regression function x → E[Y | X = x] is linear.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 100f7929-e509-4046-9269-afdfa4b0f466Cited by top-tier papers3
- Sharp Rates in Dependent Learning Theory: Avoiding Sample Size Deflation for the Square LossIngvar M. Ziemann, Stephen Tu, George J. Pappas, Nikolai MatniICML 2024 · 10 citations
- Guarantees for Nonlinear Representation Learning: Non-identical Covariates, Dependent Data, Fewer SamplesThomas T. C. K. Zhang, Bruce D. Lee, Ingvar M. Ziemann, George J. Pappas et al.ICML 2024 · 2 citations
- Data-Adaptive Exposure Thresholds under Network InterferenceVydhourie Thiyageswaran, Tyler H. McCormick, Jennifer BrennanNeurIPS 2025 · 1 citation
Builds on3
- Least Squares Regression with Markovian Data: Fundamental Limits and AlgorithmsDheeraj Nagaraj, Xian Wu, Guy Bresler, Prateek Jain et al.NeurIPS 2020 · 73 citations
- Near-optimal Offline and Streaming Algorithms for Learning Non-Linear Dynamical SystemsSuhas S. Kowshik, Dheeraj Nagaraj, Prateek Jain, Praneeth NetrapalliNeurIPS 2021 · 28 citations
- On Empirical Risk Minimization with Dependent and Heavy-Tailed DataAbhishek Roy, Krishnakumar Balasubramanian, Murat A. ErdogduNeurIPS 2021 · 22 citations
Related papers
- Online Linear Regression with Paid Stochastic FeaturesNadav Merlis, Kyoungseok Jang, Nicolò Cesa-BianchiAAAI 2026
- Learning with little mixingIngvar M. Ziemann, Stephen TuNeurIPS 2022 · 41 citations
- Fast Last-Iterate Convergence of SGD in the Smooth Interpolation RegimeAmit Attia, Matan Schliserman, Uri Sherman, Tomer KorenNeurIPS 2025 · 18 citations
- Experimental Designs for Heteroskedastic VarianceJustin Weltz, Tanner Fiez, Alexander Volfovsky, Eric Laber et al.NeurIPS 2023 · 10 citations
- Optimal Excess Risk Bounds for Empirical Risk Minimization on p-Norm Linear RegressionAyoub El Hanchi, Murat A. ErdogduNeurIPS 2023 · 2 citations
