cs.LGMay 12, 2025

Learning Penalty for Changepoint Detection via Automatic Feature Extraction

Authors: Tung L Nguyen, Toby Hocking

Organizations: School of Informatics, Computing, and Cyber Systems, Northern Arizona University, S San Francisco, Flagstaff, 86011, Arizona, USA. · Département d’informatique, Université de Sherbrooke, Sherbrooke QC J1K 2R1, Quebec, Canada.

Abstract

Changepoint detection identifies significant shifts in data sequences, making it important in areas like finance, genetics, and healthcare. The Optimal Partitioning algorithms efficiently detect these changes, using a penalty parameter to limit the changepoints count. Determining the optimal value for this penalty can be challenging. Traditionally, this process involved manually extracting statistical features, such as sequence length or variance to make the prediction. This study proposes a novel approach that uses recurrent networks to learn this penalty directly from raw sequences by automatically extracting features. Experiments conducted on 20 benchmark genomic datasets show that this novel method generally outperforms traditional ones in changepoint detection accuracy.

Figures & tables

Explore similar work

CardsList
  1. skchange: Fast and Flexible Algorithms for Changepoint Detection

    Aug 20, 2026Martin Tveten, Johannes Voll Kolstø, Per August Jarval MoenChange-Point DetectionTime-Series Anomaly Detection

  2. Pi-Change: A Prior-Informed Multiple Change Point Detection Algorithm

    May 1, 2026Jonathon Jacobs, Shanshan ChenChange-Point Detection