Algorithmic fairness
Optimal-transport methods that correct discrimination in predictive models, for one sensitive attribute or several at once, with statistical guarantees on what accuracy that costs.
ISFA, Université Claude Bernard Lyon 1 · R&D AI Lab, Milliman France
François HU
Associate Professor & AI Researcher
I am Associate Professor in AI and Actuarial Science at ISFA, Université Claude Bernard Lyon 1, and I lead the R&D AI Lab at Milliman France. My work sits at the intersection of statistical learning and trustworthy AI (fairness, interpretability, privacy), mostly applied to insurance and finance. I also teach at EPITA, Cnam and the Institut des Actuaires.
Currently
- Associate Professor in AI and Actuarial Science at ISFA, Lyon 1.
- Leading the R&D AI Lab at Milliman France on GenAI and trustworthy AI.
- Teaching data science at ISFA and ENSEA Abidjan, and fairness at Cnam.
- Working on fairness methods for multiple sensitive attributes with EquiPy.
Research
What I work on
Trustworthy AI for insurance
Pricing, scoring and mortality models that regulators and policyholders can actually scrutinise: interpretability, privacy and bias auditing on real actuarial portfolios.
Probability calibration
A score is only useful if its numbers mean what they claim. Recalibrating predicted probabilities so that they match observed frequencies, and keeping them calibrated once a fairness correction has been applied on top.
Bayesian statistics
Latent variable models, variational inference and MCMC, used both as a research tool for uncertainty quantification and as the backbone of the Bayesian machine learning course I teach.
NLP, LLMs and generative AI
Extracting structure from unstructured text: ESG concepts in corporate reporting, early signals of infectious disease outbreaks, and retrieval- augmented systems for insurance.
Semi-supervised & active learning
When labels are expensive, which ones should you buy? Sampling and labelling strategies that keep both cost and bias under control.
Publications
Selected papers
-
Fairness guarantee in multi-class classification
Journal of Machine Learning Research (JMLR)
Optimal fair classifiers under demographic parity for multi-class problems, with statistical guarantees on the fairness/accuracy trade-off.
-
A sequentially fair mechanism for multiple sensitive attributes
AAAI 2024Covered by the Montreal AI Ethics Institute
A sequential Wasserstein-barycenter approach that mitigates unfairness across several sensitive attributes at once, with an interpretable fairness path.
-
Fairness in multi-task learning via Wasserstein barycenters
ECML-PKDD 2023, Research Track
Extends optimal-transport post-processing for demographic parity to simultaneous regression and binary classification tasks.
-
Mitigating discrimination in insurance with Wasserstein barycenters
BIAS 2023
How optimal-transport fairness corrections behave on real insurance pricing data, and what they cost in premium accuracy.
-
Semi-supervised learning in insurance: fairness and labelling
PhD thesis, Institut Polytechnique de Paris (CREST-ENSAE)Awarded best actuarial thesis in France (SCOR Prize 2022)
A learning system for insurance that is accurate in prediction, cheap in labelling and ethical in transparency and fairness.
Writing
From the blog
A sequentially fair mechanism for multiple sensitive attributes
Most bias-correction methods handle one sensitive variable at a time. Real problems have several. It turns out the order you correct them in does not change ...
Projects
Projects
EquiPy
A Python package for post-processing fairness: it takes a trained model and returns a calibrated, fairer one, for a single sensitive attribute or several at once.
Early Warning System for Infectious Diseases
Spatiotemporal modelling and NLP over news and social posts to detect outbreak signals early, as part of the Mathematics for Public Health initiative.
Teaching
Where I teach
-
EPITA
-
Institut des Actuaires
-
Cnam
-
ISFA, Université Claude Bernard Lyon 1
Let's talk
Happy to discuss collaborations on trustworthy AI, guest lectures or research internships. Email is the fastest way to reach me.