Predict and Constrain: Modeling Cardinality in Deep Structured Prediction

Nataly Brukhim, Amir Globerson
Proceedings of the 35th International Conference on Machine Learning, PMLR 80:659-667, 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 methods, but it is a challenge to introduce them into a deep learning approach. 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.

Cite this Paper


BibTeX
@InProceedings{pmlr-v80-brukhim18a, title = {Predict and Constrain: Modeling Cardinality in Deep Structured Prediction}, author = {Brukhim, Nataly and Globerson, Amir}, booktitle = {Proceedings of the 35th International Conference on Machine Learning}, pages = {659--667}, year = {2018}, editor = {Dy, Jennifer and Krause, Andreas}, volume = {80}, series = {Proceedings of Machine Learning Research}, month = {10--15 Jul}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v80/brukhim18a/brukhim18a.pdf}, url = {http://proceedings.mlr.press/v80/brukhim18a.html}, 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 methods, but it is a challenge to introduce them into a deep learning approach. 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.} }
Endnote
%0 Conference Paper %T Predict and Constrain: Modeling Cardinality in Deep Structured Prediction %A Nataly Brukhim %A Amir Globerson %B Proceedings of the 35th International Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2018 %E Jennifer Dy %E Andreas Krause %F pmlr-v80-brukhim18a %I PMLR %P 659--667 %U http://proceedings.mlr.press/v80/brukhim18a.html %V 80 %X 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 methods, but it is a challenge to introduce them into a deep learning approach. 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.
APA
Brukhim, N. & Globerson, A.. (2018). Predict and Constrain: Modeling Cardinality in Deep Structured Prediction. Proceedings of the 35th International Conference on Machine Learning, in Proceedings of Machine Learning Research 80:659-667 Available from http://proceedings.mlr.press/v80/brukhim18a.html.

Related Material