betaFeedback

WorksComputer Science

Elicited Adaptation: Auditable Localized Fairness via Pairwise Queries

Abstract

How much must a predictor's scores change when a community's elicited fairness standard changes? Similarity and tolerance judgments define protected comparisons and acceptable score gaps. We study minimum uniform score movement on a fixed pool of nn profiles. For scores satisfying a source standard, we characterize the exact cost of retaining that standard during adaptation: runs of consecutive target constraints along shortest paths determine the optimal amplification factor. Its sharp worst case is ⌊n/2⌋\lfloor n/2\rfloor, and a full cost curve describes finite target-only repair budgets. Committing before the target is known can cost n−1n-1 times the worst repair after revelation, even within one fixed convex ball of two-dimensional Mahalanobis metrics. Positive edge-budget floors cap both factors; bounded geometry also limits the commitment cost. At two interior targets of the construction attaining the n−1n-1 bound, similarity queries alone yield a feasible 22-approximate repair for tolerance \eps\le1/[2(n-1)], reducing movement relative to common repair by a factor linear in nn. Feasible (1+α)(1+α)-optimal repair on this family has worst-case tolerance-query complexity Θ(α−2n2log⁡(1/δ))Θ(α^{-2}n^2\log(1/δ)) under a fixed-slope logistic model. The analysis separates the information needed for a substantial adaptation benefit from the precision needed for nearly optimal movement. Elicitation studies and training comparisons examine tolerance choice and the relation between numerical compliance and predictive utility.

Paper details

vlnc:W_8xx7h5j7
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…