paper-with-me

Papers

Efficient Robust Optimal Transport with Application to Multi-Label Classification

2020-10-22 · Pratik Jawanpuria, N T V Satyadev, Bamdev Mishra

Optimal transport (OT) is a powerful geometric tool for comparing two distributions and has been employed in various machine learning applications. In this work, we propose a novel OT formulation that takes feature correlations into account while learning the transport plan between two distributions. We model the feature-feature relationship via a symmetric positive semi-definite Mahalanobis metric in the OT cost function. For a certain class of regularizers on the metric, we show that the optimization strategy can be considerably simplified by exploiting the problem structure. For high-dimensional data, we additionally propose suitable low-dimensional modeling of the Mahalanobis metric. Overall, we view the resulting optimization problem as a non-linear OT problem, which we solve using the Frank-Wolfe algorithm. Empirical results on the discriminative learning setting, such as tag prediction and multi-class classification, illustrate the good performance of our approach.

📄 PDF Abstract BibTeX arXiv:2010.11852

Code (2)

SatyadevNtv/ROT4C 공식 구현 tf
satyadevntv/ROT 공식 구현 tf

Tasks

Multi-class ClassificationMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONTAG

Similar Papers 제목 키워드 기반

Predicate Classification Using Optimal Transport Loss in Scene Graph Generation

2023-09-19 · Sorachi Kurita, Satoshi Oyama, Itsuki Noda

In scene graph generation (SGG), learning with cross-entropy loss yields biased predictions owing to the severe imbalance in the distribution of the relationship labels in the dataset. Thus, this study proposes a method …

Graph GenerationPredicate ClassificationScene Graph Generation

A Quasi-Wasserstein Loss for Learning Graph Neural Networks

2023-10-18 · Minjie Cheng, Hongteng Xu

When learning graph neural networks (GNNs) in node-level prediction tasks, most existing loss functions are applied for each node independently, even if node embeddings and their labels are non-i.i.d. because of their gr…

Transporting Labels via Hierarchical Optimal Transport for Semi-Supervised Learning

2020-08-01 · ECCV 2020 8 · Fariborz Taherkhani, Ali Dabouei, Sobhan Soleymani, Jeremy Dawson 외

Semi-Supervised Learning (SSL) based on Convolutional Neural Networks (CNNs) have recently been proven as powerful tools for standard tasks such as image classification when there is not a sufficient amount of labeled da…

image-classificationImage Classification

Relative Entropic Optimal Transport: a (Prior-aware) Matching Perspective to (Unbalanced) Classification

2023-09-21 · NeurIPS 2023 11

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. Departure from the Bayesian framework…

Partial Optimal Tranport with applications on Positive-Unlabeled Learning

2020-12-01 · NeurIPS 2020 12 · Laetitia Chapel, Mokhtar Z. Alaya / Laboratoire LITIS, Université de Rouen Normandie, Gilles Gasso

Classical optimal transport problem seeks a transportation map that preserves the total mass between two probability distributions, requiring their masses to be equal. This may be too restrictive in some applications …