Metraipolis › archive › dc_fa4825b9aaaa

ARC: Augmented-Rank Conformalization for Changepoint Localization --- Finite-Sample Validity and Distribution-Robust Efficiency — arXiv:2608.08424

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.08424
License (as archived)
CC0-1.0
Archived
2026-10-19T09:02:37.878Z
SHA-256 of the archived text
9c8b1c80088171ec1907a8010bf9ba7b7f76b14604c71a63ad192908d682f42a
Stable URL of this page
https://metraipolis.com/documento/dc_fa4825b9aaaa

How to cite

ARC: Augmented-Rank Conformalization for Changepoint Localization --- Finite-Sample Validity and Distribution-Robust Efficiency — arXiv:2608.08424 — arXiv (en), https://arxiv.org/abs/2608.08424 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa4825b9aaaa (Metraipolis archive dc_fa4825b9aaaa, sha256 9c8b1c80088171ec1907a8010bf9ba7b7f76b14604c71a63ad192908d682f42a)
BibTeX
@misc{dcfa4825b9aaaa,
  title = {ARC: Augmented-Rank Conformalization for Changepoint Localization --- Finite-Sample Validity and Distribution-Robust Efficiency — arXiv:2608.08424},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.08424},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa4825b9aaaa; sha256 9c8b1c80088171ec1907a8010bf9ba7b7f76b14604c71a63ad192908d682f42a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08424. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Conformal changepoint localization turns any score into a confidence set for the changepoint with finite-sample coverage. Coverage is universal; efficiency is not. The oracle score is a likelihood ratio, so practical scores estimate density ratios, and set length deteriorates under heavy tails, skewness, and distribution shift, where no length guarantee applies. We propose ARC (Augmented-Rank Conformalization), a family of scores depending on the data only through within-segment ranks: rank-CUSUM location and scale channels, their fixed combinations, and a lightweight neural score frozen after synthetic training. Every ARC score inherits finite-sample coverage for every frozen weight configuration, including random initialization and mistraining. The main result is an efficiency transfer theorem: the entire ARC confidence set is almost surely invariant under strictly increasing marginal transforms, so the set length distribution depends on the data pair only through its rank structure, and lengths certified once hold verbatim across its monotone orbit, whereas a plug-in score's length changes with every re-expression. Across different rank structures lengths do change, and are reported as such. Classical rank-test theory positions ARC as targeting the optimal invariant score at bounded cost. Simulations confirm nominal coverage for all scores, including sabotaged networks, identical sets under monotone transforms where plug-in scores inflate, and smooth degradation where plug-in sets become vacuous; on the well-log benchmark ARC localizes annotated shifts to three to five candidates and flags misfit by an empty set. Two boundaries are stated rather than hidden: serial dependence destroys exactness, and trend-type alternatives lie outside the piecewise-exchangeable model.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-11 in stat.ML).
Categorie arXiv: Machine Learning (stat.ML) ; Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.08424 — 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-19T09:01:32.133Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).