Dynamical Wasserstein Barycenters for Time-series Modeling
Kevin C. Cheng, Shuchin Aeron, Michael C. Hughes, Eric L. Miller
Abstract
Many time series can be modeled as a sequence of segments representing high-level discrete states, such as running and walking in a human activity application. Flexible models should describe the system state and observations in stationary “pure-state” periods as well as transition periods between adjacent segments, such as a gradual slowdown between running and walking. However, most prior work assumes instantaneous transitions between pure discrete states. We propose a dynamical Wasserstein barycentric (DWB) model that estimates the system state over time as well as the data-generating distributions of pure states in an unsupervised manner. Our model assumes each pure state generates data from a multivariate normal distribution, and characterizes transitions between states via displacement-interpolation specified by the Wasserstein barycenter. The system state is represented by a barycentric weight vector which evolves over time via a random walk on the simplex. Parameter learning leverages the natural Riemannian geometry of Gaussian distributions under the Wasserstein distance, which leads to improved convergence speeds. Experiments on several human activity datasets show that our proposed DWB model accurately learns the generating distribution of pure states while improving state estimation for transition periods compared to the commonly used linear interpolation mixture models.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c5e297d0-8462-4e48-81ef-9ba1c0e9798bCited by top-tier papers5
- Measure Estimation in the Barycentric Coding ModelMatthew Werenski, Ruijie Jiang, Abiy Tasissa, Shuchin Aeron et al.ICML 2022 · 16 citations
- A Novel Skip Orthogonal List for Dynamic Optimal Transport ProblemXiaoyang Xu, Hu DingAAAI 2024 · 1 citation
- Efficient algorithms for Incremental Metric Bipartite MatchingRitesh Seth, Mrinal Garg, Sujoy Bhore, Sharath Raghvendra et al.ICLR 2026
- Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update TimeGramoz Goranci, Peter Kiss, Neel Patel, Martin P. Seybold et al.ICML 2025
- Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in FairnessYuntao Wang, Yuxuan Li, Qingyuan Yang, Hu DingICML 2025
Related papers
- Efficient Approximation Algorithm for Computing Wasserstein Barycenter under Euclidean MetricPankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan YaoSODA 2025
- ESPRESSO: Entropy and ShaPe awaRe timE-Series SegmentatiOn for Processing Heterogeneous Sensor DataShohreh Deldari, Daniel V. Smith, Amin Sadri, Flora D. SalimUbiComp 2020 · 46 citations
- Time2State: An Unsupervised Framework for Inferring the Latent States in Time Series DataChengyu Wang, Kui Wu, Tongqing Zhou, Zhiping CaiSIGMOD 2023 · 22 citations
- Disentangled Recurrent Wasserstein AutoencoderJun Han, Martin Renqiang Min, Ligong Han, Li Erran Li et al.ICLR 2021 · 37 citations
- Learning Graphons via Structured Gromov-Wasserstein BarycentersHongteng Xu, Dixin Luo, Lawrence Carin, Hongyuan ZhaAAAI 2021 · 42 citations
