mlsanityData to 14 Oct 2026

Learning Recourse Costs from Pairwise Feature Comparisons

arXiv 2409.13940 ↗First posted 20 Sep 2024cs.LG cs.AI cs.CYcited by 2

Not on the map. Why?

Abstract (arXiv)

This paper presents a novel technique for incorporating user input when learning and inferring user preferences. When trying to provide users of black-box machine learning models with actionable recourse, we often wish to incorporate their personal preferences about the ease of modifying each individual feature. These recourse finding algorithms usually require an exhaustive set of tuples associating each feature to its cost of modification. Since it is hard to obtain such costs by directly surveying humans, in this paper, we propose the use of the Bradley-Terry model to automatically infer feature-wise costs using non-exhaustive human comparison surveys. We propose that users only provide inputs comparing entire recourses, with all candidate feature modifications, determining which recourses are easier to implement relative to others, without explicit quantification of their costs. We demonstrate the efficient learning of individual feature costs using MAP estimates, and show that these non-exhaustive human surveys, which do not necessarily contain data for each feature pair comparison, are sufficient to learn an exhaustive set of feature costs, where each feature is associated with a modification cost.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 6 of its 11 references that are in the map. First posted on arXiv 20 Sep 2024.

Builds on

6 of 11 references.

References · 6

  1. 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,089
  2. 2018Actionable Recourse in Linear Classificationcited by 328
  3. 2019FACE: Feasible and Actionable Counterfactual Explanationscited by 233
  4. 2019Learning Model-Agnostic Counterfactual Explanations for Tabular Datacited by 146
  5. 2019Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systemscited by 131
  6. 2016How Much is 131 Million Dollars? Putting Numbers in Perspective with Compositional Descriptionscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Inference Computation Scaling for Feature Augmentation in Recommendation Systems
  2. 2024Test-Time Alignment via Hypothesis Reweighting
  3. 2026What Does Preference Learning Recover from Pairwise Comparison Data?
  4. 2024Pragmatic Feature Preferences: Learning Reward-Relevant Preferences from Human Input
  5. 2025Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective
  6. 2025Offline Clustering of Preference Learning with Active-data Augmentation
  7. 2023A density estimation perspective on learning from pairwise human preferences
  8. 2024Enhancing Preference-based Linear Bandits via Human Response Time