资源分类
》 资源 》论文》Empirical Risk Minimization with Approximations of Probabilistic Grammars

Empirical Risk Minimization with Approximations of Probabilistic Grammars

2020-01-06 | |  54 |   47 |   0

Abstract

Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. We present a framework, reminiscent of structural risk minimization, for empirical risk minimization of the parameters of a fixed probabilistic grammar using the log-loss. We derive sample complexity bounds in this framework that apply both to the supervised setting and the unsupervised setting.

上一篇：Avoiding False Positive in Multi-Instance Learning

下一篇：Transduction with Matrix Completion: Three Birds with One Stone

用户评价
全部评价

热门资源

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

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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