👋 Hello, World!
Angelo
Saadeh
Data Privacy · Data Quality · Machine Learning
I am a research fellow within the Valda team of the Computer Science Department at École Normale Supérieure – PSL, in the framework of the PR[AI]RIE Artificial Intelligence Cluster.

Valda is a joint team between Inria, CNRS and ENS-PSL. More information about Valda can be found here.

I currently develop algorithms for data provenance, uncertainty, and probabilistic inference in SQL systems. Previously, I was a research fellow at CNRS@CREATE in Singapore (Descartes program, WP2: Hybrid AI), where I built voting algorithms for ensemble learning and added differential privacy to machine learning pipelines.

Before that, during my Ph.D. at Télécom Paris, I worked on privacy-preserving ML systems using cryptographic tools and differential privacy. 😎

Get in Touch

Have a question or want to collaborate? Send me a message below.

Resume
Experience & Education
Experience
Researcher
École Normale Supérieure – PSL · Inria Valda · PR[AI]RIE, Paris
  • Augment PostgreSQL databases with a locally-served language model (Llama 3.1), preserving its full output distribution instead of only the top prediction (CIKM 2026).
  • Extend ProvSQL, a C++ PostgreSQL extension, with text-value comparisons and joins over language-model predictions, encoded as mutually exclusive events in a provenance circuit.
  • Build benchmarking frameworks validating the correctness and performance of probabilistic query evaluation at scale (10,612 products, 230,156 reviews).
Researcher
CNRS@CREATE · DesCartes Programme (WP2: Hybrid AI), Singapore
  • Design ensemble learning methods that attribute voting power across heterogeneous models — Shapley values, Leave-One-Out, inverse-entropy weighting, truth discovery, and supervised regression — compared on both accuracy and runtime (DEXA 2025).
  • Show that unsupervised attribution of voting power matches supervised methods, removing the need for a held-out labelled set.
  • Integrate data privacy mechanisms like differential privacy into aggregation, training, and inference; stress-test the guarantees with membership-inference attacks.
  • Build permutation-invariant machine learning models to measure the quality of data.
  • Train and evaluate CNNs, MLPs, and other models on heterogeneous tabular and image data; co-supervise Master's students.
Graduate Researcher
École Polytechnique, France
  • Construct numerical methods algorithms to simplify complex functions.
Graduate Researcher
Télécom Paris, France
  • Design hybrid privacy-preserving machine learning models with cryptographic tools and differential privacy (ICDIS 2022, DEXA 2023).
  • Train a logistic regression jointly by two organisations over data neither can disclose, combining secure multi-party computation with ε-differential privacy.
  • Design a protocol reconciling contradictory data sources without any party revealing its own, with algorithms restructured to stay tractable under encryption.
  • Apply differential privacy and cryptography to federated learning across multiple parties.
  • Implement a two-party computation network from scratch: protocol layer, socket programming, benchmarking, and documentation.
Research Intern
CNRS@CREATE, Singapore
  • Apply secure computation protocols for unsupervised information retrieval algorithms; truth discovery.
  • Implement and benchmark the Cosine and 3-Estimates truth-finding protocols, released as TF-MPC (DEXA 2023).
Research Intern
Inria Saclay, France
  • Accelerate computations on encrypted data using mathematical tools like error-correcting codes and hyperinvertible matrices.

Education
Ph.D. in Computer Science
Télécom Paris, France
Nov 2019 – Jun 2023
Thesis: Applications of Secure Multi-party Computation Machine Learning
Advisors: Daniel Augot (Inria) and Matthieu Rambaud (Télécom Paris)
Doctoral scholarship: Labex Digicosme
M.Sc. in Computer Science
Université Paris-Saclay, France
Sep 2017 – Sep 2019
Specialization: Cryptography and Applied Algebra
Thesis: Mathematical Tools for Secure Multi-party Computation
B.Sc. in Mathematics
Lebanese University, Lebanon
Sep 2014 – Jul 2017

