Learning from multiple sources

Journal of Machine Learning Research

Volumn 9, Issue , 2008, Pages 1757-1774

  Crammer, Koby ^a   Kearns, Michael ^a   Wortman, Jennifer ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Error bounds; Multi task learning

Indexed keywords

ERROR BOUNDS; MULTI-TASK LEARNING; MULTIPLE DATA SOURCES; MULTIPLE SOURCES;

DECISION THEORY;

EID: 50949127968     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. M. Anthony and P. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999.
2. P. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3:463-482, 2002.
3. P. Bartlett, S. Boucheron, and G. Lugosi. Model selection and error estimation. Machine Learning, 48:85-113, 2002.
4. J. Baxter. Learning internal representations. In Proceedings of the Eighth Annual Conference on Computational Learning Theory, 1995.
5. S. Ben-David. Exploiting task relatedness for multiple task learning. In Proceedings of the Sixteenth Annual Conference on Computational Learning Theory, 2003.
6. J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. Wortman. Learning bounds for domain adaptation. In Advances in Neural Information Processing Systems 20, 2007.
7. K. Crammer, M. Kearns, and J. Wortman. Learning from data of variable quality. In Advances in Neural Information Processing Systems 18, 2006.
8. K. Crammer, M. Kearns, and J. Wortman. Learning from multiple sources. In Advances in Neural Information Processing Systems 19, 2007.
9. D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78-150, 1992.
10. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
11. V. Koltchinskii. Rademacher penalties and structural risk minimization. IEEE Transactions on Information Theory, 47(5):1902-1914, 2001.
12. V. Koltchinskii and D. Panchenko. Rademacher processes and bounding the risk of function learning. High Dimensional Probability, II:443-459, 2000.
13. A. Maurer. Algorithmic stability and meta-learning. Journal of Machine Learning Research, 6: 967-994, 2005.
14. C. McDiarmid. On the method of bounded differences. Surveys in Combinatorics, pages 148-188, 1989.
15. V. Vapnik. Statistical Learning Theory. Wiley, 1998.
16. P. Wu and T. Dietterich. Improving SVM accuracy by training on auxiliary data sources. In Proceedings of the Twenty-First International Conference on Machine Learning, 2004.