Papers › Learning Lie Group Generators from Trajectories
Learning Lie Group Generators from Trajectories
Lifan Hu
This work investigates the inverse problem of generator recovery in matrix Lie groups from discretized trajectories. Let G be a real matrix Lie group and 𝔤 = Lie(G) its corresponding Lie algebra. A smooth trajectory γ(t$)$ generated by a fixed Lie algebra element $\xi \in \mathfrak{g}$ follows the exponential flow $\gamma(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 {g₀, g₁, …, g_T} ⊂G, sampled at uniform time intervals. This problem is formulated as a data-driven regression from normalized sequences of discrete Lie algebra increments log(gₜ⁻¹ gₜ₊₁) to the constant generator ξ∈𝔤. A feedforward neural network is trained to learn this mapping across several groups, including SE(2), SE(3), SO(3), and 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!
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections