paper-with-me

홈 › Papers

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

2023-08-15 · Elena Gal, Shaun Singh, Aldo Pacchiano, Ben Walker, Terry Lyons, Jakob Foerster

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.

📄 PDF Abstract BibTeX arXiv:2308.08051

Code (0)

등록된 구현이 없습니다.

Tasks

Binary ClassificationDomain AdaptationFairness

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Lean From Thy Neighbor: Stochastic & Adversarial Bandits in a Network

2017-04-14 · L. Elisa Celis, Farnood Salehi

An individual's decisions are often guided by those of his or her peers, i.e., neighbors in a social network. Presumably, being privy to the experiences of others aids in learning and decision making, but how much advant…

Decision MakingSociology

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition

2023-05-31 · Xinlei Yi, Xiuxian Li, Tao Yang, Lihua Xie 외

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate …

Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs

2020-06-14 · NeurIPS 2020 12 · Chung-Wei Lee, Haipeng Luo, Chen-Yu Wei, Mengxiao Zhang

We develop a new approach to obtaining high probability regret bounds for online learning with bandit feedback against an adaptive adversary. While existing approaches all require carefully constructing optimistic and bi…

A note on continuous-time online learning

2024-05-16 · Lexing Ying

In online learning, the data is provided in a sequential order, and the goal of the learner is to make online decisions to minimize overall regrets. This note is concerned with continuous-time models and algorithms for s…

Implications of Regret on Stability of Linear Dynamical Systems

2022-11-14 · Aren Karapetyan, Anastasios Tsiamis, Efe C. Balta, Andrea Iannelli 외

The setting of an agent making decisions under uncertainty and under dynamic constraints is common for the fields of optimal control, reinforcement learning, and recently also for online learning. In the online learning …