skchange: Fast and Flexible Algorithms for Changepoint Detection

• URL: http://arxiv.org/abs/2608.19767v1
• Date: Thu, 20 Aug 2026 08:11:15 GMT
• Title: skchange: Fast and Flexible Algorithms for Changepoint Detection
• Abstract summary: Skchange is an open-source library for detecting structural changes in time series.<n>It implements modern change detection algorithms within a unified and composable framework.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Skchange is an open-source Python library for detecting structural changes in time series. It implements modern change detection algorithms within a unified and extensible framework. The algorithms are modular and composable, and they include changepoint search methods based on both cost minimisation and statistical tests. Key features include the detection of anomalous segments in addition to changepoints; theoretically well-founded fast and approximate search methods; theoretically well-founded algorithms for high-dimensional data, covering settings where either few or many features change simultaneously; utilities for automatic and data-driven penalty calibration, which balances false alarms against missed detections; and a large collection of built-in costs and statistical tests. The design follows established scikit-learn conventions to streamline both user and contributor experience, and Numba is used extensively to achieve high computational performance. Source code and documentation are available at https://github.com/NorskRegnesentral/skchange.

Related papers

• Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls [83.89771461061903]
  Recent advancements in tree search algorithms guided by verifiers have significantly enhanced the reasoning capabilities of large language models (LLMs)<n>Recent advancements in tree search algorithms guided by verifiers have significantly enhanced the reasoning capabilities of large language models (LLMs)<n>We identify two key challenges contributing to this inefficiency: $textitover-exploration$ due to redundant states with semantically equivalent content, and $textitunder-exploration$ caused by high variance in verifier scoring.<n>We propose FETCH, a flexible, plug-and-play system compatible with various tree search algorithms.
  arXiv  Detail & Related papers  (2025-02-16T16:12:01Z)
• Learning to Make Keypoints Sub-Pixel Accurate [80.55676599677824]
  This work addresses the challenge of sub-pixel accuracy in detecting 2D local features. We propose a novel network that enhances any detector with sub-pixel precision by learning an offset vector for detected features.
  arXiv  Detail & Related papers  (2024-07-16T12:39:56Z)
• Quickest Change Detection for Unnormalized Statistical Models [36.6516991850508]
  This paper develops a new variant of the classical Cumulative Sum (CUSUM) algorithm for the quickest change detection. The SCUSUM algorithm allows the applications of change detection for unnormalized statistical models.
  arXiv  Detail & Related papers  (2023-02-01T05:27:34Z)
• A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks [65.34977803841007]
  Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience. We show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one.
  arXiv  Detail & Related papers  (2022-11-16T00:11:04Z)
• Automatic Change-Point Detection in Time Series via Deep Learning [8.43086628139493]
  We show how to automatically generate new offline detection methods based on training a neural network. We present theory that quantifies the error rate for such an approach, and how it depends on the amount of training data. Our method also shows strong results in detecting and localising changes in activity based on accelerometer data.
  arXiv  Detail & Related papers  (2022-11-07T20:59:14Z)
• Real-time AdaBoost cascade face tracker based on likelihood map and optical flow [59.17685450892182]
  The authors present a novel face tracking approach where optical flow information is incorporated into a modified version of the Viola Jones detection algorithm. In the original algorithm, detection is static, as information from previous frames is not considered. The proposed tracker preserves information about the number of classification stages passed by each window.
  arXiv  Detail & Related papers  (2022-10-25T10:15:07Z)
• 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)
• ZippyPoint: Fast Interest Point Detection, Description, and Matching through Mixed Precision Discretization [71.91942002659795]
  We investigate and adapt network quantization techniques to accelerate inference and enable its use on compute limited platforms. ZippyPoint, our efficient quantized network with binary descriptors, improves the network runtime speed, the descriptor matching speed, and the 3D model size. These improvements come at a minor performance degradation as evaluated on the tasks of homography estimation, visual localization, and map-free visual relocalization.
  arXiv  Detail & Related papers  (2022-03-07T18:59:03Z)
• Fast Online Changepoint Detection via Functional Pruning CUSUM statistics [2.867517731896504]
  Functional Online CuSUM (FOCuS) is equivalent to running earlier methods simultaneously for all sizes of window, or all possible values for the size of change. We show how FOCuS can be applied to a number of different change in mean scenarios, and demonstrate its practical utility.
  arXiv  Detail & Related papers  (2021-10-15T17:08:06Z)
• Score-Based Change Detection for Gradient-Based Learning Machines [9.670556223243182]
  We present a generic score-based change detection method that can detect a change in any number of components of a machine learning model trained via empirical risk minimization. We establish the consistency of the hypothesis test and show how to calibrate it to achieve a prescribed false alarm rate.
  arXiv  Detail & Related papers  (2021-06-27T01:38:11Z)
• AmphibianDetector: adaptive computation for moving objects detection [0.913755431537592]
  We propose an approach to object detection which makes it possible to reduce the number of false-positive detections. The proposed approach is a modification of CNN already trained for object detection task. The efficiency of the proposed approach was demonstrated on the open dataset "CDNet2014 pedestrian"
  arXiv  Detail & Related papers  (2020-11-15T12:37:44Z)
• 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.