Diffeomorphic Time Warping (DiffTW)

• DiffTW is a continuous alignment framework that maps time series by learning smooth, diffeomorphic transformations instead of relying on discrete point matching.
• It employs a continuous velocity field derived from an advection PDE and RKHS parameterization to optimize signal transport via ODE-based dynamics.
• Empirical evaluations show that DiffTW outperforms DTW on numerous datasets by effectively capturing smooth deformations in signals.

Diffeomorphic Time Warping (DiffTW) is a theoretical framework for time series classification that learns mappings between real-valued functions rather than restricting alignment to discrete sampled points. In the formulation introduced in "Time Series Classification through Diffeomorphic Time Warping" (Haney et al., 22 Jun 2026), warping is posed as a diffeomorphic transformation generated by a smooth velocity field, approximating the flow associated with the characteristic curves of a linear transport equation with a space-dependent velocity field. The resulting construction moves from discrete point matching to a continuous flow that transports one signal into another, yields a theoretically grounded dissimilarity measure, and, using a 1-nearest neighbor classifier, outperforms DTW on 60 of 86 datasets (Haney et al., 22 Jun 2026).

1. Conceptual setting and motivation

Time series classification is described as learning a mapping from a continuous, temporally ordered sequence of real-valued observations to a discrete response variable, like class labels. The task is identified as fundamental in domains including health monitoring, where the temporal structure of data is critical for accurate prediction (Haney et al., 22 Jun 2026).

The immediate motivation for DiffTW is a limitation of Dynamic Time Warping (DTW). DTW compares two discrete time series by finding an optimal alignment path between sampled points, but the matching is point-to-point and discrete. In this formulation, DTW only aligns sampled indices, not a continuous transformation of the underlying signals; it is fundamentally a pairwise alignment method, not a model of the dynamics that transform one signal into another; it builds a full alignment cost matrix, which is computationally expensive; and it can struggle when the true deformation is smooth and continuous, because DTW’s path is a sequence of discrete jumps (Haney et al., 22 Jun 2026).

DiffTW is introduced to move from matching points to learning a continuous flow that transports one signal into another. The paper’s view is explicit: DTW is a discrete optimal path search, whereas DiffTW learns a smooth vector field $\alpha(x)$ so that points in $\phi_0$ are continuously transported to align with $\phi_1$ (Haney et al., 22 Jun 2026). This gives a geometric and dynamical interpretation of alignment. A plausible implication is that the method is intended not merely as a replacement for a distance function, but as a reformulation of warping itself in transport-theoretic terms.

2. Transport equation, characteristics, and diffeomorphic mapping

The source and target signals are taken as functions on $[0,1]$,

$u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$

DiffTW assumes that the deformation is governed by the advection PDE

$\alpha(x)\,u_x + u_t = 0.$

Here, $x$ is the spatial coordinate along the signal, $t \in [0,1]$ is the warping time, $u(x,t)$ is the evolving signal, and $\alpha(x)$ is the velocity field (Haney et al., 22 Jun 2026).

Using the method of characteristics, the PDE is converted into an ODE system. Along a trajectory $\phi_0$0,

$\phi_0$1

Thus, signal values are preserved along characteristic curves, and the warping map is the flow generated by $\phi_0$2 (Haney et al., 22 Jun 2026). The paper presents this as the continuous analog of following a point through the warping process.

The ODE formulation is therefore

$\phi_0$3

Because the flow is continuous and generated by a smooth field, it is intended to behave like a diffeomorphic transformation: smooth, invertible, and structure-preserving (Haney et al., 22 Jun 2026). In this sense, DiffTW places temporal alignment within the same general mathematical family as other velocity-field formulations of diffeomorphic time warping, including DTAN, ResNet-TW, and CPA-based temporal transformer models (Weber et al., 10 Feb 2025).

3. Objective construction, RKHS parameterization, and boundary constraints

The optimization goal is to choose $\phi_0$4 so that transported points at $\phi_0$5 align the source and target signals. For training pairs $\phi_0$6, the objective is written as

$\phi_0$7

subject to

$\phi_0$8

The fundamental theorem of calculus yields the flow relation

$\phi_0$9

Because $\phi_1$0 depends on $\phi_1$1 through the ODE, differentiating $\phi_1$2 requires adjoint methods (Haney et al., 22 Jun 2026).

To model a flexible velocity field, the paper places $\phi_1$3 in a reproducing kernel Hilbert space (RKHS). The kernel is initially chosen as a Gaussian kernel,

