Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An efficient framework for clustered federated learning
We address the problem of Federated Learning (FL) where users are distributed and
partitioned into clusters. This setup captures settings where different groups of users have …
partitioned into clusters. This setup captures settings where different groups of users have …
Advancements in federated learning: Models, methods, and privacy
H Chen, H Wang, Q Long, D **, Y Li - ACM Computing Surveys, 2024 - dl.acm.org
Federated learning (FL) is a promising technique for resolving the rising privacy and security
concerns. Its main ingredient is to cooperatively learn the model among the distributed …
concerns. Its main ingredient is to cooperatively learn the model among the distributed …
An efficient framework for clustered federated learning
We address the problem of federated learning (FL) where users are distributed and
partitioned into clusters. This setup captures settings where different groups of users have …
partitioned into clusters. This setup captures settings where different groups of users have …
Exploiting heterogeneity in robust federated best-arm identification
We study a federated variant of the best-arm identification problem in stochastic multi-armed
bandits: a set of clients, each of whom can sample only a subset of the arms, collaborate via …
bandits: a set of clients, each of whom can sample only a subset of the arms, collaborate via …
Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differences
G Malinovsky, P Richtárik, S Horváth… - arxiv preprint arxiv …, 2023 - arxiv.org
Distributed learning has emerged as a leading paradigm for training large machine learning
models. However, in real-world scenarios, participants may be unreliable or malicious …
models. However, in real-world scenarios, participants may be unreliable or malicious …
Communication compression for byzantine robust learning: New efficient algorithms and improved rates
Byzantine robustness is an essential feature of algorithms for certain distributed optimization
problems, typically encountered in collaborative/federated learning. These problems are …
problems, typically encountered in collaborative/federated learning. These problems are …
Distributed Newton-type methods with communication compression and Bernoulli aggregation
Despite their high computation and communication costs, Newton-type methods remain an
appealing option for distributed training due to their robustness against ill-conditioned …
appealing option for distributed training due to their robustness against ill-conditioned …
Collaborative linear bandits with adversarial agents: Near-optimal regret bounds
We consider a linear stochastic bandit problem involving $ M $ agents that can collaborate
via a central server to minimize regret. A fraction $\alpha $ of these agents are adversarial …
via a central server to minimize regret. A fraction $\alpha $ of these agents are adversarial …