arXiv:2605. 19813v2 Announce Type: replace Abstract: Federated differentially private protocols can communicate over many adaptive rounds and reuse each client's local samples.
arXiv:2603. 19703v2 Announce Type: replace-cross Abstract: Estimating covariance matrices is fundamental to a wide range of statistical applications.
arXiv:2603. 19040v2 Announce Type: replace Abstract: Differentially private wireless federated learning (DPWFL) is a promising framework for protecting sensitive user data.
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.
arXiv:2606. 00426v1 Announce Type: new Abstract: Federated continual learning (FCL) lets distributed clients adapt language-model heads to evolving NLP tasks without sharing raw text.
arXiv:2607. 29675v1 Announce Type: cross Abstract: Density modes provide a localized and interpretable summary of multimodal distributions, but their estimation under rigorous differential privacy constraints remains largely unexplored.
arXiv:2411.16478v3 Announce Type: replace Abstract: Measuring distribution drifts is a key task in managing distributed, sensitive data, as it underpins a wide range of federated learning and analyti...
The paper introduces Fed‑LSVI, a federated online reinforcement learning algorithm that uses linear function approximation in episodic Markov decision processes. It achieves a regret bound of ≥O(√{Md^3H^4T}) while only exchanging compressed sufficient statistics, thereby meeting privacy constraints. The method reduces communication cost to logarithmic in the number of episodes, a marked improvement over previous approaches that required linear communication.
SPADE-DFL is a communication‑efficient decentralized federated learning algorithm that uses a primal–dual method to allow the number of local function‑value updates between neighbor exchanges to increase with the computation budget while maintaining non‑private convergence rates. For smooth nonconvex objectives, it achieves a time‑averaged stationarity and consensus bound of ≠O(T−1/3) with only ≠Theta(T−2/3) communication rounds, where T is the number of local updates per client. The method also supports client‑level differential privacy by isolating data‑dependent increments, proving privacy for the full interactive transcript and quantifying the resulting optimization error, and demonstrates higher mean test accuracy than existing decentralized learning methods on four classification tasks.
arXiv:2609.14778v1 Announce Type: new Abstract: We propose a decentralized privacy-preserving learning algorithm in which each agent holds a single private sample and a shared model. Samples are lear...
arXiv:2602. 01607v3 Announce Type: replace-cross Abstract: Differentially private synthetic data enables the sharing and analysis of sensitive datasets while providing rigorous privacy guarantees for individual contributors.
arXiv:2606. 02563v1 Announce Type: new Abstract: Heterogeneous Differential Privacy (HDP) in Federated Learning (FL) allows clients to select individual privacy budgets ($\varepsilon_i$) according to institutional policies and data sensitivity.
arXiv:2609.22642v1 Announce Type: cross Abstract: We develop inference for manifold-valued population minimizers when each observation belongs to a different participant and only locally private mess...