- Computer Science Laboratory

HERIN Margot

PhD Student at Sorbonne University (ATER, Sorbonne Université)
Team : DECISION
    Sorbonne Université - LIP6
    Boîte courrier 169
    Couloir 26-00, Étage 4, Bureau 401
    4 place Jussieu
    75252 PARIS CEDEX 05
    FRANCE

+33 1 44 27 70 07
Margot.Herin (at) nulllip6.fr
https://sites.google.com/view/margotherin/about
https://sites.google.com/view/margotherin/about

Supervision : Patrice PERNY
Co-supervision : SOKOLOVSKA Nataliya

Learning Preference Models: A Marriage between Decision Theory and Machine Learning

The work presented in this thesis lies at the intersection of decision theory and machine learning. The objective is to propose learning methods for preference models stemming from decision theory, with the aim of explaining or predicting a decision maker’s preferences.

We focus in particular on value function models that account for interactions between different viewpoints on the alternatives, such as the Choquet integral, the multilinear utility, and decomposable GAI utility functions. These models possess strong descriptive power, while also ensuring a form of rationality in preferences through the satisfaction of desirable mathematical properties, and allowing for interpretability via their parameters.

Due to the combinatorial nature of interactions, learning such models poses a computational challenge, as it requires determining an exponential number of parameters, sometimes subject to combinatorial constraints.

In this thesis, we propose to control the flexibility of these models through the learning of sparse representations of interactions, notably through the use of sparsity-inducing regularizations, and to reduce computational complexity by leveraging convex optimization methods from machine learning, suited to high-dimensional sparse learning problems. Then, this thesis contributes by :

  1. providing learning problem formulations tailored to various preference models and learning settings: from pre-collected examples (passive learning), from carefully selected queries (preference elicitation or active learning), or from a stream of examples (online learning),
  2. developing computationally efficient optimization algorithms to solve these problems, and
  3. conducting experimental evaluations on both synthetic and real-world preference data.

  4. Phd defence : 06/20/2025

    Jury members :

    Yann Chevaleyre, Professeur, Université Paris Dauphine-PSL [Rapporteur]
    Michel Grabisch, Professeur, Université Paris 1 Panthéon-Sorbonne [Rapporteur]
    Isabelle Bloch, Professeure, Sorbonne Université
    Sébastien Destercke, Directeur de recherche au CNRS, Université de Technologie de Compiègne
    Eyke Hüllermeier, Professeur, Ludwig-Maximilians-Universität München
    Christophe Labreuche, Ingénieur de recherche, Thales Recherche et Technologie
    Patrice Perny, Professeur, Sorbonne Université
    Nataliya Sokolovska, Professeure, Sorbonne Université

2022-2025 Publications