Abstract
We consider the problem of learning in an environment of classification tasks. Tasks sampled from the environment are used to improve classification performance on future tasks. We consider situations in which the tasks can be divided into groups. Tasks within each group are related by sharing a low dimensional representation, which differs across the groups. We present an algorithm which divides the sampled tasks into groups and computes a common representation for each group. We report experiments on a synthetic and two image data sets, which show the advantage of the approach over single-task learning and a previous transfer learning method.
Chapter PDF
Similar content being viewed by others
References
Ando, R.K., Zhang, T.: A framework for learning predictive structures from multiple tasks and unlabeled data. Journal of Machine Learning Research 6, 1817–1853 (2005)
Argyriou, A., Evgeniou, T., Pontil, M.: Convex multi-task feature learning. Machine Learning (2008), http://www.springerlink.com/content/161105027v344n03
Argyriou, A., Micchelli, C.A., Pontil, M., Ying, Y.: A spectral regularization framework for multi-task structure learning. Advances in Neural Information Processing Systems (2007)
Argyriou, A., Maurer, A., Pontil, M.: Generalization Bounds for Task Grouping (Technical Report), University College London (February 2008)
Bakker, B., Heskes, T.: Task clustering and gating for Bayesian multi–task learning. Journal of Machine Learning Research 4, 83–99 (2003)
Baxter, J.: A model for inductive bias learning. Journal of Artificial Intelligence Research 12, 149–198 (2000)
Caruana, R.: Multi–task learning. Machine Learning 28, 41–75 (1997)
Evgeniou, T., Micchelli, C.A., Pontil, M.: Learning multiple tasks with kernel methods. Journal of Machine Learning Research 6, 615–637 (2005)
Fazel, M., Hindi, H., Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings, American Control Conference, pp. 4734–4739 (2001)
Maurer, A.: Bounds for linear multi-task learning. Journal of Machine Learning Research 7, 117–139 (2006)
Srebro, N., Rennie, J.D.M., Jaakkola, T.: Maximum-margin matrix factorization. In: Advances in Neural Information Processing Systems, vol. 17, pp. 1329–1336. MIT Press, Cambridge (2005)
Thrun, S., O’Sullivan, J.: Discovering structure in multiple learning tasks: The TC algorithm. In: Proceedings of the Thirteenth International Conference on Machine Learning, pp. 489–497 (1996)
Wilson, A., Fern, A., Ray, S., Tadepalli, P.: Multi-task reinforcement learning: a hierarchical Bayesian approach. In: Proceedings of the Twenty-Fourth International Conference on Machine Learning, pp. 1015–1022 (2007)
Xue, Y., Liao, X., Carin, L., Krishnapuram, B.: Multi-task learning for classification with Dirichlet process priors. Journal of Machine Learning Research 8, 35–63 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Argyriou, A., Maurer, A., Pontil, M. (2008). An Algorithm for Transfer Learning in a Heterogeneous Environment. In: Daelemans, W., Goethals, B., Morik, K. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2008. Lecture Notes in Computer Science(), vol 5211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87479-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-87479-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87478-2
Online ISBN: 978-3-540-87479-9
eBook Packages: Computer ScienceComputer Science (R0)