HCC+: Hyperbolic Guarding for Certified Attention Retrieval
cs.DS, cs.LG
Submitted: 2026-08-25
Updated: 2026-08-25
Comments: 9 pages, no figures, theoretical paper
License: http://creativecommons.org/licenses/by-sa/4.0/
The gist: We study the Lipschitz stability of attention retrieval in hyperbolic spaces.
Terminology
Abstract
We study the Lipschitz stability of attention retrieval in hyperbolic spaces. Existing methods lack deterministic guarantees on attention-weight preservation under finite-precision representations. We introduce HCC+, a theoretical framework exploiting three properties of the Poincaré ball: exponential volume growth enabling query-independent boundary truncation; logarithmic covering radius of hyperbolic 1-centers enabling dimension-independent critical-key identification; and a packing bound with constants independent of the embedding dimension. We prove two deterministic guarantees: for exact retrieval, the per-layer attention deviation is bounded by 10% of its ideal value; for soft attention, the total variation distance decays as O(1/sqrt n), the rate of finite-sample variance. As a consequence of the guarding mechanism, the framework achieves a storage reduction factor of 6.1 times relative to FP16. We provide the first deterministic, query-independent retrieval certificate in non-Euclidean geometry.
Sources
- Riemann GeoResolver: A Non-Euclidean Attention Framework from Euclidean Resolver to Hyperbolic-Spherical Geometry
- TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
Related papers
- Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
- Edge-Private Matching Kernels Through Local Decoding
- Local Node Differential Privacy
- Cheaper by the Batch: Shared Traversal for Genotype Graph Editing
- Scalable Algorithms for Approximate DNF Model Counting
- On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions