Table of Contents
Fetching ...

Path Development Network with Finite-dimensional Lie Group Representation

Hang Lou, Siran Li, Hao Ni

TL;DR

This paper tackles the dimensionality and data-adaptivity limitations of path-signature features by introducing a trainable path development layer that maps sequential data into a finite-dimensional matrix Lie group $G$ with Lie algebra $\mathfrak{g}$. By solving a Cartan development-like recurrence $z_{n+1}=z_n\exp(M_\theta(x_{n+1}-x_n))$, trained via manifold-aware backpropagation, the approach yields universal, characteristic features with enhanced stability for irregular time series. Empirical results across speech commands, character trajectories, sequential images, and non-Euclidean dynamics show that the development layer often surpasses signature baselines and significantly improves the performance and robustness of hybrid models such as LSTM+DEV, while maintaining compact parameter counts. The work represents a practical, scalable framework for time-series modelling on non-Euclidean spaces and suggests broad applicability to physics-inspired and geometry-aware learning tasks.

Abstract

Signature, lying at the heart of rough path theory, is a central tool for analysing controlled differential equations driven by irregular paths. Recently it has also found extensive applications in machine learning and data science as a mathematically principled, universal feature that boosts the performance of deep learning-based models in sequential data tasks. It, nevertheless, suffers from the curse of dimensionality when paths are high-dimensional. We propose a novel, trainable path development layer, which exploits representations of sequential data through finite-dimensional Lie groups, thus resulting in dimension reduction. Its backpropagation algorithm is designed via optimization on manifolds. Our proposed layer, analogous to recurrent neural networks (RNN), possesses an explicit, simple recurrent unit that alleviates the gradient issues. Our layer demonstrates its strength in irregular time series modelling. Empirical results on a range of datasets show that the development layer consistently and significantly outperforms signature features on accuracy and dimensionality. The compact hybrid model (stacking one-layer LSTM with the development layer) achieves state-of-the-art against various RNN and continuous time series models. Our layer also enhances the performance of modelling dynamics constrained to Lie groups. Code is available at https://github.com/PDevNet/DevNet.git.

Path Development Network with Finite-dimensional Lie Group Representation

TL;DR

This paper tackles the dimensionality and data-adaptivity limitations of path-signature features by introducing a trainable path development layer that maps sequential data into a finite-dimensional matrix Lie group with Lie algebra . By solving a Cartan development-like recurrence , trained via manifold-aware backpropagation, the approach yields universal, characteristic features with enhanced stability for irregular time series. Empirical results across speech commands, character trajectories, sequential images, and non-Euclidean dynamics show that the development layer often surpasses signature baselines and significantly improves the performance and robustness of hybrid models such as LSTM+DEV, while maintaining compact parameter counts. The work represents a practical, scalable framework for time-series modelling on non-Euclidean spaces and suggests broad applicability to physics-inspired and geometry-aware learning tasks.

Abstract

Signature, lying at the heart of rough path theory, is a central tool for analysing controlled differential equations driven by irregular paths. Recently it has also found extensive applications in machine learning and data science as a mathematically principled, universal feature that boosts the performance of deep learning-based models in sequential data tasks. It, nevertheless, suffers from the curse of dimensionality when paths are high-dimensional. We propose a novel, trainable path development layer, which exploits representations of sequential data through finite-dimensional Lie groups, thus resulting in dimension reduction. Its backpropagation algorithm is designed via optimization on manifolds. Our proposed layer, analogous to recurrent neural networks (RNN), possesses an explicit, simple recurrent unit that alleviates the gradient issues. Our layer demonstrates its strength in irregular time series modelling. Empirical results on a range of datasets show that the development layer consistently and significantly outperforms signature features on accuracy and dimensionality. The compact hybrid model (stacking one-layer LSTM with the development layer) achieves state-of-the-art against various RNN and continuous time series models. Our layer also enhances the performance of modelling dynamics constrained to Lie groups. Code is available at https://github.com/PDevNet/DevNet.git.
Paper Structure (48 sections, 15 theorems, 68 equations, 6 figures, 6 tables, 2 algorithms)

This paper contains 48 sections, 15 theorems, 68 equations, 6 figures, 6 tables, 2 algorithms.

Key Result

Lemma 2.1

Let $X \in \mathcal{V}_{1}\left([0, s], {\mathbb{R}}^d\right)$ and $Y \in \mathcal{V}_{1}\left([s, t], {\mathbb{R}}^d\right)$. Denote by $X*Y$ their concatenation: $(X \ast Y)(v) = X(v)$ for $v \in [0,s]$ and $Y(v)-Y(s) +X(s)$ for $v \in [s,t]$. Then $D_M(X*Y)=D_M(X)D_M(Y)$ for all $M\in {\mathbf{L}

Figures (6)

  • Figure 1: A high-level summary of the proposed development layer. Output and trainable weights take values in the matrix Lie group $G$ and Lie algebra $\mathfrak{g}$, respectively. (Left) It can be interpreted as a solution to the linear controlled differential equation driven by a driving path (\ref{['def:dev']}), which is a continuous lift of sequential data. (Right) It can be viewed as an analogy of the RNNs, but with a simpler form (Eq. \ref{['eqn:dev_ref']}).
  • Figure 2: Left panel: A 2-dimensional piecewise linear path $X$; Right panel: the hyperbolic development $D_{M}(X)$.
  • Figure 3: Test accuracy v.s. the feature dimension curves of the linear models using the development and signature representation on Speech Commands dataset. See full results in \ref{['Tab:SC_sig_dev_comp']}.
  • Figure 4: The comparison plot of LSTM and LSTM+DEV on Character Trajectories with 30% drop rate. (Left) The evolution of validation loss against training time. (Middle) The evolution of validation accuracy against training time. The mean curve with $\pm$ std indicated by the shaded area is computed over 5 runs. (Right) The boxplot of the validation accuracy for varying learning rate.
  • Figure 5: True and predicted sample trajectories of the Brownian motion on $\mathbb{S}^2$ on the test set. The test MSE of LSTM+DEV(SO(3)), LSTM and ExpRNN are 0.0184, 0.109 and 0.11 respectively.
  • ...and 1 more figures

Theorems & Definitions (39)

  • Definition 2.1: Path Signature
  • Remark 2.1
  • Definition 2.2: Path Development
  • Example 2.1
  • Lemma 2.1: Multiplicative property of path development
  • Definition 2.3: Hyperbolic Development
  • Lemma 2.2: Link with signature
  • Lemma 2.3: Invariance under time-reparametrisation
  • Remark 2.2
  • Theorem 2.1: Characteristic property of path development, Theorem 4.8 in chevyrev2016characteristic
  • ...and 29 more