AIQI, the first model-free agent proven asymptotically ε-optimal in general reinforcement learning, achieves this by universal induction over action-value distributions under a grain-of-truth condition.
A Theory of Universal Artificial Intelligence based on Algorithmic Complexity
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
abstract
Decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff's theory of universal induction formally solves the problem of sequence prediction for unknown prior distribution. We combine both ideas and get a parameterless theory of universal Artificial Intelligence. We give strong arguments that the resulting AIXI model is the most intelligent unbiased agent possible. We outline for a number of problem classes, including sequence prediction, strategic games, function minimization, reinforcement and supervised learning, how the AIXI model can formally solve them. The major drawback of the AIXI model is that it is uncomputable. To overcome this problem, we construct a modified algorithm AIXI-tl, which is still effectively more intelligent than any other time t and space l bounded agent. The computation time of AIXI-tl is of the order tx2^l. Other discussed topics are formal definitions of intelligence order relations, the horizon problem and relations of the AIXI theory to other AI approaches.
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Intervention complexity provides a family of canonical rewards indexed by resource bias that completes the Legg-Hutter framework and enables a two-dimensional view of intelligence as competence plus learning efficiency.
Design-time Hindley-Milner unification over finitely generated abelian groups is claimed to verify AI model reliability properties and to compute a MAP hypothesis under a restricted Solomonoff prior.
The paper surveys the origins, frameworks, applications, and open challenges of AI agents built on large language models.
citing papers explorer
-
A Model-Free Universal AI
AIQI, the first model-free agent proven asymptotically ε-optimal in general reinforcement learning, achieves this by universal induction over action-value distributions under a grain-of-truth condition.
-
Intervention Complexity as a Canonical Reward and a Measure of Intelligence
Intervention complexity provides a family of canonical rewards indexed by resource bias that completes the Legg-Hutter framework and enables a two-dimensional view of intelligence as competence plus learning efficiency.
-
Decidable By Construction: Design-Time Verification for Trustworthy AI
Design-time Hindley-Milner unification over finitely generated abelian groups is claimed to verify AI model reliability properties and to compute a MAP hypothesis under a restricted Solomonoff prior.
-
The Rise and Potential of Large Language Model Based Agents: A Survey
The paper surveys the origins, frameworks, applications, and open challenges of AI agents built on large language models.