arXiv Machine Learning

High-Dimensional Latents Should Be Diagnosed Through Phase Structure

arXiv:2606. 02600v1 Announce Type: cross Abstract: We study autoencoder and variational-autoencoder latent spaces through the lens of spin-glass theory.

arXiv Machine Learning
Sep 18

TetrisCNN for interpretable detection of phases of matter from experimental quantum simulator data

TetrisCNN is a convolutional neural network that uses parallel branches of differently shaped filters to learn sparse, interpretable latent representations directly in terms of spin correlators. Applied to experimental snapshots from two-dimensional Ising and XY quantum simulators measured in multiple bases, the network detects phase transitions and crossovers while expressing its decision boundaries as symbolic formulas built from experimentally measurable spin correlators. This approach bridges the gap between black‑box neural network methods and physically interpretable models, enabling automated detection of phases of matter from realistic, noisy experimental data.

By Kacper Cybi\'nski, Bj\"orn van Zwol, James Enouen, Guillaume Bornet, Thierry Lahaye, Antoine Browaeys, Antoine Georges, Anna Dawid
arXiv Machine Learning
Jul 14

Learning Topological Quantum Phases from Limited Subsystems

arXiv:2607. 10656v1 Announce Type: cross Abstract: Characterizing quantum topological phases requires measuring non-local string order parameters, demanding access to the full system, which is often experimentally unfeasible.

By Mehran Khosrojerdi, Sougato Bose, Alessandro Cuccoli, Paola Verrucchi, Abolfazl Bayat, Leonardo Banchi
arXiv AI
Sep 4

Differentiable Interval Bottlenecks for Interpretable Anomaly Detection in Numerical Data

DIFFINT is a reconstruction‑based anomaly detector that uses a differentiable autoencoder with a latent bottleneck composed of soft, axis‑aligned interval memberships. Each latent unit represents a human‑readable hyper‑rectangle in feature space, allowing the model to encode how strongly an instance falls inside each interval and to compute reconstruction error as the anomaly score. The method provides a certified lower bound on reconstruction error for points outside all active intervals, a suppression mechanism for sparse abnormalities, and a closed‑form, label‑free importance ranking for each (unit, feature) pair, achieving top performance on 48 ADBench benchmarks against 22 baselines.

By Lamine Diop, Marc Plantevit
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