Neural Pseudo-Label Optimism for the Bank Loan Problem
Not on the map. Why?
Abstract (arXiv)
We study a class of classification problems best exemplified by the bank loan problem, where a lender decides whether or not to issue a loan. The lender only observes whether a customer will repay a loan if the loan is issued to begin with, and thus modeled decisions affect what data is available to the lender for future decisions. As a result, it is possible for the lender's algorithm to ``get stuck'' with a self-fulfilling model. This model never corrects its false negatives, since it never sees the true label for rejected data, thus accumulating infinite regret. In the case of linear models, this issue can be addressed by adding optimism directly into the model predictions. However, there are few methods that extend to the function approximation case using Deep Neural Networks. We present Pseudo-Label Optimism (PLOT), a conceptually and computationally simple method for this setting applicable to DNNs. PLOT adds an optimistic label to the subset of decision points the current model is deciding on, trains the model on all data so far (including these points along with their optimistic labels), and finally uses the resulting optimistic model for decision making. PLOT achieves competitive performance on a set of three challenging benchmark problems, requiring minimal hyperparameter tuning. We also show that PLOT satisfies a logarithmic regret guarantee, under a Lipschitz and logistic mean label model, and under a separability condition on the data.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 19 of its 68 references that are in the map. First posted on arXiv 3 Dec 2021.
Builds on
19 of 68 references.
References · 19
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 363
- 2020Performative Predictioncited by 318
- 2015Strategic Classificationcited by 256
- 2016A Survey of Motion Planning and Control Techniques for Self-driving Urban Vehiclescited by 251
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 218
- 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 195
- 2018Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Samplingcited by 166
- 2021Outside the Echo Chamber: Optimizing the Performative Riskcited by 95
- 2020Model Selection in Contextual Stochastic Bandit Problemscited by 71
- 2020Neural Contextual Bandits with Deep Representation and Shallow Explorationcited by 71
- 2020Regret Bound Balancing and Elimination for Model Selection in Bandits and RLcited by 45
7 more
- 2019Equal Opportunity in Online Classification with Partial Feedbackcited by 34
- 2018Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Banditscited by 33
- 2021On the Theory of Reinforcement Learning with Once-per-Episode Feedbackcited by 32
- 2017Online Learning with Abstentioncited by 28
- 2020Online Model Selection for Reinforcement Learning with Function Approximationcited by 28
- 2020Regret Balancing for Bandit and RL Model Selectioncited by 20
- 2021Top-k eXtreme Contextual Bandits with Arm Hierarchycited by 8
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1.
3 papers.