Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

On the computability of solomonoff induction and knowledge-seeking

Simple item page
dc.contributor.authorLeike, Jan
dc.contributor.authorHutter, Marcus
dc.coverage.spatialBanff, Canada
dc.date.accessioned2016-06-14T23:20:28Z
dc.date.createdOctober 4-6, 2015
dc.date.issued2015
dc.date.updated2016-06-14T08:49:26Z
dc.description.abstractSolomonoff induction is held as a gold standard for learning, but it is known to be incomputable. We quantify its incomputability by placing various flavors of Solomonoff’s prior M in the arithmetical hierarchy. We also derive computability bounds for knowledge-seeking agents, and give a limit-computable weakly asymptotically optimal reinforcement learning agent.
dc.identifier.isbn9783319244853
dc.identifier.urihttp://hdl.handle.net/1885/103397
dc.publisherSpringer International Publishing Switzerland
dc.relation.ispartofseries26th International Conference on Algorithmic Learning Theory, ALT 2015
dc.rights17/12 Fixed and entered. 15Dec15 Problem uploading document
dc.rightsAuthor/s retain copyrighten_AU
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.titleOn the computability of solomonoff induction and knowledge-seeking
dc.typeConference paper
dcterms.accessRightsOpen Accessen_AU
local.bibliographicCitation.lastpage378
local.bibliographicCitation.startpage364
local.contributor.affiliationLeike, Jan, College of Engineering and Computer Science, ANU
local.contributor.affiliationHutter, Marcus, College of Engineering and Computer Science, ANU
local.contributor.authoruidLeike, Jan, u5485774
local.contributor.authoruidHutter, Marcus, u4350841
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080101 - Adaptive Agents and Intelligent Robotics
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationU3488905xPUB6791
local.identifier.doi10.1007/978-3-319-24486-0_24
local.identifier.scopusID2-s2.0-84945896812
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Leike_On_the_computability_of_2015.pdf
Size:
274.73 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS