arXiv AI By Aleksandr M. Shtraukh-Adamsky, Vladimir M. Adamsky, Irina G. Voloshina, Artemiy D. Spitsyn

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

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 27

What Effort Level Should I Choose? On the Economics of Reasoning Effort in LLM Agents

The paper investigates how users should set the reasoning‑effort level in large language models, a parameter that trades off inference cost for potential performance gains. Experiments on proprietary and open‑weight models across four benchmarks show that higher effort does not consistently improve accuracy, can be up to 42× more expensive on easy tasks, and alters agent behavior by increasing verification and search steps. The authors propose a simple escalation strategy—starting at the lowest effort and only increasing after a verified failure—that matches or outperforms fixed high‑effort settings while reducing cost.

By Kaiser Sun, Yongchan Kwon, Zain Hasan, Shang Zhu, Kaitlyn Zhou, Federico Bianchi
arXiv AI
Sep 24

Spread and Scale: What Determines Whether Test-Time Budget Allocation Pays

The paper investigates when reallocating a fixed test‑time budget toward harder instances improves solution quality for neural combinatorial optimization solvers. Through pre‑registered experiments on three solvers and two hard‑workload constructions for the traveling salesman problem, it finds that the key deciding factor is the variation in instance difficulty within a workload, not the average difficulty. A budget‑aware policy that first spends part of the budget to gauge instance difficulty recovers most of the potential improvement, though not all, when the cost of this information is included.

By Jinhyung Bae