Functional Autoregression Without Truncation: A Continuous-Regularization Approach
Yao Zhao

TL;DR
This paper introduces a continuous-regularization approach for functional autoregression that eliminates the need for discrete truncation, leading to more stable and accurate forecasts across various regimes.
Contribution
It proposes a Tikhonov-regularized estimator that replaces truncation with a data-driven regularization parameter, improving forecast accuracy and stability.
Findings
The regularized estimator closely matches the oracle FPCA rule.
It outperforms traditional truncation methods in challenging regimes.
Application to real data shows a 9.7% forecast error reduction.
Abstract
Functional autoregressive models of order one (FAR(1)) are predominantly estimated by projecting curves onto leading functional principal components and fitting a vector autoregression in score space, requiring a discrete truncation level chosen by an \emph{ad hoc} variance threshold. We demonstrate via Monte Carlo experiments that the truncation choice is both consequential and highly regime dependent: the optimal can differ by an order of magnitude across data-generating regimes, while commonly used high variance thresholds (95\%, 99\%) lead to substantial forecast deterioration, inflating error by up to relative to an oracle benchmark. We propose a Tikhonov-regularized estimator that replaces the discrete truncation choice with a continuous regularization parameter, selected in a data-driven…
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.
