Lasso Guarantees for $ \beta $-Mixing Heavy Tailed Time Series
Kam Chung Wong, Zifan Li, Ambuj Tewari

TL;DR
This paper establishes non-asymptotic error bounds for the lasso estimator in heavy-tailed, ta-mixing time series without relying on Gaussian assumptions, broadening its applicability to various non-linear and non-Gaussian models.
Contribution
It derives error bounds for the lasso under ta-mixing conditions for subweibull variables, extending theoretical guarantees beyond Gaussian VAR models.
Findings
Error bounds for lasso in heavy-tailed time series.
Applicability to non-Gaussian and non-linear models.
Relaxed mixing conditions for Gaussian processes.
Abstract
Many theoretical results for the lasso require the samples to be iid. Recent work has provided guarantees for the lasso assuming that the time series is generated by a sparse Vector Auto-Regressive (VAR) model with Gaussian innovations. Proofs of these results rely critically on the fact that the true data generating mechanism (DGM) is a finite-order Gaussian VAR. This assumption is quite brittle: linear transformations, including selecting a subset of variables, can lead to the violation of this assumption. In order to break free from such assumptions, we derive non-asymptotic inequalities for estimation error and prediction error of the lasso estimate of the best linear predictor without assuming any special parametric form of the DGM. Instead, we rely only on (strict) stationarity and geometrically decaying \b{eta}-mixing coefficients to establish error bounds for the lasso for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference
