WISER is a linear-time, provably consistent algorithm that localizes multiple watermarked segments in mixed-source texts by treating pivot statistics as an epidemic change-point sequence.
A more efficient algorithm to compute the Rand Index for change-point problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We provide a more efficient algorithm for computing the Rand Index when the data cluster comes from a change-point detection problem. Given $N$ data points and two clusterings of size $r$ and $s$, the algorithm runs on $O(r+s)$ time complexity and $O(1)$ memory complexity. The traditional algorithm, in contrast, runs on $O(rs+N)$ time complexity and $O(rs)$ memory complexity.
citation-role summary
method 1
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Fast segmentation of watermarked texts from large language models through an epidemic change-point framework
WISER is a linear-time, provably consistent algorithm that localizes multiple watermarked segments in mixed-source texts by treating pivot statistics as an epidemic change-point sequence.