<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/user/schaul/algorithmic,"><title>BibSonomy publications for /user/schaul/algorithmic,</title><link>http://www.bibsonomy.org/publrss/user/schaul/algorithmic,</link><description>BibSonomy RSS Feed for /user/schaul/algorithmic,</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2bff001f45a7af9cbee7f353e1120baf0/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22034dfb8be6d240168a6f6e0ecde2faf/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2eb2b0c4f73afa2e29cfd7a437db7faba/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f02ccc4a785f11b569dbd098e189c91e/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22205881d024c913a7d4ea58ec9b3d196/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29903cf7b0b98332f663bf1ba1d615806/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2144bbb46927ee62c450a1b8424027265/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b6b01f644bf44596771229883de4f8b4/schaul"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2bff001f45a7af9cbee7f353e1120baf0/schaul"><title>Optimality of Universal Prediction for General Loss and Alphabet</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2bff001f45a7af9cbee7f353e1120baf0/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>algorithmic, deterministic, bayesian, prediction, induction, juergen, complexity, loss, theory, function, kolmogorov, solomonoff, leaning, information, probability, universal </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Istituto Dalle Molle di Studi sull&#039;Intelligenza Artificiale, &lt;/em&gt;&lt;em&gt;Manno (Lugano), CH, &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/deterministic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bayesian,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/complexity,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/loss,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/function,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kolmogorov,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/solomonoff,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/leaning,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/probability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/universal"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22034dfb8be6d240168a6f6e0ecde2faf/schaul"><title>Sequential Predictions based on Algorithmic Complexity</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/22034dfb8be6d240168a6f6e0ecde2faf/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>description, convergence, information, juergen, kolmogorov, minimal, prediction, monotone, algorithmic, self-optimizingness, length, solomonoffs, sequence, complexity, prior, theory </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of Computer and System Sciences&lt;/em&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/description,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/convergence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kolmogorov,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/minimal,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/monotone,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/self-optimizingness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/length,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/solomonoffs,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/complexity,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prior,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2eb2b0c4f73afa2e29cfd7a437db7faba/schaul"><title>Asymptotics of Discrete MDL for Online Prediction</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2eb2b0c4f73afa2e29cfd7a437db7faba/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>universal bounds, minimum, theory, model, class, length, loss, discrete, stabilization, regression, consistency, information, classification, induction, sequence, algorithmic, description, juergen, prediction, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;J. &lt;a href=&#034;http://www.bibsonomy.org/author/Poland&#034;&gt;Poland&lt;/a&gt;  und M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;IEEE Transactions on Information Theory&lt;/em&gt;&lt;em&gt;51(11):3780--3795&lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bounds,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/minimum,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/model,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/class,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/length,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/loss,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/discrete,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/stabilization,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/regression,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/consistency,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classification,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/description,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f02ccc4a785f11b569dbd098e189c91e/schaul"><title>On Generalized Computable Universal Priors and their Convergence</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2f02ccc4a785f11b569dbd098e189c91e/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>theory, probability, convergence, information, algorithmic, solomonoffs, mixture, computability, universal randomness, prior, prediction, posterior, sequence, distributions, juergen, concepts, martin-loef, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Theoretical Computer Science&lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/probability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/convergence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/solomonoffs,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mixture,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/randomness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prior,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/posterior,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distributions,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/concepts,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/martin-loef,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22205881d024c913a7d4ea58ec9b3d196/schaul"><title>Universal Convergence of Semimeasures on Individual Random Sequences</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/22205881d024c913a7d4ea58ec9b3d196/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>information, randomness, enumerable, quasimeasures, martin-lof, universal distributions, sequence, convergence, juergen, algorithmic, semimeasure, posterior, mixture, prediction, theory, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  und  &lt;a href=&#034;http://www.bibsonomy.org/author/An&#034;&gt;An&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 15th International Conf. on Algorithmic Learning Theory (ALT&#039;04), &lt;/em&gt;&lt;em&gt;Volume3244vonLNAI, &lt;/em&gt;&lt;em&gt;Seite234--248. &lt;/em&gt;&lt;em&gt;Padova, &lt;/em&gt;&lt;em&gt;Springer, Berlin, &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/randomness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/enumerable,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/quasimeasures,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/martin-lof,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distributions,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/convergence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semimeasure,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/posterior,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mixture,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/29903cf7b0b98332f663bf1ba1d615806/schaul"><title>Convergence of Discrete MDL for Sequential Prediction</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/29903cf7b0b98332f663bf1ba1d615806/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>convergence, model, minimum, discrete, theory, description, stabilization, information, juergen, universal prediction, length, sequence, algorithmic, classes, induction, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;J. &lt;a href=&#034;http://www.bibsonomy.org/author/Poland&#034;&gt;Poland&lt;/a&gt;  und M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 17th Annual Conf. on Learning Theory (COLT&#039;04), &lt;/em&gt;&lt;em&gt;Volume3120vonLNAI, &lt;/em&gt;&lt;em&gt;Seite300--314. &lt;/em&gt;&lt;em&gt;Banff, &lt;/em&gt;&lt;em&gt;Springer, Berlin, &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/convergence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/model,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/minimum,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/discrete,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/description,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/stabilization,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/length,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2144bbb46927ee62c450a1b8424027265/schaul"><title>Sequence Prediction based on Monotone Complexity</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2144bbb46927ee62c450a1b8424027265/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>theory information, length, self-optimizingness, description, sequence, kolmogorov, complexity, minimal, convergence, juergen, prediction, algorithmic, solomonoffs, monotone, prior, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 16th Annual Conf. on Learning Theory (COLT&#039;03), &lt;/em&gt;&lt;em&gt;Volume2777vonLNAI, &lt;/em&gt;&lt;em&gt;Seite506--521. &lt;/em&gt;&lt;em&gt;Washington, DC, &lt;/em&gt;&lt;em&gt;Springer, Berlin, &lt;/em&gt;(&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/length,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/self-optimizingness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/description,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kolmogorov,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/complexity,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/minimal,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/convergence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/solomonoffs,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/monotone,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prior,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b6b01f644bf44596771229883de4f8b4/schaul"><title>Universal Sequential Decisions in Unknown Environments</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2b6b01f644bf44596771229883de4f8b4/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>artificial, algorithmic, induction, rational, complexity, computational, kolmogorov, decision, solomonoff, theory, sequential, universal intelligence, probability, reinforcement, juergen, agents, learning, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 5th European Workshop on Reinforcement Learning (EWRL-5), &lt;/em&gt;&lt;em&gt;27, &lt;/em&gt;&lt;em&gt;Seite25--26. &lt;/em&gt;&lt;em&gt;Onderwijsinsituut CKI, Utrecht Univ., &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/artificial,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rational,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/complexity,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computational,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kolmogorov,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/decision,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/solomonoff,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequential,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/intelligence,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/probability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/reinforcement,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/agents,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning,"/></rdf:Bag></taxo:topics></item></rdf:RDF>