<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>The full version is available at https://arxiv.org/abs/</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Arbitrary Decisions are a Hidden Cost of Diferentially Private Training</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bogdan Kulynych</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hsiang Hsu</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Carmela Troncoso</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Flavio P. Calmon</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Extended Abstract</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2302</year>
      </pub-date>
      <volume>14517</volume>
      <fpage>07</fpage>
      <lpage>09</lpage>
      <abstract>
        <p>Mechanisms used in privacy-preserving machine learning often aim to guarantee diferential 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 diferentially 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.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        2.5 0.0
2.5
settings [
        <xref ref-type="bibr" rid="ref5 ref6 ref7">5, 6, 7</xref>
        ]. Predictive multiplicity can appear due to under-specification and randomness
in the model’s training procedure [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        Predictive multiplicity formalizes the arbitrariness of decisions based on a model’s output.
In practice, predictive multiplicity can lead to questions such as “Why has a model issued
a negative decision on an individual’s loan application if other models with indistinguishable
accuracy would have issued a positive decision? ” or “Why has a model suggested a high dose of a
medicine for an individual if other models with comparable accuracy would have prescribed a lower
dose? ” These examples highlight that acting on predictions of a single model without regard for
predictive multiplicity can result in arbitrary decisions. Models produced by training algorithms
that exhibit high predictive multiplicity face fundamental challenges to their credibility and
justifiability in high-stakes settings [
        <xref ref-type="bibr" rid="ref8 ref9">9, 8</xref>
        ].
      </p>
      <p>In this paper, we demonstrate a fundamental connection between privacy and predictive
multiplicity: For a fixed training dataset and model class, DP training results in models that
ensure the same degree of privacy and achieve comparable accuracy, yet assign conflicting
outputs to individual inputs. DP training produces conflicting models even when non-private
training results in a single optimal model. Thus, in addition to decreased accuracy, DP-ensuring
training methods also incur an arbitrariness cost by exacerbating predictive multiplicity. We
show that the degree of predictive multiplicity varies wildly across individual inputs and can
disproportionately impact certain population groups. Fig. 1 illustrates the predictive-multiplicity
cost of DP training in a simple synthetic example.</p>
      <p>In summary, the level of privacy in DP training significantly impacts the level of predictive
multiplicity. This, in turn, means that decisions supported by diferentially-private models can
have an increased level of arbitrariness: a given decision would have been diferent had we used
a diferent random seed in training, even when all other aspects of training are kept fixed and
the optimal non-private model is unique. Before deploying DP-ensuring models in high-stakes
situations, we suggest that practitioners quantify the predictive multiplicity of these models
over salient populations and—if possible to do so without violating privacy—measure predictive
multiplicity of individual decisions during model operation. Such audits can help practitioners
evaluate whether the increase in privacy threatens the justifiability of decisions, choose whether
to enact a decision based on a model’s output, and determine whether to deploy a model in the
ifrst place.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>C.</given-names>
            <surname>Dwork</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>McSherry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Nissim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <article-title>Calibrating noise to sensitivity in private data analysis</article-title>
          ,
          <source>in: Theory of cryptography conference</source>
          , Springer,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Dwork</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roth</surname>
          </string-name>
          , et al.,
          <article-title>The algorithmic foundations of diferential privacy</article-title>
          .,
          <source>Found. Trends Theor. Comput. Sci</source>
          . (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Chaudhuri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Monteleoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Sarwate</surname>
          </string-name>
          ,
          <article-title>Diferentially private empirical risk minimization</article-title>
          .,
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Abadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chu</surname>
          </string-name>
          , I. Goodfellow, H. B.
          <string-name>
            <surname>McMahan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Mironov</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Talwar</surname>
            ,
            <given-names>L. Zhang,</given-names>
          </string-name>
          <article-title>Deep learning with diferential privacy</article-title>
          ,
          <source>in: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>308</fpage>
          -
          <lpage>318</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Marx</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Calmon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ustun</surname>
          </string-name>
          ,
          <article-title>Predictive multiplicity in classification</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>6765</fpage>
          -
          <lpage>6774</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hsu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. d. P.</given-names>
            <surname>Calmon</surname>
          </string-name>
          ,
          <article-title>Rashomon capacity: A metric for predictive multiplicity in probabilistic classification</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Watson-Daniels</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. C.</given-names>
            <surname>Parkes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ustun</surname>
          </string-name>
          ,
          <article-title>Predictive multiplicity in probabilistic classification</article-title>
          ,
          <source>in: AAAI</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>A. D'Amour</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Heller</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Moldovan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Adlam</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Alipanahi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Beutel</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Deaton</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Eisenstein</surname>
            ,
            <given-names>M. D.</given-names>
          </string-name>
          <string-name>
            <surname>Hofman</surname>
          </string-name>
          , et al.,
          <article-title>Underspecification presents challenges for credibility in modern machine learning</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>E.</given-names>
            <surname>Black</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Barocas</surname>
          </string-name>
          ,
          <article-title>Model multiplicity: Opportunities, concerns, and solutions</article-title>
          , in: 2022 ACM Conference on Fairness, Accountability, and
          <string-name>
            <surname>Transparency</surname>
          </string-name>
          (FAccT),
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>