TSRGet The Daily Report
The Singularity Report

TSR Desk · science · 1 October 2026, 01:00 UTC

Beyond Sub-Gaussian Detector Scores: Robust Weighted Profile-Loss Change Point Detection for

What
Beyond Sub-Gaussian Detector Scores: Robust Weighted Profile-Loss Change Point Detection for Human-LLM Text Segmentation
Who
arxiv.org
When
30 September 2026, 04:00 UTC
Category
Science
Primary source
https://arxiv.org/abs/2609.36888
What is not known
This brief does not claim independent replication. Claims that appear only on X and not in the primary source stay unknown.

Across five retrospective cached-score benchmark families, core RWCP reduces family-macro WindowDiff by 17.6\% relative to weighted change-point detection, and RWCP-R lowers it further. It comes from a paper posted to arXiv on 30 September 2026. Mixed human-LLM documents require locating authorship transitions from detector scores whose reliability varies across text units. Existing weighted mean contrasts are vulnerable to extreme scores, while directly replacing means with robust centers obscures how a misplaced boundary changes the population objective. We propose Robust Weighted Profile-Loss Change Point Detection (RWCP), which combines capped reliability weights, Huber profile gains, and narrowest-over-threshold search in reliability coordinates. Our key analysis expresses the population gap between a true and a displaced split as a merge cost, avoiding a closed-form solution for the nonlinear center of a mixed segment. Under explicit curvature, spacing, and dependence conditions, core RWCP recovers the number of changes and localizes their boundaries; its quadratic-loss limit recovers squared weighted CUSUM. We also study RWCP-R, a separately evaluated decoder that shares source centers across nonadjacent passages. Boundary recovery improves most clearly for isolated changes, while both fixed configurations miss changes in collaborative and densely alternating text.

Why it counts

Across five retrospective cached-score benchmark families, core RWCP reduces family-macro WindowDiff by 17.6\% relative to weighted change-point detection, and RWCP-R lowers it further. We propose Robust Weighted Profile-Loss Change Point Detection (RWCP), which combines capped reliability weights, Huber profile gains, and narrowest-over-threshold search in reliability coordinates. Boundary recovery improves most clearly for isolated changes, while both fixed configurations miss changes in collaborative and densely alternating text.

Sources

Primary source: primary source

What is not known

This brief does not claim independent replication. Claims that appear only on X and not in the primary source stay unknown.

No clip. The article still stands.