DeepAI AI Chat

Gaussian approximation of Gaussian scale mixture

10/04/2018

∙

by Gérard Letac, et al.

∙

∙

For a given positive random variable V>0 and a given Z∼ N(0,1) independent of V, we compute the scalar t_0 such that the distance between Z√(V) and Z√(t_0), in the L^2() sense, is minimal. We also consider the same problem in several dimensions. Keywords: Normal approximation, Gaussian scale mixture, Plancherel theorem.

Gérard Letac
3 publications
Helene Massam
5 publications

page 1

page 2

page 3

page 4

∙ 06/02/2020

Zone Theorem for Arrangements in three dimensions

In this note, a simple description of zone theorem in three dimensions i...

0 Sanjeev Saxena, et al. ∙

∙ 10/02/2018

Inverse Gaussian quadrature and finite normal-mixture approximation of generalized hyperbolic distribution

In this study, a numerical quadrature for the generalized inverse Gaussi...

0 Jaehyuk Choi, et al. ∙

∙ 11/17/2018

Detection of Sparse Positive Dependence

In a bivariate setting, we consider the problem of detecting a sparse co...

0 Ery Arias-Castro, et al. ∙

∙ 08/31/2020

Note on approximating the Laplace transform of a Gaussian on a complex disk

In this short note we study how well a Gaussian distribution can be appr...

0 Yury Polyanskiy, et al. ∙

∙ 02/11/2021

Polynomial Approximations of Conditional Expectations in Scalar Gaussian Channels

We consider a channel Y=X+N where X is a random variable satisfying 𝔼[|X...

0 Wael Alghamdi, et al. ∙

∙ 04/13/2020

Learning Mixtures of Spherical Gaussians via Fourier Analysis

Suppose that we are given independent, identically distributed samples x...

0 Hariharan Narayanan, et al. ∙

∙ 11/29/2022

Optimizing sparse fermionic Hamiltonians

We consider the problem of approximating the ground state energy of a fe...

0 Yaroslav Herasymenko, et al. ∙