Why Finite Intelligence Works in an Infinite World: A Mathematical Theory
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The paper presents a complete enumeration of all possible representations and binary action rules in a uniform four‑state world, comparing their retained information, payoff (task accuracy), and cost under various tariffs. It shows that a representation with less retained information can sometimes yield higher payoff, while in other cases the more informative representation performs better, and that equal payoff can occur with different information amounts. The study demonstrates how the specific distinctions preserved by a representation, the choice of action rule, and the cost assumptions jointly determine performance, offering a reproducible model for exploring these trade‑offs.
arXiv:2610.20004v1 Announce Type: new Abstract: Transformers can perform in-context reinforcement learning without parameter updates. However, existing theoretical constructions often require context...
arXiv:2610.08884v1 Announce Type: cross Abstract: A declared task can sometimes certify a reduced source before a downstream encoder, codebook, rate, distortion target, or optimizer is chosen. This p...
arXiv:2608. 05085v1 Announce Type: cross Abstract: Systems that automate scientific discovery must repeatedly decide which experiment to run, which hypothesis to test, which tool to build, and when to stop.
Large Language Models (LLMs) are frequently portrayed as general-purpose solvers capable of solving arbitrary tasks. We argue that this view overlooks a fundamental constraint: language is a compressed and capacity-limited interface for conveying task information.
arXiv:2606. 11171v2 Announce Type: replace Abstract: We develop indexed Bellman information complexity, a representation-level theory of interactive decision making centered on information indices and reference histories.