Compressibility Analysis of Asymptotically Mean Stationary Processes
Jorge F. Silva

TL;DR
This paper investigates the compressibility of asymptotically mean stationary processes, establishing conditions under which their approximation errors can be characterized and simplified, thus advancing the understanding of sparse process analysis.
Contribution
It introduces the concept of strong $ ext{ell}_p$-characterization for AMS processes and demonstrates how ergodicity simplifies the approximation error analysis.
Findings
AMS processes have a strong $ ext{ell}_p$-characterization.
The approximation error function is constant and explicitly determined by the stationary mean.
Point-wise ergodic theorem is crucial for analyzing compressibility under relaxed assumptions.
Abstract
This work provides new results for the analysis of random sequences in terms of -compressibility. The results characterize the degree in which a random sequence can be approximated by its best -sparse version under different rates of significant coefficients (compressibility analysis). In particular, the notion of strong -characterization is introduced to denote a random sequence that has a well-defined asymptotic limit (sample-wise) of its best -term approximation error when a fixed rate of significant coefficients is considered (fixed-rate analysis). The main theorem of this work shows that the rich family of asymptotically mean stationary (AMS) processes has a strong -characterization. Furthermore, we present results that characterize and analyze the -approximation error function for this family of processes. Adding ergodicity in the analysis of…
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.
