mlsanityData to 7 Oct 2026

On Rank Energy Statistics via Optimal Transport: Continuity, Convergence, and Change Point Detection

arXiv 2302.07964 ↗First posted 15 Feb 2023stat.ML cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

This paper considers the use of recently proposed optimal transport-based multivariate test statistics, namely rank energy and its variant the soft rank energy derived from entropically regularized optimal transport, for the unsupervised nonparametric change point detection (CPD) problem. We show that the soft rank energy enjoys both fast rates of statistical convergence and robust continuity properties which lead to strong performance on real datasets. Our theoretical analyses remove the need for resampling and out-of-sample extensions previously required to obtain such rates. In contrast the rank energy suffers from the curse of dimensionality in statistical estimation and moreover can signal a change point from arbitrarily small perturbations, which leads to a high rate of false alarms in CPD. Additionally, under mild regularity conditions, we quantify the discrepancy between soft rank energy and rank energy in terms of the regularization parameter. Finally, we show our approach performs favorably in numerical experiments compared to several other optimal transport-based methods as well as maximum mean discrepancy.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 24 of its 77 references that are in the map. First posted on arXiv 15 Feb 2023.

Builds on

24 of 77 references.

References · 24

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 526
  3. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  4. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  5. 2015On Wasserstein Two Sample Testing and Related Families of Nonparametric Testscited by 165
  6. 2019Differentiable Ranks and Sorting using Optimal Transportcited by 113
  7. 2021Entropic estimation of optimal transport mapscited by 87
  8. 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
  9. 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
  10. 2019On the Efficiency of Entropic Regularized Algorithms for Optimal Transportcited by 34
  11. 2019Kernel Change-point Detection with Auxiliary Deep Generative Modelscited by 32
  12. 2013A Nonparametric Approach for Multiple Change Point Analysis of Multivariate Datacited by 28
12 more
  1. 2019Multivariate Rank-based Distribution-free Nonparametric Testing using Measure Transportationcited by 24
  2. 2021Quantitative Stability of Regularized Optimal Transport and Convergence of Sinkhorn's Algorithmcited by 21
  3. 2021Entropic Optimal Transport: Geometry and Large Deviationscited by 20
  4. 2018Univariate Mean Change Point Detection: Penalization, CUSUM and Optimalitycited by 13
  5. 2018Time Series Segmentation through Automatic Feature Learningcited by 11
  6. 2021Dynamical Wasserstein Barycenters for Time-series Modelingcited by 10
  7. 2022Convergence rate of general entropic optimal transport costscited by 9
  8. 2019Optimal Transport Based Change Point Detection and Time Series Segment Clusteringcited by 8
  9. 2020On Matched Filtering for Statistical Change Point Detectioncited by 5
  10. 2013Joint segmentation of multivariate time series with hidden process regression for human activity recognitioncited by 4
  11. 2021Multivariate rank via entropic optimal transport: sample efficiency and generative modelingcited by 4
  12. 2022Learning Sinkhorn divergences for supervised change point detectioncited by 1

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 1.

3 papers.