论文信息 - Learning to learn with the informative vector machine

Learning to learn with the informative vector machine

This paper describes an efficient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn independently from the same GP prior. An efficient algorithm is obtained by extending the informative vector machine (IVM) algorithm to handle the multi-task learning case. The multi-task IVM (MTIVM) saves computation by greedily selecting the most informative examples from the separate tasks. The MT-IVM is also shown to be more efficient than random sub-sampling on an artificial data-set and more effective than the traditional IVM in a speaker dependent phoneme recognition task.

Neil D. Lawrence | John C. Platt | Neil D. Lawrence

[1] Christopher K. I. Williams. Prediction with Gaussian Processes: From Linear Regression to Linear Prediction and Beyond , 1999, Learning in Graphical Models.

[2] Carl E. Rasmussen,et al. In Advances in Neural Information Processing Systems , 2011 .

[3] Sebastian Thrun,et al. Is Learning The n-th Thing Any Easier Than Learning The First? , 1995, NIPS.

[4] Jonathan Baxter,et al. Learning internal representations , 1995, COLT '95.

[5] L. Csató. Gaussian processes:iterative sparse approximations , 2002 .

[6] Neil D. Lawrence,et al. Fast Sparse Gaussian Process Methods: The Informative Vector Machine , 2002, NIPS.

[7] Michael I. Jordan,et al. Advances in Neural Information Processing Systems 30 , 1995 .

[8] Matthias W. Seeger,et al. Covariance Kernels from Bayesian Generative Models , 2001, NIPS.

[9] Rich Caruana,et al. Multitask Learning , 1998, Encyclopedia of Machine Learning and Data Mining.

[10] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .

[11] David Haussler,et al. Using the Fisher Kernel Method to Detect Remote Protein Homologies , 1999, ISMB.