<?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>Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis</title></titleInfo>

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

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


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

<name type="personal">
  <namePart type="given">Ruichen</namePart>
  <namePart type="family">Luo</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">b391db08-1ffe-11ee-8b67-d18ddcfb5a14</identifier></name>
<name type="personal">
  <namePart type="given">Sebastian U.</namePart>
  <namePart type="family">Stich</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Samuel</namePart>
  <namePart type="family">Horváth</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Martin</namePart>
  <namePart type="family">Takáč</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







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



<name type="conference">
  <namePart>AISTATS: Conference on Artificial Intelligence and Statistics</namePart>
</name>



<name type="corporate">
  <namePart>Formal Methods for Stochastic Models: Algorithms and Applications</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">LocalSGD and SCAFFOLD are widely used methods in distributed stochastic optimization, with numerous applications in machine learning, large-scale data processing, and federated learning. However, rigorously establishing their theoretical advantages over simpler methods, such as minibatch SGD (MbSGD), has proven challenging, as existing analyses often rely on strong assumptions, unrealistic premises, or overly restrictive scenarios.

In this work, we revisit the convergence properties of LocalSGD and SCAFFOLD under a variety of existing or weaker conditions, including gradient similarity, Hessian similarity, weak convexity, and Lipschitz continuity of the Hessian. Our analysis shows that (i) LocalSGD achieves faster convergence compared to MbSGD for weakly convex functions without requiring stronger gradient similarity assumptions; (ii) LocalSGD benefits significantly from higher-order similarity and smoothness; and (iii) SCAFFOLD demonstrates faster convergence than MbSGD for a broader class of non-quadratic functions. These theoretical insights provide a clearer understanding of the conditions under which LocalSGD and SCAFFOLD outperform MbSGD.</abstract>

<originInfo><publisher>ML Research Press</publisher><dateIssued encoding="w3cdtf">2025</dateIssued><place><placeTerm type="text">Mai Khao, Thailand</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>The 28th International Conference on Artificial Intelligence and Statistics</title></titleInfo>
  <identifier type="eIssn">2640-3498</identifier>
  <identifier type="arXiv">2501.04443</identifier>
<part><detail type="volume"><number>258</number></detail><extent unit="pages">2539-2547</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ama>Luo R, Stich SU, Horváth S, Takáč M. Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In: &lt;i&gt;The 28th International Conference on Artificial Intelligence and Statistics&lt;/i&gt;. Vol 258. ML Research Press; 2025:2539-2547.</ama>
<ieee>R. Luo, S. U. Stich, S. Horváth, and M. Takáč, “Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis,” in &lt;i&gt;The 28th International Conference on Artificial Intelligence and Statistics&lt;/i&gt;, Mai Khao, Thailand, 2025, vol. 258, pp. 2539–2547.</ieee>
<chicago>Luo, Ruichen, Sebastian U. Stich, Samuel Horváth, and Martin Takáč. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” In &lt;i&gt;The 28th International Conference on Artificial Intelligence and Statistics&lt;/i&gt;, 258:2539–47. ML Research Press, 2025.</chicago>
<mla>Luo, Ruichen, et al. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” &lt;i&gt;The 28th International Conference on Artificial Intelligence and Statistics&lt;/i&gt;, vol. 258, ML Research Press, 2025, pp. 2539–47.</mla>
<apa>Luo, R., Stich, S. U., Horváth, S., &amp;#38; Takáč, M. (2025). Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In &lt;i&gt;The 28th International Conference on Artificial Intelligence and Statistics&lt;/i&gt; (Vol. 258, pp. 2539–2547). Mai Khao, Thailand: ML Research Press.</apa>
<ista>Luo R, Stich SU, Horváth S, Takáč M. 2025. Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 2539–2547.</ista>
<short>R. Luo, S.U. Stich, S. Horváth, M. Takáč, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 2539–2547.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>20302</recordIdentifier><recordCreationDate encoding="w3cdtf">2025-09-07T22:01:35Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-09T07:17:08Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
