Abstract

We study the problem of learning with label proportions in which the training data is provided in groups and only the proportion of each class in each group is known. We propose a new method called proportionSVM, or ∝SVM, which explicitly models the latent unknown instance labels together with the known group label proportions in a largemargin framework. Unlike the existing works, our approach avoids making restrictive assumptions about the data. The ∝SVM model leads to a non-convex integer programming problem. In order to solve it efficiently, we propose two algorithms: one based on simple alternating optimization and the other based on a convex relaxation. Extensive experiments on standard datasets show that ∝SVM outperforms the state-of-the-art, especially for larger group sizes.