Emilio Leonardi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Emilio Leonardi has a total of 218 co-authors. Here are the top co-authors by number of shared publications:
- Michele Garetto
Università di Torino
60 shared publications F. Neri
49 shared publications- Marco Mellia
Politecnico di Torino, Torino, Italy
46 shared publications - Andrea Bianco
Politecnico di Torino
43 shared publications - Paolo Giaccone
Politecnico di Torino
42 shared publications M.A. Marsan
Dipt. di Elettronica, Politecnico di Torino, Italy
21 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (5) , 5932-5943
Competing for Attention: A Stochastic Analysis of Influencer Popularity Dynamics
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (5) , 5932-5943
Competing for Attention: A Stochastic Analysis of Influencer Popularity Dynamics
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 602-612
Information Retrieval in the Age of Generative AI: The RGB Model
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 602-612
Open AccessInformation Retrieval in the Age of Generative AI: The RGB Model
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (6) , 4741-4756
Ranking a Set of Objects Using Heterogeneous Workers: QUITE an Easy Problem
We focus on the problem of ranking $N$ objects starting from a set of noisy pairwise comparisons provided by a crowd of unequal workers, each worker being characterized by a specific degree of reliability, which reflects her ability to rank pairs of objects. More specifically, we assume that objects are endowed with intrinsic qualities and that the probability with which an object is preferred to another depends both on the difference between the qualities of the two competitors and on the reliability of the worker. We propose QUITE, a non-adaptive ranking algorithm that jointly estimates workers' reliabilities and qualities of objects. Performance of QUITE is compared in different scenarios against previously proposed algorithms. Finally, we show how QUITE can be naturally made adaptive.
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (6) , 4741-4756
Ranking a Set of Objects Using Heterogeneous Workers: QUITE an Easy Problem
We focus on the problem of ranking $N$ objects starting from a set of noisy pairwise comparisons provided by a crowd of unequal workers, each worker being characterized by a specific degree of reliability, which reflects her ability to rank pairs of objects. More specifically, we assume that objects are endowed with intrinsic qualities and that the probability with which an object is preferred to another depends both on the difference between the qualities of the two competitors and on the reliability of the worker. We propose QUITE, a non-adaptive ranking algorithm that jointly estimates workers' reliabilities and qualities of objects. Performance of QUITE is compared in different scenarios against previously proposed algorithms. Finally, we show how QUITE can be naturally made adaptive.
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (16) , 16699-16707
Scalable Decentralized Algorithms for Online Personalized Mean Estimation
In numerous settings, agents lack sufficient data to learn a model directly. Collaborating with other agents may help, but introduces a bias-variance trade-off when local data distributions differ. A key challenge is for each agent to identify clients with similar distributions while learning the model, a problem that remains largely unresolved. This study focuses on a particular instance of the overarching problem, where each agent collects samples from a real-valued distribution over time to estimate its mean. Existing algorithms face impractical per-agent space and time complexities (linear in the number of agents |A|). To address scalability challenges, we propose a framework where agents self-organize into a graph, allowing each agent to communicate with only a selected number of peers r. We propose two collaborative mean estimation algorithms: one employs a consensus-based approach, while the other uses a message-passing scheme, with complexity O(r) and O(r log |A|), respectively. We establish conditions for both algorithms to yield asymptotically optimal estimates and we provide a theoretical characterization of their performance.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (16) , 16699-16707
Open AccessScalable Decentralized Algorithms for Online Personalized Mean Estimation
In numerous settings, agents lack sufficient data to learn a model directly. Collaborating with other agents may help, but introduces a bias-variance trade-off when local data distributions differ. A key challenge is for each agent to identify clients with similar distributions while learning the model, a problem that remains largely unresolved. This study focuses on a particular instance of the overarching problem, where each agent collects samples from a real-valued distribution over time to estimate its mean. Existing algorithms face impractical per-agent space and time complexities (linear in the number of agents |A|). To address scalability challenges, we propose a framework where agents self-organize into a graph, allowing each agent to communicate with only a selected number of peers r. We propose two collaborative mean estimation algorithms: one employs a consensus-based approach, while the other uses a message-passing scheme, with complexity O(r) and O(r log |A|), respectively. We establish conditions for both algorithms to yield asymptotically optimal estimates and we provide a theoretical characterization of their performance.
- Open Access
- 16 August 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
- Vol. 18 (3) , 1-24
Re-Identification Attacks against the Topics API
Recently, Google proposed the Topics API framework as a privacy-friendly alternative for behavioural advertising as a possible solution to balance user’s privacy and advertisement effectiveness. Using the Topics API, the browser builds a user profile based on navigation history, which advertisers can access. The Topics API aim at becoming the new standard for behavioural advertising, thus it is necessary to fully understand its operation and find possible limitations. In this article, we evaluate the robustness of the Topics API to a re-identification attack. To build a user profile, we suppose an attacker accumulates over time the topics a user exposes to different websites. The attacker later re-identifies the same user matching the profiles of their audience. We leverage real traffic traces and realistic population models, and we present increasingly powerful attack threats. We find that the Topics API mitigates but cannot prevent re-identification from taking place, as there is a sizeable chance that a user’s profile remains unique within a website’s audience and the attacker successfully matches it with the profile of the same user on a second website. Depending on environmental factors, the probability of correct re-identification can reach 50%, considering a pool of 1,000 users. We offer the code and data we use in this work to stimulate further studies and the tuning of the Topic API parameters. 1
- 16 August 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
- Vol. 18 (3) , 1-24
Open AccessRe-Identification Attacks against the Topics API
Recently, Google proposed the Topics API framework as a privacy-friendly alternative for behavioural advertising as a possible solution to balance user’s privacy and advertisement effectiveness. Using the Topics API, the browser builds a user profile based on navigation history, which advertisers can access. The Topics API aim at becoming the new standard for behavioural advertising, thus it is necessary to fully understand its operation and find possible limitations. In this article, we evaluate the robustness of the Topics API to a re-identification attack. To build a user profile, we suppose an attacker accumulates over time the topics a user exposes to different websites. The attacker later re-identifies the same user matching the profiles of their audience. We leverage real traffic traces and realistic population models, and we present increasingly powerful attack threats. We find that the Topics API mitigates but cannot prevent re-identification from taking place, as there is a sizeable chance that a user’s profile remains unique within a website’s audience and the attacker successfully matches it with the profile of the same user on a second website. Depending on environmental factors, the probability of correct re-identification can reach 50%, considering a pool of 1,000 users. We offer the code and data we use in this work to stimulate further studies and the tuning of the Topic API parameters. 1
- Open Access
- 21 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 343-353
Competition of Influencers: A Model for Maximizing Online Social Impact
- 21 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 343-353
Open AccessCompetition of Influencers: A Model for Maximizing Online Social Impact
- 18 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (2) , 2314-2331
Planning Interventions in a Controlled Pandemic: The COVID-19 Case
Restrictions on social and economic activities, as well as vaccinations, have been a key intervention in containing the COVID-19 epidemic. Our work focuses on better understanding the options available to policymakers under the conditions and uncertainties created by the onset of a new pandemic. More precisely, we focus on two control strategies. The first aims to control the rate of new infections to prevent congestion of the health care system. The latter directly controls hospitalizations and intensive care units (ICUs) occupation. By a first-order analysis, we show that, on the one hand, due to the difficulty in contact tracing and the lack of accurate information, controlling the transmission rate may be difficult, leading to instability. On the other hand, although hospitalizations and ICUs are easily accessible and less noisy than the rate of new infections, a delay is introduced in the control loop, which may endanger system stability. Our framework allows assessing the impact on economic and social costs of the above strategies in a scenario enriched by: i) population heterogeneity in terms of mortality rate and risk exposure, ii) closed-loop control of the epidemiological curve, and iii) progressive vaccination of individu
- 18 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (2) , 2314-2331
Planning Interventions in a Controlled Pandemic: The COVID-19 Case
Restrictions on social and economic activities, as well as vaccinations, have been a key intervention in containing the COVID-19 epidemic. Our work focuses on better understanding the options available to policymakers under the conditions and uncertainties created by the onset of a new pandemic. More precisely, we focus on two control strategies. The first aims to control the rate of new infections to prevent congestion of the health care system. The latter directly controls hospitalizations and intensive care units (ICUs) occupation. By a first-order analysis, we show that, on the one hand, due to the difficulty in contact tracing and the lack of accurate information, controlling the transmission rate may be difficult, leading to instability. On the other hand, although hospitalizations and ICUs are easily accessible and less noisy than the rate of new infections, a delay is introduced in the control loop, which may endanger system stability. Our framework allows assessing the impact on economic and social costs of the above strategies in a scenario enriched by: i) population heterogeneity in terms of mortality rate and risk exposure, ii) closed-loop control of the epidemiological curve, and iii) progressive vaccination of individu
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (2) , 1451-1460
Federated Learning Under Heterogeneous and Correlated Client Availability
In Federated Learning (FL), devices – also referred to as clients – can exhibit heterogeneous availability patterns, often correlated over time and with other clients. This paper addresses the problem of heterogeneous and correlated client availability in FL. Our theoretical analysis is the first to demonstrate the negative impact of correlation on FL algorithms’ convergence rate and highlights a trade-off between optimization error (related to convergence speed) and bias error (indicative of model quality). To optimize this trade-off, we propose Correlation-Aware FL (), a novel algorithm that dynamically balances the competing objectives of fast convergence and minimal model bias. achieves this by dynamically adjusting the aggregation weight assigned to each client and selectively excluding clients with high temporal correlation and low availability. Experimental evaluations on diverse datasets demonstrate the effectiveness of compared to state-of-the-art methods. Specifically, achieves the best trade-off between training time and test accuracy. By dynamically handling clients with high temporal correlation and low availability, emerges as a promising solution to mitigate the detrimental impact of correlated client availability in FL.
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (2) , 1451-1460
Federated Learning Under Heterogeneous and Correlated Client Availability
In Federated Learning (FL), devices – also referred to as clients – can exhibit heterogeneous availability patterns, often correlated over time and with other clients. This paper addresses the problem of heterogeneous and correlated client availability in FL. Our theoretical analysis is the first to demonstrate the negative impact of correlation on FL algorithms’ convergence rate and highlights a trade-off between optimization error (related to convergence speed) and bias error (indicative of model quality). To optimize this trade-off, we propose Correlation-Aware FL (), a novel algorithm that dynamically balances the competing objectives of fast convergence and minimal model bias. achieves this by dynamically adjusting the aggregation weight assigned to each client and selectively excluding clients with high temporal correlation and low availability. Experimental evaluations on diverse datasets demonstrate the effectiveness of compared to state-of-the-art methods. Specifically, achieves the best trade-off between training time and test accuracy. By dynamically handling clients with high temporal correlation and low availability, emerges as a promising solution to mitigate the detrimental impact of correlated client availability in FL.
- Open Access
- 1 October 2023
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2023 (4) , 66-78
On the Robustness of Topics API to a Re-Identification Attack
Web tracking through third-party cookies is considered a threat to users' privacy and is supposed to be abandoned in the near future. Recently, Google proposed the Topics API framework as a privacy-friendly alternative for behavioural advertising. Using this approach, the browser builds a user profile based on navigation history, which advertisers can access. The Topics API has the possibility of becoming the new standard for behavioural advertising, thus it is necessary to fully understand its operation and find possible limitations. This paper evaluates the robustness of the Topics API to a re-identification attack where an attacker reconstructs the user profile by accumulating user's exposed topics over time to later re-identify the same user on a different website. Using real traffic traces and realistic population models, we find that the Topics API mitigates but cannot prevent re-identification to take place, as there is a sizeable chance that a user's profile is unique within a website's audience. Consequently, the probability of correct re-identification can reach 15-17%, considering a pool of 1,000 users. We offer the code and data we use in this work to stimulate further studies and the tuning of the Topic API parameters.
- 1 October 2023
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2023 (4) , 66-78
Open AccessOn the Robustness of Topics API to a Re-Identification Attack
Web tracking through third-party cookies is considered a threat to users' privacy and is supposed to be abandoned in the near future. Recently, Google proposed the Topics API framework as a privacy-friendly alternative for behavioural advertising. Using this approach, the browser builds a user profile based on navigation history, which advertisers can access. The Topics API has the possibility of becoming the new standard for behavioural advertising, thus it is necessary to fully understand its operation and find possible limitations. This paper evaluates the robustness of the Topics API to a re-identification attack where an attacker reconstructs the user profile by accumulating user's exposed topics over time to later re-identify the same user on a different website. Using real traffic traces and realistic population models, we find that the Topics API mitigates but cannot prevent re-identification to take place, as there is a sizeable chance that a user's profile is unique within a website's audience. Consequently, the probability of correct re-identification can reach 15-17%, considering a pool of 1,000 users. We offer the code and data we use in this work to stimulate further studies and the tuning of the Topic API parameters.
- Open Access
Planning interventions in a controlled pandemic: the COVID-19 case
Restrictions on social and economic activities, as well as vaccinations, have been a key intervention in containing the COVID-19 epidemic. Our work focuses on better understanding the options available to policymakers under the conditions and uncertainties created by the onset of a new pandemic. More precisely, we focus on two control strategies. The first aims to control the rate of new infections to prevent congestion of the health care system. The latter directly controls hospitalizations and intensive care units (ICUs) occupation. By a first-order analysis, we show that, on the one hand, due to the difficulty in contact tracing and the lack of accurate information, controlling the transmission rate may be difficult, leading to instability. On the other hand, although hospitalizations and ICUs are easily accessible and less noisy than the rate of new infections, a delay is introduced in the control loop, which may endanger system stability. Our framework allows assessing the impact on economic and social costs of the above strategies in a scenario enriched by: i) population heterogeneity in terms of mortality rate and risk exposure, ii) closed-loop control of the epidemiological curve, and iii) progressive vaccination of individuals.
Open AccessPlanning interventions in a controlled pandemic: the COVID-19 case
Restrictions on social and economic activities, as well as vaccinations, have been a key intervention in containing the COVID-19 epidemic. Our work focuses on better understanding the options available to policymakers under the conditions and uncertainties created by the onset of a new pandemic. More precisely, we focus on two control strategies. The first aims to control the rate of new infections to prevent congestion of the health care system. The latter directly controls hospitalizations and intensive care units (ICUs) occupation. By a first-order analysis, we show that, on the one hand, due to the difficulty in contact tracing and the lack of accurate information, controlling the transmission rate may be difficult, leading to instability. On the other hand, although hospitalizations and ICUs are easily accessible and less noisy than the rate of new infections, a delay is introduced in the control loop, which may endanger system stability. Our framework allows assessing the impact on economic and social costs of the above strategies in a scenario enriched by: i) population heterogeneity in terms of mortality rate and risk exposure, ii) closed-loop control of the epidemiological curve, and iii) progressive vaccination of individuals.