Relative entropic optimal transport: a (prior-aware) matching perspective to (unbalanced) classification
Classification is a fundamental problem in machine learning, and considerable efforts have
been recently devoted to the demanding long-tailed setting due to its prevalence in nature …
been recently devoted to the demanding long-tailed setting due to its prevalence in nature …
Double-Bounded Optimal Transport for Advanced Clustering and Classification
Optimal transport (OT) is attracting increasing attention in machine learning. It aims to
transport a source distribution to a target one at minimal cost. In its vanilla form, the source …
transport a source distribution to a target one at minimal cost. In its vanilla form, the source …
Learning common semantics via optimal transport for contrastive multi-view clustering
Q Zhang, L Zhang, R Song, R Cong… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Multi-view clustering aims to learn discriminative representations from multi-view data.
Although existing methods show impressive performance by leveraging contrastive learning …
Although existing methods show impressive performance by leveraging contrastive learning …
Sparsistency for inverse optimal transport
Optimal Transport is a useful metric to compare probability distributions and to compute a
pairing given a ground cost. Its entropic regularization variant (eOT) is crucial to have fast …
pairing given a ground cost. Its entropic regularization variant (eOT) is crucial to have fast …
S-MolSearch: 3D Semi-supervised Contrastive Learning for Bioactive Molecule Search
Virtual Screening is an essential technique in the early phases of drug discovery, aimed at
identifying promising drug candidates from vast molecular libraries. Recently, ligand-based …
identifying promising drug candidates from vast molecular libraries. Recently, ligand-based …
Contrasting Multiple Representations with the Multi-Marginal Matching Gap
Learning meaningful representations of complex objects that can be seen through multiple
($ k\geq 3$) views or modalities is a core task in machine learning. Existing methods use …
($ k\geq 3$) views or modalities is a core task in machine learning. Existing methods use …
Differentiable Cost-Parameterized Monge Map Estimators
S Howard, G Deligiannidis, P Rebeschini… - arxiv preprint arxiv …, 2024 - arxiv.org
Within the field of optimal transport (OT), the choice of ground cost is crucial to ensuring that
the optimality of a transport map corresponds to usefulness in real-world applications. It is …
the optimality of a transport map corresponds to usefulness in real-world applications. It is …
Computing Approximate Graph Edit Distance via Optimal Transport
Given a graph pair $(G^ 1, G^ 2) $, graph edit distance (GED) is defined as the minimum
number of edit operations converting $ G^ 1$ to $ G^ 2$. GED is a fundamental operation …
number of edit operations converting $ G^ 1$ to $ G^ 2$. GED is a fundamental operation …
Online Inverse Linear Optimization: Improved Regret Bound, Robustness to Suboptimality, and Toward Tight Regret Analysis
We study an online learning problem where, over $ T $ rounds, a learner observes both time-
varying sets of feasible actions and an agent's optimal actions, selected by solving linear …
varying sets of feasible actions and an agent's optimal actions, selected by solving linear …
Identifiability of the Optimal Transport Cost on Finite Spaces
The goal of optimal transport (OT) is to find optimal assignments or matchings between data
sets which minimize the total cost for a given cost function. However, sometimes the cost …
sets which minimize the total cost for a given cost function. However, sometimes the cost …