Manzil Zaheer, Sashank Reddi, Honglin Yuan
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Federated Learning (FL) is a distributed learning paradigm that scales on-device learning collaboratively and privately. Standard FL algorithms such as FedAvg are primarily geared towards smooth unconstrained settings. In this paper, we study the Federated Composite Optimization (FCO) problem, in which the loss function contains a non-smooth regularizer. Such problems arise naturally in FL applications that involve sparsity, low-rank, monotonicity, or more general constraints. We first show that straightforward extensions of primal algorithms such as FedAvg are not well-suited for FCO since they suffer from the "curse of primal averaging," resulting in poor convergence. As a solution, we propose a new primal-dual algorithm, Federated Dual Averaging (FedDualAvg), which by employing a novel server dual averaging procedure circumvents the curse of primal averaging. Our theoretical analysis and empirical experiments demonstrate that FedDualAvg outperforms the other baselines. * Based on work performed at Google Research.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2011.08474")
get_code_for_paper("2011.08474")
have("2011.08474")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2011.08474.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2011.08474)
Connect an agent — have() is free.