Efficient quadratic entropy with distance sketches
arXiv:2610.11976v1 Announce Type: new Abstract: We detail scalable methods for approximating the quadratic entropy $p^T d p$ for arbitrary distributions $p$ and common distances $d$ of negative type. We focus on the Euclidean and spherical geodesic cases, which both use random feature embeddings an…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-10-09 04:00 · arXiv stat.ML
Efficient quadratic entropy with distance sketches