Estimating Matching Affinity Matrices under Low-Rank Constraints

Fiche du document

Type de document
Périmètre
Langue
Identifiants
Relations

Ce document est lié à :
info:eu-repo/semantics/altIdentifier/doi/10.1093/imaiai/iaz015

Collection

Archives ouvertes



Citer ce document

Arnaud Dupuy et al., « Estimating Matching Affinity Matrices under Low-Rank Constraints », HAL-SHS : économie et finance, ID : 10.1093/imaiai/iaz015


Métriques


Partage / Export

Résumé En

In this paper, we address the problem of estimating transport surplus (a.k.a. matching affinity) in high-dimensional optimal transport problems. Classical optimal transport theory specifies the matching affinity and determines the optimal joint distribution. In contrast, we study the inverse problem of estimating matching affinity based on the observation of the joint distribution, using an entropic regularization of the problem. To accommodate high dimensionality of the data, we propose a novel method that incorporates a nuclear norm regularization that effectively enforces a rank constraint on the affinity matrix. The low-rank matrix estimated in this way reveals the main factors that are relevant for matching.

document thumbnail

Par les mêmes auteurs

Sur les mêmes sujets

Sur les mêmes disciplines

Exporter en