<p>Most stochastic gradient tracking (GT) methods adopt pre-scheduled stepsize rules, while a few recent works studied adaptive stepsizes that attempt to respond to the problem’s local landscape. These methods are typically built upon the problem’s global smoothness constant in both analysis and implementation, even for the adaptive ones. On the one hand, for many problems the local smoothness constant may vary drastically across the domain, and sometimes even unbounded, using the global upper bound of the local constants is too conservative. On the other hand, drastic stepsize changes can cause difficulties in the analysis of convergence and consensus of distributed algorithms, making the direct use of local smoothness constants risky and theoretically challenging. In this paper, we propose a <i>Relative Uniform Continuity</i> (RUC) regularity condition for the local smoothness constant as a function of sets. The RUC condition covers most common growth functions for local smoothness constant, ranging from constant and logarithmic to polynomial and even exponential. For RUC-regular distributed optimization problems with finite-sum structure, we derive a clipped gradient tracking method with staggered variance reduction, which only relies on the local smoothness of objective functions, and an <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$\mathcal {O}(\sum _in_i^{1.5}+n_i^{0.5}\epsilon ^{-1})$</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <msub> <mo>∑</mo> <mi>i</mi> </msub> <msubsup> <mi>n</mi> <mi>i</mi> <mrow> <mn>1.5</mn> </mrow> </msubsup> <mo>+</mo> <msubsup> <mi>n</mi> <mi>i</mi> <mrow> <mn>0.5</mn> </mrow> </msubsup> <msup> <mi>ϵ</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> complexity has been established for our algorithm.</p>

Clipped Stochastic Gradient Tracking For Locally Smooth Functions

期刊论文
发表日期：

2026年6月25日

查看全文

Leilei Mei,
Junyu Zhang

摘要

Most stochastic gradient tracking (GT) methods adopt pre-scheduled stepsize rules, while a few recent works studied adaptive stepsizes that attempt to respond to the problem’s local landscape. These methods are typically built upon the problem’s global smoothness constant in both analysis and implementation, even for the adaptive ones. On the one hand, for many problems the local smoothness constant may vary drastically across the domain, and sometimes even unbounded, using the global upper bound of the local constants is too conservative. On the other hand, drastic stepsize changes can cause difficulties in the analysis of convergence and consensus of distributed algorithms, making the direct use of local smoothness constants risky and theoretically challenging. In this paper, we propose a Relative Uniform Continuity (RUC) regularity condition for the local smoothness constant as a function of sets. The RUC condition covers most common growth functions for local smoothness constant, ranging from constant and logarithmic to polynomial and even exponential. For RUC-regular distributed optimization problems with finite-sum structure, we derive a clipped gradient tracking method with staggered variance reduction, which only relies on the local smoothness of objective functions, and an $\mathcal {O}(\sum _in_i^{1.5}+n_i^{0.5}\epsilon ^{-1})$ $O (\sum_{i} n_{i}^{1.5} + n_{i}^{0.5} ϵ^{- 1})$ complexity has been established for our algorithm.