Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1909.02373 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929418955390976 |
|---|---|
| author | Liu, Yanbin Yamada, Makoto Tsai, Yao-Hung Hubert Le, Tam Salakhutdinov, Ruslan Yang, Yi |
| author_facet | Liu, Yanbin Yamada, Makoto Tsai, Yao-Hung Hubert Le, Tam Salakhutdinov, Ruslan Yang, Yi |
| contents | Estimating mutual information is an important statistics and machine learning problem. To estimate the mutual information from data, a common practice is preparing a set of paired samples $\{(\mathbf{x}_i,\mathbf{y}_i)\}_{i=1}^n \stackrel{\mathrm{i.i.d.}}{\sim} p(\mathbf{x},\mathbf{y})$. However, in many situations, it is difficult to obtain a large number of data pairs. To address this problem, we propose the semi-supervised Squared-loss Mutual Information (SMI) estimation method using a small number of paired samples and the available unpaired ones. We first represent SMI through the density ratio function, where the expectation is approximated by the samples from marginals and its assignment parameters. The objective is formulated using the optimal transport problem and quadratic programming. Then, we introduce the Least-Squares Mutual Information with Sinkhorn (LSMI-Sinkhorn) algorithm for efficient optimization. Through experiments, we first demonstrate that the proposed method can estimate the SMI without a large number of paired samples. Then, we show the effectiveness of the proposed LSMI-Sinkhorn algorithm on various types of machine learning problems such as image matching and photo album summarization. Code can be found at https://github.com/csyanbin/LSMI-Sinkhorn. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1909_02373 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport Liu, Yanbin Yamada, Makoto Tsai, Yao-Hung Hubert Le, Tam Salakhutdinov, Ruslan Yang, Yi Machine Learning Estimating mutual information is an important statistics and machine learning problem. To estimate the mutual information from data, a common practice is preparing a set of paired samples $\{(\mathbf{x}_i,\mathbf{y}_i)\}_{i=1}^n \stackrel{\mathrm{i.i.d.}}{\sim} p(\mathbf{x},\mathbf{y})$. However, in many situations, it is difficult to obtain a large number of data pairs. To address this problem, we propose the semi-supervised Squared-loss Mutual Information (SMI) estimation method using a small number of paired samples and the available unpaired ones. We first represent SMI through the density ratio function, where the expectation is approximated by the samples from marginals and its assignment parameters. The objective is formulated using the optimal transport problem and quadratic programming. Then, we introduce the Least-Squares Mutual Information with Sinkhorn (LSMI-Sinkhorn) algorithm for efficient optimization. Through experiments, we first demonstrate that the proposed method can estimate the SMI without a large number of paired samples. Then, we show the effectiveness of the proposed LSMI-Sinkhorn algorithm on various types of machine learning problems such as image matching and photo album summarization. Code can be found at https://github.com/csyanbin/LSMI-Sinkhorn. |
| title | LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport |
| topic | Machine Learning |
| url | https://arxiv.org/abs/1909.02373 |