Computationally Efficient Multi-task Learning with Least-squares Probabilistic Classifiers
Jaak Simm, Masashi Sugiyama, Tsuyoshi Kato · IPSJ Transactions on Computer Vision and Applications · 2011
Probabilistic classification and multi-task learning are two important branches of machine learning research. Probabilistic classification is useful when the ‘confidence’ of decision is necessary. On the other hand, the idea of multi-task learning is beneficial if multiple related learning tasks exist. So far, kernelized logistic regression has been a vital probabilistic classifier for the use in multi-task learning scenarios. However, its training tends to be computationally expensive, which prevented its use in large-scale problems. To overcome this limitation, we propose to employ a recently-proposed probabilistic classifier called the least-squares probabilistic classifier in multi-task learning scenarios. Through image classification experiments, we show that our method achieves comparable classification performance to the existing method, with much less training time.
Cited by 9 works. doi:10.2197/ipsjtcva.3.1 Open-access PDF
Authors
References
- The Elements of Statistical Learning
- The Elements of Statistical Learning: Data Mining, Inference, and Prediction
- The use of the area under the ROC curve in the evaluation of machine learning algorithms
- Editorial
- Regularized multi--task learning
- Characterising Virtual Eigensignatures for General Purpose Face Recognition
- The Matrix Cookbook
- A comparison of numerical optimizers for logistic regression
- Multi-task learning for classification with dirichlet process priors
- Superfast-Trainable Multi-Class Probabilistic Classifier by Least-Squares Posterior Fitting