Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912688009904128 |
|---|---|
| author | Persiianov, Mikhail Asadulaev, Arip Andreev, Nikita Starodubcev, Nikita Baranchuk, Dmitry Kratsios, Anastasis Burnaev, Evgeny Korotin, Alexander |
| author_facet | Persiianov, Mikhail Asadulaev, Arip Andreev, Nikita Starodubcev, Nikita Baranchuk, Dmitry Kratsios, Anastasis Burnaev, Evgeny Korotin, Alexander |
| contents | Learning conditional distributions $π^*(\cdot|x)$ is a central problem in machine learning, which is typically approached via supervised methods with paired data $(x,y) \sim π^*$. However, acquiring paired data samples is often challenging, especially in problems such as domain translation. This necessitates the development of $\textit{semi-supervised}$ models that utilize both limited paired data and additional unpaired i.i.d. samples $x \sim π^*_x$ and $y \sim π^*_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 that integrates both paired and unpaired data $\textbf{seamlessly}$ using the 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 $\textbf{end-to-end}$ learning algorithm to get $π^*(\cdot|x)$. In addition, we derive the universal approximation property, demonstrating that our approach can theoretically recover true conditional distributions with arbitrarily small error. Furthermore, we demonstrate through empirical tests that our method effectively learns conditional distributions using paired and unpaired data simultaneously. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_02628 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximization Persiianov, Mikhail Asadulaev, Arip Andreev, Nikita Starodubcev, Nikita Baranchuk, Dmitry Kratsios, Anastasis Burnaev, Evgeny Korotin, Alexander Machine Learning Artificial Intelligence Learning conditional distributions $π^*(\cdot|x)$ is a central problem in machine learning, which is typically approached via supervised methods with paired data $(x,y) \sim π^*$. However, acquiring paired data samples is often challenging, especially in problems such as domain translation. This necessitates the development of $\textit{semi-supervised}$ models that utilize both limited paired data and additional unpaired i.i.d. samples $x \sim π^*_x$ and $y \sim π^*_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 that integrates both paired and unpaired data $\textbf{seamlessly}$ using the 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 $\textbf{end-to-end}$ learning algorithm to get $π^*(\cdot|x)$. In addition, we derive the universal approximation property, demonstrating that our approach can theoretically recover true conditional distributions with arbitrarily small error. Furthermore, we demonstrate through empirical tests that our method effectively learns conditional distributions using paired and unpaired data simultaneously. |
| title | Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximization |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2410.02628 |