Preprint
Aug 2026
When Does More Correct Data Hurt? Insertion-Stability and the Limits of Dimension-Based Theory
On Mehrotra's hard class the authors prove more than the failure of a single algorithm, showing that no monotone permutation-invariant compression scheme of any finite size attains the clean rate.
J. Johny
· 0 citations