paper-with-me

Papers

A Finite-Sample Deviation Bound for Stable Autoregressive Processes

2019-12-17 · L4DC 2020 6 · Rodrigo A. González, Cristian R. Rojas

In this paper, we study non-asymptotic deviation bounds of the least squares estimator in Gaussian AR($n$) processes. By relying on martingale concentration inequalities and a tail-bound for $\chi^2$ distributed variables, we provide a concentration bound for the sample covariance matrix of the process output. With this, we present a problem-dependent finite-time bound on the deviation probability of any fixed linear combination of the estimated parameters of the AR$(n)$ process. We discuss extensions and limitations of our approach.

📄 PDF Abstract BibTeX arXiv:1912.08103

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Lag selection and estimation of stable parameters for multiple autoregressive processes through convex programming

2023-03-03 · Somnath Chakraborty, Johannes Lederer, Rainer von Sachs

Motivated by a variety of applications, high-dimensional time series have become an active topic of research. In particular, several methods and finite-sample theories for individual stable autoregressive processes with …

Time SeriesTime Series Analysis

HOMER: Huber-of-Means for Efficient and Robust Estimation in Hilbert Spaces

2026-07-29 · Kisung You, Boram Cho arxiv

Heavy tails weaken high-confidence control for the empirical mean. Geometric median-of-means (MOM) also lacks a threshold that moves toward mean efficiency. We propose \emph{HOMER}, or Huber-of-Means for Efficient and Ro…

Finite Time Analysis of Stratified Sampling for Monte Carlo

2011-12-01 · NeurIPS 2011 12 · Alexandra Carpentier, Rémi Munos

We consider the problem of stratified sampling for Monte-Carlo integration. We model this problem in a multi-armed bandit setting, where the arms represent the strata, and the goal is to estimate a weighted average of th…

The Optimal Sample Complexity of Learning Autoregressive Chain-of-Thought

2026-07-08 · Zhiyuan Li arxiv

We prove that, in the realizable PAC setting, the sample complexity of exact-trace learning for full autoregressive Chain-of-Thought traces is upper bounded by the standard multiclass rate of the local next-token class, …

A finite-sample generalization bound for stable LPV systems

2024-05-16 · Daniel Racz, Martin Gonzalez, Mihaly Petreczky, Andras Benczur 외

One of the main theoretical challenges in learning dynamical systems from data is providing upper bounds on the generalization error, that is, the difference between the expected prediction error and the empirical predic…

Prediction