Boosting for transfer learning

ABSTRACT

Traditional machine learning makes a basic assumption: the training and test data should be under the same distribution. However, in many cases, this identical-distribution assumption does not hold. The assumption might be violated when a task from one new domain comes, while there are only labeled data from a similar old domain. Labeling the new data can be costly and it would also be a waste to throw away all the old data. In this paper, we present a novel transfer learning framework called TrAdaBoost, which extends boosting-based learning algorithms (Freund & Schapire, 1997). TrAdaBoost allows users to utilize a small amount of newly labeled data to leverage the old data to construct a high-quality classification model for the new data. We show that this method can allow us to learn an accurate model using only a tiny amount of new data and a large amount of old data, even when the new data are not sufficient to train a model alone. We show that TrAdaBoost allows knowledge to be effectively transferred from the old data to the new. The effectiveness of our algorithm is analyzed theoretically and empirically to show that our iterative algorithm can converge well to an accurate model.

REFERENCES

• 1: Ben-David, S., & Schuller, R. (2003). Exploiting task relatedness for multiple task learning. Proceedings of the Sixteenth Annual Conference on Learning Theory.
• 2: Bickel, S., & Scheffer, T. (2007). Dirichlet-enhanced spam filtering based on biased samples. In Advances in neural information processing systems 19.
• 3: Bernhard E. Boser , Isabelle M. Guyon , Vladimir N. Vapnik, A training algorithm for optimal margin classifiers, Proceedings of the fifth annual workshop on Computational learning theory, p.144-152, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130401]
• 4: Rich Caruana, Multitask Learning, Machine Learning, v.28 n.1, p.41-75, July 1997 [doi>10.1023/A:1007379606734]
• 5: DauméIII, H., & Marcu, D. (2006). Domain adaptation for statistical classifiers. Journal of Artificial Intelligence Research, 26, 101--126.
• 6: Dudík, M., Schapire, R., & Phillips, S. (2006). Correcting sample selection bias in maximum entropy density estimation. In Advances in neural information processing systems 18.
• 7: Yoav Freund , Robert E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and System Sciences, v.55 n.1, p.119-139, Aug. 1997 [doi>10.1006/jcss.1997.1504]
• 8: Heckman, J. J. (1979). Sample selection bias as a specification error. Econometrica, 47, 153--161.
• 9: Huang, J., Smola, A., Gretton, A., Borgwardt, K. M., & Schöölkopf, B. (2007). Correcting sample selection bias by unlabeled data. In Advances in neural information processing systems 19.
• 10: Thorsten Joachims, Transductive Inference for Text Classification using Support Vector Machines, Proceedings of the Sixteenth International Conference on Machine Learning, p.200-209, June 27-30, 1999
• 11: Joachims, T. (2002). Learning to classify text using support vector machines. Dissertation, Kluwer.
• 12: Kullback, S., & Leibler, R. A. (1951). On information and sufficiency. Annals of Mathematical Statistics, 22(1), 79--86.
• 13: Xuejun Liao , Ya Xue , Lawrence Carin, Logistic regression with an auxiliary data source, Proceedings of the 22nd international conference on Machine learning, p.505-512, August 07-11, 2005, Bonn, Germany [doi>10.1145/1102351.1102415]
• 14: Rosenstein, M. T., Marx, Z., Kaelbling, L. P., & Dietterich, T. G. (2005). To transfer or not to transfer. Proceedings of NIPS 2005 Workshop on Inductive Transfer: 10 Years Later.
• 15: Robert E. Schapire, A Brief Introduction to Boosting, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, p.1401-1406, July 31-August 06, 1999
• 16: Robert E. Schapire , Yoav Freund , Peter Barlett , Wee Sun Lee, Boosting the margin: A new explanation for the effectiveness of voting methods, Proceedings of the Fourteenth International Conference on Machine Learning, p.322-330, July 08-12, 1997
• 17: Schmidhuber, J. (1994). On learning how to learn learning strategies (Technical Report FKI-198-94). Fakultat fur Informatik.
• 18: Shimodaira, H. (2000). Improving predictive inference under covariate shift by weighting the log-likelihood function. Journal of Statistical Planning and Inference, 90, 227--244.
• 19: Thrun, S., & Mitchell, T. M. (1995). Learning one more thing. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence.
• 20: Pengcheng Wu , Thomas G. Dietterich, Improving SVM accuracy by training on auxiliary data sources, Proceedings of the twenty-first international conference on Machine learning, p.110, July 04-08, 2004, Banff, Alberta, Canada [doi>10.1145/1015330.1015436]
• 21: Bianca Zadrozny, Learning and evaluating classifiers under sample selection bias, Proceedings of the twenty-first international conference on Machine learning, p.114, July 04-08, 2004, Banff, Alberta, Canada [doi>10.1145/1015330.1015425]