Farthest-cell triplet entropy: high-dimensional shell limits and hyperbolic curvature amplification
arXiv:2609.02362
2026
Geometry
2 ideas extracted · analyzed Sep 3, 2026
What the math gives to ML
The paper introduces a comparison-based statistic for the geometry of learned representations: the conditional entropy of the farthest prototype among three, averaged over queries and prototype triples. Its useful properties are that it needs only argmax comparisons, is invariant to monotone rescaling of distances, and detects whether prototype cells are balanced or dominated by radial variation. In high-dimensional isotropic shells, the statistic is governed by a one-dimensional signal-to-noise parameter, while hyperbolic curvature amplifies radial variation through the explicit factor A(s)=s coth s. The most promising neural uses are a farthest-neighbor geometry regularizer and an entropy-based controller for adaptive hyperbolic curvature, with anisotropy explicitly treated as a failure mode.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Use farthest-triplet entropy as a low-bandwidth observable of whether a hyperbolic embedding is angular- or radial-dominated, then adapt the hyperbolic curvature rather than fixing it arbitrarily. In the isotropic shell regime, invert the entropy-to-signal curve to estimate the effective radial/angular parameter and select curvature that reaches a chosen geometric operating point.
Useful7/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a regularizer that rewards balanced farthest-prototype cells in an embedding space. For each query and random triple of prototypes, compute which prototype is farthest, estimate the three label probabilities over queries, and maximize their Shannon entropy to discourage prototype domination and representation collapse toward a radial direction.
Useful6/10
Difficulty4/10
Novelty6/10