GT-SAGA and GT-SVRG (Decentralized Variance-Reduced Gradient Tracking)
Algorithms AIMech:GtSagaAndGtSvrgDecentralizedVarianceReducedGradientTracking DRAFT
Aliases: GT-SAGA and GT-SVRG, GT-SAGA, GT-SVRG, Decentralized Variance-Reduced Gradient Tracking
A unified decentralized finite-sum stochastic optimization framework (GT-VR, Xin, Khan, & Kar 2020, Sections II-III, Algorithms 1-2) for minimizing F(x) = (1/n) sum_{i=1}^n (1/m_i) sum_{j=1}^{m_i} f_{i,j}(x) over a primitive doubly stochastic network W that couples local variance-reduced gradient estimators r_i^k with dynamic gradient tracking x_i^{k+1} = sum_j w_{ij} x_j^k - alpha y_i^k and y_i^{k+1} = sum_j w_{ij} y_j^k + r_i^{k+1} - r_i^k: GT-SAGA (Algorithm 1) computes g_i^k = nabla f_{i,s_i^k}(x_i^k) - nabla f_{i,s_i^k}(z_{i,s_i^k}^k) + (1/m_i) sum_j nabla f_{i,j}(z_{i,j}^k) from a local gradient table, while GT-SVRG (Algorithm 2) computes v_i^k = nabla f_{i,s_i^k}(x_i^k) - nabla f_{i,s_i^k}(tau_i^k) + nabla f_i(tau_i^k) relative to periodic local checkpoints tau_i^k = x_i^{t T}.
Identity Notes & Concept Scope
Distinct from DSGT and GSGT (AIMech:DsgtAndGsgtDistributedStochasticGradientTracking, Pu & Nedic 2021), which use unreduced stochastic gradients G_i(x_{i,k}, xi_{i,k}) and suffer an O(alpha sigma^2 / n) steady-state variance neighborhood under constant step size, and from centralized SAGA (AIMech:SagaFastIncrementalGradientMethodWithSupportForNonStronglyConvexCompositeObjectives, Defazio et al. 2014) and SVRG (AIMech:StochasticVarianceReducedGradient, Johnson & Zhang 2013), which operate on a single shared parameter vector without decentralized consensus or inter-node gradient tracking.
Claims & Grounded Evidence
4 Claims
Mechanism
#r436-simultaneous-elimination-of-local-variance-and-network-heterogeneity
Whereas decentralized SGD under constant step size alpha converges only to an error ball proportional to both intra-node sample variance nu^2 and inter-node gradient heterogeneity zeta^2 = (1/n) sum_{i=1}^n ||nabla f_i(x^*)||^2 (Eq. 2), coupling local SAGA/SVRG estimators (which drive intra-node variance to zero as x_i^k -> x^*, Lemmas 3-4) with gradient tracking y_i^k (which preserves bar_y^k = bar_r^k and eliminates zeta^2) achieves exact global Q-linear convergence to x^* without any neighborhood floor (Theorems 1-2).
Mechanism
#r436-complexity-bounds-and-big-data-network-independent-linear-speedup
For L-smooth mu-strongly convex functions with condition number Q = L / mu, spectral gap 1 - sigma of W, M = max_i m_i, and m = min_i m_i, GT-SAGA (Theorem 1) achieves epsilon-accuracy in O(max{M, (M/m) Q^2 (1 - sigma)^{-2}} log(1/epsilon)) component gradient evaluations and communication rounds, while GT-SVRG (Theorem 2) with inner loop T = O(Q^2 (1 - sigma)^{-2} log Q) achieves O((M + Q^2 (1 - sigma)^{-2} log Q) log(1/epsilon)) component gradients and O(Q^2 (1 - sigma)^{-2} log Q log(1/epsilon)) communications; in the big-data regime m ~ M >> Q^2 (1 - sigma)^{-2}, both attain network-independent O(M log(1/epsilon)) complexity, yielding an exact 1/n linear speedup over centralized SAGA/SVRG (Remark 1, Table I).
Limitation
#r436-storage-versus-synchronization-tradeoff-limitation
GT-SAGA requires O(p m_i) local memory at each node i to store all m_i component gradients, whereas GT-SVRG avoids O(p m_i) storage (using O(p) memory) but requires synchronized periodic full-batch gradient evaluations nabla f_i(x_i^{t T}) every T iterations (Remark 2).
Application
#r436-decentralized-logistic-regression-on-real-benchmark-datasets-application
Applied to decentralized l_2-regularized logistic regression across undirected exponential, grid, and random geometric graphs on CIFAR-10, MNIST, a9a, and w8a.
⚠️ Curated Limitations & Negative Results
- GT-SAGA requires O(p m_i) memory per node to store the component gradient table.
- GT-SVRG requires periodic full local gradient evaluations every T inner iterations.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:FederatedLearning
Federated Learning
|
related_match | GT-SAGA and GT-SVRG unify decentralized gradient tracking with finite-sum variance reduction over peer-to-peer networks. |
AIO:LogisticRegression
Logistic Regression
|
related_match | Evaluated on decentralized regularized logistic classification. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r436-primary-pdf
|
Ran Xin, Usman A. Khan, Soummya Kar
|
primary paper
full_text
|
ID: https://doi.org/10.1109/TSP.2020.3031071
sha256:1f3942598b0c…
|
r436-arxiv-abs
|
Variance-Reduced Decentralized Stochastic Optimization With Accelerated Convergence (arXiv abstract)
Ran Xin, Usman A. Khan, Soummya Kar
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/1912.04230
sha256:2ce8fd75c192…
|
r436-metadata-cr
|
Ran Xin, Usman A. Khan, Soummya Kar
|
primary paper
abstract_only
|
ID: https://doi.org/10.1109/TSP.2020.3031071
sha256:a25637a9e060…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T08:39:00Z
Updated: 2026-10-19T08:39:00Z
Explore across X-Mech
Related computational & biological Mechs:
Embedding Map
Network Graph
ProteinTraitsMech (ESM-2 pLM)
DUFMech (Domain pLM)
TraitMech
CultureMech
All 14 X-Mech Repositories