$\phi_1$4

To avoid an infinite-dimensional representation, the method uses random Fourier features,

$\phi_1$5

and parameterizes

$\phi_1$6

so that the objective becomes

$\phi_1$7

with

$\phi_1$8

As $\phi_1$9, $[0,1]$0 almost surely (Haney et al., 22 Jun 2026).

Learning is treated as an optimal control problem. Introducing Lagrange multipliers $[0,1]$1 yields

$[0,1]$2

The gradient is

$[0,1]$3

with adjoint dynamics

$[0,1]$4

and terminal condition

$[0,1]$5

The appendix further simplifies the per-sample derivative to

$[0,1]$6

The paper identifies this as the continuous-time backpropagation mechanism (Haney et al., 22 Jun 2026).

To mimic DTW-like endpoint constraints, DiffTW enforces

$[0,1]$7

This leads to the sub-RKHS

$[0,1]$8

If $[0,1]$9 is the explicit feature map and

$u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$0

then the projected kernel is

$u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$1

Writing

$u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$2

gives

$u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$3

The rank drops by $u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$4, and the new explicit feature map is obtained by spectral decomposition,

$u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$5

so that $u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$6 has dimension $u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$7 and automatically satisfies the zero-boundary property (Haney et al., 22 Jun 2026).

4. Dissimilarity measure, computation, and classification protocol

DiffTW defines its pairwise dissimilarity as the minimum converged objective value,

$u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$8

This is presented as the continuous analog of DTW’s accumulated alignment cost. For comparison, the DTW baseline distance is

$u(x,0) = \phi_0(x), \qquad u(x,1) = \phi_1(x).$9

In practice, the computation proceeds by initializing $\alpha(x)\,u_x + u_t = 0.$0, integrating the ODE $\alpha(x)\,u_x + u_t = 0.$1 forward from $\alpha(x)\,u_x + u_t = 0.$2 to $\alpha(x)\,u_x + u_t = 0.$3, computing terminal mismatch and terminal adjoint, integrating the adjoint backward, computing $\alpha(x)\,u_x + u_t = 0.$4 using quadrature, updating $\alpha(x)\,u_x + u_t = 0.$5 by gradient descent or Adam, and taking the final objective value at convergence as the DiffTW distance (Haney et al., 22 Jun 2026).

The classification protocol is 1-nearest neighbor. Distances are computed between a test series and each training series, and the label of the nearest training example is assigned. For DTW, the distance is the optimal discrete warping cost; for DiffTW, it is $\alpha(x)\,u_x + u_t = 0.$6 (Haney et al., 22 Jun 2026).

On the ECG benchmark, the reported accuracies are 98.80% for DiffTW and 98.12% for DTW. Across 86 datasets total—85 UCR datasets and 1 specialized ECG dataset—the paper reports that DiffTW is better on 60 datasets, DTW is better on 22 datasets, and there are 4 ties. A two-sided Wilcoxon signed-rank test gives approximately $\alpha(x)\,u_x + u_t = 0.$7, indicating that the improvement is statistically significant (Haney et al., 22 Jun 2026).

The same section of the paper also states that the method shows strong gains on shape and morphology-sensitive datasets, but some failures on sparse or highly discontinuous signals, where discrete DTW can be more robust (Haney et al., 22 Jun 2026). This suggests that the continuous-flow prior is well matched to smooth deformations, but not uniformly advantageous for all signal classes.

5. Relation to adjacent diffeomorphic alignment frameworks and terminology

DiffTW belongs to a broader line of work that treats temporal alignment as a diffeomorphic transformation rather than a discrete warping path search. In "Diffeomorphic Temporal Alignment Nets for Time-series Joint Alignment and Averaging" (Weber et al., 10 Feb 2025), the corresponding terminology is DTAN rather than DiffTW. DTAN predicts and applies diffeomorphic transformations in an input-dependent manner, facilitates joint alignment and averaging in an unsupervised or a weakly-supervised manner, uses CPAB warps, and extends to multi-task learning for simultaneous alignment and classification (Weber et al., 10 Feb 2025). The conceptual overlap is explicit: both frameworks replace discrete path search with learnable order-preserving diffeomorphisms, though DiffTW is formulated as per-pair optimization over a transport equation and DTAN as a trained temporal transformer.

