Related papers: Sharp failure rates for the bootstrap particle fil…
Sinopoli et al. (TAC, 2004) considered the problem of optimal estimation for linear systems with Gaussian noise and intermittent observations, available according to a Bernoulli arrival process. They showed that there is a "critical"…
We study a new random matrix ensemble $X$ which is constructed by an application of a two dimensional linear filter to a matrix of iid random variables with infinite fourth moments. Our result gives asymptotic lower and upper bounds for the…
We consider a high-dimensional linear regression problem. Unlike many papers on the topic, we do not require sparsity of the regression coefficients; instead, our main structural assumption is a decay of eigenvalues of the covariance matrix…
We study bootstrap inference for the $k$th largest coordinate of a normalized sum of independent high-dimensional random vectors. Existing second-order theory for maxima does not directly extend to order statistics, because the event…
The following anticoncentration property is proved. The probability that the $k$-order statistic of an arbitrarily correlated jointly Gaussian random vector $X$ with unit variance components lies within an interval of length $\varepsilon$…
We study a Gaussian measure with parameter $q\in(0,1)$ on the dual of the unitary group of size $N$: we prove that a random highest weight under this measure is the coupling of two independent $q$-uniform random partitions $\alpha,\beta$…
In recent years, bootstrap methods have drawn attention for their ability to approximate the laws of "max statistics" in high-dimensional problems. A leading example of such a statistic is the coordinate-wise maximum of a sample average of…
Let X be a n*p matrix and l_1 the largest eigenvalue of the covariance matrix X^{*}*X. The "null case" where X_{i,j} are independent Normal(0,1) is of particular interest for principal component analysis. For this model, when n, p tend to…
Complex eigenvalues of random matrices $J=\text{GUE }+ i\gamma \diag (1, 0, \ldots, 0)$ provide the simplest model for studying resonances in wave scattering from a quantum chaotic system via a single open channel. It is known that in the…
The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…
Spectral analysis plays a crucial role in high-dimensional statistics, where determining the asymptotic distribution of various spectral statistics remains a challenging task. Due to the difficulties of deriving the analytic form, recent…
We study the problem of high-dimensional covariance estimation under the constraint that the partial correlations are nonnegative. The sign constraints dramatically simplify estimation: the Gaussian maximum likelihood estimator is well…
We establish large deviation principles for the largest eigenvalue of large random matrices with variance profiles. For $N \in \mathbb N$, we consider random $N \times N$ symmetric matrices $H^N$ which are such that…
This paper is aimed at deriving the universality of the largest eigenvalue of a class of high-dimensional real or complex sample covariance matrices of the form $\mathcal{W}_N=\Sigma^{1/2}XX^*\Sigma ^{1/2}$. Here, $X=(x_{ij})_{M,N}$ is an…
We study the orthogonal polynomials and the Hankel determinants associated with Gaussian weight with two jump discontinuities. When the degree $n$ is finite, the orthogonal polynomials and the Hankel determinants are shown to be connected…
The ability of many powerful machine learning algorithms to deal with large data sets without compromise is often hampered by computationally expensive linear algebra tasks, of which calculating the log determinant is a canonical example.…
We consider the problem of finding a dense submatrix of a matrix with i.i.d. Gaussian entries, where density is measured by average value. This problem arose from practical applications in biology and social sciences…
We consider a class of rotationally invariant unitary random matrix ensembles where the eigenvalue density falls off as an inverse power law. Under a new scaling appropriate for such power law densities (different from the scaling required…
We study the computation of Gaussian orthant probabilities, i.e. the probability that a Gaussian falls inside a quadrant. The Geweke-Hajivassiliou-Keane (GHK) algorithm [Genz, 1992; Geweke, 1991; Hajivassiliou et al., 1996; Keane, 1993], is…
We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…