相关论文: Note on approximating the Laplace transform of a G…

Higher criticism is a large-scale testing procedure that can attain the optimal detection boundary for sparse and faint signals. However, there has been a lack of knowledge in most existing works about its asymptotic distribution for more…

In the hypothesis selection problem, we are given sample and query access to finite set of candidate distributions (hypotheses), $\mathcal{H} = \{H_1, \ldots, H_n\}$, and samples from an unknown distribution $P$, both over a domain…

We study the approximation of expectations $\E(f(X))$ for Gaussian random elements $X$ with values in a separable Hilbert space $H$ and Lipschitz continuous functionals $f \colon H \to \R$. We consider restricted Monte Carlo algorithms,…

Logistic Gaussian process (LGP) priors provide a flexible alternative for modelling unknown densities. The smoothness properties of the density estimates can be controlled through the prior covariance structure of the LGP, but the challenge…

Random hyperspherical harmonics are Gaussian Laplace eigenfunctions on the unit $d$-dimensional sphere ($d\ge 2$). We study the convergence in Total Variation distance for their nonlinear statistics in the high energy limit, i.e., for…

Learning a Gaussian mixture model (GMM) is a fundamental problem in machine learning, learning theory, and statistics. One notion of learning a GMM is proper learning: here, the goal is to find a mixture of $k$ Gaussians $\mathcal{M}$ that…

Consider a family of distributions $\{\pi_{\beta}\}$ where $X\sim\pi_{\beta}$ means that $\mathbb{P}(X=x)=\exp(-\beta H(x))/Z(\beta)$. Here $Z(\beta)$ is the proper normalizing constant, equal to $\sum_x\exp(-\beta H(x))$. Then…

We consider Bayesian inference problems with computationally intensive likelihood functions. We propose a Gaussian process (GP) based method to approximate the joint distribution of the unknown parameters and the data. In particular, we…

We propose a revised definition of quasi-distributions within the framework of large-momentum effective theory (LaMET) that improves convergence towards the large-momentum limit. Since the definition of quasi-distributions is not unique,…

Let each of n particles starting at the origin in Z^2 perform simple random walk until reaching a site with no other particles. Lawler, Bramson, and Griffeath proved that the resulting random set A(n) of n occupied sites is (with high…

The Laplace approximation (LA) to posteriors is a ubiquitous tool to simplify Bayesian computation, particularly in the high-dimensional settings arising in Bayesian inverse problems. Precisely quantifying the LA accuracy is a challenging…

In Bayesian inference, a widespread technique to compute integrals against a high-dimensional posterior is to use a Gaussian proxy to the posterior known as the Laplace approximation. We address the question of accuracy of the approximation…

We study moderate deviations of suprema of parametrized sequences of sample bounded Gaussian processes $\{X _x(t), t\in T _x\}$, and first present recent sharp bounds in simple cases. In the almost periodic case, we prove an approximation…

In this paper we propose a new deterministic approximation method, called discretization approximation, for Bayesian computation. Discretization approximation is very simple to understand and to implement, It only requires calculating…

Let $X_1, \ldots , X_n$ be i.i.d. random vectors in $\mathbb{R}^d$ with $\|X_1\| \le \beta$. Then, we show that $\frac{1}{\sqrt{n}}(X_1 + \ldots + X_n)$ converges to a Gaussian in quadratic transportation (also known as "Kantorovich" or…

In this paper, we investigate a class of approximate Gaussian processes (GP) obtained by taking a linear combination of compactly supported basis functions with the basis coefficients endowed with a dependent Gaussian prior distribution.…

The Laplace approximation has been one of the workhorses of Bayesian inference. It often delivers good approximations in practice despite the fact that it does not strictly take into account where the volume of posterior density lies.…

We study linear chance-constrained problems where the coefficients follow a Gaussian mixture distribution. We provide mixed-binary quadratic programs that give inner and outer approximations of the chance constraint based on piecewise…

In Bayesian Deep Learning, distributions over the output of classification neural networks are often approximated by first constructing a Gaussian distribution over the weights, then sampling from it to receive a distribution over the…

In this work we construct Gaussian beam approximations to solutions of the high frequency Helmholtz equation with a localized source. Under the assumption of non-trapping rays we show error estimates between the exact outgoing solution and…