pith. sign in

arxiv: 1512.06789 · v1 · pith:YV7QRT5Gnew · submitted 2015-12-21 · 📊 stat.ML · cs.AI· cs.SY· math.OC

Information-Theoretic Bounded Rationality

classification 📊 stat.ML cs.AIcs.SYmath.OC
keywords boundedrationalitydecisiondecision-makingdecisionsfunctionalinformation-theoreticplanning
0
0 comments X p. Extension
pith:YV7QRT5G Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{YV7QRT5G}

Prints a linked pith:YV7QRT5G badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Bounded rationality, that is, decision-making and planning under resource limitations, is widely regarded as an important open problem in artificial intelligence, reinforcement learning, computational neuroscience and economics. This paper offers a consolidated presentation of a theory of bounded rationality based on information-theoretic ideas. We provide a conceptual justification for using the free energy functional as the objective function for characterizing bounded-rational decisions. This functional possesses three crucial properties: it controls the size of the solution space; it has Monte Carlo planners that are exact, yet bypass the need for exhaustive search; and it captures model uncertainty arising from lack of evidence or from interacting with other agents having unknown intentions. We discuss the single-step decision-making case, and show how to extend it to sequential decisions using equivalence transformations. This extension yields a very general class of decision problems that encompass classical decision rules (e.g. EXPECTIMAX and MINIMAX) as limit cases, as well as trust- and risk-sensitive planning.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Bounded-Rationality, Hedging, and Generalization

    cs.LG 2026-05 unverdicted novelty 7.0

    Generalization is a testable hedging property of the learner's response law, recovered via f-divergence regularizers that induce information-geometric curves between training loss and sample dependence.