Related papers: Optimal Gaussian concentration bounds for stochast…
We study lattice spin systems and analyze the evolution of Gaussian concentration bounds (GCB) under the action of probabilistic cellular automata (PCA), which serve as discrete-time analogues of Markovian spin-flip dynamics. We establish…
In this paper, we consider the problem of stochastic optimization under a bandit feedback model. We generalize the GP-UCB algorithm [Srinivas and al., 2012] to arbitrary kernels and search spaces. To do so, we use a notion of localized…
Concentration inequalities for the sample mean, like those due to Bernstein, Hoeffding, and Bentkus, are valid for any sample size but overly conservative, yielding confidence intervals that are unnecessarily wide. The central limit theorem…
We consider the behavior of the Gaussian concentration bound (GCB) under stochastic time evolution. More precisely, we consider a Markovian diffusion process on $\mathbb{R}^d$ and start the process from an initial distribution $\mu$ that…
We provide a stochastic interpretation of non-commutative Dirichlet forms in the context of quantum filtering. For stochastic processes motivated by quantum optics experiments, we derive an optimal finite time deviation bound expressed in…
We obtain non asymptotic concentration bounds for two kinds of stochastic approximations. We first consider the deviations between the expectation of a given function of the Euler scheme of some diffusion process at a fixed deterministic…
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multi-armed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low RKHS…
Slepian and Sudakov-Fernique type inequalities, which compare expectations of maxima of Gaussian random vectors under certain restrictions on the covariance matrices, play an important role in probability theory, especially in empirical…
The paper considers the problem of global optimization in the setup of stochastic process bandits. We introduce an UCB algorithm which builds a cascade of discretization trees based on generic chaining in order to render possible his…
In this paper, we establish maximal concentration bounds for the iterates generated by a stochastic approximation (SA) algorithm under a contractive operator with respect to some arbitrary norm (for example, the $\ell_\infty$-norm). We…
The required set of operations for universal continuous-variable quantum computation can be divided into two primary categories: Gaussian and non-Gaussian operations. Furthermore, any Gaussian operation can be decomposed as a sequence of…
Recently in Gao and Stoev (2018) it was established that the concentration of maxima phenomenon is the key to solving the exact sparse support recovery problem in high dimensions. This phenomenon, known also as relative stability, has been…
In this paper, we consider the Gaussian process (GP) bandit optimization problem in a non-stationary environment. To capture external changes, the black-box function is allowed to be time-varying within a reproducing kernel Hilbert space…
We consider the full shift $T:\Omega\to\Omega$ where $\Omega=A^{\mathbb N}$, $A$ being a finite alphabet. For a class of potentials which contains in particular potentials $\phi$ with variation decreasing like $O(n^{-\alpha})$ for some…
We prove finite-sample concentration and anti-concentration bounds for dimension estimation using Gaussian kernel sums. Our bounds provide explicit dependence on sample size, bandwidth, and local geometric and distributional parameters,…
We consider Gibbs measures on the configuration space $S^{\mathbb{Z}^d}$, where mostly $d\geq 2$ and $S$ is a finite set. We start by a short review on concentration inequalities for Gibbs measures. In the Dobrushin uniqueness regime, we…
A Gaussian boson sampler (GBS) is a special-purpose quantum computer that can be practically realized at large scale in optics. Here we report on experiments in which we used a frequency-multiplexed GBS with $>400$ modes as the reservoir in…
We describe a general technique that yields the first {\em Statistical Query lower bounds} for a range of fundamental high-dimensional learning problems involving Gaussian distributions. Our main results are for the problems of (1) learning…
We study the concentration of random kernel matrices around their mean. We derive nonasymptotic exponential concentration inequalities for Lipschitz kernels assuming that the data points are independent draws from a class of multivariate…
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…