arXiv Machine Learning

What is Smoothness?

arXiv:2609. 03246v1 Announce Type: cross Abstract: Smoothness of a function on the real line is reflected in the decay of its Fourier transform, which suggests that smoothness of a function in $L^2(G)$ for a group $G$ should mean concentration of the Fourier coefficients at low frequency.

arXiv Machine Learning
Jul 13

Group Invariant Spectral Embedding

arXiv:2607. 08987v1 Announce Type: new Abstract: Spectral embedding methods are widely used for dimensionality reduction and clustering of high-dimensional datasets with intrinsic low-dimensional structures.

By Yeari Vigder, Paulina Hoyos, David Thong, Joakim and\'en, Joe Kileel, Amit Moscovich
arXiv Machine Learning
Jul 15

Learning the Graphical Nature of Symmetries

arXiv:2607. 12026v1 Announce Type: cross Abstract: Finite groups are rigid algebraic objects, whose Cayley graphs expose a rich network geometry through which group-theoretic structure can be measured, compared, and learned.

By Rashid Barket, Enrico Grimaldi, Yacoub Hendi, Edward Hirst, Adam Onus, Harmeet Singh
arXiv Machine Learning
Jul 9

The Optimal Sample Complexity of Learning Autoregressive Chain-of-Thought

arXiv:2607. 07423v1 Announce Type: new Abstract: We prove that, in the realizable PAC setting, the sample complexity of exact-trace learning for full autoregressive Chain-of-Thought traces is upper bounded by the standard multiclass rate of the local next-token class, where this rate is governed by the Daniely--Shalev-Shwartz dimension.

By Zhiyuan Li