资源分类
》 资源 》论文》A Non-generative Framework and Convex Relaxations for Unsupervised Learning

A Non-generative Framework and Convex Relaxations for Unsupervised Learning

2020-02-10 | |  69 |   37 |   0

Abstract 

We give a novel formal theoretical framework for unsupervised learning with two distinctive characteristics. First, it does not assume any generative model and based on a worst-case performance metric. Second, it is comparative, namely performance is measured with respect to a given hypothesis class. This allows to avoid known computational hardness results and improper algorithms based on convex relaxations. We show how several families of unsupervised learning models, which were previously only analyzed under probabilistic assumptions and are otherwise provably intractable, can be efficiently learned in our framework by convex optimization.

上一篇：Learning Transferrable Representations for Unsupervised Domain Adaptation

下一篇：Tagger: Deep Unsupervised Perceptual Grouping

用户评价
全部评价

热门资源

  • 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...