Related papers: Sampling Pfaffian point processes and the symplect…

This paper studies several aspects of signal reconstruction of sampled data in spaces of bandlimited functions. In the first part, signal spaces are characterized in which the classical sampling series uniformly converge, and we investigate…

An elementary derivation of the Borodin-Sinclair-Forrester-Nagao Pfaffian point process, which characterises the law of real eigenvalues for the real Ginibre ensemble in the large matrix size limit, uses the averages of products of…

In recent work, robust mixture modelling approaches using skewed distributions have been explored to accommodate asymmetric data. We introduce parsimony by developing skew-t and skew-normal analogues of the popular GPCM family that employ…

Deep metric learning aims to learn embeddings that contain semantic similarity information among data points. To learn better embeddings, methods to generate synthetic hard samples have been proposed. Existing methods of synthetic hard…

We present a new random walk for uniformly sampling high-dimensional convex bodies. It achieves state-of-the-art runtime complexity with stronger guarantees on the output than previously known, namely in R\'enyi divergence (which implies…

Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet…

We consider a generalization of the discrete-time Self Healing Umbrella Sampling method, which is an adaptive importance technique useful to sample multimodal target distributions. The importance function is based on the weights (namely the…

Given a parametric polynomial curve $\gamma:[a,b]\rightarrow \mathbb{R}^n$, how can we sample a random point $\mathfrak{x}\in \mathrm{im}(\gamma)$ in such a way that it is distributed uniformly with respect to the arc-length? Unfortunately,…

We show, using either Fock space techniques or Macdonald difference operators, that certain symplectic and orthogonal analogues of Okounkov's Schur measure are determinantal with kernels given by explicit double contour integrals. We give…

A sketch-and-select Arnoldi process to generate a well-conditioned basis of a Krylov space at low cost is proposed. At each iteration the procedure utilizes randomized sketching to select a limited number of previously computed basis…

We propose an input sparsity time sampling algorithm that can spectrally approximate the Gram matrix corresponding to the $q$-fold column-wise tensor product of $q$ matrices using a nearly optimal number of samples, improving upon all…

This paper highlights a formal connection between two families of widely used matrix factorization algorithms in numerical linear algebra. One family consists of the Jacobi eigenvalue algorithm and its variants for computing the Hermitian…

We focus the use of \emph{row sampling} for approximating matrix algorithms. We give applications to matrix multipication; sparse matrix reconstruction; and, \math{\ell_2} regression. For a matrix \math{\matA\in\R^{m\times d}} which…

The Airy$_\beta$ point process, $a_i \equiv N^{2/3} (\lambda_i-2)$, describes the eigenvalues $\lambda_i$ at the edge of the Gaussian $\beta$ ensembles of random matrices for large matrix size $N \to \infty$. We study the probability…

We propose a novel method for sampling and optimization tasks based on a stochastic interacting particle system. We explain how this method can be used for the following two goals: (i) generating approximate samples from a given target…

We present and analyze a framework for designing symplectic neural networks (SympNets) based on geometric integrators for Hamiltonian differential equations. The SympNets are universal approximators in the space of Hamiltonian…

This paper deals with the problem of efficient sampling from a stochastic differential equation, given the drift function and the diffusion matrix. The proposed approach leverages a recent model for probabilities \cite{rudi2021psd} (the…

We consider random normal matrix and planar symplectic ensembles, which can be interpreted as two-dimensional Coulomb gases having determinantal and Pfaffian structures, respectively. For general radially symmetric potentials, we derive the…

The proximal point algorithm plays a central role in non-smooth convex programming. The Augmented Lagrangian Method, one of the most famous optimization algorithms, has been found to be closely related to the proximal point algorithm. Due…

The computation of select eigenvalues and eigenvectors of large, sparse matrices is fundamental to a wide range of applications. Accordingly, evaluating the numerical performance of emerging alternatives to the IEEE 754 floating-point…