Related papers: A Gaussian Process Approximation for a two-color R…
Variational inference is a powerful tool for approximate inference, and it has been recently applied for representation learning with deep generative models. We develop the variational Gaussian process (VGP), a Bayesian nonparametric…
In this paper, we develop a general machinery for finding explicit uniform probability and moment bounds on sub-additive positive functionals of random processes. Using the developed general technique, we derive uniform bounds on the…
The declining response rates in probability surveys along with the widespread availability of unstructured data has led to growing research into non-probability samples. Existing robust approaches are not well-developed for non-Gaussian…
We consider the problem of approximating a general Gaussian location mixture by finite mixtures. The minimum order of finite mixtures that achieve a prescribed accuracy (measured by various $f$-divergences) is determined within constant…
A two-dimensional Gauss-Kuzmin theorem for $N$-continued fraction expansions is shown. More exactly, we obtain a Gauss-Kuzmin theorem related to the natural extension of the measure-dynamical system corresponding to these expansions. Then,…
Approximation algorithms are widely used in many engineering problems. To obtain a data set for approximation a factorial design of experiments is often used. In such case the size of the data set can be very large. Therefore, one of the…
For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…
Exponential averages that appear in integral fluctuation theorems can be recast as a sum over moments of thermodynamic observables. We use two examples to show that such moment series can exhibit non-uniform convergence in certain singular…
Gaussian random processes which variances reach theirs maximum values at unique points are considered. Exact asymptotic behaviors of probabilities of large absolute maximums of theirs trajectories have been evaluated using Double Sum Method…
We examine the convexity and tractability of the two-sided linear chance constraint model under Gaussian uncertainty. We show that these constraints can be applied directly to model a larger class of nonlinear chance constraints as well as…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical…
A completely elementary and self-contained proof of convergence of Gaussian multiplicative chaos is given. The argument shows further that the limiting random measure is nontrivial in the entire subcritical phase $(\gamma < \sqrt{2d})$ and…
We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…
In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…
We study reinforcement learning methods with linear function approximation under non-Markov state and cost processes. We first consider the policy evaluation method and show that the algorithm converges under suitable ergodicity conditions…
The aim of this paper is to establish the uniform convergence of the densities of a sequence of random variables, which are functionals of an underlying Gaussian process, to a normal density. Precise estimates for the uniform distance are…
Probabilistic machine learning models are distinguished by their ability to integrate prior knowledge of noise statistics, smoothness parameters, and training data uncertainty. A common approach involves modeling data with Gaussian…
The aim of this paper is twofold: In the first part, we leverage recent results on scenario design to develop randomized algorithmsfor approximating the image set of a nonlinear mapping, that is, a (possibly noisy) mapping of a set via a…
Gaussian couplings of partial sum processes are derived for the high-dimensional regime $d=o(n^{1/3})$. The coupling is derived for sums of independent random vectors and subsequently extended to nonstationary time series. Our inequalities…