Impossibility of latent inner product recovery via rate distortion
Not on the map. Why?
Abstract (arXiv)
In this largely expository note, we present an impossibility result for inner product recovery in a random geometric graph or latent space model using the rate-distortion theory. More precisely, suppose that we observe a graph A on n vertices with average edge density p generated from Gaussian or spherical latent locations z1, dots, zn ∈ ℝd associated with the n vertices. It is of interest to estimate the inner products langle zi, zj rangle which represent the geometry of the latent points. We prove that it is impossible to recover the inner products if d gtrsim n h(p) where h(p) is the binary entropy function. This matches the condition required for positive results on inner product recovery in the literature. The proof follows the well-established rate-distortion theory with the main technical ingredient being a lower bound on the rate-distortion function of the Wishart distribution which is interesting in its own right.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 32 references that are in the map. First posted on arXiv 16 Jul 2024.
Builds on
10 of 32 references.
References · 10
- 2014Testing for high-dimensional geometry in random graphscited by 25
- 2013A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completioncited by 23
- 20161-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximationcited by 11
- 2019Latent Distance Estimation for Random Geometric Graphscited by 11
- 2019Phase Transitions for Detecting Latent Geometry in Random Graphscited by 9
- 2024Concentration properties of fractional posterior in 1-bit matrix completioncited by 7
- 20151-Bit Matrix Completion under Exact Low-Rank Constraintcited by 6
- 2020Community detection and percolation of information in a geometric settingcited by 5
- 2023Spectral clustering in the Gaussian mixture block modelcited by 5
- 2016Information and dimensionality of anisotropic random geometric graphscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.