Jump to ContentJump to Main Navigation
Dataset Shift in Machine Learning$
Users without a subscription are not able to see the full content.

Joaquin Quiñonero-Candela, Masashi Sugiyama, Anton Schwaighofer, and Neil D. Lawrence

Print publication date: 2008

Print ISBN-13: 9780262170055

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262170055.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2022. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use.date: 02 July 2022

On Bayesian Transduction: Implications for the Covariate Shift Problem

On Bayesian Transduction: Implications for the Covariate Shift Problem

(p.65) 4 On Bayesian Transduction: Implications for the Covariate Shift Problem
Dataset Shift in Machine Learning

Kai Hansen Lars

The MIT Press

This chapter analyzes Bayesian supervised learning with extensions to semisupervised learning, and learning with covariate or dataset shift. The main result is an expression for the generalization optimal Bayesian procedure. The resulting “Bayesian transduction” average is optimal for a realizable model. For semisupervised learning, this implies that all available data, including unlabeled data, should be used in the likelihood, hence in forming the parameter posterior. In the case of covariate or dataset shift, the situation is contingent on the parameterization.

Keywords:   Bayesian supervised learning, semisupervised learning, covariate shift, dataset shift

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.