A Proof of theorems

G if and only if for any constraint in G, the corresponding loss term is 0 . Our loss terms clearly connect the HEX property. The number of labels, types of features, the number of instances vary significantly. The diversity of these datasets makes them suitable for evaluating the multi-label classification task. We add mutual exclusion edges between two labels whenever there is no instance in the training set simultaneously belonging to them.