Efficient Model Selection for Regularized Classification by Exploiting Unlabeled Data - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Efficient Model Selection for Regularized Classification by Exploiting Unlabeled Data

(1) , (2) , (1) , (3) , (1)
1
2
3

Abstract

Hyper-parameter tuning is a resource-intensive task when optimizing classification models. The commonly used k-fold cross validation can become intractable in large scale settings when a classifier has to learn billions of parameters. At the same time, in real-world, one often encounters multi-class classification scenarios with only a few labeled examples; model selection approaches often offer little improvement in such cases and the default values of learners are used. We propose bounds for classification on accuracy and macro measures (precision, recall, F1) that motivate efficient schemes for model selection and can benefit from the existence of unlabeled data. We demonstrate the advantages of those schemes by comparing them with k-fold cross validation and hold-out estimation in the setting of large scale classification.
Fichier principal
Vignette du fichier
Quantification_IDA15.pdf (510.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01237129 , version 1 (02-12-2015)

Identifiers

Cite

Georgios Balikas, Ioannis Partalas, Eric Gaussier, Rohit Babbar, Massih-Reza Amini. Efficient Model Selection for Regularized Classification by Exploiting Unlabeled Data. 14th International Symposium on Intelligent Data Analysis, IDA, Oct 2015, Saint-Etienne, France. ⟨10.1007/978-3-319-24465-5_3⟩. ⟨hal-01237129⟩
255 View
155 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More