mlsanityData to 7 Oct 2026

Arbitrary Decisions are a Hidden Cost of Differentially Private Training

arXiv 2302.14517 ↗First posted 28 Feb 2023cs.LG cs.CR cs.CYcited by 19

Not on the map. Why?

Abstract (arXiv)

Mechanisms used in privacy-preserving machine learning often aim to guarantee differential privacy (DP) during model training. Practical DP-ensuring training methods use randomization when fitting model parameters to privacy-sensitive data (e.g., adding Gaussian noise to clipped gradients). We demonstrate that such randomization incurs predictive multiplicity: for a given input example, the output predicted by equally-private models depends on the randomness used in training. Thus, for a given input, the predicted output can vary drastically if a model is re-trained, even if the same training dataset is used. The predictive-multiplicity cost of DP training has not been studied, and is currently neither audited for nor communicated to model designers and stakeholders. We derive a bound on the number of re-trainings required to estimate predictive multiplicity reliably. We analyze--both theoretically and through extensive experiments--the predictive-multiplicity cost of three DP-ensuring algorithms: output perturbation, objective perturbation, and DP-SGD. We demonstrate that the degree of predictive multiplicity rises as the level of privacy increases, and is unevenly distributed across individuals and demographic groups in the data. Because randomness used to ensure DP during training explains predictions for some examples, our results highlight a fundamental challenge to the justifiability of decisions supported by differentially private models in high-stakes settings. We conclude that practitioners should audit the predictive multiplicity of their DP-ensuring algorithms before deploying them in applications of individual-level consequence.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). Builds on 21 of its 45 references that are in the map. First posted on arXiv 28 Feb 2023.

Builds on

21 of 45 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Deep Learning with Differential Privacycited by 2,682
  4. 2020Underspecification Presents Challenges for Credibility in Modern Machine Learningcited by 488
  5. 2021Opacus: User-Friendly Differential Privacy Library in PyTorchcited by 375
  6. 2018All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneouslycited by 364
  7. 2019Differential Privacy Has Disparate Impact on Model Accuracycited by 316
  8. 2020Differentially Private Learning Needs Better Features (or Much More Data)cited by 233
  9. 2021Numerical Composition of Differential Privacycited by 174
  10. 2019Predictive Multiplicity in Classificationcited by 162
  11. 2021Hyperparameter Tuning with Renyi Differential Privacycited by 104
  12. 2019On the Existence of Simpler Machine Learning Modelscited by 87
9 more
  1. 2021Characterizing Fairness Over the Set of Good Models Under Selective Labelscited by 65
  2. 2019Diffprivlib: The IBM Differential Privacy Librarycited by 51
  3. 2014Deep Roto-Translation Scattering for Object Classificationcited by 49
  4. 2019SciPy 1.0--Fundamental Algorithms for Scientific Computing in Pythoncited by 49
  5. 2021Robin Hood and Matthew Effects: Differential Privacy Has Disparate Impact on Synthetic Datacited by 48
  6. 2022Predictive Multiplicity in Probabilistic Classificationcited by 44
  7. 2021Selective Ensembles for Consistent Predictionscited by 23
  8. 2022How unfair is private learning ?cited by 18
  9. 2021Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channelscited by 15

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 5; 2025: 7; 2026: 4.

19 papers.

Sort:

By area:

  1. 2024Dropout-Based Rashomon Set Exploration for Efficient Predictive Multiplicity Estimationcited by 18
  2. 2025Systemizing Multiplicity: The Curious Case of Arbitrariness in Machine Learningcited by 17
  3. 2024Predictive Churn with the Set of Good Modelscited by 15
  4. 2023The Inadequacy of Similarity-based Privacy Metrics: Privacy Attacks against "Truly Anonymous" Synthetic Datasetscited by 14
  5. 2025Rashomon Sets for Prototypical-Part Networks: Editing Interpretable Models in Real-Timecited by 13
  6. 2024Algorithmic Arbitrariness in Content Moderationcited by 12
  7. 2025Unifying Re-Identification, Attribute Inference, and Data Reconstruction Risks in Differential Privacycited by 11
  8. 2025Mitigating Unintended Memorization with LoRA in Federated Learning for LLMscited by 6
  9. 2023Arbitrariness Lies Beyond the Fairness-Accuracy Frontiercited by 5
  10. 2024The Cost of Arbitrariness for Individuals: Examining the Legal and Technical Challenges of Model Multiplicitycited by 4
  11. 2026The Unseen Threat: Residual Knowledge in Machine Unlearning under Perturbed Samplescited by 4
  12. 2023When Synthetic Data Met Regulationcited by 3
7 more
  1. 2026Using predictive multiplicity to measure individual performance within the AI Actcited by 2
  2. 2025Regretful Decisions under Label Noisecited by 1
  3. 2026Rethinking Anonymity Claims in Synthetic Data Generation: A Model-Centric Privacy Attack Perspectivecited by 1
  4. 2024On the Impact of Output Perturbation on Fairness in Binary Linear Classificationcited by 0
  5. 2025On Arbitrary Predictions from Equally Valid Modelscited by 0
  6. 2025The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learningcited by 0
  7. 2026Rashomon Sets and Model Multiplicity in Federated Learningcited by 0