English
Related papers

Related papers: Discrepancy, chaining and subgaussian processes

200 papers

The problem is a power-law asymptotics of the probability that a self-similar process does not exceed a fixed level during long time. The exponent in such asymptotics is estimated for some Gaussian processes, including the fractional…

Probability · Mathematics 2012-03-13 George Molchan

Standard sparse pseudo-input approximations to the Gaussian process (GP) cannot handle complex functions well. Sparse spectrum alternatives attempt to answer this but are known to over-fit. We suggest the use of variational inference for…

Machine Learning · Statistics 2015-03-23 Yarin Gal , Richard Turner

We prove that the smallest minimizer s(f) of a real convex function f is less than or equal to a real point x if and only if the right derivative of f at x is non-negative. Similarly, the largest minimizer t(f) is greater or equal to x if…

Probability · Mathematics 2023-11-07 Dietmar Ferger

In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…

Computational Complexity · Computer Science 2020-09-01 Rohit Agrawal

We rigorously prove that deep Gaussian process priors can outperform Gaussian process priors if the target function has a compositional structure. To this end, we study information-theoretic lower bounds for posterior contraction rates for…

Machine Learning · Statistics 2022-09-28 Matteo Giordano , Kolyan Ray , Johannes Schmidt-Hieber

Gaussian process regression is a classical kernel method for function estimation and data interpolation. In large data applications, computational costs can be reduced using low-rank or sparse approximations of the kernel. This paper…

Numerical Analysis · Mathematics 2024-10-04 Daniel Sanz-Alonso , Ruiyi Yang

We show that for certain Gaussian random processes and fields X:R^N to R^d, D_q(mu_X) = min{d, D_q(mu)/alpha} a.s. for an index alpha which depends on Holder properties and strong local nondeterminism of X, where q>1, where D_q denotes…

Probability · Mathematics 2013-11-25 Kenneth Falconer , Yimin Xiao

Let $Z$ be an $n$-dimensional Gaussian vector and let $f: \mathbb R^n \to \mathbb R$ be a convex function. We show that: $$\mathbb P \left( f(Z) \leq \mathbb E f(Z) -t\sqrt{ {\rm Var} f(Z)} \right) \leq \exp(-ct^2),$$ for all $t>1$, where…

Probability · Mathematics 2017-06-19 Grigoris Paouris , Petros Valettas

In this paper we obtain a decoupling feature of the random interlacements process $\mathcal{I}^u \subset \mathbb{Z}^d$, at level $u$, $d\geq 3$. More precisely, we show that the trace of the random interlacements process on two disjoint…

Probability · Mathematics 2019-11-06 Diego F. de Bernardini , Christophe Gallesco , Serguei Popov

In this paper we show discrepancy bounds for index-transformed uniformly distributed sequences. From a general result we deduce very tight lower and upper bounds on the discrepancy of index-transformed van der Corput-, Halton-, and…

Number Theory · Mathematics 2014-08-01 Peter Kritzer , Gerhard Larcher , Friedrich Pillichshammer

Let $G$ be a finite-dimensional vector space over a prime field $\mathbb{F}_p$ with some subspaces $H_1, \dots, H_k$. Let $f \colon G \to \mathbb{C}$ be a function. Generalizing the notion of Gowers uniformity norms, Austin introduced…

Combinatorics · Mathematics 2021-03-12 Luka Milićević

We derive high-resolution upper bounds for optimal product quantization of pathwise contionuous Gaussian processes respective to the supremum norm on [0,T]^d. Moreover, we describe a product quantization design which attains this bound.…

Probability · Mathematics 2013-04-03 Harald Luschgy , Gilles Pagès

We give two examples of periodic Gaussian processes, having entropy numbers of exactly same order but radically different small deviations. Our construction is based on classical Knopp's result yielding of existence of continuous nowhere…

Probability · Mathematics 2017-07-13 Michel Weber

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…

Machine Learning · Computer Science 2025-06-27 Michalis K. Titsias

Structured prediction can be considered as a generalization of many standard supervised learning tasks, and is usually thought as a simultaneous prediction of multiple labels. One standard approach is to maximize a score function on the…

Machine Learning · Computer Science 2021-02-19 Kevin Bello , Asish Ghoshal , Jean Honorio

Bayesian posterior distributions arising in modern applications, including inverse problems in partial differential equation models in tomography and subsurface flow, are often computationally intractable due to the large computational cost…

Machine Learning · Statistics 2023-02-10 Tapio Helin , Andrew Stuart , Aretha Teckentrup , Konstantinos Zygalakis

We study the accuracy of the expected Euler characteristic approximation to the distribution of the maximum of a smooth, centered, unit variance Gaussian process f. Using a point process representation of the error, valid for arbitrary…

Probability · Mathematics 2007-05-23 Jonathan Taylor , Akimichi Takemura , Robert J. Adler

We quantify the minimax rate for a nonparametric regression model over a star-shaped function class $\mathcal{F}$ with bounded diameter. We obtain a minimax rate of ${\varepsilon^{\ast}}^2\wedge\mathrm{diam}(\mathcal{F})^2$ where…

Statistics Theory · Mathematics 2025-08-20 Akshay Prasadan , Matey Neykov

Normal comparison lemma and Slepian's inequality are essential tools in the study of Gaussian processes. In this paper we extend normal comparison lemma and derive various related comparison inequalities including Slepian's inequality for…

Probability · Mathematics 2015-04-01 K. Debicki , E. Hashorva , L. Ji , C. Ling

Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…

Number Theory · Mathematics 2011-03-25 Hamed Hatami , Shachar Lovett