Lune

ICML2026顶会

Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximization

Mikhail Persiianov, Arip Asadulaev, Nikita Andreev, Nikita Starodubcev, Dmitry Baranchuk, Anastasis Kratsios, Evgeny Burnaev, Aleksandr Korotin

2026年份
2被引次数
1顶会引用

摘要

Learning conditional distributions π * (•|x) is a central problem in machine learning, which is typically approached via supervised methods with paired data (x, y) ∼ π * . However, acquiring paired data samples is often challenging, especially in problems such as domain translation. This necessitates the development of semisupervised models that utilize both limited paired data and additional unpaired i.i.d. samples x ∼ π * x and y ∼ π * y from the marginal distributions. The usage of such combined data is complex and often relies on heuristic approaches. To tackle this issue, we propose a new learning paradigm called EBiEOT that integrates both paired and unpaired data seamlessly using data likelihood maximization techniques. We demonstrate that our approach also connects intriguingly with inverse entropic optimal transport (OT). This finding allows us to apply recent advances in computational OT to establish an end-to-end learning algorithm to get π * (•|x). In addition, we derive the universal approximation property, demonstrating that our approach can theoretically recover true conditional distributions with arbitrarily small error. Finally, we demonstrate through empirical tests that our method effectively learns conditional distributions using paired and unpaired data simultaneously. Source code: https: //github.com/MuXauJl11110/EBiEOT .

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

lune papers fulltext 3dcf256d-e378-450d-a1e4-eee4014ac49e

引用它的顶会 Paper1

问问它们各自怎么用它

它引用的顶会 Paper43

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