Apr 23, 2025 | Our tutorial “Towards Adversarially Robust ML in The Age of The AI Act” has been accepted at the 28th European Conference on Artificial Intelligence in Bologna, Italy. Antonio Emanuele Cinà and me will provide an overview about recent advancements on security of Machine Learning and methods to test and verify the robustness of Machine Learning models, with a specific focus on the compliance with the European AI Act. |
Apr 19, 2025 | Our paper Less is More: Boosting Coverage of Web Crawling through Adversarial Multi-Armed Bandit has been accepted at DSN 2025! In this work, we propose a new state-agnostic Reinforcement Learning-based crawler that applies Adversarial Multi-Armed Bandit in a smart way to improve the exploration of web applications, surpassing the limitations of previous crawlers based on Reinforcement Learning. Available soon! |
Dec 12, 2024 | Our paper Watermarking Decision Tree Ensembles has been accepted at EDBT 2025! In this work, we propose the first watermarking scheme for decision tree ensembles and we analyze its security against relevant threats. |
Dec 12, 2024 | Our paper Timber! Poisoning Decision Trees has been accepted at IEEE SaTML 2025! In this work, we present a new poisoning attack about decision trees that is feasible to perform without incurring in large computational costs. |
Nov 4, 2024 | I have been selected as a Top Reviewer at the Thirty-eighth Annual Conference on Neural Information Processing Systems (NeurIPS 2024) and the 17th ACM Workshop on Artificial Intelligence and Security (AISec 2024)! |
Sep 11, 2024 | I will serve as poster chair for the 10th IEEE European Symposium on Security and Privacy (IEEE EuroS&P 2025)! |
Aug 27, 2024 | Our paper Verifiable Boosted Tree Ensembles has been accepted at IEEE S&P 2025! In this work, we demonstrate how to train boosted tree ensembles with robustness guarantees that can be efficiently verified in polynomial time, overcoming the challenge of robustness verification, which is NP-hard for tree ensembles in general. |