| Publication | Date of Publication | Type |
|---|
| Reward tampering problems and solutions in reinforcement learning: a causal influence diagram perspective | 2024-01-26 | Paper |
| Classification by decomposition: a novel approach to classification of symmetric \(2\times 2\) games | 2022-09-30 | Paper |
| Open problems in universal induction \& intelligence | 2018-08-20 | Paper |
| A complete theory of everything (will be subjective) | 2018-08-20 | Paper |
| Tractability of batch to sequential conversion | 2018-06-05 | Paper |
| On the computability of Solomonoff induction and AIXI | 2018-03-12 | Paper |
| Solomonoff Induction Violates Nicod’s Criterion | 2016-11-30 | Paper |
| On the Computability of Solomonoff Induction and Knowledge-Seeking | 2016-11-30 | Paper |
| Extreme state aggregation beyond Markov decision processes | 2016-10-21 | Paper |
| Exact Bayesian regression of piecewise constant functions | 2016-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5744806 | 2016-02-19 | Paper |
| Sequential Extensions of Causal and Evidential Decision Theory | 2015-11-04 | Paper |
| On Martin-Löf (non-)convergence of Solomonoff's universal mixture | 2015-06-11 | Paper |
| Bayesian Reinforcement Learning with Exploration | 2015-01-14 | Paper |
| Extreme State Aggregation beyond MDPs | 2015-01-14 | Paper |
| Offline to Online Conversion | 2015-01-14 | Paper |
| Indefinitely Oscillating Martingales | 2015-01-14 | Paper |
| Near-optimal PAC bounds for discounted MDPs | 2014-10-31 | Paper |
| A philosophical treatise of universal induction | 2014-08-26 | Paper |
| Probabilities on sentences in an expressive logic | 2014-04-17 | Paper |
| General time consistent discounting | 2014-01-13 | Paper |
| No Free Lunch versus Occam’s Razor in Supervised Learning | 2013-12-17 | Paper |
| Principles of Solomonoff Induction and AIXI | 2013-12-17 | Paper |
| Universal Knowledge-Seeking Agents for Stochastic Environments | 2013-11-06 | Paper |
| Concentration and Confidence for Discrete Bayesian Sequence Predictors | 2013-11-06 | Paper |
| On Martin-Löf Convergence of Solomonoff’s Mixture | 2013-05-28 | Paper |
| The Subjective Computable Universe | 2013-02-26 | Paper |
| PAC Bounds for Discounted MDPs | 2012-10-16 | Paper |
| Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence | 2012-03-29 | Paper |
| Universal Prediction of Selected Bits | 2011-10-19 | Paper |
| Axioms for Rational Reinforcement Learning | 2011-10-19 | Paper |
| Asymptotically Optimal Agents | 2011-10-19 | Paper |
| Time Consistent Discounting | 2011-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093271 | 2011-10-12 | Paper |
| A Monte-Carlo AIXI Approximation | 2011-03-08 | Paper |
| Consistency of Feature Markov Processes | 2010-10-01 | Paper |
| Practical robust estimators for the imprecise Dirichlet model | 2010-04-07 | Paper |
| Limits of learning about a categorical latent variable under prior near-ignorance | 2010-04-07 | Paper |
| Model selection with the loss rank principle | 2010-04-06 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| KI 2003: Advances in Artificial Intelligence | 2010-03-03 | Paper |
| Algorithmic Learning Theory | 2010-02-23 | Paper |
| Convergence and loss bounds for bayesian sequence prediction | 2008-12-21 | Paper |
| Asymptotics of Discrete MDL for Online Prediction | 2008-12-21 | Paper |
| Distribution of mutual information from complete and incomplete data | 2008-11-26 | Paper |
| On the possibility of learning in reactive environments with arbitrary dependence | 2008-10-22 | Paper |
| General Discounting Versus Average Reward | 2008-09-04 | Paper |
| Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence | 2008-09-04 | Paper |
| Editors’ Introduction | 2008-08-19 | Paper |
| Predicting non-stationary processes | 2008-05-05 | Paper |
| The Loss Rank Principle for Model Selection | 2008-01-03 | Paper |
| On universal prediction and Bayesian confirmation | 2007-09-28 | Paper |
| On semimeasures predicting Martin-Löf random sequences | 2007-09-18 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Algorithmic complexity bounds on future prediction errors | 2007-02-20 | Paper |
| On generalized computable universal priors and their convergence | 2007-01-09 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Hybrid rounding techniques for knapsack problems | 2006-04-28 | Paper |
| Robust inference of trees | 2006-04-04 | Paper |
| Sequential predictions based on algorithmic complexity | 2006-01-10 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS | 2005-06-22 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Universal artificial intelligence. Sequential decisions based on algorithmic probability. | 2005-02-11 | Paper |
| 10.1162/1532443041827952 | 2004-11-05 | Paper |
| Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures | 2004-08-12 | Paper |
| Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory | 2003-03-13 | Paper |
| Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences | 2003-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787395 | 2003-01-06 | Paper |
| New error bounds for Solomonoff prediction | 2002-04-21 | Paper |
