<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Learning rate scheduling with matrix factorization for private training</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LIPIcs</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Nikita</namePart>
  <namePart type="family">Kalinin</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">4b14526e-14d2-11ed-ba64-c14c9553d137</identifier></name>
<name type="personal">
  <namePart type="given">Joel D</namePart>
  <namePart type="family">Andersson</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">4a893819-d954-11f0-89b1-e360bad9ccc5</identifier></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">ChLa</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">GradSch</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MoHe</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>FORC: Symposium on Foundations of Responsible Computing</namePart>
</name>



<name type="corporate">
  <namePart>The design and evaluation of modern fully dynamic data structures</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">We study differentially private model training with stochastic gradient descent under learning rate scheduling and correlated noise. Although correlated noise, in particular via matrix factorizations, has been shown to improve accuracy, prior theoretical work focused primarily on the prefix-sum workload. That workload assumes a constant learning rate, whereas in practice learning rate schedules are widely used to accelerate training and improve convergence. We close this gap by deriving general upper and lower bounds for a broad class of learning rate schedules in both single- and multi-epoch settings. Building on these results, we propose a learning-rate-aware factorization that achieves improvements over prefix-sum factorizations under both MaxSE and MeanSE error metrics. Our theoretical analysis yields memory-efficient constructions suitable for practical deployment, and experiments on CIFAR-10 and IMDB datasets confirm that schedule-aware factorizations improve accuracy in private training.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2026_LIPIcsFORC_Kalinin.pdf">https://research-explorer.ista.ac.at/download/22146/22149/2026_LIPIcsFORC_Kalinin.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisher><dateIssued encoding="w3cdtf">2026</dateIssued><place><placeTerm type="text">Cambridge, MA; United States</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>

<subject><topic>differential privacy</topic><topic>machine learning</topic><topic>matrix factorization</topic>
</subject>


<relatedItem type="host"><titleInfo><title>7th Symposium on Foundations of Responsible Computing</title></titleInfo>
  <identifier type="eIssn">1868-8969</identifier>
  <identifier type="isbn">9783959774192</identifier>
  <identifier type="arXiv">2511.17994</identifier><identifier type="doi">10.4230/LIPIcs.FORC.2026.2</identifier>
<part><detail type="volume"><number>368</number></detail>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<short>N. Kalinin, J.D. Andersson, in:, 7th Symposium on Foundations of Responsible Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.</short>
<mla>Kalinin, Nikita, and Joel D. Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” &lt;i&gt;7th Symposium on Foundations of Responsible Computing&lt;/i&gt;, vol. 368, 2:1-2:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.FORC.2026.2&quot;&gt;10.4230/LIPIcs.FORC.2026.2&lt;/a&gt;.</mla>
<ama>Kalinin N, Andersson JD. Learning rate scheduling with matrix factorization for private training. In: &lt;i&gt;7th Symposium on Foundations of Responsible Computing&lt;/i&gt;. Vol 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.FORC.2026.2&quot;&gt;10.4230/LIPIcs.FORC.2026.2&lt;/a&gt;</ama>
<ieee>N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization for private training,” in &lt;i&gt;7th Symposium on Foundations of Responsible Computing&lt;/i&gt;, Cambridge, MA; United States, 2026, vol. 368.</ieee>
<chicago>Kalinin, Nikita, and Joel D Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” In &lt;i&gt;7th Symposium on Foundations of Responsible Computing&lt;/i&gt;, Vol. 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.FORC.2026.2&quot;&gt;https://doi.org/10.4230/LIPIcs.FORC.2026.2&lt;/a&gt;.</chicago>
<apa>Kalinin, N., &amp;#38; Andersson, J. D. (2026). Learning rate scheduling with matrix factorization for private training. In &lt;i&gt;7th Symposium on Foundations of Responsible Computing&lt;/i&gt; (Vol. 368). Cambridge, MA; United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.FORC.2026.2&quot;&gt;https://doi.org/10.4230/LIPIcs.FORC.2026.2&lt;/a&gt;</apa>
<ista>Kalinin N, Andersson JD. 2026. Learning rate scheduling with matrix factorization for private training. 7th Symposium on Foundations of Responsible Computing. FORC: Symposium on Foundations of Responsible Computing, LIPIcs, vol. 368, 2:1-2:21.</ista>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22146</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-28T22:01:34Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-06-29T06:56:34Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
