arXiv Machine Learning By Yi Fan, Vishnu Jejjala, Yang Lei

Machine learning modularity

Read the original on arXiv Machine Learning →

The paper introduces a transformer‑based sequence‑to‑sequence model with dynamic batching that automatically simplifies complex expressions involving multiple elliptic Gamma functions. It learns to apply algebraic identities, especially SL(2,ℤ) and SL(3,ℤ) modular transformations, to reduce scrambled expressions to canonical forms. Experiments show over 99% accuracy on in‑distribution tests and more than 90% accuracy under significant extrapolation, indicating the model internalizes the underlying algebraic rules rather than merely memorizing patterns.

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 AI
Aug 19

BRo-JEPA: Learning Modular Transformations in Latent Space

The paper introduces BRo-JEPA, a world model that learns modular arithmetic operations as rotations in latent space. Using MNIST and EMNIST datasets, BRo-JEPA achieves near-perfect zero‑shot generalization to unseen operations, outperforming standard supervised and JEPA baselines by a large margin. The model demonstrates that latent transformations can encode underlying algebraic structures, enabling strict zero‑shot operation generalization.

By Divyansh Jha, Yuanfang Xie, Brennen Yu, Varan Mehra