Privacy & model security
What can a trained model—or an explanation of one of its decisions—disclose about its training data? I develop reconstruction attacks and study defenses for structured models.
Postdoctoral researcher · Montréal
I study how machine learning models can be made more transparent and accountable—and what they can reveal about the data used to train them. My work connects combinatorial optimization with robustness, privacy, fairness, and explainability.
Currently at Polytechnique Montréal(opens in a new tab), in the Department of Mathematics and Industrial Engineering, and the SCALE-AI Chair in Data-Driven Supply Chains with Prof. Thibaut Vidal.
NeurIPS 2025Spotlight paper
ICML 2024Oral presentation
Québec ScienceTop 10 discoveries of 2024
01 / ABOUT
I am a postdoctoral researcher in the Department of Mathematics and Industrial Engineering at Polytechnique Montréal, in the SCALE-AI Chair in Data-Driven Supply Chains. I work with Prof. Thibaut Vidal on trustworthy machine learning and optimization.
I earned my PhD in 2023 at LAAS-CNRS / Université Toulouse III Paul Sabatier, where I studied the interplays between interpretability, fairness, and privacy in machine learning using combinatorial optimization and operations research.
My research focuses on trustworthy machine learning, with a focus on certifiability, interpretability, explainability, fairness, robustness, privacy, and the relationships among these goals. My works draw primarily on combinatorial optimization, particularly mathematical programming, to develop methods with rigorous guarantees of optimality or constraint satisfaction.
02 / RESEARCH
Combinatorial optimization provides powerful and flexible tools for jointly modelling and studying many desiderata related to trustworthy ML. This allows thorough characterizations, with rigorous guarantees on optimality and constraint satisfaction.
What can a trained model—or an explanation of one of its decisions—disclose about its training data? I develop reconstruction attacks and study defenses for structured models.
How can we find meaningful changes that alter a model’s prediction? I study exact and efficient methods for counterfactual explanations in tree ensembles.
How do accuracy, fairness, transparency, and sparsity interact? I design fair and interpretable learning methods and provably characterize the space of good models for several hypothesis classes.
How to jointly leverage the predictive power of a black-box and the transparent nature of a simple model? My research studies optimization-grounded methods to learn such models and characterize the novel chanllenges they carry.
How to compress an existing model without altering its prediction function? My work uses tailored row- and column-generation frameworks to compress existing tree ensembles while certifiably preserving their decision boundaries.
How to make sure that a trained model will perform well outside its training data distribution? I use distributionally robust optimization tools grounded in combinatorial optimization to derive rigorous worst-case guarantees.
Improving one trustworthy ML desiderata is likely to affect others: only a joint handling of all desirable properties can make ML really trustworthy.
03 / PUBLICATIONS
ICML · Oral presentation · Nominated as one of Québec Science's top 10 discoveries of 2024
Transactions on Machine Learning Research
The selected works above also appear below for completeness.
04 / OPEN SOURCE
All the code developed for my research is made publicly available. A few examples:
A library for counterfactual explanations for tree ensembles, to which I contributed refactoring and new methods.
github.com/vidalt/OCEAN PRIVACY AUDITINGA dataset reconstruction attack targeting the training data of random forests.
github.com/vidalt/DRAFT FAIR LEARNINGLearn compact, interpretable rule lists while accounting for statistical fairness constraints.
github.com/ferryjul/fairCORELS INTERPRETABILITYTrain hybrid models that combine an interpretable component with a black-box model.
github.com/ferryjul/HybridCORELS RASHOMON SETSPrecisely characterize, for several hypothesis classes, the sets of trade-offs achievable between accuracy, fairness and interpretability.
github.com/vidalt/Rashomon-Explorer PRIVACY PROTECTIONInvestigating the effectiveness of a Differential Privacy mechanism to prevent training set reconstruction attacks against random forests.
github.com/vidalt/DRAFT-DP EXPLANATIONS AND PRIVACYLeveraging counterfactual explanations of tree ensembles to provably recontruct the underlying model from a black-box API access.
github.com/vidalt/Tree-ExtractorMore projects on my GitHub ↗
05 / EDUCATION & TEACHING Polytechnique Montréal · SCALE-AI Chair in Data-Driven Supply Chains LAAS-CNRS · Université Toulouse III Paul Sabatier Thales Alenia Space · Bias mitigation in CNNs INSA Toulouse · Distributed Systems and Big Data · Ranked first in graduating class The University of Texas at Austin · University Honors Fall Semester 2017 I have taught algorithms, complexity, data structures, graph theory, programming, supervised and unsupervised machine learning, and related topics at INSA Toulouse (total of 196 hours). I also gave invited lectures on AI privacy and security at UQAM (3 hours) and INSA Toulouse (1 hour). Full list of my teaching activities can be found on my CV. I have co-supervised 8 master students, and currently co-supervise 2 doctoral students on interpretable models, counterfactual explanations, and privacy attacks. I have reviewed for journals including JMLR, TMLR, TKDE and Neural Networks, as well as conferences including ICML, NeurIPS (awarded Top Reviewer in 2026), AAAI, IJCAI, FAccT, SaTML, ECAI, ECML-PKDD, CP, and CPAIOR. 06 / CONTACT For collaborations, speaking invitations, or questions about my work, reach me by email.Beyond the papers.
Positions & education
Supervisor: Thibaut Vidal
Supervisors: Marie-José Huguet, Sébastien Gambs and Mohamed SialaTeaching & mentoring
Academic service
Let's talk.