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.

Monotone conditional complexity bounds on future prediction errors

Simple item page
dc.contributor.authorChernov, Alexey
dc.contributor.authorHutter, Marcus
dc.coverage.spatialSingapore
dc.date.accessioned2015-12-10T22:41:04Z
dc.date.createdOctober 8-11 2005
dc.date.issued2005
dc.date.updated2016-02-24T11:44:51Z
dc.description.abstractWe bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true distribution μ by the algorithmic complexity of μ. Here we assume that we ar
dc.identifier.isbn354029242X
dc.identifier.urihttp://hdl.handle.net/1885/57726
dc.publisherSpringer
dc.relation.ispartofseriesInternational Conference on Algorithmic Learning Theory (ALT 2005)
dc.rightsCopyright Information: © Springer-Verlag Berlin Heidelberg 2005. http://www.sherpa.ac.uk/romeo/issn/0302-9743/..."Author's post-print on any open access repository after 12 months after publication" from SHERPA/RoMEO site (as at 31/08/15)
dc.rightsCopyright Information: © 2006 Elsevier Inc. http://www.sherpa.ac.uk/romeo/issn/0890-5401/..."Author's post-print on open access repository after an embargo period of between 12 months and 48 months" from SHERPA/RoMEO site (as at 28/08/15)
dc.sourceAlgorithmic Learning Theory: Proceedings of the 16th International Conference on Algorithmic Learning Theory (ALT-05) - LNAI 3734
dc.source.urihttp://www.springerlink.com/content/4l3kjpj6kjw7
dc.subjectKeywords: Kolmogorov complexity; Monotone conditional complexity; Online sequential prediction; Posterior bounds; Randomness deficiency; Solomonoff prior; Algorithms; Bayesian networks; Computational complexity; Forecasting; Random processes; Parallel processing sy Future loss; Kolmogorov complexity; Monotone conditional complexity; Online sequential prediction; Posterior bounds; Randomness deficiency; Solomonoff prior; Total error
dc.titleMonotone conditional complexity bounds on future prediction errors
dc.typeConference paper
local.bibliographicCitation.lastpage428
local.bibliographicCitation.startpage414
local.contributor.affiliationChernov, Alexey, IDSIA-Istituto Dalle Molle di Studi sull Intelligenza Artificiale
local.contributor.affiliationHutter, Marcus, College of Engineering and Computer Science, ANU
local.contributor.authoruidHutter, Marcus, u4350841
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080299 - Computation Theory and Mathematics not elsewhere classified
local.identifier.ariespublicationu8803936xPUB412
local.identifier.doi10.1016/j.ic.2006.10.004
local.identifier.scopusID2-s2.0-84855201017
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 3 of 3
Thumbnail Image
Name:
01_Chernov_Monotone_conditional_2005.pdf
Size:
255.49 KB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
02_Chernov_Monotone_conditional_2005.pdf
Size:
95.28 KB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
03_Chernov_Monotone_conditional_2005.pdf
Size:
94.7 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS