WorksComputer Science
Data-driven Discovery of Lie Symmetries and First Integrals with Latent ODEs
Abstract
We present LatentLieODE, a novel neural ODE method to discover linear Lie symmetries and first integrals of the learned dynamics from timeseries observations such as video inputs. It starts with an autoencoder, which learns a low dimensional representation of the observed system and then maps trajectories to decorrelated latent coordinates . A bank of linear infinitesimal generators is fitted jointly against a differentiable Lie-bracket residual , while an MLP optimises the latent ODE to reconstruct the observation-space timeseries. After suitable generators and are found, we fit a third network to generate the first integral of the system. Across six benchmark systems (harmonic oscillator, simple and twin pendulums, Lotka-Volterra, pixel pendulum, sphere geodesics) we find each system's relevant symmetries, and the discovered invariants match ground-truth conserved quantities at . On the sphere, the pipeline recovers a non-abelian , certified by the negative-definite Killing form of its recovered structure constants. This work presents significant advances in data-driven discovery of symmetries and provides a new pathway for neural surrogates of dynamical systems.
Figure 1. An autoencoder maps observations (states or video) to a decorrelated latent chart where a latent ODE carries the dynamics and orbits are circular. A linear generator is then fitted by minimising the normalised Lie-bracket residual on encoded data.
Introduction
Symmetry is one of the fundamental frameworks of physics. Continuous symmetries are linked with conservation laws via Noether’s theorem [10], they constrain dynamics, and they reduce the dimensionality of systems. A growing body of work aims to build known symmetries into networks as equivariance constraints [4, 2, 14] or to learn dynamics that respect an assumed analytic structure such as a Hamiltonian [7, 5, 13]. However, the inverse problem is also of great interest: Given only noisy observations of a system, can one determine which symmetries (if any) it has? Existing approaches search for symmetries directly in observation space [8, 6] or learn group actions with adversarial objectives [15, 16], typically on state-space observations with the symmetry group’s dimension fixed in advance.
We take a different route, motivated by the work of Yang et al. [16]. A symmetry that is nonlinear and incomprehensible in observation space is often linear in the right coordinate system. Hence, we create a neural pipeline that (1) automatically finds a reduced dimensional representation of a given dynamical system; (2) learns a latent ODE [3, 11] from trajectories, mapping observations into a low-dimensional decorrelated coordinate chart; (3) fits a deliberately over-complete bank of linear generators against a differentiable Lie-bracket residual; and (4) reads off the algebra’s dimension from the generator-norm spectrum, its structure constants from pairwise brackets, and its conservation laws from jointly-fitted first-integral networks.
Main contributions:
A fully differentiable symmetry-discovery objective, paired with matrix-norm rank detection, for which the algebra dimension is an output.
Discovery and optimisation of a first-integral based on the squared cosine between and the flow, invariant to reparameterisation of , with post-hoc calibration to physical units.
Validation on five classical system trajectories and a video observation, successfully recovering the true symmetries of each system.
Related work
Noether networks [1] meta-learn conserved quantities from raw observations by tailoring a prediction model at test time to respect a learned conservation law, using Noether’s theorem as an inductive bias for forecasting. The conserved quantity is discovered with the goal of improving prediction accuracy.
LaLiGAN [16], which extends work of Yang et al. [15], learns an autoencoder for a latent space, in which a symmetry becomes a linear group action, representing it by Lie algebra basis matrices. Training is carried out adversarially: A discriminator tests whether group-transformed latents remain indistinguishable from the data distribution. It thereby discovers distribution-level symmetries with the group’s dimension fixed in advance, treating dynamics and downstream structure (e.g. latent equation discovery) as separate, subsequent steps.
Hamiltonian and Lagrangian Neural Networks ([7, 5]) parameterise the scalar generating function of an assumed variational structure, which obtains the dynamics and exact energy conservation by construction. Autoencoder variants extend both approaches to pixel observations.
Key distinctions Hamiltonian and Lagrangian Neural Networks solve the inverse of our problem, with physical structure being imposed, rather than discovered, to learn better dynamics. LaLiGAN is the closest work. It also learns an autoencoder for a latent space where a nonlinear symmetry acts linearly and parameterises the symmetry by Lie algebra basis matrices. LaLiGAN’s symmetry condition is enforced distributionally, through a discriminator that judges whether transformed pairs remain indistinguishable from real ones, and is therefore only defined at an adversarial optimum. We impose the infinitesimal Lie bracket condition directly on the learned vector field and evaluate it pointwise by automatic differentiation, giving a scalar residual at every state. First, the bracket can be thresholded, compared on- versus off-manifold, and reported as a verification statistic. Secondly, in our method the algebra’s dimension is an output of the spectral gap rather than a hyperparameter. Finally, we recover first integrals alongside the generators and calibrate them to physical units, a connection between discovered symmetry and conservation laws hinted at as future work by Yang et al. [16].
| Ours | LaLiGAN | Noether Nets | HNN/LNN | |
| Discovers Lie generators | ✓ | ✓ | – | – |
| Continuous-time dynamics learned jointly | ✓ | – | – | ✓ |
| Invariants discovered, not assumed | ✓ | – | ✓ | – |
| Num. of symmetries detected, not specified | ✓ | – | – | – |
| Expressivity guarantee for the action | – | ✓ | – | – |
| Exact conservation by construction | – | – | – | ✓ |
Table 1. Capability comparison with the closest families of methods.
Method
Latent dynamics model We follow the non-variational latent ODE architecture from Sampson and Melchior [12], a modification of the implementation from Rubanova et al. [11], which encodes time series with a recurrent neural network. We do not employ the explicit path-minimizing penalty used by Sampson and Melchior [12], which is designed to perform parameter inference. It would compress the dynamics, while we seek to reshape them. For video/pixel data, the encoder and decoder are small convolutional stacks. Training minimises reconstruction error plus a latent-consistency term; for video, the per-pixel squared error is weighted by each pixel’s temporal variance (normalised to a mean of one), which removes the otherwise-dominant trivial optimum of predicting a static background.
Coordinate construction The latent chart (our new coordinate system) is recomputed from batch statistics at every training step via:
where re-centres the batch of latents at the origin, is the diagonal matrix of per-dimension batch variances, and is the batch correlation matrix, whose inverse square root is computed by a Newton–Schulz iteration. is therefore a variance-preserving decorrelation. The cross-correlations between latent dimensions are removed, while each dimension’s scale is kept, so that symmetries of the dynamics become linearly representable. A small is added to protect against singularities.
Setting and assumed form We seek one-parameter groups of transformations of the latent state that commute with the flow of the learned dynamics , i.e. , so that every solution maps to another. With representing the vector field that generates , this condition is equivalent to the vanishing of the Lie bracket . We restrict the search to linear generators in a learned coordinate chart, so . The coordinate chart is trained to carry the nonlinearity of the systems. The decorrelation and the action-angle priors are chosen so that phase rotations, dilations and rigid rotations of (quasi-)periodic systems become linear, and symmetries with no linear representation at the chosen latent width are outside the search space by construction. No Hamiltonian or Lagrangian structure is assumed and is an unconstrained smooth vector field and is a first integral of it.
Rotational dynamics Apart from decorrelated dimensions, we must explicitly encourage circular trajectories in latent space. This is achieved through a penalty term:
which penalises the temporal variance of the radius along each trajectory. We normalise by the squared radius to avoid trivially shrinking to 0. This term vanishes exactly when every orbit is an origin-centred circle of constant radius, so periodic motion acquires an action-like radial coordinate and rotations become linearly representable. To further encourage action-angle representations, we include a speed penalty:
applying the same scale-free regularisation to the pushforward field magnitude 1, demanding each orbit be traversed at uniform speed on a constant-radius orbit, i.e. at uniform angular velocity. This penalty encourages the true action-angle representation and thus allows for the discovery of linear Lie point symmetries.
Symmetry discovery We construct an over-complete bank of linear infinitesimal generators , where the generators are fitted by minimising the Lie bracket loss:
evaluated by forward-mode differentiation using a Jacobian-vector product (jax.jvp) to avoid a full Jacobian computation. We sample from encoded real trajectories with a small jitter. Generator redundancy is suppressed by decorrelating the actions in the data metric. The number of surviving generators after a multiplicative-gap test on the norm spectrum (see Appendix C) is the detected algebra dimension, and closure is then checked by projecting pairwise brackets back onto the surviving span.
Independent generators Training several candidate generators is prone to failures: Without decorrelation pressure they all collapse onto the single easiest symmetry, while a naive decorrelation pressure prevents convergence altogether. We adapt the stop-gradient orthogonalisation of Markov and Hvatov [9], where each pair penalty anchors the earlier generator of the pair, so generator 1 settles freely, generator 2 arranges itself to differ from a fixed generator 1, and so on. We measure overlap as the squared correlation of the generator actions () on the data manifold:
With latent dimension above the true effective dimension, overlap can be cancelled by matrix components acting on dead dimensions, letting duplicate generators hide. The normalisation and the samples are also stop-gradiented, so the pressure only steers generator directions and cannot be satisfied by inflating norms or bending the coordinates.
Joint objective All of the symmetry terms above would be trivially minimised by . We introduce a norm budget to prevent that while still allowing redundant generators to go to 0:
where is the bank size. The first term fixes only the total on-manifold norm; the second (weight ) is a gentle per-generator attraction toward unit norm, preventing a winner-take-all allocation when several genuine symmetries coexist. Norms are measured through the data as , so a generator acting only off-manifold counts as collapsed. The full symmetry objective
is added to the reconstruction and latent-consistency losses of the dynamics model and optimised jointly in the main training phase; is the Noether-compatibility pressure defined in Equation (8) below. The symmetry weights sit well below the fit weights and ramp in over training: at equal weighting, a small gain in bracket residual can buy a large reconstruction degradation, after which every “symmetry” found is a symmetry of model error. Per-system weights are given in Appendix D.
Discovering conservation laws Independent first-integral networks are learned alongside the generators. A quantity is conserved exactly when its gradient is perpendicular to the motion, and a symmetry is Noether-compatible (i.e. corresponds to a conservation law) when it preserves that quantity. This gives two perpendicularity constraints of the same form, with :
When a system carries several independent invariants, the networks (multiple heads) additionally receive a decorrelation pressure , i.e. gradients of distinct heads are pushed away from each other on the data manifold, with the stop-gradient anchoring the earlier head as in , so the two factor energies of the twin pendulums are recovered by separate networks rather than collapsing onto one. The left term trains to be constant along the flow2. Because the cosine is scale-free, is also minimised by the degenerate solution , we add a unit-gradient penalty to disallow this solution. The right term steers the generators, the stop-gradient freezes , so the penalty pushes toward transformations that slide states along level sets of rather than across them. Both terms are active during the main phase, so co-trains with the dynamics and the bank. Because a fraction of initialisations stall in a plateau, is over-complete (several independent networks); after the main phase the networks are re-fitted against the frozen , , and coordinate chart by minimising the conservation terms alone, and the best network is kept. We then calibrate the discovered invariant to physical units by a monotone fit on validation data (see Figure 3a).
Figure 3. The discovered invariant, calibrated to energy on validation windows (a), tracks the true energy of held-out trajectories over the training span (b), and yields a falsifiable conservation verdict (c): fresh pendulum data stays within the noise-floor band ( the floor), while a damped control from the same initial conditions is correctly rejected at the noise floor.
Results
Circular dynamics Figure 2 shows the latent trajectories of four of our test systems. The colourbar can be considered to represent the unit-less energy of each trajectory. We see that the autoencoder is able to create almost entirely circular trajectories even for highly nonlinear systems (twin pendulums) or pure pixel space observations (pixel pendulum).
Figure 2. Latent phase portrait of the harmonic oscillator, Lotka-Volterra, twin pendulum, and pixel-pendulum systems. Note that if the reduced latent dimension is , a PCA projection is used to convert the -dimensional trajectory onto a 2D map (as in the twin pendulum).
Symmetry discovery Across all six systems, our LATENTLIEODE method recovers the expected symmetry (see Table 2). The discovered invariant for each system also matches the ground-truth conserved quantity (correlation coefficient in Table 2) almost perfectly. Wherever dimension discovery is enabled, we see successful reduction of the latent dimensions to the lowest true dimensionality of each respective system3, and we find the true
| System | obs. dim | rank | expected | discovered symmetries | calib. | |
| Harmonic oscillator | 2 | 2 | 2 | rotation + dilation | 0.999 | 0.999 |
| Pendulum (=5%) | 2 | 1 | 1 | phase rotation | 0.998 | 0.997 |
| Lotka–Volterra | 2 | 1 | 1 | phase rotation | 0.991 | 0.983 |
| Twin pendulums | 4 | 2 | 2 | two phase rotations | 0.978 | 0.963 |
| Sphere geodesics | 6 | 3 | 3 | rotations | 0.997 | 0.996 |
| Pixel pendulum | 4 | 1 | 1 | phase rotation | 0.995 | 0.996 |
Table 2. Symmetry discovery across the test suite. Rank counts the survivors of the generator-norm spectrum (i.e. the number of discovered symmetries). Expected is the true number of symmetries. is the absolute Spearman rank correlation between the discovered invariant network and the ground-truth invariant, both evaluated on held-out validation windows. Calib. is the variance of the ground-truth invariant explained by , where is a monotone map fitted on validation windows (Figure 3a).
number of symmetries for each system (rank) despite never specifying the desired amount a priori.
Transferring the discovered invariant The discovered , its coordinate chart, and its calibration together define a standalone function on raw observations, so conservation can be tested on data the model has never seen. Figure 3a shows the monotone calibration map fitted on validation windows. Since the objective is invariant under reparameterisation of , this monotone fit converts the invariant to physical units. On unseen pendulum trajectories, the calibrated invariant tracks the true energy ( from Table 2) and remains conserved for over ten times the training data period (Figure 3b). Importantly, we can test this learned invariant on systems that do not conserve energy, e.g. a damped pendulum (Figure 3c). In this case, we see a consistent drop in along the observed trajectories, indicating a clear violation of energy conservation for the system.
Pixels to physics For the pixel pendulum, the model receives only 32 × 32 pixel frames with no state supervision. The initial dimensionality reduction prunes the latent space from 8 dimensions to 2, where we then run the main symmetry discovery step. From Table 2 we can see LᴇɴᴛLɪᴇOᴅᴇ finds one symmetry of this system, with the discovered invariant tracking the true pendulum energy at (calibrated ; energy error 1.7%, and 1.6% drift on fresh trajectories). Figure 4 shows the resulting model rolled out and decoded into observation space from a single context window to twice the training span. We see strong agreement between the true and reconstructed dynamics far into the extrapolated regime.
Figure 4. Pixel-pendulum reconstruction. Ground-truth frames (top) vs. frames decoded from the LatentLieODE rollout (middle) and residuals (truth minus decoded, bottom), continued past the end of the training data. All temporal structure lives in the 2D latent ODE with the decoder rendering each latent state independently.
Non-abelian symmetry groups For all preceding systems the discovered algebras are abelian, so closure is trivial. As a non-abelian test, we simulate free-particle geodesics on , specifically, state observations , with particle speeds drawn from in units of a sphere radius 1. The true algebra of this system is . We recover exactly three symmetries from three surviving generators. This system is visualised in Figure 5, where we show trajectories of increasing particle speeds from left to right.
Figure 5. Ground truth (gray), decoded latent-ODE rollout (blue), and pure group transport (orange, dashed; no integration, ) for four held-out orbits. The transport generator is the per-orbit projection of the flow onto the discovered span.
Projecting the pairwise commutators of the three surviving generators back onto their span recovers the bracket table
The Killing form assembled from these structure constants, , has eigenvalues , hence is negative definite. Definiteness is invariant under change of basis, and among three-dimensional real Lie algebras a negative-definite Killing form identifies uniquely. As a consistency check, an orthonormal basis scaled by gives , and the observed eigenvalues imply , closely matching the recovered structure-constant magnitudes of 1.82, 1.72 and 1.65 (see Appendix § 7 for more details). From the run’s stored per-pair projection residuals and commutator norms, the off-span fractions are:
i.e., of every commutator lies inside the surviving span.
Integration-free dynamics Figure 5 shows trajectories from the integration of as well as the symmetry-evolved dynamics for the particles on a sphere. In both cases, initial states are encoded from held-out trajectory windows, but instead of ordinarily integrating the ODE (blue curves), the dashed orange curves apply the discovered generator via the exponential map . These dynamics are purely generated by increasing the values of . The close agreement between all three curves is further evidence that we have indeed discovered valid symmetries for this physical system.
Discussion
We showed that a latent ODE equipped with a decorrelated coordinate chart, action-angle-encouraging penalties, and a differentiable bracket residual discovers linear Lie symmetries, their algebra dimension, structure constants, and calibrated first integrals from state timeseries and from video frames. We find strong agreement between the rollout of the latent trajectories whether using direct numerical integration of the ODE function or via sweeping the action parameter of the exponential map to create the temporal dynamics. We have thus demonstrated significant advances in data-driven discovery of symmetries and provide a new pathway for neural surrogates of dynamical systems.
Limitations. The method returns linear generators in a learned chart, so a symmetry is found only if some chart at the chosen latent width linearises it. The circle and speed priors presume (quasi-)periodic orbits, so chaotic regimes are out of scope, and results are single training runs checked by scripted acceptance gates rather than seed ensembles.
Cost and scaling
The symmetry machinery scales with the latent width , not the observation dimension . The bracket residual costs one Jacobian-vector product per sample and generator, an extra forward pass of with no Jacobian materialised, and the chart is a batch statistic. Figure 6 shows this and we see step time is mostly flat across , with the pixel-pendulum at costing roughly 4 times more than the other systems.
Figure 6. Training step time against encoder input dimension, single CPU.
Sphere geodesic Killing form
This section derives the consistency check quoted in the main text, the eigenvalues of the Killing form and the magnitudes of the recovered structure constants.
Throughout, indices run over the three surviving generators . The structure constants are the projection coefficients of the pairwise commutators onto the surviving span,
and the Killing form is the symmetric matrix built from them:
depends only on the structure constants.
Baseline: the orthonormal basis. For an orthonormal basis of the structure constants are given by,
(all other components zero). Substituting into Equation (10) and using the contraction identity (where is the Kronecker delta) gives
A uniformly scaled basis. The basis returned by rank detection is arbitrary in scale. Suppose that every generator carries the same unknown scale ,
The commutator is bilinear, so
i.e. the structure constants of the scaled basis are . Since Equation (10) is quadratic in the structure constants,
Each eigenvalue of the measured Killing form therefore yields an estimate of the basis scale:
The three measured eigenvalues, computed from the recovered structure constants of the sphere-geodesic run, are , giving
Generator norm ranking
To determine the number of symmetries of a certain system, post training we rank each infinitesimal generator by its norm. We show an example of this in Figure 7 for the sphere geodesic test, where we can see we have 3 surviving generators, corresponding to 3 independent symmetries discovered. We show the generator plots for all the test cases in Figure 8.
Figure 7. Generator norm spectrum for the sphere-geodesic system of deliberately over-complete generators, three survive and five collapse, leaving a gap. The detected algebra dimension matches the expected rank of 3 for the group.

