arXiv:2609.21057v1 Announce Type: new
Abstract: Federated learning (FL) enables collaborative model training without sharing raw data, but its performance degrades under non-IID data and stochastic c...
By Herlock Rahimi, Dionysis Kalogerias
arXiv:2607. 12763v1 Announce Type: cross Abstract: Federated Reinforcement Learning (FedRL) enables coordination of distributed energy resources without sharing raw local data, but standard aggregation methods such as FedAvg do not account for system-level constraints, often leading to unsafe global behavior.
By Usman Haider, Karl Mason
The paper introduces the first federated algorithm for Targeted Maximum Likelihood Estimation (TMLE), enabling hospitals, banks, or registries to perform TMLE without sharing individual data. Two frameworks—FedTMLE‑G, which aggregates local gradients, and FedTMLE‑L, which allows each institution to complete its own fluctuation fit—are presented, along with a finite‑precision communication protocol that keeps numerical targeting error negligible. The authors also discuss privacy implications, convergence bounds, and trade‑offs between institutional influence and sampling variability.
By Diyang Li, Fei Wang, Kyra Gan
The paper investigates the trade‑off between the costs of participating in federated learning (privacy, communication, compute) and the potential gains in model performance, framing this as a game‑theoretic problem of individual rationality versus autarky. It shows that clients can remain below their local‑training baseline for many rounds and that simply capping per‑round contributions harms learning. The authors propose a new mechanism that provides short‑term participation guarantees and personalized model evaluation, demonstrating theoretically and empirically that clients can avoid short‑term losses without significantly harming overall performance, even under moderate heterogeneity.
By Amin Meghrazi, Srinivasan Parthasarathy, Andrew Perrault
The paper proposes a new federated learning approach called FedALS that reduces communication costs by varying aggregation frequencies across model layers. It derives tighter generalization bounds for one‑round and multi‑round federated learning, linking these bounds to local updates and data heterogeneity. Based on representation‑learning insights, the authors argue that infrequent aggregation of early layers and more frequent aggregation of final layers yields more generalizable models, especially in non‑iid settings, and demonstrate the method’s effectiveness experimentally.
By Peyman Gholami, Hulya Seferoglu
The paper investigates how a single pooled contract offered by an aggregator to heterogeneous smallholder farmers can be designed to maximize profit while addressing private adoption costs and unobserved effort over multiple seasons. Using a POMDP framework and reinforcement learning, the authors find that profit‑maximizing contracts disproportionately favor large farms, achieving 87.7% of possible adoption on large farms versus only 8.2% on smallholdings, largely due to higher measurement, reporting, and verification costs on smaller plots. The study suggests that adjusting MRV cost structures could reduce this disparity and help scale carbon farming to smallholders.
By Rishi Bharadwaj, Yadati Narahari