arXiv Statistics ML

A shape-similarity latent space for fluid interfaces: invertible reduced-order modelling of droplet morphology

arXiv Machine Learning
Jul 8

Geometric Stability: The Missing Axis of Representations

arXiv:2601. 09173v5 Announce Type: replace Abstract: Representational similarity analysis and related methods compare the internal geometries of neural networks, but they measure only alignment between spaces, leaving a blind spot -- whether a representation's structure is reliably recoverable, not merely similar.

By Prashant C. Raju
arXiv Machine Learning
Aug 27

Hyperbolic Latent Geometry for Tree-Structured Prototype Networks: A Local-vs-Global Trade-off

The paper investigates whether placing class prototypes on a hyperbolic manifold (Poincaré ball) rather than a Euclidean space improves the satisfaction of a tree‑structured regularizer in hierarchical classification. Experiments on WikiArt show that hyperbolic prototypes better preserve nearest‑neighbor topology (higher sibling and cousin recall) across multiple tree definitions, while Euclidean prototypes perform similarly to logistic regression on raw features and only hyperbolic models improve local retrieval. The study provides empirical evidence that the choice of latent geometry can affect the fidelity of tree‑structured regularization in real data.

By Peter Flo, Luca Grossmann
arXiv Machine Learning
Jun 5

Dead Directions: Geometric Singular Learning

arXiv:2606. 05957v1 Announce Type: new Abstract: Singular learning theory and information geometry have studied the same parameter spaces in mostly separate vocabularies: the former computes Bayesian invariants in resolved coordinates, the latter works in original coordinates under a non-degeneracy assumption that overparameterised models routinely violate.

By Tejas Pradeep Shirodkar
arXiv Machine Learning
Jul 15

From Geometric Recovery to Causal Validation: A Reproducible Audit of Sparse Autoencoder Features, from Superposition Geometry to Causal Inertness

arXiv:2607. 12166v1 Announce Type: new Abstract: Sparse autoencoders (SAEs) are the standard for decomposing superposed neural representations into interpretable features, and evaluation relies predominantly on correlational recovery metrics -- cosine similarity between ground-truth directions and decoder atoms.

By Mohamed Abdessalem Bal