Approximating a sequence of observations by a simple process
Dinah Rosenberg, Eilon Solan, Nicolas Vieille
Abstract
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step transitions along a realization from the approximating process, are close to that of the given sequence. We generalize the result to the case where the one-step transitions are required to be in given polyhedra.
Create a lesson
Related papers
Instance-Optimal Adaptive Location Estimation via Multiscale Mid-Summaries
Qiaosen Wang, Chao Gao
Robust Multi-Task Learning for Principal Component Analysis
Dali Liu, Haolei Weng
Principal component error in high-dimensional factor models
Alex Bernstein, Lisa R. Goldberg, Nicholas Gunther et al.
Approximation Theorems for High-Dimensional Canonical U-Statistics: Gaussian Chaos and Phase Transition
Leheng Cai, Qirui Hu
On the parametric and semiparametric Fisher information matrix for non-zero mean stationary spherical invariant random processes
Jean-Pierre Delmas, Habti Abeida, Stefano Fortunati
Inference for two-stage sampling in spatial surveys
Guillaume Chauvet, Olivier Bouriaud, Trinh H. K. Duong