Predict and Constrain: Modeling Cardinality in Deep Structured Prediction release_ifnrvz3kczg5xm24ztfxd75k2u

by Nataly Brukhim, Amir Globerson

Released as a article .

2018  

Abstract

Many machine learning problems require the prediction of multi-dimensional labels. Such structured prediction models can benefit from modeling dependencies between labels. Recently, several deep learning approaches to structured prediction have been proposed. Here we focus on capturing cardinality constraints in such models. Namely, constraining the number of non-zero labels that the model outputs. Such constraints have proven very useful in previous structured prediction approaches, but it is a challenge to introduce them into a deep learning framework. Here we show how to do this via a novel deep architecture. Our approach outperforms strong baselines, achieving state-of-the-art results on multi-label classification benchmarks.
In text/plain format

Archived Files and Locations

application/pdf  436.1 kB
file_otp5fr64yrg3zfsuclthdzkx4e
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2018-02-13
Version   v1
Language   en ?
arXiv  1802.04721v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 41dfb85b-b5aa-4921-84f6-ede02d503f0e
API URL: JSON