# Nonsmooth Analysis and Subgradient Methods for Averaging in Dynamic Time Warping Spaces

arXiv: https://arxiv.org/abs/1701.06393 · HTML: https://mlsanity.com/paper/1701.06393/

## Key facts

- Cited by 10 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Jan 2017.

## Built on by (most cited first, 10 of 10)

- [A Review and Evaluation of Elastic Distance Functions for Time Series Clustering](https://mlsanity.com/paper/2205.15181/) (2022)
- [MuSe-Toolbox: The Multimodal Sentiment Analysis Continuous Annotation Fusion and Discrete Class Transformation Toolbox](https://mlsanity.com/paper/2107.11757/) (2021)
- [Unifying Pairwise Interactions in Complex Dynamics](https://mlsanity.com/paper/2201.11941/) (2022)
- [The Conditional Cauchy-Schwarz Divergence with Applications to Time-Series Data and Sequential Decision Making](https://mlsanity.com/paper/2301.08970/) (2023)
- [The impact of data set similarity and diversity on transfer learning success in time series forecasting](https://mlsanity.com/paper/2404.06198/) (2024)
- [Rock the KASBA: Blazingly Fast and Accurate Time Series Clustering](https://mlsanity.com/paper/2411.17838/) (2024)
- [TimewarpVAE: Simultaneous Time-Warping and Representation Learning of Trajectories](https://mlsanity.com/paper/2310.16027/) (2023)
- [Accurate shape and phase averaging of time series through Dynamic Time Warping](https://mlsanity.com/paper/2109.00978/) (2021)
- [Continuous Edit Distance, Geodesics and Barycenters of Time-varying Persistence Diagrams](https://mlsanity.com/paper/2512.12939/) (2025)
- [Soft-MSM: Differentiable Context-Aware Elastic Alignment for Time Series](https://mlsanity.com/paper/2605.00069/) (2026)

## Abstract (arXiv)

Time series averaging in dynamic time warping (DTW) spaces has been successfully applied to improve pattern recognition systems. This article proposes and analyzes subgradient methods for the problem of finding a sample mean in DTW spaces. The class of subgradient methods generalizes existing sample mean algorithms such as DTW Barycenter Averaging (DBA). We show that DBA is a majorize-minimize algorithm that converges to necessary conditions of optimality after finitely many iterations. Empirical results show that for increasing sample sizes the proposed stochastic subgradient (SSG) algorithm is more stable and finds better solutions in shorter time than the DBA algorithm on average. Therefore, SSG is useful in online settings and for non-small sample sizes. The theoretical and empirical results open new paths for devising sample mean algorithms: nonsmooth optimization methods and modified variants of pairwise averaging methods.