Semi-Supervised Learning: the Case When Unlabeled Data is Equally Useful

May 22, 2020 ยท Declared Dead ยท ๐Ÿ› Conference on Uncertainty in Artificial Intelligence

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jingge Zhu arXiv ID 2005.11018 Category cs.LG: Machine Learning Cross-listed cs.IT, stat.ML Citations 10 Venue Conference on Uncertainty in Artificial Intelligence Last Checked 3 months ago
Abstract
Semi-supervised learning algorithms attempt to take advantage of relatively inexpensive unlabeled data to improve learning performance. In this work, we consider statistical models where the data distributions can be characterized by continuous parameters. We show that under certain conditions on the distribution, unlabeled data is equally useful as labeled date in terms of learning rate. Specifically, let $n, m$ be the number of labeled and unlabeled data, respectively. It is shown that the learning rate of semi-supervised learning scales as $O(1/n)$ if $m\sim n$, and scales as $O(1/n^{1+ฮณ})$ if $m\sim n^{1+ฮณ}$ for some $ฮณ>0$, whereas the learning rate of supervised learning scales as $O(1/n)$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted