The alpha version of my new book "Optimal Transport
for Machine Learners" is out, with in particular an online version with interactive figures
https://t.co/xEdZpMXgjx
This week, me, @YBendou and @mikegartrell had the chance to present our latest paper, "ReBaPL: Repulsive Bayesian Prompt Learning", at @CVPR
This method is a Bayesian "plug-and-play" on top of existing Prompt Learning methods.
Continuing on the good news, our paper "Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computation" was accepted at @UncertaintyInAI ! In this paper, we provide a gradient flow view of empirical Wasserstein barycenters.
Our paper "ReBaPL: Repulsive Bayesian Prompt Learning" has been accepted at #CVPR2026 as a conference paper. We show how Bayesian MCMC methods explores the multi-modality of the posterior distribution in Prompt Learning
Preprint:
https://t.co/8eetrPcRRM
🎓Get the latest results in information geometry! 😊
A collage of about 150 papers published in the first issues of the "Information Geometry" journal (Springer INGE):
https://t.co/sn8r7sMwSF
@SN_INGE
˙✧˖°🎓 ༘⋆。 °
My paper on Knowledge Distillation has been accepted at the 7th International Conference on Geometric Science of Information (GSI'25). In this paper I explore Feature Knowledge Distillation from a theoretical point of view, and how it performs under different probability metrics
I started posting a series of toy examples in Optimal Transport for Machine Learning, mostly related to my survey "Recent advances in optimal transport for machine learning" and my PhD thesis:
https://t.co/KNAZ63J7mY
We tested different probability metrics for the KD task, based on Empirical and Gaussian approximations. We also considered supervised variants of these metrics, showing that these actually perform (slightly) better than unsupervised variants.