SyncAI.news, a Varaisys broadcasting
Elicited Adaptation: Auditable Localized Fairness via Pairwise Queries
SS

Shrey Shah

· 1 min read

ResearcharXiv cs.LG

Elicited Adaptation: Auditable Localized Fairness via Pairwise Queries

arXiv:2611.19686v1 Announce Type: new 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 $n$ 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 $\lfloor n/2\rfloor$, and a full cost curve describes finite target-only repair budgets. Committing before the target is known can cost $n-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-1$ bound, similarity queries alone yield a feasible $2$-approximate repair for tolerance $\eps\le1/[2(n-1)]$, reducing movement relative to common repair by a factor linear in $n$. Feasible $(1+\alpha)$-optimal repair on this family has worst-case tolerance-query complexity $\Theta(\alpha^{-2}n^2\log(1/\delta))$ 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.

Original source

This story was published by arXiv cs.LG and written by Shrey Shah. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News