The chair develops novel optimization methods for machine learning, where one can exploit certain structures in the learning pipeline. In particular, the ubiquity of discrete aspects—both in the output objects learned by models and in the input objects from which we make predictions—has emerged as a key property that methods must capture. Incorporating discrete structures when building and training models presents a wide range of challenges due to more complex optimization problems. Among our ultimate goals is to build robustness against various forms of perturbations into such learning models by leveraging this additional structure.
ACTIVITIES
The SOL chair will begin in January 2026 and will hire two PhD students and one postdoc.
Published on September 30, 2026 Updated on September 30, 2026
Core members
Mathieu Besançon
Jérôme Malick
Quoc-Tung Le
Hamza Ennaji
Research Topics
Optimization for learning, convex optimization, discrete optimization, machine learning, robustness
Share the linkCopyCopiedClose the modal windowShare the URL of this pageI recommend this page:Available at this address:The page will then be accessible from your "My Favorites" menu.Stop the videoPlay the videoMutePlay audioChat: Have a question?Robo Fabrica ChatbotMatomo Traffic StatisticsX (formerly Twitter)