A Caltech Library Service

The Bin Model

Abu-Mostafa, Yaser and Song, Xubo and Nicholson, Alexander and Magdon-Ismail, Malik (2004) The Bin Model. Computer Science Technical Reports, 2004.001. California Institute of Technology , Pasadena, CA. (Unpublished)

PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


We propose a novel theoretical framework for understanding learning and generalization which we will call the bin model. Using the bin model, a closed form is derived for the generalization error that estimates the out-of-sample performance in terms of the in-sample performance. We address the problem of overfitting, and show that using a simple exhaustive learning algorithm it does not arise. This is independent of the target function, input distribution and learning model, and remains true even with noisy data sets. We apply our analysis to both classification and regression problems and give an example of how it may be used effectively in practice.

Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Subject Keywords:Learning theory, generalization, noisy data, VC dimension, out of sample error, overfitting
Series Name:Computer Science Technical Reports
Issue or Number:2004.001
Record Number:CaltechCSTR:2004.002
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:27073
Deposited By: Imported from CaltechCSTR
Deposited On:06 Jul 2004
Last Modified:03 Oct 2019 03:20

Repository Staff Only: item control page