Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Neil D. Lawrence
University of Cambridge
John Platt
Google (United States)
University of Sheffield
Microsoft (United States)
Building similarity graph...
Analyzing shared references across papers
Loading...
Lawrence et al. (Thu,) studied this question.
synapsesocial.com/papers/6a0f7af15725bbd5cc5fc9fd — DOI: https://doi.org/10.1145/1015330.1015382