cs.AIAug 11, 2026

RCShift: Certifying When Partial Linkage Suffices for Finite-Sample Decisions

Authors: Shuheng Cao, Ruiqi Chen, Zhenhao Zhang, Renjie Cao, Siyu Zhang, Lingwei Dang, Jiajun Zhang, Tingting Dan

Organizations: University of California, San Diego · University of Michigan, Ann Arbor · ShanghaiTech University · Tsinghua University · 

Abstract

Systems with costly gold outcomes and cheaper auxiliary observations must decide how much record linkage to retain. Complete pairing retains every joint counter, while separate margins retain none. Neither endpoint is calibrated to a declared finite-sample decision. Universal reconstruction can retain cycle directions invisible to the likelihood-ratio family. Family-exact storage can exceed what the decision requires because certified residual loss may fit within finite-sample slack. We introduce RCShift, which certifies two routes to sufficiency under a declared observation contract. Its exact mode characterizes minimum-cost family-exact storage through LR-visible cycle directions. Its approximate mode bounds reverse Le Cam deficiency. Its integer mode certifies whether a chosen set preserves the full experiment's minimum integer record count at specified size and power. In a rank-two witness, one aligned counter preserves a four-record minimum. An equal-cost misaligned counter and the margins require eleven records, while universal reconstruction requires two counters. A local perturbation has positive reverse deficiency yet retains the four-record minimum. Proof-checked scheduling bounds instantiate the contract before gold computation and yield exact reconstruction on the admitted tree support. RCShift turns partial-linkage storage into decision-calibrated measurement design for the declared family, costs, target, and common strictly positive support.

Figures & tables

Explore similar work

CardsList
  1. Decision-Target Reversal under Informative Label Missingness

    Oct 18, 2026Farinborz Setoudehtazangi, Geoffrey J. McLachlanLearning with Missing DataCost-Sensitive Learning

  2. Detecting a Shift Is Not Enough: Exact Minimax Limits of Linear Representation Repair

    Oct 6, 2026Anuar Aimoldin, Yankai Chen, Ayana Mussabayeva +1Distribution Shift RobustnessMinimax Estimation

  3. DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedback

    Oct 9, 2026He Sun, Junyuan Mao, Wenhao Jiang +2Online Resource AllocationTraining Data Curation