Towards Cross Domain Generalization of Hamiltonian Representation via Meta Learning
Not on the map. Why?
Abstract (arXiv)
Recent advances in deep learning for physics have focused on discovering shared representations of target systems by incorporating physics priors or inductive biases into neural networks. While effective, these methods are limited to the system domain, where the type of system remains consistent and thus cannot ensure the adaptation to new, or unseen physical systems governed by different laws. For instance, a neural network trained on a mass-spring system cannot guarantee accurate predictions for the behavior of a two-body system or any other system with different physical laws. In this work, we take a significant leap forward by targeting cross domain generalization within the field of Hamiltonian dynamics. We model our system with a graph neural network (GNN) and employ a meta learning algorithm to enable the model to gain experience over a distribution of systems and make it adapt to new physics. Our approach aims to learn a unified Hamiltonian representation that is generalizable across multiple system domains, thereby overcoming the limitations of system-specific models. We demonstrate that the meta-trained model captures the generalized Hamiltonian representation that is consistent across different physical domains. Overall, through the use of meta learning, we offer a framework that achieves cross domain generalization, providing a step towards a unified model for understanding a wide array of dynamical systems via deep learning.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 29 of its 43 references that are in the map. First posted on arXiv 2 Dec 2022.
Builds on
29 of 43 references.
References · 29
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2017Neural Discrete Representation Learningcited by 4,712
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2014How transferable are features in deep neural networks?cited by 1,225
- 2020Meta-Learning in Neural Networks: A Surveycited by 950
- 2021Vector Quantized Diffusion Model for Text-to-Image Synthesiscited by 774
17 more
- 2016Generative Adversarial Text to Image Synthesiscited by 735
- 2019Hamiltonian Neural Networkscited by 712
- 2020Lagrangian Neural Networkscited by 398
- 2019Transfusion: Understanding Transfer Learning for Medical Imagingcited by 368
- 2019Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAMLcited by 359
- 2019Hamiltonian Graph Networks with ODE Integratorscited by 108
- 2020Simplifying Hamiltonian and Lagrangian Neural Networks via Explicit Constraintscited by 105
- 2020AI Poincar'e: Machine Learning Conservation Laws from Trajectoriescited by 77
- 2019Sequential Neural Processescited by 55
- 2022Generalizing to New Physical Systems via Context-Informed Dynamics Modelcited by 50
- 2021LEADS: Learning Dynamical Systems that Generalize Across Environmentscited by 40
- 2021Meta-Learning Dynamics Forecasting Using Task Inferencecited by 38
- 2019Variational Integrator Networks for Physically Structured Embeddingscited by 36
- 2022Deconstructing the Inductive Biases of Hamiltonian Neural Networkscited by 31
- 2021The Impact of Reinitialization on Generalization in Convolutional Neural Networkscited by 20
- 2022Constants of motion networkcited by 10
- 2021Identifying Physical Law of Hamiltonian Systems via Meta-Learningcited by 8
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.