Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Sugiyama, M.
Right arrow Articles by Müller, K.-R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Sugiyama, M.
Right arrow Articles by Müller, K.-R.
(Neural Computation. 2004;16:1077-1104.)
© 2004 The MIT Press


Letter

Trading Variance Reduction with Unbiasedness: The Regularized Subspace Information Criterion for Robust Model Selection in Kernel Regression

Masashi Sugiyama

sugi{at}cs.titech.ac.jp, Fraunhofer FIRST, IDA, 12489 Berlin, Germany, and Department of Computer Science, Tokyo Institute of Technology, Meguro-ku, Tokyo, 152-8552, Japan

Motoaki Kawanabe

nabe{at}first.fhg.de, Fraunhofer FIRST, IDA, 12489 Berlin, Germany

Klaus-Robert Müller

klaus{at}first.fhg.de, Fraunhofer FIRST, IDA, 12489 Berlin, Germany, and Department of Computer Science, University of Potsdam, 14482 Potsdam, Germany

A well-known result by Stein (1956) shows that in particular situations, biased estimators can yield better parameter estimates than their generally preferred unbiased counterparts. This letter follows the same spirit, as we will stabilize the unbiased generalization error estimates by regularization and finally obtain more robust model selection criteria for learning. We trade a small bias against a larger variance reduction, which has the beneficial effect of being more precise on a single training set. We focus on the subspace information criterion (SIC), which is an unbiased estimator of the expected generalization error measured by the reproducing kernel Hilbert space norm. SIC can be applied to the kernel regression, and it was shown in earlier experiments that a small regularization of SIC has a stabilization effect. However, it remained open how to appropriately determine the degree of regularization in SIC. In this article, we derive an unbiased estimator of the expected squared error, between SIC and the expected generalization error and propose determining the degree of regularization of SIC such that the estimator of the expected squared error is minimized. Computer simulations with artificial and real data sets illustrate that the proposed method works effectively for improving the precision of SIC, especially in the high-noise-level cases. We furthermore compare the proposed method to the original SIC, the cross-validation, and an empirical Bayesian method in ridge parameter selection, with good results.




This article has been cited by other articles:


Home page
IEICE Trans FundamentalsHome page
M. SUGIYAMA and K. SAKURAI
Analytic Optimization of Shrinkage Parameters Based on Regularized Subspace Information Criterion
IEICE Trans A: Fundamentals, August 1, 2006; E89-A(8): 2216 - 2225.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2004 by The MIT Press.