arXiv research

The paper analyzes stability of random matrix products with Markovian noise.

A new matrix concentration inequality for random products of matrices.

Generalizes randomized SVD for better matrix approximations using Gaussian vectors.

Study examines large deviations in random walks on hyperbolic spaces.

New insights into identifying mixtures of product distributions using Hadamard extensions.

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology outlined in \citet{sussman2012universally} to construct consistent estimates for the …

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c >= rank(A) columns depend on the right singular vector matrix of A. For a Monte-…

Study reveals an equivalence principle for the spectrum of random inner-product kernel matrices in polynomial scaling.

New matrix ensembles better match deep neural network spectral densities.

Random matrix ensembles yield uniform distributions on manifolds.

The paper generalizes product inequalities for random vectors and their applications.

Study on random matrices in deep neural networks with IID entries.

The paper examines how well node similarities are preserved by random projections in graph embeddings.

Paper finds formulas for mutual information and MMSE in matrix tensor product problems.

IDPGs extend RDPGs with a Poisson process for random latent positions.

We investigate the computational complexity of several basic linear algebra primitives, including largest eigenvector computation and linear regression, in the computational model that allows access to the data via a matrix-vector product oracle. We show that for polynomial accuracy, $Θ(d)$ calls to the oracle are nece…

Matrices satisfying the Restricted Isometry Property (RIP) play an important role in the areas of compressed sensing and statistical learning. RIP matrices with optimal parameters are mainly obtained via probabilistic arguments, as explicit constructions seem hard. It is therefore interesting to ask whether a fixed mat…

In this paper, we present a new framework to obtain tail inequalities for sums of random matrices. Compared with existing works, our tail inequalities have the following characteristics: 1) high feasibility--they can be used to study the tail behavior of various matrix functions, e.g., arbitrary matrix norms, the absol…

New method estimates large matrices' spectra from small sub-matrices.

We study covariance matrix estimation for the case of partially observed random vectors, where different samples contain different subsets of vector coordinates. Each observation is the product of the variable of interest with a $0-1$ Bernoulli random variable. We analyze an unbiased covariance estimator under this mod…

Study on random matrices in deep neural networks using Gaussian data.

Many important problems are characterized by the eigenvalues of a large matrix. For example, the difficulty of many optimization problems, such as those arising from the fitting of large models in statistics and machine learning, can be investigated via the spectrum of the Hessian of the empirical loss function. Networ…

New algorithm reduces cold-start costs in multi-armed bandits for many products.

In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels are observed for a number of vertices tending to infinity, then we show that the …

Improved perturbation reduces matrix condition number to O(n) with minimal storage.

Convex optimization method infers latent structure in random dot product graphs.

The paper develops concentration inequalities for structured random data, extending beyond independent terms.

Random walks on hyperbolic spaces follow predictable large deviation principles.

We show that a simple randomized sketch of the matrix multiplicative weight (MMW) update enjoys (in expectation) the same regret bounds as MMW, up to a small constant factor. Unlike MMW, where every step requires full matrix exponentiation, our steps require only a single product of the form $e^A b$, which the Lanczos …

The paper proves a distribution claim for neural network Jacobians.

Improved statistical computation through efficient matrix sampling.

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for stochastic blockmodel graphs, the rows of the spectral embedding of the normalized La…

Stochastic trace estimation with tensor train random vectors

This paper shows universality in spectrum behavior for random inner-product kernel matrices in polynomial regime.

High-dimensional curved diffusions show abrupt convergence at a critical time.

Corrected whitening restores orthogonality in high-dimensional spherical Gaussian mixtures.

A method for identifying joint and individual subspaces from multi-view data.

Generative modeling, which learns joint probability distribution from data and generates samples according to it, is an important task in machine learning and artificial intelligence. Inspired by probabilistic interpretation of quantum physics, we propose a generative model using matrix product states, which is a tenso…

This article investigates the eigenspectrum of the inner product-type kernel matrix $\sqrt{p} \mathbf{K}=\{f( \mathbf{x}_i^{\sf T} \mathbf{x}_j/\sqrt{p})\}_{i,j=1}^n$ under a binary mixture model in the high dimensional regime where the number of data $n$ and their dimension $p$ are both large and comparable. Based on…

Product Kanerva Machines dynamically combine smaller models for better memory organization.

We develop an efficient alternating framework for learning a generalized version of Factorization Machine (gFM) on steaming data with provable guarantees. When the instances are sampled from $d$ dimensional random Gaussian vectors and the target second order coefficient matrix in gFM is of rank $k$, our algorithm conve…

New algorithm estimates matrix-valued regression parameters efficiently.

Study on the geometric Dyson Brownian motion of non-square matrix products.

Random projections (RP) are a popular tool for reducing dimensionality while preserving local geometry. In many applications the data set to be projected is given to us in advance, yet the current RP techniques do not make use of information about the data. In this paper, we provide a computationally light way to extra…

Boolean matrix factorization (BMF) is a popular and powerful technique for inferring knowledge from data. The mining result is the Boolean product of two matrices, approximating the input dataset. The Boolean product is a disjunction of rank-1 binary matrices, each describing a feature-relation, called pattern, for a g…

In this work, we propose a new randomized algorithm for computing a low-rank approximation to a given matrix. Taking an approach different from existing literature, our method first involves a specific biased sampling, with an element being chosen based on the leverage scores of its row and column, and then involves we…

The paper analyzes heavy-tailed multivariate distributions in non-stationary systems using random matrix theory.

The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor spectral norm, tensor nuclear norm [C. Lu, et al., 2018] and many others. The line…