On the Pseudo-Mixing of Kac's Walk
arXiv:2608.17374
2026
Architecture
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper provides a constructive way to generate approximately Haar-random orthogonal transformations using only a sequence of two-coordinate rotations. The transferable asset is computational pseudo-mixing: low-degree observables of the resulting matrix can become Haar-like after roughly n polylog(n) rotations, even though the full matrix has not mixed in total variation. This suggests replacing dense Gaussian or Haar projections in neural networks with a streamed Kac rotation sequence, retaining exact norm preservation while reducing matrix storage and potentially projection cost. The cleanest first target is a random projection or bottleneck layer whose downstream behavior depends primarily on degree-two norm and inner-product statistics.
Ideas from this paper
✗ Failed on benchmark
2026
Replace a dense Haar or Gaussian random projection with a streamed product of random two-coordinate rotations followed by coordinate subsampling. The transform is exactly orthogonal before subsampling, requires only a list of rotation triples, and the paper's pseudo-mixing result predicts that degree-two statistics relevant to norm preservation and Johnson–Lindenstrauss embeddings become Haar-like after only O(n polylog(n)) rotations.
Useful7/10
Difficulty4/10
Novelty5/10