Related papers: Exact bounds for some quadratic empirical processe…
Sparse variational Gaussian processes (GPs) construct tractable posterior approximations to GP models. At the core of these methods is the assumption that the true posterior distribution over training function values ${\bf f}$ and inducing…
We study the behavior of bivariate empirical copula process $\mathbb{G}_n(\cdot,\cdot)$ on pavements $[0,k_n/n]^2$ of $[0,1]^2,$ where $k_n$ is a sequence of positive constants fulfilling some conditions. We provide a upper bound for the…
This paper addresses the Bayesian optimization problem (also referred to as the Bayesian setting of the Gaussian process bandit), where the learner seeks to minimize the regret under a function drawn from a known Gaussian process (GP).…
The article starts with generalizations of some classical results and new truncation error upper bounds in the sampling theorem for bandlimited stochastic processes. Then, it investigates $L_p([0,T])$ and uniform approximations of…
Gaussian Process is a non-parametric prior which can be understood as a distribution on the function space intuitively. It is known that by introducing appropriate prior to the weights of the neural networks, Gaussian Process can be…
Modern construction of uniform confidence bands for nonparametric densities (and other functions) often relies on the classical Smirnov-Bickel-Rosenblatt (SBR) condition; see, for example, Gin\'{e} and Nickl [Probab. Theory Related Fields…
We obtain optimal Gaussian concentration bounds (GCBs) for stochastic chains of unbounded memory (SCUMs) on countable alphabets. These stochastic processes are also known as "chains with complete connections" or "$g$-measures". We consider…
Probabilistic regression models typically use the Maximum Likelihood Estimation or Cross-Validation to fit parameters. These methods can give an advantage to the solutions that fit observations on average, but they do not pay attention to…
We study the empirical process indexed by F^2=\{f^2 : f \in F\}, where F is a class of mean-zero functions on a probability space. We present a sharp bound on the supremum of that process which depends on the \psi_1 diameter of the class F…
The use of Gaussian processes (GPs) is supported by efficient sampling algorithms, a rich methodological literature, and strong theoretical grounding. However, due to their prohibitive computation and storage demands, the use of exact GPs…
We consider the approximation of a convolution of possibly different probability measures by (compound) Poisson distributions and also by related signed measures of higher order. We present new total variation bounds having a better…
Sparse variational Gaussian process (GP) approximations based on inducing points have become the de facto standard for scaling GPs to large datasets, owing to their theoretical elegance, computational efficiency, and ease of implementation.…
We give an approximation algorithm for MaxCut and provide guarantees on the average fraction of edges cut on $d$-regular graphs of girth $\geq 2k$. For every $d \geq 3$ and $k \geq 4$, our approximation guarantees are better than those of…
We study the small deviation probabilities of a family of very smooth self-similar Gaussian processes. The canonical process from the family has the same scaling property as standard Brownian motion and plays an important role in the study…
Estimating the rate of convergence of the empirical measure of an i.i.d. sample to the reference measure is a classical problem in probability theory. Extending recent results of Ambrosio, Stra and Trevisan on 2-dimensional manifolds, in…
Gaussian Quadrature is a well known technique for numerical integration. Recently Gaussian quadrature with respect to discrete measures corresponding to finite sums have found some new interest. In this paper we apply these ideas to…
Introducing inequality constraints in Gaussian process (GP) models can lead to more realistic uncertainties in learning a great variety of real-world problems. We consider the finite-dimensional Gaussian approach from Maatouk and Bay (2017)…
This work studies finite sample approximations of the exact and entropic regularized Wasserstein distances between centered Gaussian processes and, more generally, covariance operators of functional random processes. We first show that…
Gaussian processes are widely employed as versatile modelling and predictive tools in spatial statistics, functional data analysis, computer modelling and diverse applications of machine learning. They have been widely studied over…
We consider the problem of calculating learning curves (i.e., average generalization performance) of Gaussian processes used for regression. On the basis of a simple expression for the generalization error, in terms of the eigenvalue…