mlsanityData to 7 Oct 2026

Unbiased Decisions Reduce Regret: Adversarial Domain Adaptation for the Bank Loan Problem

arXiv 2308.08051 ↗First posted 15 Aug 2023cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

In many real world settings binary classification decisions are made based on limited data in near real-time, e.g. when assessing a loan application. We focus on a class of these problems that share a common feature: the true label is only observed when a data point is assigned a positive label by the principal, e.g. we only find out whether an applicant defaults if we accepted their loan application. As a consequence, the false rejections become self-reinforcing and cause the labelled training set, that is being continuously updated by the model decisions, to accumulate bias. Prior work mitigates this effect by injecting optimism into the model, however this comes at the cost of increased false acceptance rate. We introduce adversarial optimism (AdOpt) to directly address bias in the training set using adversarial domain adaptation. The goal of AdOpt is to learn an unbiased but informative representation of past data, by reducing the distributional shift between the set of accepted data points and all data points seen thus far. AdOpt significantly exceeds state-of-the-art performance on a set of challenging benchmark problems. Our experiments also provide initial evidence that the introduction of adversarial domain adaptation improves fairness in this setting.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 38 references that are in the map. First posted on arXiv 15 Aug 2023.

Builds on

22 of 38 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2022Generative Adversarial Networkscited by 5,603
  3. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  4. 2017Adversarial Discriminative Domain Adaptationcited by 1,309
  5. 2018Mitigating Unwanted Biases with Adversarial Learningcited by 663
  6. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 363
  7. 2020Performative Predictioncited by 318
  8. 2015Strategic Classificationcited by 256
  9. 2016Coupled Generative Adversarial Networkscited by 216
  10. 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 195
  11. 2015Censoring Representations with an Adversarycited by 191
  12. 2016Fairness in Learning: Classic and Contextual Banditscited by 167
10 more
  1. 2018Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Samplingcited by 166
  2. 2021Outside the Echo Chamber: Optimizing the Performative Riskcited by 95
  3. 2020Neural Contextual Bandits with Deep Representation and Shallow Explorationcited by 71
  4. 2021Characterizing Fairness Over the Set of Good Models Under Selective Labelscited by 65
  5. 2018Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Banditscited by 33
  6. 2019Adversarial Domain Adaptation for Machine Reading Comprehensioncited by 21
  7. 2019Deep Generative Models for Reject Inference in Credit Scoringcited by 9
  8. 2021Top-k eXtreme Contextual Bandits with Arm Hierarchycited by 8
  9. 2021Gradual (In)Compatibility of Fairness Criteriacited by 8
  10. 2021Neural Pseudo-Label Optimism for the Bank Loan Problemcited by 3

Built on by

Not cited yet.