Data Augmentation: A Fourier Analysis Perspective
arXiv:2606. 24418v1 Announce Type: new Abstract: Data augmentation is a simple and model-agnostic approach for exploiting known invariances in learning problems.
arXiv:2606. 24418v1 Announce Type: new Abstract: Data augmentation is a simple and model-agnostic approach for exploiting known invariances in learning problems.
arXiv:2512. 20043v3 Announce Type: replace Abstract: Symmetry is fundamental to understanding physical systems and can improve performance and sample efficiency in machine learning.
arXiv:2505. 19809v3 Announce Type: replace-cross Abstract: In many real-world applications of regression, conditional probability estimation, and uncertainty quantification, exploiting symmetries rooted in physics or geometry can dramatically improve generalization and sample efficiency.
arXiv:2604. 00316v2 Announce Type: replace-cross Abstract: Grokking occurs when a model achieves high training accuracy but generalization to unseen test points happens long after that.
arXiv:2608. 08091v1 Announce Type: cross Abstract: Dynamical systems model trajectory data generated by fixed underlying dynamics, with applications ranging from biology to physics.
arXiv:2512. 14338v3 Announce Type: replace Abstract: Many learning problems involve symmetries, and while invariance can be built into neural architectures, it can also emerge implicitly when training on group-structured data.
arXiv:2608.31045v1 Announce Type: new Abstract: Rotational symmetry is one of the most important structural principles in machine learning on 3D data. In applications ranging from physics and materia...
arXiv:2609.08133v1 Announce Type: cross Abstract: In nonconvex optimization problems arising in geometric machine learning, data augmentation is commonly used to promote invariance by averaging empir...
The paper investigates sparse data augmentation for nonconvex optimization in geometric machine learning. It shows that using a small, fixed sample of transformations—obtained before optimization—allows gradient descent to achieve an ε‑stationary point of the fully augmented objective with ≤ O((log|G|+log(1/δ))/ε²) transformation queries. This is more efficient than both full augmentation and standard group‑SGD, which require O(1/ε⁴) queries.
arXiv:2207. 03116v4 Announce Type: replace Abstract: We introduce a general method for learning representations that are equivariant to symmetries of data.
arXiv:2603. 27631v2 Announce Type: replace Abstract: Self-supervised pre-training, where large corpora of unlabeled data are used to learn representations for downstream fine-tuning, has become a cornerstone of modern machine learning.
Equivariant Neural Networks (ENNs) have empowered numerous applications in scientific fields. Despite their remarkable capacity for representing geometric structures, ENNs suffer from degraded expressivity when processing symmetric inputs: the output representations are invariant to transformations that extend beyond the input's symmetries.