The following pages link to Marcus Hutter (Q208767):
Displaying 50 items.
- (Q252110) (redirect page) (← links)
- (Q329612) (redirect page) (← links)
- Extreme state aggregation beyond Markov decision processes (Q329613) (← links)
- General time consistent discounting (Q391749) (← links)
- (Q400870) (redirect page) (← links)
- A philosophical treatise of universal induction (Q400871) (← links)
- Near-optimal PAC bounds for discounted MDPs (Q465258) (← links)
- (Q588672) (redirect page) (← links)
- Robust inference of trees (Q819944) (← links)
- On generalized computable universal priors and their convergence (Q860822) (← links)
- Algorithmic complexity bounds on future prediction errors (Q865627) (← links)
- On the possibility of learning in reactive environments with arbitrary dependence (Q950202) (← links)
- Distribution of mutual information from complete and incomplete data (Q957142) (← links)
- Model selection with the loss rank principle (Q962384) (← links)
- Practical robust estimators for the imprecise Dirichlet model (Q962849) (← links)
- Limits of learning about a categorical latent variable under prior near-ignorance (Q962884) (← links)
- Open problems in universal induction \& intelligence (Q1662486) (← links)
- A complete theory of everything (will be subjective) (Q1662561) (← links)
- On the computability of Solomonoff induction and AIXI (Q1704559) (← links)
- Universal artificial intelligence. Sequential decisions based on algorithmic probability. (Q1762575) (← links)
- Classification by decomposition: a novel approach to classification of symmetric \(2\times 2\) games (Q2081903) (← links)
- On Martin-Löf (non-)convergence of Solomonoff's universal mixture (Q2348255) (← links)
- On semimeasures predicting Martin-Löf random sequences (Q2381581) (← links)
- On universal prediction and Bayesian confirmation (Q2382281) (← links)
- Predicting non-stationary processes (Q2425399) (← links)
- Probabilities on sentences in an expressive logic (Q2446673) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
- Sequential predictions based on algorithmic complexity (Q2581758) (← links)
- Tractability of batch to sequential conversion (Q2636409) (← links)
- Solomonoff Induction Violates Nicod’s Criterion (Q2835642) (← links)
- On the Computability of Solomonoff Induction and Knowledge-Seeking (Q2835643) (← links)
- Universal Knowledge-Seeking Agents for Stochastic Environments (Q2859213) (← links)
- Concentration and Confidence for Discrete Bayesian Sequence Predictors (Q2859227) (← links)
- No Free Lunch versus Occam’s Razor in Supervised Learning (Q2868414) (← links)
- Principles of Solomonoff Induction and AIXI (Q2868427) (← links)
- Bayesian Reinforcement Learning with Exploration (Q2938731) (← links)
- Extreme State Aggregation beyond MDPs (Q2938732) (← links)
- Offline to Online Conversion (Q2938735) (← links)
- Indefinitely Oscillating Martingales (Q2938742) (← links)
- THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS (Q3021962) (← links)
- Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures (Q3046718) (← links)
- A Monte-Carlo AIXI Approximation (Q3081449) (← links)
- (Q3093271) (← links)
- Universal Prediction of Selected Bits (Q3093957) (← links)
- Axioms for Rational Reinforcement Learning (Q3093963) (← links)
- Asymptotically Optimal Agents (Q3093965) (← links)
- Time Consistent Discounting (Q3093966) (← links)
- PAC Bounds for Discounted MDPs (Q3164829) (← links)
- Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence (Q3224087) (← links)
- Sequential Extensions of Causal and Evidential Decision Theory (Q3449535) (← links)
