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

An Adversarial View of Covariate Shift and a Minimax Approach

An Adversarial View of Covariate Shift and a Minimax Approach

(p.178) (p.179) 10 An Adversarial View of Covariate Shift and a Minimax Approach
Dataset Shift in Machine Learning

Globerson Amir

Hui Teo Choon

Smola Alex

Roweis Sam

The MIT Press

This chapter considers an adversarial model where the learning algorithm attempts to construct a predictor that is robust to deletion of features at test time. The problem is formulated as finding the optimal minimax strategy with respect to an adversary which deletes features, and shows that the optimal strategy may be found by either solving a quadratic program or using efficient bundle methods for optimization. The resulting algorithm significantly improves prediction performance for several problems included in a spam-filtering challenge task.

Keywords:   learning algorithm, minimax problem, spam filtering, optimization

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.