Figure 8. Generator norm spectra for the six systems of Table 2, in the same form as Figure 7
Experimental details
Latent ODE architecture The encoder is a reverse-time GRU over context windows, followed by a small GELU MLP head producing the latent initial condition . The vector field is with softplus activations and tanh output using smooth activations only, so the Jacobian in the bracket residual is differentiable everywhere. We note is a learned scale parameter. The decoder is an MLP applied pointwise to each latent state. For pixel observations the encoder and decoder are small convolutional stacks (channels 16/32/64) over frames. Latent rollouts use diffrax (Tsit5, adaptive PID controller, rtol = atol = ). We train with AdamW (weight decay , gradient clip 1.0) with a cosine warmup schedule, with a separate Adam optimiser for the generator bank at learning rate . Training runs a dimension-discovery (reduction) warmup, then joint co-training in which the symmetry weights follow a quadratic ramp reaching full strength at 75% of the run. Reconstruction is trained over an increasing horizon of the training data, and the Lie bracket samples are drawn from encoded trajectories plus Gaussian jitter at 5% of the latent spread. The Latent ODE architecture is identical across all datasets.
Harmonic oscillator Closed-form trajectories of , with radii drawn uniformly from and uniform phases; 1024 training and 128 validation trajectories of 50 samples over , observation noise . Dimension discovery prunes the latent space .
Simple pendulum with , integrated numerically; amplitudes drawn uniformly from radians with 60 samples over , observation noise . Dimension discovery prunes .
Twin pendulums Two uncoupled pendulums with and 2 observed jointly as a 4-dimensional state, amplitudes drawn as above, . The latent width is fixed at 4.
Lotka–Volterra , (all rates unity); initial conditions sampled inside the box filtered to invariant values in ; 70 samples over , . Dimension discovery prunes .
Pixel pendulum The pendulum simulator rendered as frames (rod and bob, amplitudes uniform in , pixel noise ), with a temporal-difference channel appended so the state is per-frame observable. Training is staged. Stage 1 (perception only, all symmetry weights zero): convolutional codec with an autoencoder warm-start of 5000 steps, variance-weighted reconstruction, latent width 8, 45,000 steps at learning rate . Stage 2: the full symmetry pipeline on the frozen stage-1 encoder’s decorrelated latent trajectories (observation dimension 8); dimension discovery prunes , and a metric-anneal curriculum (held for the first 10% of training, annealed to the plain metric by 40%) locks the single-cover chart; 80,000 steps.
Sphere geodesic Closed-form circle geodesics of a free particle on the unit sphere, observed as the state ; initial positions uniform on , tangent directions uniform, speeds ; 3000 training trajectories of 125 samples over , . The latent width is fixed at 6 with the sparsity weight zero: the linear realisation lives in while the data manifold is only 4-dimensional, so the embedding slack is required. After co-training, a field-only polish phase freezes everything except the vector field and fine-tunes full-horizon reconstruction for 25,000 steps at learning rate , sharpening the frequency profile without touching the chart or the generators.
| Harmonic | Pendulum | Lotka–Volterra | Twin pend. | Pixel (stage 2) | Sphere | |
| trajectories (train/val) | 1024/128 | 1024/128 | 1024/128 | 1024/128 | 1024/32 | 3000/128 |
| samples × span | 50 × 8 | 60 × 12 | 70 × 14 | 60 × 12 | — | 125 × 25 |
| noise | 0.01 | 0.05 | 0.01 | 0.02 | — | 0.01 |
| obs. dim | 2 | 2 | 2 | 4 | 8 | 6 |
| latent dim (found) | 6 → 2 | 6 → 2 | 20 → 2 | 4 | 8 → 2 | 6 |
| generators | 3 | 4 | 5 | 6 | 4 | 8 |
| heads | 4 | 4 | 4 | 4 | 4 | 4 |
| context length | 40 | 32 | 35 | 32 | 12 | 40 |
| batch size | 16 | 16 | 16 | 16 | 16 | 32 |
| lr / lr | ||||||
| co-train / polish steps | 25k/5k | 25k/5k | 25k/5k | 40k/5k | 80k/6k | 100k/10k |
| 0.1 | 0.2 | 0.1 | 0.1 | 0.1 | 0.3 | |
| 0.1 | 0.2 | 0.1 | 0.1 | 0.1 | 0.1 | |
| 1.0 | 2.0 | 1.0 | 1.0 | 1.0 | 1.0 | |
| 1.0 | 2.0 | 1.0 | 1.0 | 1.0 | 1.0 | |
| 0.05 | 0.1 | 0.1 | 0.1 | 0.1 | 0.1 | |
| 0.1 | 0.2 | 0.1 | 0.1 | 0.1 | 0.1 | |
| (+ grad. norm) | 1.0 | 1.0 | 0.2 | 0.2 | 0.2 | 0.2 |
| 0.05 | 0.15 | 0.05 | – | 0.05 | – | |
| – | – | – | 0.5 | – | – |
Table 3. Per-system hyperparameters. Loss weights are the of the joint objective; reconstruction and latent-consistency weights are 1 throughout. Pixel stage 1 trains perception only (all symmetry weights zero) and is omitted; its settings appear in the text.
References
- [1]Ferran Alet, Dylan Doblar, Allan Zhou, Josh Tenenbaum, Kenji Kawaguchi, and Chelsea Finn. Noether networks: meta-learning useful conserved quantities. Advances in Neural Information Processing Systems, 34:16384–16397, 2021.arxiv.org/abs/2112.03321
- [2]Michael M Bronstein, Joan Bruna, Yann LeCun, Arthur Szlam, and Pierre Vandergheynst. Geometric deep learning: going beyond euclidean data. IEEE Signal Processing Magazine, 34(4):18–42, 2017.DOI
- [3]Ricky TQ Chen, Yulia Rubanova, Jesse Bettencourt, and David K Duvenaud. Neural ordinary differential equations. Advances in neural information processing systems, 31, 2018.arxiv.org/abs/1806.07366
- [4]Taco Cohen and Max Welling. Group equivariant convolutional networks. In International conference on machine learning, pages 2990–2999. PMLR, 2016.arxiv.org/abs/1602.07576
- [5]Miles Cranmer, Sam Greydanus, Stephan Hoyer, Peter Battaglia, David Spergel, and Shirley Ho. Lagrangian neural networks. In ICLR 2020 Workshop on Integration of Deep Neural Models and Differential Equations, 2020.arxiv.org/abs/2003.04630
- [6]Krish Desai, Benjamin Nachman, and Jesse Thaler. Symmetry discovery with deep learning. Physical Review D, 105(9):096031, 2022.
- [7]Samuel Greydanus, Misko Dzamba, and Jason Yosinski. Hamiltonian neural networks. Advances in neural information processing systems, 32, 2019.arxiv.org/abs/1906.01563
- [8]Ziming Liu and Max Tegmark. Machine learning conservation laws from trajectories. Physical Review Letters, 126(18):180604, 2021.DOI
- [9]Ilya Markov and Alexander Hvatov. Data-driven discovery of lie algebra generators via fréchet-invariant learning. In Conference of Mathematics of AI, 2026. URL https://openreview.net/forum?id=UNJ2Z8pvxH.
- [10]E. Noether. Invariante variationsprobleme. Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, 1918:235–257, 1918. URL http://eudml.org/doc/59024.
- [11]Yulia Rubanova, Ricky TQ Chen, and David K Duvenaud. Latent ordinary differential equations for irregularly-sampled time series. Advances in neural information processing systems, 32, 2019.
- [12]Matt L Sampson and Peter Melchior. Path-minimizing latent ODEs for improved extrapolation and inference. Machine Learning: Science and Technology, 6(2):025047, June 2025.arxiv.org/abs/2410.08923
- [13]Peter Toth, Danilo J Rezende, Andrew Jaegle, Sébastien Racanière, Aleksandar Botev, and Irina Higgins. Hamiltonian generative networks. In International Conference on Learning Representations, 2020.arxiv.org/abs/1909.13789
- [14]Soledad Villar, David W Hogg, Kate Storey-Fisher, Weichi Yao, and Ben Blum-Smith. Scalars are universal: Equivariant machine learning, structured like classical physics. Advances in neural information processing systems, 34:28848–28863, 2021.
- [15]Jianke Yang, Robin Walters, Nima Dehmamy, and Rose Yu. Generative adversarial symmetry discovery. In International conference on machine learning, pages 39488–39508. PMLR, 2023.arxiv.org/abs/2302.00236
- [16]Jianke Yang, Nima Dehmamy, Robin Walters, and Rose Yu. Latent space symmetry discovery. In Proceedings of the 41st International Conference on Machine Learning, 2024.arxiv.org/abs/2310.00105






