# Consistent Kernel Change-Point Detection under m-Dependence for Text Segmentation

arXiv: https://arxiv.org/abs/2510.03437 · HTML: https://mlsanity.com/paper/2510.03437/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 20 of its 58 references that are in the map.
- First posted on arXiv 3 Oct 2025.

## Builds on (most cited first, 20 of 20)

- [RoBERTa: A Robustly Optimized BERT Pretraining Approach](https://mlsanity.com/paper/1907.11692/) (2019)
- [Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks](https://mlsanity.com/paper/1908.10084/) (2019)
- [DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter](https://mlsanity.com/paper/1910.01108/) (2019)
- [MPNet: Masked and Permuted Pre-training for Language Understanding](https://mlsanity.com/paper/2004.09297/) (2020)
- [Text Segmentation as a Supervised Learning Task](https://mlsanity.com/paper/1803.09337/) (2018)
- [Text Segmentation by Cross Segment Attention](https://mlsanity.com/paper/2004.14535/) (2020)
- [Two-Level Transformer and Auxiliary Coherence Modeling for Improved Text Segmentation](https://mlsanity.com/paper/2001.00891/) (2020)
- [Kernel Change-point Detection with Auxiliary Deep Generative Models](https://mlsanity.com/paper/1901.06077/) (2019)
- [Unsupervised Topic Segmentation of Meetings with BERT Embeddings](https://mlsanity.com/paper/2106.12978/) (2021)
- [Toward Unifying Text Segmentation and Long Document Summarization](https://mlsanity.com/paper/2210.16422/) (2022)
- [Attention-based Neural Text Segmentation](https://mlsanity.com/paper/1808.09935/) (2018)
- [Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming](https://mlsanity.com/paper/2002.09132/) (2020)
- [Multiple-change-point detection for high dimensional time series via sparsified binary segmentation](https://mlsanity.com/paper/1611.08639/) (2016)
- [High-dimensional changepoint estimation via sparse projection](https://mlsanity.com/paper/1606.06246/) (2016)
- [Improving Long Document Topic Segmentation Models With Enhanced Coherence Modeling](https://mlsanity.com/paper/2310.11772/) (2023)
- [Online Neural Networks for Change-Point Detection](https://mlsanity.com/paper/2010.01388/) (2020)
- [Online change-point detection with kernels](https://mlsanity.com/paper/2002.02704/) (2020)
- [Structural Breaks in Time Series](https://mlsanity.com/paper/1805.03807/) (2018)
- [Selective Inference for Changepoint detection by Recurrent Neural Network](https://mlsanity.com/paper/2311.14964/) (2023)
- [TreeSeg: Hierarchical Topic Segmentation of Large Transcripts](https://mlsanity.com/paper/2407.12028/) (2024)

## Abstract (arXiv)

Kernel change-point detection (KCPD) has become a widely used tool for identifying structural changes in complex data. While existing theory establishes consistency under independence assumptions, real-world sequential data such as text exhibits strong dependencies. We establish new guarantees for KCPD under m-dependent data: specifically, we prove consistency in the number of detected change points and weak consistency in their locations under mild additional assumptions. We perform an LLM-based simulation that generates synthetic m-dependent text to validate the asymptotics. To complement these results, we present the first comprehensive empirical study of KCPD for text segmentation with modern embeddings. Across diverse text datasets, KCPD with text embeddings outperforms baselines in standard text segmentation metrics. We demonstrate through a case study on Taylor Swift's tweets that KCPD not only provides strong theoretical and simulated reliability but also practical effectiveness for text segmentation tasks.
