Open Source
From Plato to Aristotle: Toward a General Theory of Representation Hypotheses
arXiv stat.ML0 views
arXiv:2610.20286v1 Announce Type: cross Abstract: The Platonic Representation Hypothesis (PRH) holds that increasingly capable models converge toward a common representation. However, recent studies have shown different views on aligning representations via their neighborhoods, spanning trees, and distances. We show that these views can differ because the alignment criteria behind them sit at different points of one lattice, and we formalize this explanation as the Lattice Representation Hypothesis (LRH). Under the LRH, the convergence claimed by the PRH is agreement at the top of the lattice, whereas its evidence comes from neighbor overlap, a criterion near the bottom. The Aristotelian Representation Hypothesis (ARH) restricts convergence to local neighborhoods because calibration keeps the growth of neighbor overlap with model size but largely removes that of centered kernel alignment. We show that this removal can come from calibrating a maximum over layers, so global convergence remains open. Back into Plato's Cave (BPC) infers coarse shared structure from the collapse of neighbor overlap on larger evaluation sets, whereas we trace it at least partly to a fixed number of neighbors covering shorter distances. We show that the spanning-tree overlap used by Structure over Geometry (SOG) mostly repeats one-nearest-neighbor overlap. The LRH also extends to independently trained models, whose training procedure and objective decide the criteria met reliably across runs. We prove this claim for the training procedure in a linear autoencoder and for the objective in a finite contrastive Gibbs model. Experiments on dozens of pretrained vision and language models and thousands of runs of both theoretical models support these conclusions. We hope this work paves the way toward a general theory of representation hypotheses, with a framework to analyze them and compare their evidence. Project page: https://eethanshi.github.io/LRH
Source:https://arxiv.org/abs/2610.20286PreviousMAEM: Mitigating Recency Bias via a Replay-Free, Capacity-Controlled Dynamic Mixture of Experts for Class-Incremental Graph LearningNextSpectrumQuant: Spectrum Alignment for LLM Quantization
Related posts
A fresh wave of cyberattacks has hit Europe’s supermarket refrigerators, destroying food across countries
0TechCrunch

Onboarding Instrumentation: What to Actually Log Before You Redesign the Flow
0dev.to UX
Iceberg vs Parquet: do you need a table format?
0dev.to Data

Open Source Didn't Ban AI Code. 83% of Its AI Policies Allow It, With One Catch
0dev.to Git
Orbit: A High-Performance Terminal Workspace & System Monitor in Rust with WASM Plugins
0dev.to Rust

Forecasting the U.S. Senate with Prediction Markets and Monte Carlo Simulations
0dev.to AI