资源分类
》 资源 》论文》Spectral Regularization for Max-Margin Sequence Tagging

Spectral Regularization for Max-Margin Sequence Tagging

2020-03-04 | |  59 |   41 |   0

Abstract

We frame max-margin learning of latent variable structured prediction models as a convex optimization problem, making use of scoring functions computed by input-output observable operator models. This learning problem can be expressed as an optimization problem involving a low-rank Hankel matrix that represents the inputoutput operator model. The direct outcome of our work is a new spectral regularization method for max-margin structured prediction. Our experiments confirm that our proposed regularization framework leads to an effective way of controlling the capacity of structured prediction models.

上一篇：On Robustness and Regularization of Structural Support Vector Machines

下一篇：Towards Minimax Online Learning with Unknown Time Horizon

用户评价
全部评价

热门资源

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