arXiv AI
Sep 17

Pay Only for Disagreement: Certified No-Regression Verdicts for Model Updates with Matching Label-Complexity Bounds

The paper introduces DISCERN, a two-tier protocol for certifying that updates to production models do not increase risk. It first uses unlabeled data to detect benign updates based on disagreement rates, then selectively labels only disagreements through an anytime-valid confidence sequence. The method achieves finite-sample validity with label-complexity bounds of order ρ²/ε², demonstrating significant label savings and strong empirical performance across 14,000+ audit streams.

By Vishnu Bindu Balachandran
arXiv AI
Aug 28

Fairness Invariants: A Relational Approach to Explaining and Mitigating Fairness Bugs

The paper introduces REMI, a framework that treats counterfactual fairness as a relational invariant discovery problem. By learning over paired examples, REMI identifies input regions where fairness is violated and generates interpretable rule-based models—fairness invariants—that can block or relabel unfair predictions without retraining the underlying model. Experiments on symbolic and neural network programs show REMI localizes fairness bugs in over 83% of cases and reduces discriminatory decisions in black-box models by up to 70%.

By Ranit Debnath Akash, Ashish Kumar, Gang Tan, Saeid Tizpaz-Niari