no code implementations • 27 Jun 2023 • Riccardo Rossetti, Galen Reeves
We propose and analyze an approximate message passing (AMP) algorithm for the matrix tensor product model, which is a generalization of the standard spiked matrix models that allows for multiple types of pairwise observations over a collection of latent variables.
no code implementations • 17 Jun 2022 • Ziv Goldfeld, Kristjan Greenewald, Theshani Nuradha, Galen Reeves
However, a quantitative characterization of how SMI itself and estimation rates thereof depend on the ambient dimension, which is crucial to the understanding of scalability, remain obscure.
1 code implementation • 22 Jun 2021 • Joshua K. Behne, Galen Reeves
These results are based on a novel reduction from the low-rank matrix tensor product model (with homogeneous noise) to a rank-one model with heteroskedastic noise.
no code implementations • 28 Feb 2021 • Yixing Zhang, Xiuyuan Cheng, Galen Reeves
The Gaussian-smoothed optimal transport (GOT) framework, recently proposed by Goldfeld et al., scales to high dimensions in estimation and provides an alternative to entropy regularization.
1 code implementation • 25 Jun 2020 • Sebastian Goldt, Bruno Loureiro, Galen Reeves, Florent Krzakala, Marc Mézard, Lenka Zdeborová
Here, we go beyond this simple paradigm by studying the performance of neural networks trained on data drawn from pre-trained generative models.
no code implementations • 22 May 2020 • Galen Reeves
This paper studies a high-dimensional inference problem involving the matrix tensor product of random matrices.
no code implementations • 16 May 2020 • Jean Barbier, Galen Reeves
We consider a generalization of an important class of high-dimensional inference problems, namely spiked symmetric matrix models, often used as probabilistic models for principal component analysis.
no code implementations • 9 Jan 2020 • Alon Kipnis, Galen Reeves
We show that the Wasserstein distance between a bitrate-$R$ compressed version of $X$ and its observation under an AWGN-channel of signal-to-noise ratio $2^{2R}-1$ is sub-linear in the problem dimension.
no code implementations • 11 Dec 2019 • Vaishakhi Mayya, Galen Reeves
We study the problem of community detection when there is covariate information about the node labels and one observes multiple correlated networks.
1 code implementation • 15 Sep 2019 • Willem van den Boom, Galen Reeves, David B. Dunson
Posterior computation for high-dimensional data with many parameters can be challenging.
Computation Methodology
no code implementations • 12 Oct 2017 • Galen Reeves
When applied to the special case of models with multivariate Gaussian channels our method is rigorous and has close connections to free probability theory for random matrices.
no code implementations • 1 Dec 2014 • Francesco Renna, Liming Wang, Xin Yuan, Jianbo Yang, Galen Reeves, Robert Calderbank, Lawrence Carin, Miguel R. D. Rodrigues
These conditions, which are reminiscent of the well-known Slepian-Wolf and Wyner-Ziv conditions, are a function of the number of linear features extracted from the signal of interest, the number of linear features extracted from the side information signal, and the geometry of these signals and their interplay.