Researcher:
Lodhi, Ahnaf Hannan

Profile Picture
ORCID

Job Title

PhD Student

First Name

Ahnaf Hannan

Last Name

Lodhi

Name

Name Variants

Lodhi, Ahnaf Hannan

Email Address

Birth Date

Filters

20221

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.d961cbde-fc0b-4955-87c7-1f5d7f64dbbd

Search Results

Now showing 1 - 1 of 1
  • Placeholder
    PublicationMetadata only
    FLAGS framework for comparative analysis of federated learning algorithms
    (Elsevier, 2022) N/A; N/A; Department of Computer Engineering; Department of Computer Engineering; Lodhi, Ahnaf Hannan; Akgün, Barış; Özkasap, Öznur; PhD Student; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; 258784; 113507
    Federated Learning (FL) has become a key choice for distributed machine learning. Initially focused on centralized aggregation, recent works in FL have emphasized greater decentralization to adapt to the highly heterogeneous network edge. Among these, Hierarchical, Device-to-Device and Gossip Federated Learning (HFL, D2DFL & GFL respectively) can be considered as foundational FL algorithms employing fundamental aggregation strategies. A number of FL algorithms were subsequently proposed employing multiple fundamental aggregation schemes jointly. Existing research, however, subjects the FL algorithms to varied conditions and gauges the performance of these algorithms mainly against Federated Averaging (FedAvg) only. This work consolidates the FL landscape and offers an objective analysis of the major FL algorithms through a comprehensive cross-evaluation for a wide range of operating conditions. In addition to the three foundational FL algorithms, this work also analyzes six derived algorithms. To enable a uniform assessment, a multi-FL framework named FLAGS: Federated Learning AlGorithms Simulation has been developed for rapid configuration of multiple FL algorithms. Our experiments indicate that fully decentralized FL algorithms achieve comparable accuracy under multiple operating conditions, including asynchronous aggregation and the presence of stragglers. Furthermore, decentralized FL can also operate in noisy environments and with a comparably higher local update rate. However, the impact of extremely skewed data distributions on decentralized FL is much more adverse than on centralized variants. The results indicate that it may not be necessary to restrict the devices to a single FL algorithm; rather, multi-FL nodes may operate with greater efficiency.