A spectral regularization framework for multi-task structure learning

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Argyriou, Andreas ^a   Micchelli, Charles A ^b   Pontil, Massimiliano ^a   Ying, Yiming ^c  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b STATE UNIVERSITY OF NEW YORK   (United States)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING;

COMMON STRUCTURES; COMPUTATIONAL PROPERTIES; GENERALIZATION PERFORMANCE; MATRIX; MULTI TASKS; REGULARISATION; REGULARIZATION FRAMEWORK; SPECTRAL FUNCTION; STRUCTURE-LEARNING; TASK STRUCTURE;

MATRIX ALGEBRA;

EID: 85162007328     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J. Abernethy, F. Bach, T. Evgeniou, and J-P. Vert. Low-rank matrix factorization with attributes. Technical Report N24/06/MM, Ecole des Mines de Paris, 2006.
2. R. K. Ando and T. Zhang. A framework for learning predictive structures from multiple tasks and unlabeled data. Journal of Machine Learning Research, 6:1817-1853, 2005.
3. A. Argyriou, T. Evgeniou, and M. Pontil. Convex multi-task feature learning. Machine Learning, 2007. In press.
4. A. Argyriou, T. Evgeniou, and M. Pontil. Multi-task feature learning. In Advances in Neural Information Processing Systems 19, pages 41-48. 2007.
5. B. Bakker and T. Heskes. Task clustering and gating for bayesian multi.task learning. Journal of Machine Learning Research, 4:83-99, 2003.
6. J. Baxter. A model for inductive bias learning. J. of Artificial Intelligence Research, 12:149-198, 2000.
7. R. Bhatia. Matrix Analysis. Graduate texts in Mathematics. Springer, 1997.
8. R. Chari, W.W. Lockwood, and B.P. Coe et al. Sigma: a system for integrative genomic microarray analysis of cancer genomes. BMC Genomics, 7:324, 2006.
9. J.-B. Hiriart-Urruty and C. Lemaréchal. Convex Analysis and Minimization Algorithms. Springer, 1996.
10. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.
11. G.R.G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M.I. Jordan. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5:27-72, 2005.
12. P. J. Lenk, W. S. DeSarbo, P. E. Green, and M. R. Young. Hierarchical Bayes conjoint analysis: recovery of partworth heterogeneity from reduced experimental designs. Marketing Science, 15(2):173-191, 1996.
13. A. W. Marshall and I. Olkin. Inequalities: Theory of Majorization and its Applications. Academic Press, 1979.
14. A. Maurer. Bounds for linear multi-task learning. J. of Machine Learning Research, 7:117-139, 2006. (Pubitemid 43100916)
15. C.A. Micchelli and M. Pontil. Learning the kernel function via regularization. Journal of Machine Learning Research, 6:1099-1125, 2005.
16. R. Raina, A. Y. Ng, and D. Koller. Constructing informative priors using transfer learning. In Proceedings of the 23rd International Conference on Machine Learning, 2006.
17. N. Srebro, J. D. M. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. In Advances in Neural Information Processing Systems 17, pages 1329-1336. 2005.
18. A. Torralba, K. P. Murphy, and W. T. Freeman. Sharing features: efficient boosting procedures for multiclass object detection. In Proc. of Conf. on Computer Vision and Pattern Recognition. 2:762-769, 2004.
19. J. Zhang, Z. Ghahramani, and Y. Yang. Learning multiple related tasks using latent independent component analysis. In Advances in Neural Information Processing Systems 18, pages 1585-1592. 2006.