Learning Infinitesimal Generators of Continuous Symmetries from Data
Gyeonghoon Ko, Hyunsu Kim, Juho Lee

TL;DR
This paper introduces a data-driven method to learn continuous symmetries in data using infinitesimal generators, extending beyond traditional Lie group symmetries, to improve model generalization and efficiency.
Contribution
The paper proposes a novel symmetry learning algorithm based on infinitesimal generators, capable of capturing both linear and nonlinear symmetries from data with minimal assumptions.
Findings
Effective in learning symmetries in image data
Applicable to partial differential equations
Outperforms existing symmetry detection methods
Abstract
Exploiting symmetry inherent in data can significantly improve the sample efficiency of a learning procedure and the generalization of learned models. When data clearly reveals underlying symmetry, leveraging this symmetry can naturally inform the design of model architectures or learning strategies. Yet, in numerous real-world scenarios, identifying the specific symmetry within a given data distribution often proves ambiguous. To tackle this, some existing works learn symmetry in a data-driven manner, parameterizing and learning expected symmetry through data. However, these methods often rely on explicit knowledge, such as pre-defined Lie groups, which are typically restricted to linear or affine transformations. In this paper, we propose a novel symmetry learning algorithm based on transformations defined with one-parameter groups, continuously parameterized transformations flowing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Analysis · Model Reduction and Neural Networks · Evolutionary Algorithms and Applications
