Artificial Intelligence · 25.08.2026, 09:46 UTC
Radial Compensation: The Inverse Base-Distribution Problem for Chart-Based Generative Models on Riemannian Manifolds
| Schweregrad | info |
|---|---|
| Kategorie | Artificial Intelligence |
| Quelle | arXiv cs.AI ↗ |
| Veröffentlicht | 25.08.2026 UTC |
Sicherheitsmeldung mit Schweregrad noch nicht bewertet. Technische Details im Tab „Originaltext“; empfohlene Schritte in der Checkliste.
arXiv:2511.14056v3 Announce Type: replace-cross Abstract: Latent-variable models on spheres and hyperbolic spaces usually draw a Gaussian in the tangent space at a base point and push it onto the manifold. On these spaces the distance from the base point is the coordinate that carries meaning: depth in a hierarchy, the angle of a rotation, the deviation of a protein frame from a reference. We show that the standard construction silently replaces whatever distance distribution the modeler intended with a fixed one, a scaled chi law whose shape no setting of the scale can change. We then solve the reverse problem. Given the intended distance distribution, we derive in closed form the tangent density that realizes it, prove it is the only isotropic choice with chart-independent likelihoods for a broad class of charts, and prove a lower bound with explicit constants on what ignoring the problem costs a variational autoencoder. Experiments backed by an exact per-run normalization audit confirm that the compensated prior is invariant to the chart and stable across scales, every wrapped baseline we train collapses to the boundary of its chart, curvature becomes recoverable where the wrapped prior fails and protein-orientation likelihood improves from 2.58 to 0.87 nats at identical accuracy.
Maßnahmen
⬇ Als MarkdownVerwandte Beiträge
- info Can Large Language Models "Hyper-Thread"?
- info Context-Aware Cluster Decoding: Semantic Anchor-Driven Coherence in dMLLMs
- info When Not to Imitate: Boundary-Aware Skill Memory for Reliable Tool-Use LLM Agents
- info Mechanistic Interpretability of Chain-of-Thought Reasoning via Sequential Activation Patching