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 Ogawa, H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Sugiyama, M.
Right arrow Articles by Ogawa, H.
(Neural Computation. 2001;13:1863-1889.)
© 2001 The MIT Press


Letter

Subspace Information Criterion for Model Selection

Masashi Sugiyama

Department of Computer Science, Graduate School of Information Science and Engineering, Tokyo Institute of Technology, Meguro-ku, Tokyo, 152-8552, Japan

Hidemitsu Ogawa

Department of Computer Science, Graduate School of Information Science and Engineering, Tokyo Institute of Technology, Meguro-ku, Tokyo, 152-8552, Japan

The problem of model selection is considerably important for acquiring higher levels of generalization capability in supervised learning. In this article, we propose a new criterion for model selection, the subspace information criterion (SIC), which is a generalization of Mallows's CL. It is assumed that the learning target function belongs to a specified functional Hilbert space and the generalization error is defined as the Hilbert space squared norm of the difference between the learning result function and target function. SIC gives an unbiased estimate of the generalization error so defined. SIC assumes the availability of an unbiased estimate of the target function and the noise covariance matrix, which are generally unknown. A practical calculation method of SIC for least-mean-squares learning is provided under the assumption that the dimension of the Hilbert space is less than the number of training examples. Finally, computer simulations in two examples show that SIC works well even when the number of training examples is small.




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 page
Neural Comput.Home page
J.-M. Ye, X.-L. Zhu, and X.-D. Zhang
Adaptive Blind Separation with an Unknown Number of Sources
Neural Comput., August 1, 2004; 16(8): 1641 - 1660.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
M. Sugiyama, M. Kawanabe, and K.-R. Muller
Trading Variance Reduction with Unbiasedness: The Regularized Subspace Information Criterion for Robust Model Selection in Kernel Regression
Neural Comput., May 1, 2004; 16(5): 1077 - 1104.
[Abstract] [Full Text] [PDF]




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