Professeur Des Universités at Université de Bretagne Sud
Vannes, Brittany, France
Join Prog.AI to see contacts
Join Prog.AI to see contacts
Summary
🤩
Rockstar
🎓
Top School
Nicolas Courty is a French academic and researcher with nine years of professional experience specializing in optimal transport, machine learning, and signal processing. He is a Professor at Université de Bretagne Sud, seconded part-time to Inria where he advances links between optimal transport theory and applied ML. With a PhD in Mathematics and Computer Science and an HDR, he combines deep theoretical training with practical software contributions, notably extending the popular Python Optimal Transport (POT) library with new algorithms (generalized conditional gradient, Gromov–Wasserstein) and domain-adaptation tools. His work spans teaching, research supervision, and hands-on development, including fixing low-level C++ wrappers and producing illustrative examples for different regularizations. Based in Vannes, Brittany, he brings a rare mix of rigorous mathematical insight and pragmatic engineering to bridge research and open-source impact.
9 years of coding experience
Doctor of Philosophy - PhD, Mathematics and Computer Science, Doctor of Philosophy - PhD, Mathematics and Computer Science at INSA Rennes - Institut National des Sciences Appliquées de Rennes
Master's degree, Artificial Intelligence, Master's degree, Artificial Intelligence at Université de Rennes I
Habilitation à diriger des recherches (HDR), Habilitation à diriger des recherches (HDR) at Université de Bretagne Sud
Contributions:7 reviews, 103 commits, 16 PRs in 5 years 1 month
Contributions summary:Nicolas primarily focused on adding new functionality and correcting previous code to the Python Optimal Transport library. Their contributions included adding a generalized conditional gradient algorithm for regularized optimal transport problems, creating new examples demonstrating the use of various regularization methods (Frobenius, Entropic), and implementing domain adaptation methods with group lasso regularization, all within the ot and ot.da modules. The user also corrected a bug in the C++ code wrapper and implemented Gromov-Wasserstein distance calculations.
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.
Request Free Trial
Nicolas Courty - Professeur Des Universités at Université de Bretagne Sud