Optimal Condition Numbers in Low-Rank Positive Semidefinite Matrix Sensing
arXiv:2608.22418
2026
Architecture
2 ideas extracted · analyzed Aug 29, 2026
What the math gives to ML
The paper turns positive-semidefinite sensing into a quantitative stability problem: the relevant object is the ratio between the largest and smallest measurement distortion over pairs of low-rank PSD matrices. Its transferable asset is a principled way to design nonnegative, low-dimensional measurements of covariance-like neural representations, rather than treating compression as an unconstrained linear projection. Rank-one Gaussian measurements are shown to be asymptotically optimal for this condition-number objective, suggesting both a useful initialization and a fixed architecture for stable low-rank feature bottlenecks. A practical neural-network adaptation is to measure PSD feature matrices with intensity features and explicitly monitor or regularize empirical lower and upper Lipschitz constants.
Ideas from this paper
Unverified
Re-invented
2026
Use fixed or lightly trainable rank-one Gaussian PSD measurements as a compact feature layer for representations whose useful information is contained in a low-rank Gram or covariance matrix. The nonnegative intensity coordinates preserve the geometry of low-rank PSD inputs while using only \(m\) scalar features instead of a full \(d\times d\) matrix.
Useful6/10
Difficulty3/10
Novelty7/10
✗ Failed on benchmark
2026
Represent an intermediate feature as a low-rank PSD matrix and compress it using nonnegative measurements \(\langle A_i,X\rangle\), while penalizing the empirical ratio between maximum and minimum measurement distortion over low-rank feature pairs. This directly discourages collapsed directions and excessively amplified directions in a covariance or Gram-feature bottleneck.
Useful6/10
Difficulty5/10
Novelty6/10