资源论文Classification from Pairwise Similarity and Unlabeled Data

Classification from Pairwise Similarity and Unlabeled Data

2020-03-20 | |  92 |   62 |   0

Abstract

Supervised learning needs a huge amount of labeled data, which can be a big bottleneck under the situation where there is a privacy concern or l beling cost is high. To overcome this problem, we propose a new weakly-supervised learning setting where only similar (S) data pairs (two examples belong to the same class) and unlabeled (U) data points are needed instead of fully labeled data, which is called SU classification. We show that an unbiased estimator of the classification risk ca be obtained only from SU data, and the estimation error of its empirical risk minimizer achieves the optimal parametric convergence rate. Finally, we demonstrate the effectiveness of the proposed method through experiments.

上一篇:Towards End-to-End Prosody Transfer for Expressive Speech Synthesis with Tacotron

下一篇:Do Outliers Ruin Collaboration?

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...