NDLI: An Experimental and Theoretical Comparison of Model Selection Methods

Content Provider	Springer Nature Link
Author	Kearns, Michael Mansour, Yishay Ng, Andrew Y. Ron, Dana
Copyright Year	1997
Abstract	We investigate the problem of model selection in the setting of supervised learning of boolean functions from independent random examples. More precisely, we compare methods for finding a balance between the complexity of the hypothesis chosen and its observed error on a random training sample of limited size, when the goal is that of minimizing the resulting generalization error. We undertake a detailed comparison of three well-known model selection methods — a variation of Vapnik's Guaranteed Risk Minimization (GRM), an instance of Rissanen's Minimum Description Length Principle (MDL), and (hold-out) cross validation (CV). We introduce a general class of model selection methods (called penalty-based methods) that includes both GRM and MDL, and provide general methods for analyzing such rules. We provide both controlled experimental evidence and formal theorems to support the following conclusions:•Even on simple model selection problems, the behavior of the methods examined can be both complex and incomparable. Furthermore, no amount of “tuning” of the rules investigated (such as introducing constant multipliers on the complexity penalty terms, or a distribution-specific “effective dimension”) can eliminate this incomparability.•It is possible to give rather general bounds on the generalization error, as a function of sample size, for penalty-based methods. The quality of such bounds depends in a precise way on the extent to which the method considered automatically limits the complexity of the hypothesis selected.•For any model selection problem, the additional error of cross validation compared to any other method can be bounded above by the sum of two terms. The first term is large only if the learning curve of the underlying function classes experiences a phase transition” between (1-γ)m and m examples (where gamma is the fraction saved for testing in CV). The second and competing term can be made arbitrarily small by increasing γ.•The class of penalty-based methods is fundamentally handicapped in the sense that there exist two types of model selection problems for which every penalty-based method must incur large generalization error on at least one, while CV enjoys small generalization error on both.
Starting Page	7
Ending Page	50
Page Count	44
File Format	PDF
ISSN	08856125
Journal	Machine Learning
Volume Number	27
Issue Number	1
e-ISSN	15730565
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	1997-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computer Science Artificial Intelligence (incl. Robotics) Automation and Robotics
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Experimental Comparison of Model-Based Clustering Methods

Metric-Based Methods for Adaptive Model Selection and Regularization

Model Selection and Error Estimation

Model Selection for Small Sample Regression

An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Guest Introduction: Special Issue on New Methods for Model Selection and Model Combination

A Theoretical Analysis of Query Selection for Collaborative Filtering

Theoretical and Experimental Evaluation of the Subspace Information Criterion

Nonparametric Time Series Prediction Through Adaptive Model Selection

An Experimental and Theoretical Comparison of Model Selection Methods

Similar Documents

An Experimental Comparison of Model-Based Clustering Methods

Metric-Based Methods for Adaptive Model Selection and Regularization

Model Selection and Error Estimation

Model Selection for Small Sample Regression

An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Guest Introduction: Special Issue on New Methods for Model Selection and Model Combination

A Theoretical Analysis of Query Selection for Collaborative Filtering

Theoretical and Experimental Evaluation of the Subspace Information Criterion

Nonparametric Time Series Prediction Through Adaptive Model Selection

An Experimental and Theoretical Comparison of Model Selection Methods