In many federated learning (FL) models, a common strategy employed to ensure the progress in the training process, is to wait for at least $M$ clients out of the total $N$ clients to send back their local gradients based on a reporting deadline $T$, once the parameter server (PS) has broadcasted the global model. If enough clients do not report back within the deadline, the particular round is considered to be a failed round and the training round is restarted from scratch. If enough clients have responded back, the round is deemed successful and the local gradients of all the clients that responded back are used to update the global model. In either case, the clients that failed to report back an update within the deadline would have wasted their computational resources. Having a tighter deadline (small $T$) and waiting for a larger number of participating clients (large $M$) leads to a large number of failed rounds and therefore greater communication cost and computation resource wastage. However, having a larger $T$ leads to longer round durations whereas smaller $M$ may lead to noisy gradients. Therefore, there is a need to optimize the parameters $M$ and $T$ such that communication cost and the resource wastage is minimized while having an acceptable convergence rate. In this regard, we show that the average age of a client at the PS appears explicitly in the theoretical convergence bound, and therefore, can be used as a metric to quantify the convergence of the global model. We provide an analytical scheme to select the parameters $M$ and $T$ in this setting.
Federated Recommendation System via Differential Privacy
City University of Hong Kong（香港城市大学）；City University of Hong Kong Shenzhen Research Institute（香港城市大学深圳研究院）；University of California, Los Angeles（加利福尼亚大学洛杉矶分校）
Secure Distributed/Federated Learning: Prediction-Privacy Trade-Off for Multi-Agent System
University of Southern California（南加州大学）
分散学习是一种有效的新兴范式，用于提高多个有界计算代理的计算能力。在大数据时代，在分布式和联邦学习（DL和FL）框架内执行推理，中央服务器需要处理大量数据，同时依赖各种代理执行多个分布式训练任务。考虑到分布式计算的拓扑结构，隐私已经成为一个首要的问题。此外，假设代理的信息处理能力有限，需要一个复杂的\textit{privacy-preserving decentralization}来确保有效的计算。为此，我们研究的\textit{privacy-aware server to multi-agent assignment}问题受到信息处理的限制与每个代理，同时保持隐私和确保学习信息的消息，通过分布式私人联邦学习（DPFL）的方法收到代理全球终端。为了找到一个分散的计划，两个代理系统，我们制定了一个优化问题，平衡隐私和准确性，考虑到与每个代理相关联的压缩约束的质量。我们提出了一个迭代收敛算法交替自洽方程。我们还对所提出的解决方案进行了数值评估，以显示隐私预测的权衡，并证明了新方法在确保DL和FL隐私方面的有效性。
Age Aware Scheduling for Differentially-Private Federated Learning
Institute of Communications Engineering, National Yang Ming Chiao Tung University（国立阳明交通大学通信工程研究所）；Simula UiB（西挪威应用科技大学西蒙研究所）；Department of Communication Engineering, National Taipei University（国立台北大学通信工程学系）
MRI-based and metabolomics-based age scores act synergetically for mortality prediction shown by multi-cohort federated learning
Maastricht University Medical Centre +（马斯特里赫特大学医学中心）；Leiden University Medical Center（莱顿大学医学中心）；Delft University of Technology（代尔夫特理工大学）；Erasmus MC - University Medical Center Rotterdam（伊拉斯姆斯大学医学中心鹿特丹分校）；Leiden University（莱顿大学）
Can One Safety Loop Guard Them All? Agentic Guard Rails for Federated Computing
Division of Cancer Registry of Norway, Norwegian Institute of Public Health, Oslo, Norway（挪威癌症登记处，挪威公共卫生研究所，奥斯陆）；Department of Physics and Technology, The Arctic University of Norway, Tromsø, Norway（挪威极地大学物理与技术系）
Faithful Edge Federated Learning: Scalability and Privacy
Zhejiang University/University of Illinois at Urbana–Champaign Institute（浙江大学伊利诺伊大学厄巴纳-香槟校区联合学院）；Zhejiang University（浙江大学）；Northwestern University（西北大学）
Breaking the Prototype Bias Loop: Confidence-Aware Federated Contrastive Learning for Highly Imbalanced Clients
Key Laboratory of Water Big Data Technology of Ministry of Water Resources, College of Computer Science and Software Engineering, Hohai University, Nanjing, China（水利部水大数据技术重点实验室，计算机科学与软件工程学院，河海大学，南京，中国）；Department of Computer Science, City University of Hong Kong, Hong Kong, China（计算机科学系，香港城市大学，香港，中国）；State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China（新型软件技术国家重点实验室，南京大学，南京，中国）；School of Artificial Intelligence and Information Technology, Nanjing University of Chinese Medicine, Nanjing, China（人工智能与信息技术学院，南京中医药大学，南京，中国）
A Locally Penalized Cross-Estimate Federated Method with Guarantees for Constrained Personalized Learning
Department of Industrial and Systems Engineering, Rutgers University（工业与系统工程系，罗杰斯大学）；Department of Electrical and Computer Engineering, Rutgers University（电气与计算机工程系，罗杰斯大学）
Agentic Trust Coordination for Federated Learning through Adaptive Thresholding and Autonomous Decision Making in Sustainable and Resilient Industrial Networks
London South Bank University（伦敦南岸大学）；Instituto de Telecomunicações（电信研究所）
