dc.contributor.author |
Hay, N.J |
en |
dc.date.accessioned |
2009-04-16T23:15:12Z |
en |
dc.date.available |
2009-04-16T23:15:12Z |
en |
dc.date.issued |
2007-02 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-300 (2007) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3807 |
en |
dc.description.abstract |
Universal semimeasures [Hut05][LV97], a type of function derived from probability
and computability theory, describe extremely powerful sequence predictors. They
outperform all other predictors but for a penalty no more than the predictor’s complexity.
They learn to predict any computable sequence with error no more than
the sequence’s complexity. Universal semimeasures work by modelling the sequence
as generated by an unknown program running on a universal computer. Although
these predictors are uncomputable, and so cannot be implemented in practice, they
serve to describe an ideal: an existence proof for systems that predict better than
humans.
We review the mathematics behind universal semimeasures and discuss some of its
implications. Our approach differs from previous ones in several respects. We show
semimeasures correspond to probability measures over the set of finite and infinite
sequences, establishing a rigorous footing. We demonstrate the existence of universal
semimeasures using a novel proof of the equivalence between enumerable semimeasures
and processes. We take into account the possibility of sequence termination
leading to a stronger definition of universality. To make explicit hidden constants we
define a novel complexity measure, simulation complexity, which generalises monotone
complexity. Finally, we emphasise the use of logarithmic scoring rules [Ber79]
to measure error in prediction. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
Universal Semimeasures: An Introduction |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |