Related papers: Sampling Matrices from Harish-Chandra-Itzykson-Zub…
We study the problem of sampling from a distribution $p^*(x) \propto \exp\left(-U(x)\right)$, where the function $U$ is $L$-smooth everywhere and $m$-strongly convex outside a ball of radius $R$, but potentially nonconvex inside this ball.…
Let H=A+UBU* where A and B are two N-by-N Hermitian matrices and U is a Haar-distributed random unitary matrix, and let \mu_H, \mu_A, and \mu_B be empirical measures of eigenvalues of matrices H, A, and B, respectively. Then, it is known…
Various differentially private algorithms instantiate the exponential mechanism, and require sampling from the distribution $\exp(-f)$ for a suitable function $f$. When the domain of the distribution is high-dimensional, this sampling can…
In a companion paper, we proposed combining large numbers of "fuzzy archetypes" with Self-Organizing Maps (SOMs) to derive photometric redshifts in a data-driven way. In this paper, we investigate the performance of several sampling…
Concise review of the basic properties of unitary matrix integrals. They are studied with the help of the three matrix models: the ordinary unitary model, Brezin-Gross-Witten model and the Harish-Charndra-Itzykson-Zuber model. Especial…
We provide an elementary proof for a theorem due to Petz and R\'effy which states that for a random $n\times n$ unitary matrix with distribution given by the Haar measure on the unitary group U(n), the upper left (or any other) $k\times k$…
We provide a differentially private algorithm for hypothesis selection. Given samples from an unknown probability distribution $P$ and a set of $m$ probability distributions $\mathcal{H}$, the goal is to output, in a…
In this article, we study high-dimensional behavior of empirical spectral distributions $\{L_N(t), t\in[0,T]\}$ for a class of $N\times N$ symmetric/Hermitian random matrices, whose entries are generated from the solution of stochastic…
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computationally hard (under cryptographic assumptions), and…
We consider random matrix ensembles on the set of Hermitian matrices that are heavy tailed, in particular not all moments exist, and that are invariant under the conjugate action of the unitary group. The latter property entails that the…
We study the Riemannian Langevin Algorithm for the problem of sampling from a distribution with density $\nu$ with respect to the natural measure on a manifold with metric $g$. We assume that the target density satisfies a log-Sobolev…
An accurate calibration of the source redshift distribution $p(z)$ is a key aspect in the analysis of cosmic shear data. This, one way or another, requires the use of spectroscopic or high-quality photometric samples. However, the…
Random unitary matrices find a number of applications in quantum information science, and are central to the recently defined boson sampling algorithm for photons in linear optics. We describe an operationally simple method to directly…
The Metropolis-Hastings (MH) algorithm is one of the most widely used Markov Chain Monte Carlo schemes for generating samples from Bayesian posterior distributions. The algorithm is asymptotically exact, flexible and easy to implement.…
We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…
We study the statistical properties of eigenvalues of the Hessian matrix ${\cal H}$ (matrix of second derivatives of the potential energy) for a classical atomic liquid, and compare these properties with predictions for random matrix models…
The concept of randomness in quantum computing has been central to construct benchmarking tools, cryptographic protocols, as well as a proof of beyond classical computation. Discerning whether quantum states (or unitaries) are randomly…
Kernel dependence measures yield accurate estimates of nonlinear relations between random variables, and they are also endorsed with solid theoretical properties and convergence rates. Besides, the empirical estimates are easy to compute in…
We propose a new method called the Metropolis-adjusted Mirror Langevin algorithm for approximate sampling from distributions whose support is a compact and convex set. This algorithm adds an accept-reject filter to the Markov chain induced…
We develop Gaussian approximations for high-dimensional vectors formed by second-order $U$- and $V$-statistics whose kernels depend on sample size under independent but not identically distributed (i.n.i.d.) sampling. Our results hold…