atlas

Research map / Federated learning and privacy / Communication-efficient FL

Pursuing Overall Welfare in Federated Learning through Sequential Decision Making

ICML 2024 · Federated learning and privacy › Communication-efficient FL · approach: Communication-efficient heterogeneous FL · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Unifies existing fairness-aware adaptive aggregation methods for federated learning as online convex optimization (OCO) and proposes AAggFF, with cross-silo (ONS-based) and cross-device (entropic FTRL with doubly robust estimation) variants that achieve sublinear regret and better client-level fairness.

Problem

Single global models in federated learning perform unequally across clients; existing adaptive aggregation schemes that reweight client updates for client-level fairness are suboptimal as sequential decision making and are poorly suited when only a few local signals per round are observed.

Approach

Cast the server's mixing-coefficient update as an online portfolio selection / OCO problem with negative log-growth decision loss, replace static/stateless weights with FTRL-style stateful updates, bound responses via a CDF transform for Lipschitzness, and use a doubly robust estimator under client sampling for the cross-device setting.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use AAggFF-S adaptive aggregation instead of the strongest shown baselineCross-silo FL · BerkaWorst AUROC: 49.44 -> 52.08Helped
Use AAggFF-S adaptive aggregation instead of the strongest shown baselineCross-silo FL · BerkaGini: 10.47 -> 10.16Helped
Use AAggFF-S adaptive aggregation instead of the strongest shown baselineCross-silo FL · MQPWorst AUROC: 41.71 -> 41.79Helped
Use AAggFF-S adaptive aggregation instead of the strongest shown baselineCross-silo FL · MQPGini: 8.56 -> 8.38Helped
Use AAggFF-S adaptive aggregation instead of the strongest shown baselineCross-silo FL · ISICWorst Acc. 5: 77.32 -> 85.17Helped
Use AAggFF-S adaptive aggregation instead of the strongest shown baselineCross-silo FL · ISICGini: 3.77 -> 2.52Helped
Use AAggFF-D adaptive aggregation instead of the strongest shown baselineCross-device FL · CelebAWorst 10% Acc. 1: 55.76 -> 56.71Helped
Use AAggFF-D adaptive aggregation instead of the strongest shown baselineCross-device FL · CelebAGini: 7.82 -> 7.54Helped
Use AAggFF-D adaptive aggregation instead of the strongest shown baselineCross-device FL · RedditWorst 10% Acc. 1: 2.35 -> 4.75Helped
Use AAggFF-D adaptive aggregation instead of the strongest shown baselineCross-device FL · RedditGini: 23.34 -> 22.59Helped
Use AAggFF-D adaptive aggregation instead of the strongest shown baselineCross-device FL · SpeechCommandsWorst 10% Acc. 5: 5.98 -> 14.54Helped
Use AAggFF-D adaptive aggregation instead of the strongest shown baselineCross-device FL · SpeechCommandsGini: 23.16 -> 21.42Helped

Surprising findings

Limitations

Experimental setup

Datasets: Berka MQP ISIC CelebA Reddit SpeechCommands Heart TinyImageNet

Benchmarks: Berka MQP ISIC CelebA Reddit SpeechCommands Heart TinyImageNet

Metrics: average performance worst 10% best 10% Gini coefficient accuracy parity gap

Baselines: FedAvg AFL q-FedAvg TERM FedMGDA PropFair FedProx FedAdam FedAdagrad FedYogi

Builds on: FedAvg q-FedAvg TERM PropFair Online Newton Step Exponentiated Gradient

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy