Learning Sinkhorn divergences for supervised change point detection

• URL: http://arxiv.org/abs/2202.04000v3
• Date: Thu, 10 Feb 2022 17:40:40 GMT
• Title: Learning Sinkhorn divergences for supervised change point detection
• Authors: Nauman Ahad, Eva L. Dyer, Keith B. Hengen, Yao Xie, Mark A. Davenport
• Abstract summary: We present a novel change point detection framework that uses true change point instances as supervision for learning a ground metric. Our method can be used to learn a sparse metric which can be useful for both feature selection and interpretation.
• Score: 24.30834981766022
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many modern applications require detecting change points in complex sequential data. Most existing methods for change point detection are unsupervised and, as a consequence, lack any information regarding what kind of changes we want to detect or if some kinds of changes are safe to ignore. This often results in poor change detection performance. We present a novel change point detection framework that uses true change point instances as supervision for learning a ground metric such that Sinkhorn divergences can be then used in two-sample tests on sliding windows to detect change points in an online manner. Our method can be used to learn a sparse metric which can be useful for both feature selection and interpretation in high-dimensional change point detection settings. Experiments on simulated as well as real world sequences show that our proposed method can substantially improve change point detection performance over existing unsupervised change point detection methods using only few labeled change point instances.

Related papers

• Enhancing Changepoint Detection: Penalty Learning through Deep Learning Techniques [2.094821665776961]
  This study introduces a novel deep learning method for predicting penalty parameters. It leads to demonstrably improved changepoint detection accuracy on large benchmark supervised labeled datasets.
  arXiv  Detail & Related papers  (2024-08-01T18:10:05Z)
• Change points detection in crime-related time series: an on-line fuzzy approach based on a shape space representation [0.0]
  We propose an on-line method for detecting and querying change points in crime-related time series. The method is able to accurately detect change points at very low computational costs.
  arXiv  Detail & Related papers  (2023-12-18T10:49:03Z)
• Online Change Points Detection for Linear Dynamical Systems with Finite Sample Guarantees [1.6026317505839445]
  We study the online change point detection problem for linear dynamical systems with unknown dynamics. We develop a data-dependent threshold that can be used in our test that allows one to achieve a pre-specified upper bound on the probability of making a false alarm.
  arXiv  Detail & Related papers  (2023-11-30T18:08:16Z)
• MS-Former: Memory-Supported Transformer for Weakly Supervised Change Detection with Patch-Level Annotations [50.79913333804232]
  We propose a memory-supported transformer (MS-Former) for weakly supervised change detection. MS-Former consists of a bi-directional attention block (BAB) and a patch-level supervision scheme (PSS) Experimental results on three benchmark datasets demonstrate the effectiveness of our proposed method in the change detection task.
  arXiv  Detail & Related papers  (2023-11-16T09:57:29Z)
• Learning Transformations To Reduce the Geometric Shift in Object Detection [60.20931827772482]
  We tackle geometric shifts emerging from variations in the image capture process. We introduce a self-training approach that learns a set of geometric transformations to minimize these shifts. We evaluate our method on two different shifts, i.e., a camera's field of view (FoV) change and a viewpoint change.
  arXiv  Detail & Related papers  (2023-01-13T11:55:30Z)
• Deep learning model solves change point detection for multiple change types [69.77452691994712]
  A change points detection aims to catch an abrupt disorder in data distribution. We propose an approach that works in the multiple-distributions scenario.
  arXiv  Detail & Related papers  (2022-04-15T09:44:21Z)
• E-detectors: a nonparametric framework for sequential change detection [86.15115654324488]
  We develop a fundamentally new and general framework for sequential change detection. Our procedures come with clean, nonasymptotic bounds on the average run length. We show how to design their mixtures in order to achieve both statistical and computational efficiency.
  arXiv  Detail & Related papers  (2022-03-07T17:25:02Z)
• Bandit Quickest Changepoint Detection [55.855465482260165]
  Continuous monitoring of every sensor can be expensive due to resource constraints. We derive an information-theoretic lower bound on the detection delay for a general class of finitely parameterized probability distributions. We propose a computationally efficient online sensing scheme, which seamlessly balances the need for exploration of different sensing options with exploitation of querying informative actions.
  arXiv  Detail & Related papers  (2021-07-22T07:25:35Z)
• Sequential Changepoint Detection in Neural Networks with Checkpoints [11.763229353978321]
  We introduce a framework for online changepoint detection and simultaneous model learning. It is based on detecting changepoints across time by sequentially performing generalized likelihood ratio tests. We show improved performance compared to online Bayesian changepoint detection.
  arXiv  Detail & Related papers  (2020-10-06T21:49:54Z)
• Online Neural Networks for Change-Point Detection [0.6015898117103069]
  We present two online change-point detection approaches based on neural networks. We compare them with the best known algorithms on various synthetic and real world data sets.
  arXiv  Detail & Related papers  (2020-10-03T16:55:59Z)
• Change Point Detection in Time Series Data using Autoencoders with a Time-Invariant Representation [69.34035527763916]
  Change point detection (CPD) aims to locate abrupt property changes in time series data. Recent CPD methods demonstrated the potential of using deep learning techniques, but often lack the ability to identify more subtle changes in the autocorrelation statistics of the signal. We employ an autoencoder-based methodology with a novel loss function, through which the used autoencoders learn a partially time-invariant representation that is tailored for CPD.
  arXiv  Detail & Related papers  (2020-08-21T15:03:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.