mlsanityData to 7 Oct 2026

Unpacking the Black Box: Regulating Algorithmic Decisions

arXiv 2110.03443 ↗First posted 5 Oct 2021econ.GN cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

What should regulators of complex algorithms regulate? We propose a model of oversight over 'black-box' algorithms used in high-stakes applications such as lending, medical testing, or hiring. In our model, a regulator is limited in how much she can learn about a black-box model deployed by an agent with misaligned preferences. The regulator faces two choices: first, whether to allow for the use of complex algorithms; and second, which key properties of algorithms to regulate. We show that limiting agents to algorithms that are simple enough to be fully transparent is inefficient as long as the misalignment is limited and complex algorithms have sufficiently better performance than simple ones. Allowing for complex algorithms can improve welfare, but the gains depend on how the regulator regulates them. Regulation that focuses on the overall average behavior of algorithms, for example based on standard explainer tools, will generally be inefficient. Targeted regulation that focuses on the source of incentive misalignment, e.g., excess false positives or racial disparities, can provide second-best solutions. We provide empirical support for our theoretical findings using an application in consumer lending, where we document that complex models regulated based on context-specific explanation tools outperform simple, fully transparent models. This gain from complex models represents a Pareto improvement across our empirical applications that is preferred both by the lender and from the perspective of the financial regulator.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 19 of its 92 references that are in the map. First posted on arXiv 5 Oct 2021.

Builds on

19 of 92 references.

References · 19

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  3. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,400
  4. 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
  5. 2016Fair prediction with disparate impact: A study of bias in recidivism prediction instrumentscited by 671
  6. 2016Inherent Trade-Offs in the Fair Determination of Risk Scorescited by 582
  7. 2019Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methodscited by 440
  8. 2017Algorithmic decision making and the cost of fairnesscited by 402
  9. 2019Interpretable machine learning: definitions, methods, and applicationscited by 303
  10. 2019Explainable Machine Learning in Deploymentcited by 210
  11. 2020Algorithmic Fairnesscited by 143
  12. 2019"How do I fool you?": Manipulating User Trust via Misleading Black Box Explanationscited by 111
7 more
  1. 2021Characterizing Fairness Over the Set of Good Models Under Selective Labelscited by 65
  2. 2019Discrimination in the Age of Algorithmscited by 51
  3. 2018An Interpretable Model with Globally Consistent Explanations for Credit Riskcited by 33
  4. 2019Using Wasserstein Generative Adversarial Networks for the Design of Monte Carlo Simulationscited by 32
  5. 2018Predicting Race and Ethnicity From the Sequence of Characters in a Namecited by 24
  6. 2020PermuteAttack: Counterfactual Explanation of Machine Learning Credit Scorecardscited by 16
  7. 2019Bias In, Bias Out? Evaluating the Folk Wisdomcited by 7

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 1.

3 papers.