Nonasymptotic Gaussian Approximation for Inference with Stable Noise
Marina Riabiz, Tohid Ardeshiri, Ioannis Kontoyiannis, Simon Godsill

TL;DR
This paper develops nonasymptotic bounds for Gaussian approximations of stable noise series, enabling practical inference methods by transforming complex stable distributions into conditionally Gaussian models.
Contribution
It introduces explicit nonasymptotic bounds for Gaussian approximation of stable noise series, facilitating inference with stable distributions using standard statistical techniques.
Findings
Gaussian approximation errors are sharply bounded.
Truncated series with Gaussian error outperform full series in inference.
Explicit bounds guide practical truncation choices.
Abstract
The results of a series of theoretical studies are reported, examining the convergence rate for different approximate representations of -stable distributions. Although they play a key role in modelling random processes with jumps and discontinuities, the use of -stable distributions in inference often leads to analytically intractable problems. The LePage series, which is a probabilistic representation employed in this work, is used to transform an intractable, infinite-dimensional inference problem into a conditionally Gaussian parametric problem. A major component of our approach is the approximation of the tail of this series by a Gaussian random variable. Standard statistical techniques, such as Expectation-Maximization, Markov chain Monte Carlo, and Particle Filtering, can then be applied. In addition to the asymptotic normality of the tail of this series, we…
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.
