Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/184105
Title: Towards robust federated learning
Authors: Lim, Jonathan Jun Wei
Keywords: Computer and Information Science
Issue Date: 2025
Publisher: Nanyang Technological University
Source: Lim, J. J. W. (2025). Towards robust federated learning. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/184105
Project: CCDS24-0089
Abstract: The proliferation of IoT and edge computing has accelerated the adoption of Federated Learning (FL) as a privacy-preserving framework for collaborative model training. However, FL systems remain vulnerable to Byzantine attacks, where malicious participants disrupt learning through data poisoning or corrupted model updates. This project explores the integration of Large Language Models (LLMs) into FL to enhance Byzantine fault tolerance. Leveraging LLMs' contextual understanding and analytical capabilities, we aim to improve model robustness against adversarial behaviors while preserving performance. Our work includes a comprehensive analysis of Byzantine attack strategies and the design and evaluation of LLM-augmented defense mechanisms. Through rigorous experimentation on deep learning tasks in resource-constrained environments, we investigate the trade-offs between robustness, scalability, and model accuracy. The findings contribute to the development of a secure and resilient FL framework, opening pathways for the reliable deployment of LLMs in distributed, privacy-sensitive applications.
URI: https://hdl.handle.net/10356/184105
Schools: College of Computing and Data Science 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:CCDS Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
JonathanLimJw_FinalYearReport.pdf
  Restricted Access
2.1 MBAdobe PDFView/Open

Page view(s)

65
Updated on May 7, 2025

Download(s)

11
Updated on May 7, 2025

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.