Optimizing Average Precision using Weakly Supervised Data

Aseem Behl 1 C.V. Jawahar 1 M. Pawan Kumar 2, 3
1 CVIT
CVIT - Center for Visual Information Technology [Hyderabad]
Abstract : The performance of binary classification tasks, such as action classification and object detection, is often measured in terms of the average precision (AP). Yet it is common practice in computer vision to employ the support vector machine (SVM) classifier, which optimizes a surrogate 0-1 loss. The popularity of SVM can be attributed to its empirical performance. Specifically, in fully supervised settings, SVM tends to provide similar accuracy to the AP-SVM classifier, which directly optimizes an AP-based loss. However, we hypothesize that in the significantly more challenging and practically useful setting of weakly supervised learning, it becomes crucial to optimize the right accuracy measure. In order to test this hypothesis, we propose a novel latent AP-SVM that minimizes a carefully designed upper bound on the AP-based loss function over weakly supervised samples. Using publicly available datasets, we demonstrate the advantage of our approach over standard loss-based binary classifiers on two challenging problems: action classification and character recognition.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/hal-00984699
Contributor : M. Pawan Kumar <>
Submitted on : Monday, April 28, 2014 - 5:00:24 PM
Last modification on : Thursday, February 7, 2019 - 5:29:29 PM
Document(s) archivé(s) le : Monday, July 28, 2014 - 12:06:16 PM

File

BJK-CVPR2014.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00984699, version 1

Collections

Citation

Aseem Behl, C.V. Jawahar, M. Pawan Kumar. Optimizing Average Precision using Weakly Supervised Data. CVPR - IEEE Conference on Computer Vision and Pattern Recognition, 2014, Columbus, Ohio, United States. ⟨hal-00984699⟩

Share

Metrics

Record views

622

Files downloads

348