Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Davide Leo

dblp:399/5513 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › federated learning › personalized federated learning
clustered federated learning
0.912025
Interaction-Aware Gaussian Weighting for Clustered Federated Learning · ICML 2025
Machine learning › Efficient and distributed learning › federated learning
data heterogeneity
0.912025
Interaction-Aware Gaussian Weighting for Clustered Federated Learning · ICML 2025
Machine learning › Efficient and distributed learning
federated learning
0.912025
Interaction-Aware Gaussian Weighting for Clustered Federated Learning · ICML 2025
Data mining › clustering
client clustering
0.912025
Interaction-Aware Gaussian Weighting for Clustered Federated Learning · ICML 2025
Data mining
clustering
0.912025
Interaction-Aware Gaussian Weighting for Clustered Federated Learning · ICML 2025

Methods — techniques the papers use, named apart from their topics

wasserstein distance · 1.7gaussian reward mechanism · 1.7clustering metric · 1.7
YearPublicationVenuePosition
2026 Wavelet Scattering Transform and Fourier Representation for Offline Detection of Malicious Clients in Federated Learning
abstract
Federated Learning (FL) enables the training of machine learning models across decentralized clients while preserving data privacy. However, the presence of anomalous or corrupted clients—such as those with faulty sensors or non-representative data distributions—can significantly degrade model performance. Detecting such clients without accessing raw data remains a key challenge. We propose Waffle (Wavelet and Fourier representations for Federated Learning), a detection algorithm that labels malicious clients <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">before training</i>, using locally computed compressed representations derived from either the Wavelet Scattering Transform (WST) or the Fourier Transform. Both approaches provide low-dimensional, task-agnostic embeddings suitable for unsupervised client separation. A lightweight detector, trained on a distilled public dataset, performs the labeling with minimal communication and computational overhead. While both transforms enable effective detection, WST offers theoretical advantages, such as non-invertibility and stability to local deformations, that make it particularly well-suited to federated scenarios. Experiments on benchmark datasets demonstrate that our method improves both detection accuracy and downstream classification performance compablack to existing FL anomaly detection algorithms, validating its effectiveness as an offline alternative to online detection strategies. Source code for the paper is publicly available at https://github.com/davedleo/Waffle.
Alessandro Licciardi, Davide Leo, Davide Carbone
IEEE Internet Things J.2
2025 Interaction-Aware Gaussian Weighting for Clustered Federated Learning
abstract
Federated Learning (FL) emerged as a decentralized paradigm to train models while preserving privacy. However, conventional FL struggles with data heterogeneity and class imbalance, which degrade model performance. Clustered FL balances personalization and decentralized training by grouping clients with analogous data distributions, enabling improved accuracy while adhering to privacy constraints. This approach effectively mitigates the adverse impact of heterogeneity in FL. In this work, we propose a novel clustering method for FL, FedGWC (Federated Gaussian Weighting Clustering), which groups clients based on their data distribution, allowing training of a more robust and personalized model on the identified clusters. FedGWC identifies homogeneous clusters by transforming individual empirical losses to model client interactions with a Gaussian reward mechanism. Additionally, we introduce the Wasserstein Adjusted Score, a new clustering metric for FL to evaluate cluster cohesion with respect to the individual class distribution. Our experiments on benchmark datasets show that FedGWC outperforms existing FL algorithms in cluster quality and classification accuracy, validating the efficacy of our approach.
Alessandro Licciardi, Davide Leo, Eros Fanì, Barbara Caputo, Marco Ciccone
ICML2