English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Occam's Razor

Rasmussen, C., & Ghahramani, Z. (2001). Occam's Razor. In T. Leen, T. Dietterich, & V. Tresp (Eds.), Advances in Neural Information Processing Systems 13 (pp. 294-300). Cambridge, MA, USA: MIT Press.

Item is

Files

show Files

Locators

show
hide
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Rasmussen, CE1, Author           
Ghahramani , Z, Author
Affiliations:
1External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 Abstract: The Bayesian paradigm apparently only sometimes gives rise to Occam's Razor; at other times very large models perform well. We give simple examples of both kinds of behaviour. The two views are reconciled when measuring complexity of functions, rather than of the machinery used to implement them. We analyze the complexity of functions for some linear in the parameter models that are equivalent to Gaussian Processes, and always find Occam's Razor at work.

Details

show
hide
Language(s):
 Dates: 2001-04
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: 2215
 Degree: -

Event

show
hide
Title: Fourteenth Annual Neural Information Processing Systems Conference (NIPS 2000)
Place of Event: Denver, CO, USA
Start-/End Date: 2000-11-27 - 2000-12-02

Legal Case

show

Project information

show

Source 1

show
hide
Title: Advances in Neural Information Processing Systems 13
Source Genre: Proceedings
 Creator(s):
Leen, TK, Editor
Dietterich, TG, Editor
Tresp, V, Editor
Affiliations:
-
Publ. Info: Cambridge, MA, USA : MIT Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 294 - 300 Identifier: ISBN: 0-262-12241-3