arXiv Machine Learning By Paulina Hoyos, Shashanka Ubaru, Dongsung Huh, Vasileios Kalantzis, Kenneth L. Clarkson, Misha Kilmer, Haim Avron, Lior Horesh

Exact Symmetry as Algebra: A Machine-Verified Tensor Calculus that Enforces Physical Selection Rules

Read the original on arXiv Machine Learning →

arXiv:2605. 20440v2 Announce Type: replace Abstract: Symmetry is central to the physical sciences, yet machine learning usually captures it only approximately, leaving a residual per-step equivariance error $\varepsilon$ that compounds with depth $M$ as $M\varepsilon$, whereas exact equivariance holds at unbounded depth; we demonstrate this divergence at fourteen orders of magnitude.

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.

arXiv Machine Learning
Sep 17

The parity gap in crystal tensor prediction

arXiv:2608.18714v2 Announce Type: replace-cross Abstract: Crystal symmetry dictates whether a physical response tensor must vanish, establishing a direct test for machine learning predictions indepen...

By Can Polat, Mustafa Kurban, Erchin Serpedin, Hasan Kurban
arXiv Machine Learning
Aug 20

A single design choice determines whether machine learning models of materials make physically impossible predictions

The article demonstrates that a single design decision—whether a machine‑learning model’s features include parity labels—determines if the model can ever predict physically impossible values for material properties. Using group‑theoretical analysis, the authors introduce the parity gap criterion to identify which properties and crystal symmetries are affected. Experiments on 2,000 centrosymmetric crystals show that parity‑labelled models achieve exact zero predictions for forbidden piezoelectric responses, whereas models lacking parity labels produce large errors, yet both maintain comparable overall accuracy.

By Can Polat, Mustafa Kurban, Erchin Serpedin, Hasan Kurban
Hugging Face Trending Papers
Aug 19

Score the Algebra, Not the Span: Dimension Reduction for Transfer Operator Models of Dynamical Systems

The paper addresses the limitations of spectral dimension reduction for dynamical systems composed of weakly interacting components, where standard rank‑based methods either require exponentially many modes or omit entire components (a phenomenon termed linear masking). It proposes scoring the σ‑algebra generated by coordinates instead of individual modes, using a χ²‑divergence criterion that guarantees an embedding with twice the intrinsic dimension captures the full operator spectrum. Experiments on benchmark systems show that this algebraic approach recovers masked components and enables accurate prediction from few labels, outperforming traditional rank‑based and VAMP methods.