Chapter

Learning Theory

Volume 4539 of the series Lecture Notes in Computer Science pp 589-603

The Loss Rank Principle for Model Selection

  • Marcus HutterAffiliated withRSISE @ ANU and SML @ NICTA, Canberra, ACT, 0200

* Final gross prices may vary according to local VAT.

Get Access

Abstract

A key issue in statistics and machine learning is to automatically select the “right” model complexity, e.g. the number of neighbors to be averaged over in k nearest neighbor (kNN) regression or the polynomial degree in regression with polynomials. We suggest a novel principle (LoRP) for model selection in regression and classification. It is based on the loss rank, which counts how many other (fictitious) data would be fitted better. LoRP selects the model that has minimal loss rank. Unlike most penalized maximum likelihood variants (AIC,BIC,MDL), LoRP only depends on the regression functions and the loss function. It works without a stochastic noise model, and is directly applicable to any non-parametric regressor, like kNN.