ResNet-TW places the same general idea in the language of residual flows. "Residual Networks as Flows of Velocity Fields for Diffeomorphic Time Series Alignment" (Huang et al., 2021) models the transformation as a flow of time-dependent vector fields, interprets each residual block as an Eulerian discretization of the flow equation, and emphasizes smooth, invertible, order-preserving warping functions (Huang et al., 2021). The resemblance to DiffTW is strongest at the level of ODE-based deformation and diffeomorphic interpretation, while the parameterization and learning architecture differ.

A second neighboring line is the CPA-based closed-form formulation. "Closed-Form Diffeomorphic Transformations for Time Series Alignment" (Martinez et al., 2022) derives a closed-form flow solution and a closed-form gradient for continuous piecewise-affine velocity fields, and "Diffeomorphic Transformations for Time Series Analysis: An Efficient Approach to Nonlinear Warping" (Martinez, 2023) presents the same family as a parametric, smooth, invertible warping function used in alignment, averaging, classification, clustering, and normalizing flows (Martinez, 2023). These works are closely aligned with DiffTW at the level of diffeomorphic flow construction, but the main 2026 DiffTW paper specifically centers the advection PDE, the method of characteristics, and an RKHS-optimal-control learning problem (Haney et al., 22 Jun 2026).

A recurrent source of terminological ambiguity is that "DiffTW" is also used in geophysics to mean differentiable dynamic time warping, also called smooth DTW. In "Cycle-skipping mitigation using misfit measurements based on differentiable dynamic time warping" (Chen et al., 2021), the term denotes a smooth relaxation of DTW obtained by replacing the hard minimum with a differentiable soft-min (Chen et al., 2021). That usage is methodologically distinct from Diffeomorphic Time Warping: the former smooths dynamic programming over warping paths, whereas the latter replaces path search with a continuous diffeomorphic transport map.

6. Assumptions, guarantees, computational profile, and limitations

The assumptions stated for DiffTW are explicit. Signals are treated as real-valued functions on a continuous interval, typically normalized to $\alpha(x)\,u_x + u_t = 0.$8; the deformation is modeled by a time-independent velocity field $\alpha(x)\,u_x + u_t = 0.$9; $x$0 is smooth enough to generate characteristic flows; and boundary conditions enforce $x$1 (Haney et al., 22 Jun 2026). The theoretical guarantees are correspondingly limited and local to the construction: the transport dynamics are grounded in the PDE $x$2; the method of characteristics provides the ODE representation; RKHS structure ensures a principled regularized function space; the projected kernel guarantees zero boundary values; and the adjoint formulation gives an exact gradient for the constrained optimization problem (Haney et al., 22 Jun 2026).

The paper does not present a formal theorem of global convergence; the optimization guarantee is primarily the correctness of the gradient derivation and the continuous transport formulation (Haney et al., 22 Jun 2026). This is an important qualification, because the method’s mathematical rigor lies in its derivation rather than in a global optimization theory.

The claimed computational complexity is

$x$3

where $x$4 is sequence length or number of transported points, $x$5 is the number of numerical integration steps, and $x$6 is the number of optimization iterations. This is contrasted with DTW’s $x$7 cost from the full alignment matrix (Haney et al., 22 Jun 2026). A plausible implication is that DiffTW is particularly attractive when quadratic alignment tables are a computational bottleneck.

Implementation details are also specified. The method is implemented in Python, uses TensorFlow and TensorFlow Probability, performs forward integration by the Euler method, uses gradient descent for toy and ECG examples and Adam for broad UCR experiments, and typically sets the random Fourier feature dimension to $x$8 (Haney et al., 22 Jun 2026). Training is reported on a GPU cluster with NVIDIA A40 GPUs (48GB) and CUDA 12.8. For the toy and ECG experiments, the paper uses values like $x$9, $t \in [0,1]$0, and $t \in [0,1]$1; for the UCR benchmark, it uses grid search over $t \in [0,1]$2 on 100 log-spaced values, bandwidth over 10 values in $t \in [0,1]$3, and up to 10 Adam iterations in the final large-scale runs (Haney et al., 22 Jun 2026).

The paper is also explicit about failure modes. DiffTW shows strong gains on shape and morphology-sensitive datasets, but some failures on sparse or highly discontinuous signals, where discrete DTW can be more robust (Haney et al., 22 Jun 2026). More broadly, this places the method within a familiar trade-off in diffeomorphic alignment: smooth invertible transformations preserve temporal topology and support gradient-based optimization, but they encode a deformation prior that may be mismatched to signals with abrupt, sparse, or strongly discontinuous structure.