相关论文: The maximum deviation of the Sine$_\beta$ counting…

Margin-based structured prediction commonly uses a maximum loss over all possible structured outputs \cite{Altun03,Collins04b,Taskar03}. In natural language processing, recent work \cite{Zhang14,Zhang15} has proposed the use of the maximum…

In this paper, we consider projection estimates for L\'evy densities in high-frequency setup. We give a unified treatment for different sets of basis functions and focus on the asymptotic properties of the maximal deviation distribution for…

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).…

Many machine learning and optimization algorithms are built upon the framework of stochastic approximation (SA), for which the selection of step-size (or learning rate) $\{\alpha_n\}$ is crucial for success. An essential condition for…

We study the fluctuations of the largest eigenvalue $\lambda_{\max}$ of $N \times N$ random matrices in the limit of large $N$. The main focus is on Gaussian $\beta$-ensembles, including in particular the Gaussian orthogonal ($\beta=1$),…

We compute the leading asymptotics as $N\to\infty$ of the maximum of the field $Q_N(q)= \log\det|q- A_N|$, $q\in \mathbb{C}$, for any unitarily invariant Hermitian random matrix $A_N$ associated to a non-critical real-analytic potential.…

Gaussian Process Regression is a well-known machine learning technique for which several quantum algorithms have been proposed. We show here that in a wide range of scenarios these algorithms show no exponential speedup. We achieve this by…

The Gaussian $\beta$-ensemble is a real $n$-point configuration $\{x_j\}_1^n$ picked randomly with respect to the Boltzmann factor $e^{-\frac\beta 2H_n}$, $H_n=\sum_{i\ne j}\log\frac 1{|x_i-x_j|}+n\sum_{i=1}^n\tfrac 12x_i^2.$ The point…

We study the distribution of the maximum of a large class of Gaussian fields indexed by a box $V_N\subset Z^d$ and possessing logarithmic correlations up to local defects that are sufficiently rare. Under appropriate assumptions that…

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

Suppose $(X_t)_{t \in T}$ is a Gaussian process indexed by some arbitrary set $T:$ the random variable $\sup_{t \in T}{X_t}$ can be very intricate and bounding its expectation is a natural step towards understanding it. Sudakov-Fernique…

We study a system of N particles with logarithmic, Coulomb or Riesz pairwise interactions, confined by an external potential. We examine a microscopic quantity, the tagged empirical field, for which we prove a large deviation principle at…

The expected improvement (EI) algorithm is one of the most popular strategies for optimization under uncertainty due to its simplicity and efficiency. Despite its popularity, the theoretical aspects of this algorithm have not been properly…

We study the diffusion process in a Heisenberg chain with correlated spatial disorder, with a power spectrum in the momentum space behaving as $k^{-\beta}$, using a stochastic description. It establishes a direct connection between the…

We prove a central limit theorem for linear statistics of a broad class of Pfaffian point processes. As an application, we derive Gaussian limits for scaled linear statistics of step functions in the Pfaffian $\mathrm{Sine_4}$ and…

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

Let $\{\xi(k), k \in \mathbb{Z} \}$ be a stationary sequence of random variables and let $\{S_n, n \in \mathbb{N}_+ \}$ be a transient random walk in the domain of attraction of a stable law. In the previous work \cite{Nicolas_Ahmad}, under…

We study the sequential general online regression, known also as the sequential probability assignments, under logarithmic loss when compared against a broad class of experts. We focus on obtaining tight, often matching, lower and upper…

Experimental design is crucial for inference where limitations in the data collection procedure are present due to cost or other restrictions. Optimal experimental designs determine parameters that in some appropriate sense make the data…

Let $\mathbf{X}=\{X_{n}\}_{n\geq 1}$ be a sequence of stationary Gaussian variables and suppose that only some of the random variables from $\mathbf{X}$ can be observed. In this paper, by studying the limiting properties of multidimensional…