Search Results for author: Michaël Perrot

Found 10 papers, 4 papers with code

On the Impact of Output Perturbation on Fairness in Binary Linear Classification

no code implementations5 Feb 2024 Vitalii Emelianov, Michaël Perrot

We theoretically study how differential privacy interacts with both individual and group fairness in binary linear classification.

Fairness Privacy Preserving

A Revenue Function for Comparison-Based Hierarchical Clustering

1 code implementation29 Nov 2022 Aishik Mandal, Michaël Perrot, Debarghya Ghoshdastidar

Comparison-based learning addresses the problem of learning when, instead of explicit features or pairwise similarities, one only has access to comparisons of the form: \emph{Object $A$ is more similar to $B$ than to $C$.}

Clustering Open-Ended Question Answering

FairGrad: Fairness Aware Gradient Descent

no code implementations22 Jun 2022 Gaurav Maheshwari, Michaël Perrot

We address the problem of group fairness in classification, where the objective is to learn models that do not unjustly discriminate against subgroups of the population.

Fairness

Foundations of Comparison-Based Hierarchical Clustering

1 code implementation NeurIPS 2019 Debarghya Ghoshdastidar, Michaël Perrot, Ulrike Von Luxburg

We address the classical problem of hierarchical clustering, but in a framework where one does not have access to a representation of the objects or their pairwise similarities.

Clustering

Boosting for Comparison-Based Learning

no code implementations31 Oct 2018 Michaël Perrot, Ulrike Von Luxburg

We consider the problem of classification in a comparison-based setting: given a set of objects, we only have access to triplet comparisons of the form "object $x_i$ is closer to object $x_j$ than to object $x_k$."

Object

Mapping Estimation for Discrete Optimal Transport

no code implementations NeurIPS 2016 Michaël Perrot, Nicolas Courty, Rémi Flamary, Amaury Habrard

Most of the computational approaches of Optimal Transport use the Kantorovich relaxation of the problem to learn a probabilistic coupling $\mgamma$ but do not address the problem of learning the underlying transport map $\funcT$ linked to the original Monge problem.

Domain Adaptation

Regressive Virtual Metric Learning

no code implementations NeurIPS 2015 Michaël Perrot, Amaury Habrard

In this paper, instead of bringing closer examples of the same class and pushing far away examples of different classes we propose to move the examples with respect to virtual points.

Metric Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.