TAMUNA Doubly Accelerated Distributed Optimization with Local Training, Compression, and Partial Participation
Algorithms AIMech:TamunaDoublyAcceleratedDistributedOptimizationWithLocalTrainingCompressionAndPartialParticipation DRAFT
Aliases: TAMUNA, TAMUNA Doubly Accelerated Distributed Optimization under Partial Participation, Local Training with Correlated Mask Compression and Partial Participation
A federated and distributed optimization algorithm introduced by Condat, Agarský, Malinovsky, and Richtárik (2023) that simultaneously combines Local Training (LT), Communication Compression (CC), and Partial Client Participation (PP) to minimize f(x) = (1/n) sum_{i=1}^n f_i(x) across n clients without suffering from client drift. In each communication round r, the server broadcasts the global model x_bar^{(r)} to a uniformly sampled cohort Omega^{(r)} subset [n] of size c in {2, ..., n}; active clients perform L^{(r)} ~ Geom(p) drift-corrected local steps x_i^{(r, ell+1)} = x_i^{(r, ell)} - gamma g_i^{(r, ell)} + gamma h_i^{(r)} from x_i^{(r, 0)} = x_bar^{(r)}, apply a correlated column-permuted binary mask compressor C_i^{(r)} that selects exactly s in {2, ..., c} active clients per coordinate j in {1, ..., d}, and the server aggregates x_bar^{(r+1)} = (1/s) sum_{i in Omega^{(r)}} C_i^{(r)}(x_i^{(r, L^{(r)})}) while active clients update their control variates via h_i^{(r+1)} = h_i^{(r)} + (eta/gamma)(C_i^{(r)}(x_bar^{(r+1)}) - C_i^{(r)}(x_i^{(r, L^{(r)})})) and idle clients retain h_i^{(r+1)} = h_i^{(r)}.
Identity Notes & Concept Scope
Distinct from Scaffnew / ProxSkip (which uses uncompressed full-client communication without partial participation or sparsification), distinct from CompressedScaffnew (which requires full client participation c = n), and distinct from Scaffold (which does not achieve O(sqrt(kappa)) accelerated communication complexity or support correlated coordinate-mask compression): TAMUNA unifies CompressedScaffnew and Cohort-Squeeze via an active-cohort correlated permutation mask with sparsity parameter s in {2, ..., c}, preserving the zero-sum control variate invariant sum_{i=1}^n h_i^{(r)} = 0 under partial participation and achieving doubly accelerated communication complexity with respect to both the condition number kappa = L/mu and model dimension d.
Claims & Grounded Evidence
4 Claims
Mechanism
#tamuna-correlated-cohort-mask-and-zero-sum-control-variate-invariant
In each round r, TAMUNA generates a binary mask matrix q^{(r)} in {0,1}^{d x c} across the c active clients Omega^{(r)} by independently permuting a template row containing s in {2, ..., c} ones and c - s zeros for each coordinate j in {1, ..., d}; the resulting compressors C_i^{(r)} satisfy E[||(1/s) sum_{i in Omega} C_i(v_i) - (1/c) sum_{i in Omega} v_i||^2] = ((c - s)/(s(c - 1))) ((1/c) sum_{i in Omega} ||v_i||^2 - ||(1/c) sum_{i in Omega} v_i||^2) (Eq. 8) and ensure that the control variate update h_i^{(r+1)} = h_i^{(r)} + (eta/gamma)(C_i^{(r)}(x_bar^{(r+1)}) - C_i^{(r)}(x_i^{(r, L^{(r)})})) preserves sum_{i=1}^n h_i^{(r)} = 0 for all r >= 0 when initialized with sum_{i=1}^n h_i^{(0)} = 0.
Mechanism
#tamuna-linear-convergence-and-doubly-accelerated-communication-complexity
For L-smooth mu-strongly convex client objectives with exact gradients, setting 0 < gamma < 2/L, 0 < chi <= n(s - 1)/(s(n - 1)), and eta = p chi guarantees that the Lyapunov function Psi^{(r)} := (n/(gamma p)) ||x_bar^{(r)} - x*||^2 + (gamma / (p^2 chi)) ((n - 1)/(s - 1)) sum_{i=1}^n ||h_i^{(r)} - nabla f_i(x*)||^2 contracts at rate E[Psi^{(r)}] <= tau^r Psi^{(0)} with tau = max((1 - gamma mu)^2, (gamma L - 1)^2, 1 - p^2 chi (s - 1)/(n - 1)) < 1 (Theorem 1), yielding doubly accelerated total uplink communication complexity O((sqrt(d) sqrt(kappa) sqrt(n/c) + d sqrt(kappa) sqrt(n)/c + d n / c + sqrt(alpha) d sqrt(kappa) sqrt(n/c)) log(1/epsilon)) floats (Corollary 1).
Scope
#tamuna-stochastic-gradient-variance-reduced-convergence
Under unbiased local stochastic gradients with bounded variance C_i and bounded ABC-type second-moment growth A_i ||nabla f_i(x) - nabla f_i(x*)||^2 + B_i D_{f_i}(x, x*) + C_i (Assumption 2), TAMUNA converges linearly to a variance-proportional neighborhood of x* for constant step size gamma (Theorem 3) and converges to x* with O(1/epsilon) communication complexity via diminishing step sizes or variance reduction.
Limitation
#tamuna-stateful-control-variate-and-shared-seed-mask-limitation
Because every client i in [n] must maintain a stateful control variate h_i^{(r)} in R^d across rounds even when not participating, TAMUNA is applicable to stateful cross-silo or repeat-participation cross-device federated learning rather than purely stateless one-shot client sampling, and requires active clients in Omega^{(r)} to coordinate (e.g. via a shared pseudorandom seed) to generate the row-constrained binary masks with exactly s ones per coordinate.
⚠️ Curated Limitations & Negative Results
- Requires each client i in [n] to store a persistent d-dimensional control variate h_i^{(r)} across rounds, precluding purely stateless one-shot client participation.
- Requires at least c >= 2 participating clients per round and s >= 2 active clients transmitting each coordinate j in {1, ..., d} to preserve the zero-sum control variate invariant.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:FederatedLearning
Federated Learning
|
narrow_match | TAMUNA is a specific federated optimization algorithm that combines local training, correlated coordinate-subsampling uplink compression, and partial client participation with exact client-drift cancellation. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r567-primary-pdf
|
Laurent Condat, Ivan Agarský, Grigory Malinovsky, Peter Richtárik
|
primary paper
full_text
|
ID: https://api.openalex.org/works/W4321471475
sha256:4d9724df872e…
|
r567-arxiv-abs
|
Laurent Condat, Ivan Agarský, Grigory Malinovsky, Peter Richtárik
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2302.09832
sha256:7890784fa3b6…
|
r567-metadata-cr
|
Laurent Condat, Ivan Agarský, Grigory Malinovsky, Peter Richtárik
|
primary paper
abstract_only
|
ID: https://api.openalex.org/works/W4321471475
sha256:205c3ef966f9…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T10:50:00Z
Updated: 2026-10-19T10:50: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