arXiv AI
1d ago

When Does Less Information Pay? An Exact Finite Atlas of Representation, Payoff, and Cost

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.

By Aleksandr M. Shtraukh-Adamsky, Vladimir M. Adamsky, Irina G. Voloshina, Artemiy D. Spitsyn
arXiv Machine Learning
Jun 19

Indexed Bellman Information Complexity

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.

By Yunbei Xu