AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Statistical Guarantees in the Search for Less Discriminatory Algorithms

Chris Hays, Benjamin Laufer, Solon Barocas, Manish Raghavan

ICLR 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add data-adaptive CEI bounds (extra assumptions) to the stopping boundAnytime-valid LDA search stopping bound · Adult/Folktables/HMDAupper bound tightnessNo clear effect
add extra distributional assumptions to the boundAnytime-valid LDA search stopping bound · Adult/Folktables/HMDAupper bound tightnessNo clear effect
add Fairlearn fairness regularization to the modelsRetrained models · Adult/Folktables/HMDAupper bound on marginal gainImproved
lower Fairlearn target disparate impact to 0.05 (ablation)Fairlearn methods · Adult/Folktables/HMDAmarginal gain from retraining: 0.05Improved
use finite-data version instead of infinite-data versionAnytime-valid upper bound · Miscoveragemiscoverage rate: less than 10 events -> significantly above target 0.05 rateHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy