<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T05:27:55Z</responseDate>
  <request identifier="635" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:635</identifier>
        <datestamp>2024-03-06T11:06:42Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Recent Results in Universal and Non-Universal Induction</dc:title>
          <dc:creator>Poland, Jan</dc:creator>
          <dc:subject>Bayesian learning</dc:subject>
          <dc:subject>MDL</dc:subject>
          <dc:subject>stochastic model selection</dc:subject>
          <dc:subject>prediction with expert advice</dc:subject>
          <dc:subject>universal learning</dc:subject>
          <dc:subject>Solomonoff induction</dc:subject>
          <dc:description>We present and relate recent results in prediction based on&#13;
countable classes of either probability (semi-)distributions&#13;
or base predictors. Learning by Bayes, MDL, and stochastic &#13;
model selection will be considered as instances of the first&#13;
category. In particular, we will show how analog assertions&#13;
to Solomonoff's universal induction result can be obtained for&#13;
MDL and stochastic model selection. The second category is &#13;
based on prediction with expert advice. We will present a&#13;
recent construction to define a universal learner in this&#13;
framework.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Jan Poland</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.06051.12</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-6355</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.12</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
