arXiv Machine Learning By Kazuo Ishii, Bishnu Prasad Gautam, Jieling Wu, Javaid Saher

Platonic Projection Structures: Operator-Induced Observability in Representation Learning

Read the original on arXiv Machine Learning →

arXiv:2607. 05175v1 Announce Type: new Abstract: We characterize observability in representation learning through Platonic Projection Structures (PPS), an operator-theoretic framework for analyzing representation accessibility under partial observation.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jul 6

Platonic Projection Structures: Operator-Induced Observability in Representation Learning

We characterize observability in representation learning through Platonic Projection Structures (PPS), an operator-theoretic framework for analyzing representation accessibility under partial observation. Rather than treating observable outputs as direct reflections of latent representations, PPS models observation through a self-adjoint positive semidefinite operator acting on a latent representation space.

arXiv Machine Learning
5d ago

From Plato to Aristotle: Toward a General Theory of Representation Hypotheses

The paper introduces the Lattice Representation Hypothesis (LRH) to explain why different alignment criteria—such as neighbor overlap, spanning trees, and distances—yield varying views on model representation convergence. It shows that the Platonic Representation Hypothesis (PRH) reflects agreement at the top of a lattice, while evidence comes from criteria near the bottom, and that the Aristotelian Representation Hypothesis (ARH) limits convergence to local neighborhoods due to calibration effects. Experiments on numerous pretrained vision and language models, along with theoretical analyses of linear autoencoders and contrastive Gibbs models, support the LRH’s claim that training procedures and objectives determine which criteria are reliably met across runs.

By Dai Shi, Andi Han, Xiaoyu Li, Luke Thompson, Jos\'e Miguel Hern\'andez-Lobato
arXiv Machine Learning
Oct 3

Symmetry Discovery in Quantum Learning: Observable-Level and Task-Level Inference from Finite Measurements

The paper develops a finite‑measurement framework for inferring the symmetry group that a quantum learning model should respect, based on candidate transformations and limited data. It shows that observable‑invisible transformations correspond to the stabilizer of a projected state when the probe span is invariant, and that recovered generators form a valid subgroup with a continuous invisible space identified via its Lie algebra. The authors introduce an unbiased shadow statistic that improves estimation rates, establish optimal gap dependence through a commuting‑qubit lower bound, and provide tools for task validation, bias quantification, and capacity analysis, all illustrated with Ising‑chain calculations.

By Zeyu Chen