Metraipolis › archive › dc_568a8a520c8d
LABS: Extending the scope of binary segmentation via a look-ahead device — arXiv:2608.21122
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21122
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T10:38:29.628Z
- SHA-256 of the archived text
833b1439a90b11bf933fc96c73685b65ce8615e6681b55f118cbac8c16fe5fef- Stable URL of this page
https://metraipolis.com/documento/dc_568a8a520c8d
How to cite
LABS: Extending the scope of binary segmentation via a look-ahead device — arXiv:2608.21122 — arXiv (en), https://arxiv.org/abs/2608.21122 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_568a8a520c8d (Metraipolis archive dc_568a8a520c8d, sha256 833b1439a90b11bf933fc96c73685b65ce8615e6681b55f118cbac8c16fe5fef)
BibTeX
@misc{dc568a8a520c8d,
title = {LABS: Extending the scope of binary segmentation via a look-ahead device — arXiv:2608.21122},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21122},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_568a8a520c8d; sha256 833b1439a90b11bf933fc96c73685b65ce8615e6681b55f118cbac8c16fe5fef},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21122. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Binary segmentation is widely used for multiple change-point detection because it is fast, simple to describe, and simple to implement. Its validity rests on the requirement that, at each recursive stage, the procedure identifies one of the true change-points when several are present in the current interval. This holds for detecting changes in mean using the CUSUM statistic, but fails in some other settings, in particular in slope change detection for continuous piecewise-linear signals. We propose Look-Ahead Binary Segmentation (LABS), a modification in which the change-points returned by the two child recursions define a narrower interval on which the parent estimate is re-evaluated. LABS inherits the computational speed of standard binary segmentation, but achieves the near-optimal consistency rate of $O\{(n\log n)^{1/2}\}$ in the slope-change signal setting when the LABS model is chosen via either thresholding or a Schwarz-like information criterion. Simulations show that LABS is fast and achieves state-of-the-art performance.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-24 in math.ST).
Categorie arXiv: Methodology (stat.ME) ; Statistics Theory (math.ST); Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.21122 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T10:37:55.791Z dalla pagina https://arxiv.org/catchup/math.ST/2026-08-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).