Open Problems

Federated Learning

Client-Scalable Federated Learning Under Severe Data Partitioning and Heterogeneity

Effect to explainOpen
Strong candidate · 5/5 runs9 papers report this67% from 2025+

Generated automatically from the limitations stated in 9 papers (ICML, ICLR, NeurIPS), listed under Evidence. It is not a paper, and it does not come from papers submitted to CSPaper.

The problem

Federated learning algorithms consistently exhibit severe accuracy collapses when the client population scales from small toy cohorts (5–10 clients) to realistic deployments (30–100+ clients). As the client count increases for a fixed dataset, each client receives fewer training samples while cross-client data heterogeneity and gradient conflict intensify, causing standard aggregation operators to produce destructive model updates. This scaling wall structurally limits federated systems from deploying in environments where data is naturally fragmented across large numbers of low-volume edge devices. Current literature masks this limitation by evaluating primarily on small, well-provisioned client counts where local sample sizes remain artificially high.

Why it matters

Enables federated learning systems to scale to hundreds of decentralized, low-sample participants without suffering performance collapse, eliminating the need to artificially restrict federation size or downscale local model architectures.

Ways to approach it

Prior-work checks are free with an account. Results someone already ran are shown to everyone.

  1. 1

    Controlled Scaling Diagnostic & Gradient Conflict Analysis: Construct an empirical testbed evaluating standard FL algorithms (FedAvg, FedProx, SCAFFOLD) across client scales ($K \in \{5, 10, 20, 50, 100, 200\}$) across vision and language benchmarks; measure gradient cosine similarity distributions, local drift norms, and effective rank of aggregated updates to pinpoint the exact transition point where aggregation fails.

  2. 2

    Subspace Projection and Conflict-Aware Aggregation: Implement a server-side aggregation mechanism that projects client updates into common gradient subspaces and downweights orthogonal or opposing directional updates from data-starved clients; evaluate validation accuracy and round-to-convergence as $K$ increases from 5 to 100.

  3. 3

    Adaptive Representation Anchoring: Implement a prototype-regularized local objective where clients align feature representations to globally shared anchor points to prevent local models with small sample sizes from overfitting to spurious local features; measure test accuracy across Dirichlet non-IID partitions at $K=80$ and $K=100$.

Have a different approach?

Describe how you would tackle this problem and we'll look for papers that already do it. Free; your text stays private.

Free · 3 checks per day

Why it might fail

If the performance collapse is fundamentally driven by an information-theoretic sample-complexity floor—where local clients have too few examples to produce any valid local gradient direction under extreme non-IID splits—server-side aggregation techniques will fail without introducing auxiliary shared public data or client clustering.

Evidence

Each paper's own statement of the limitation, verbatim.

Show all 9 papers

Nearest existing work

Related open problems

Generated automatically, not curated by hand. Automated prior-work checks catch about a third of existing work, so treat this problem as a lead to investigate.