English

Learning Lie Group Generators from Trajectories

Machine Learning 2025-04-07 v1

Abstract

This work investigates the inverse problem of generator recovery in matrix Lie groups from discretized trajectories. Let GG be a real matrix Lie group and g=Lie(G)\mathfrak{g} = \text{Lie}(G) its corresponding Lie algebra. A smooth trajectory γ(\gamma(t)) generated by a fixed Lie algebra element ξg\xi \in \mathfrak{g} follows the exponential flow γ(\gamma(t)=g0exp(tξ)) = g_0 \cdot \exp(t \xi). The central task addressed in this work is the reconstruction of such a latent generator ξ\xi from a discretized sequence of poses {g0,g1,,gT}G \{g_0, g_1, \dots, g_T\} \subset G, sampled at uniform time intervals. This problem is formulated as a data-driven regression from normalized sequences of discrete Lie algebra increments log(gt1gt+1)\log\left(g_{t}^{-1} g_{t+1}\right) to the constant generator ξg\xi \in \mathfrak{g}. A feedforward neural network is trained to learn this mapping across several groups, including \text{SE(2)}, \text{SE(3)}, \text{SO(3)}, and \text{SL(2,\mathbb{R})}. It demonstrates strong empirical accuracy under both clean and noisy conditions, which validates the viability of data-driven recovery of Lie group generators using shallow neural architectures. This is Lie-RL GitHub Repo https://github.com/Anormalm/LieRL-on-Trajectories. Feel free to make suggestions and collaborations!

Cite

@article{arxiv.2504.03220,
  title  = {Learning Lie Group Generators from Trajectories},
  author = {Lifan Hu},
  journal= {arXiv preprint arXiv:2504.03220},
  year   = {2025}
}

Comments

7 pages, 12 figures

R2 v1 2026-06-28T22:46:18.664Z