Skills
Programming
PythonCC++ JavaJavaScriptSQL
Machine Learning
PyTorchTensorFlowScikit-learn PandasNumPy
Language Models
Hugging Facesentence-transformers llama.cppRetrieval-augmented generation
Databases
PostgreSQLProvSQL MySQLXML / XQuery
Privacy
Differential privacyPySyftTF-Encrypted
Tools
GitLinuxLaTeX StreamlitGradio
Languages
English (fluent)French (native) Arabic (native)Italian (B2) Mandarin (HSK2)
Research
Publications & Projects
Publications
Discovering Voting Power for Ensemble Methods
DEXA 2025 · Bangkok, Thailand · Lecture Notes in Computer Science, Vol. 16046
Pratik Karmakar, Angelo Saadeh, Pierre Senellart, and Stéphane Bressan
doi →
Confidential Truth Finding with Multi-Party Computation
DEXA 2023 · Penang, Malaysia · Springer
Angelo Saadeh, Pierre Senellart, and Stéphane Bressan
doi → extended version →
Applications of Secure Multi-party Computation in Machine Learning
PhD Thesis · Institut Polytechnique de Paris · 2023
Angelo Saadeh
hal →
Epsilon-Differentially Private and Fully Secure Logistic Regression on Vertically Split Data
ICDIS 2022 · 4th International Conference on Data Intelligence and Security
Angelo Saadeh, Vaibhavi Kumari, and Stéphane Bressan
doi →

Projects
Musical — probabilistic queries over an LLM-augmented database
Python · PostgreSQL · ProvSQL · Llama 3.1 · Streamlit
Amazon musical products and reviews augmented with language-model probability distributions, queried probabilistically through ProvSQL, with a deterministic baseline for comparison.
github →
Rennes-delibs — retrieval-augmented assistant
Python · multilingual-e5 · Llama 3 · Gradio
Answers questions in French over ~30,000 indexed passages of Rennes city-council deliberations, citing its sources and abstaining when the corpus cannot support an answer.
demo → github →
ProvSQL — provenance and uncertainty in PostgreSQL
C++ · PostgreSQL extension
Contributions adding text-value comparisons and joins over language-model predictions, and provenance for aggregate queries.
github →
TF-MPC — confidential truth-finding
Python · secure multi-party computation
Implements and benchmarks the Cosine and 3-Estimates truth-finding protocols under encryption. Companion code to DEXA 2023.
github →
Secure 2PC — two-party computation network
Python · socket programming
A secure two-party computation network built from scratch — protocol layer, sockets, and benchmarking — for running machine learning functions on combined data.
github →
WannaFly — dummy ransomware for red team exercises
Python · C · REDOCS 2021, topic proposed and supervised by Airbus
Aboubacar Djibo Maman Sani, Boukerrou Hamid, Marinho Dylan, Saadeh Angelo, and Somers Benjamin
pdf →
Teaching
Courses & Lab Sessions
INFMDI731
Advanced Cryptography
Télécom Paris · Spring 2021
Intervention: Secure Multi-Party Computation
MDI210
Optimization and Numerical Analysis
Télécom Paris · Lab sessions: Fall 2020  ·  Course: Fall 2021
Course lectures and Java lab sessions covering optimization methods and numerical techniques.
BT5110
Data Management and Warehousing
National University of Singapore (NUS) · Lab sessions: Fall 2023
PostgreSQL lab sessions covering data management, warehousing concepts, and SQL querying techniques.
Cool Stuff
Side Projects
Kalendar

A tile puzzle: place 6 out of the 7 pieces on the 7×5 board to cover every cell except today's date. Drag pieces from the tray, rotate & flip with the button. Every day has many solutions, you can see them if you click "Show Solution" to see one possible solution.

Target day:
Board
Pieces
Chinese Flashcards
Practice HSK vocabulary with flashcards. Click the card to reveal pinyin, then click again for the definition. Select multiple HSK levels below. Vocabulary for HSK5 and HSK6 is currently not available, if you want them, contact me and I'll add them for you :-)
⟶ View on GitHub
click to reveal
0/0
HSK-3 Français
Cartes Mémoire · Sélectionner les leçons pour réviser le vocabulaire. Cliquer sur la carte pour afficher le pinyin, puis cliquer à nouveau pour faire apparaître la définition.
cliquez pour révéler
0/0
🔐 Secure Multi-party Computation
Simulate an addition protocol for n parties. All computations are done modulo 220 = 1048576.

Step 1. Choose number of parties (n) and hidden parties (k). You won't have access to the information of the hidden parties