Repository logo
 

Sharp Gaussian Approximation Bounds for Linear Systems with α-stable Noise

Accepted version
Peer-reviewed

Type

Conference Object

Change log

Authors

Kontoyiannis, Ioannis  ORCID logo  https://orcid.org/0000-0001-7242-6375
Riabiz, Marina 
Ardeshiri, Tohid 
Godsill, Simon 

Abstract

We report the results of several theoretical studies into the convergence rate for certain random series representations of α-stable random variables, which are motivated by and find application in modelling heavy-tailed noise in time series analysis, inference, and stochastic processes. The use of α-stable noise distributions generally leads to analytically intractable inference problems. The particular version of the Poisson series representation invoked here implies that the resulting distributions are “conditionally Gaussian,” for which inference is relatively straightforward, although an infinite series is still involved. Our approach is to approximate the residual (or “tail”) part of the series from some point, c > 0, say, to ∞, as a Gaussian random variable. Empirically, this approximation has been found to be very accurate for large c. We study the rate of convergence, as c → ∞, of this Gaussian approximation. This allows the selection of appropriate truncation parameters, so that a desired level of accuracy for the approximate model can be achieved. Explicit, nonasymptotic bounds are obtained for the Kolmogorov distance between the relevant distribution functions, through the application of probability-theoretic tools. The theoretical results obtained are found to be in very close agreement with numerical results obtained in earlier work.

Description

Keywords

40 Engineering, 4901 Applied Mathematics, 4006 Communications Engineering, 49 Mathematical Sciences, 4905 Statistics

Journal Title

https://ieeexplore.ieee.org/xpl/conhome/8410646/proceeding

Conference Name

2018 IEEE International Symposium on Information Theory (ISIT

Journal ISSN

2157-8117

Volume Title

Publisher

IEEE