Demo Data from VLDB 2026 / reviewers in the wild / expert
Debora Caldarola
dblp:291/3764
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0002-8328-8622ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 since 2021Systems, architecture and hardware · 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
2 papers |
Efficient and distributed learning · 53% Optimization for machine learning · 33% Learning theory · 13% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
federated learning |
1.4 | 2 | 2025 | Beyond Local Sharpness: Communication-Efficient Global Sharpness-aware Minimization for Federated Learning · CVPR 2025 Improving Generalization in Federated Learning by Seeking Flat Minima · ECCV (23) 2022 |
Machine learning › Efficient and distributed learning › federated learning
federated optimization |
0.9 | 1 | 2025 | Beyond Local Sharpness: Communication-Efficient Global Sharpness-aware Minimization for Federated Learning · CVPR 2025 |
Machine learning › Optimization for machine learning › gradient-based optimization
sharpness-aware minimization |
0.9 | 1 | 2025 | Beyond Local Sharpness: Communication-Efficient Global Sharpness-aware Minimization for Federated Learning · CVPR 2025 |
Machine learning › Optimization for machine learning › optimization landscape
flat minima |
0.6 | 1 | 2022 | Improving Generalization in Federated Learning by Seeking Flat Minima · ECCV (23) 2022 |
Machine learning › Learning theory
generalization |
0.6 | 1 | 2022 | Improving Generalization in Federated Learning by Seeking Flat Minima · ECCV (23) 2022 |
Methods — techniques the papers use, named apart from their topics
sharpness-aware minimization · 0.9gradient approximation · 0.9flat minima seeking · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Beyond Local Sharpness: Communication-Efficient Global Sharpness-aware Minimization for Federated LearningabstractFederated learning (FL) enables collaborative model training with privacy preservation. Data heterogeneity across edge devices (clients) can cause models to converge to sharp minima, negatively impacting generalization and robustness. Recent approaches use client-side sharpness-aware minimization (SAM) to encourage flatter minima, but the discrepancy between local and global loss landscapes often undermines their effectiveness, as optimizing for local sharpness does not ensure global flatness. This work introduces FedGloSS (Federated Global Server-side Sharpness), a novel FL approach that prioritizes the optimization of global sharpness on the server, using SAM. To reduce communication overhead, FedGloSS cleverly approximates sharpness using the previous global gradient, eliminating the need for additional client communication. Our extensive evaluations demonstrate that FedGloSS consistently achieves flatter minima and better performance compared to state-of-the-art FL methods in various federated vision benchmarks. Code available at github.com/pietrocagnasso/fedgloss. Debora Caldarola, Pietro Cagnasso, Barbara Caputo, Marco Ciccone |
CVPR | 1 |
| 2023 | Learning Across Domains and Devices: Style-Driven Source-Free Domain Adaptation in Clustered Federated LearningabstractFederated Learning (FL) has recently emerged as a possible way to tackle the domain shift in real-world Semantic Segmentation (SS) without compromising the private nature of the collected data. However, most of the existing works on FL unrealistically assume labeled data in the re-mote clients. Here we propose a novel task (FFreeDA) in which the clients’ data is unlabeled and the server accesses a source labeled dataset for pre-training only. To solve FFreeDA, we propose LADD, which leverages the knowledge of the pre-trained model by employing self-supervision with ad-hoc regularization techniques for local training and introducing a novel federated clustered aggregation scheme based on the clients’ style. Our experiments show that our algorithm is able to efficiently tackle the new task out-performing existing approaches. The code is available at https://github.com/Erosinho13/LADD. Donald Shenaj, Eros Fanì, Marco Toldo, Debora Caldarola, Antonio Tavera, Umberto Michieli, Marco Ciccone, Pietro Zanuttigh, Barbara Caputo |
WACV | 4 |
| 2022 | Improving Generalization in Federated Learning by Seeking Flat Minima
Debora Caldarola, Barbara Caputo, Marco Ciccone |
ECCV (23) | 1 |
| 2022 | Speeding up Heterogeneous Federated Learning with Sequentially Trained SuperclientsabstractFederated Learning (FL) allows training machine learning models in privacy-constrained scenarios by enabling the cooperation of edge devices without requiring local data sharing. This approach raises several challenges due to the different statistical distribution of the local datasets and the clients’ computational heterogeneity. In particular, the presence of highly non-i.i.d. data severely impairs both the performance of the trained neural network and its convergence rate, increasing the number of communication rounds requested to reach a performance comparable to that of the centralized scenario. As a solution, we propose FedSeq, a novel framework leveraging the sequential training of subgroups of heterogeneous clients, i.e. superclients, to emulate the centralized paradigm in a privacy-compliant way. Given a fixed budget of communication rounds, we show that FedSeq outperforms or match several state-of-the-art federated algorithms in terms of final performance and speed of convergence. Finally, our method can be easily integrated with other approaches available in the literature. Empirical results show that combining existing algorithms with FedSeq further improves its final performance and convergence speed. We test our method on CIFAR-10 and CIFAR-100 and prove its effectiveness in both i.i.d. and non-i.i.d. scenarios.1 Riccardo Zaccone, Andrea Rizzardi, Debora Caldarola, Marco Ciccone, Barbara Caputo |
ICPR | 3 |
| 2022 | FedDrive: Generalizing Federated Learning to Semantic Segmentation in Autonomous DrivingabstractSemantic Segmentation is essential to make self-driving vehicles autonomous, enabling them to understand their surroundings by assigning individual pixels to known categories. However, it operates on sensible data collected from the users' cars; thus, protecting the clients' privacy becomes a primary concern. For similar reasons, Federated Learning has been recently introduced as a new machine learning paradigm aiming to learn a global model while preserving privacy and leveraging data on millions of remote devices. Despite several efforts on this topic, no work has explicitly addressed the challenges of federated learning in semantic segmentation for driving so far. To fill this gap, we propose FedDrive, a new benchmark consisting of three settings and two datasets, incorporating the real-world challenges of statistical heterogeneity and domain generalization. We benchmark state-of-the-art algorithms from the federated learning literature through an in-depth analysis, combining them with style transfer methods to improve their generalization ability. We demonstrate that correctly handling normalization statistics is crucial to deal with the aforementioned challenges. Furthermore, style transfer improves performance when dealing with significant appearance shifts. Official website: https://feddrive.github.io. Lidia Fantauzzo, Eros Fanì, Debora Caldarola, Antonio Tavera, Fabio Cermelli, Marco Ciccone, Barbara Caputo |
IROS | 3 |