arXiv Machine Learning

Task-Sufficient Contraction: Source Selection for Machine Information Interfaces

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 AI
Sep 12

A Mathematical Theory of Pragmatic Information

The paper introduces a pragmatic information theory that unifies communication, control, and decision-making through the isoteleia mapping, which formalizes equifinality by treating distinct semantic paths that lead to the same optimal action as pragmatically equivalent. It establishes a three-tier hierarchy of syntactic, semantic, and pragmatic information, defines pragmatic entropy, mutual information, channel capacity, and rate-distortion, and proves coding theorems that generalize Shannon’s results. The authors also present pragmatic value and cost of information, a Lagrangian dual framework for cross-layer optimization, and a pragmatic efficiency bound that quantifies the maximum net utility for resource-constrained intelligent systems, extending the theory to continuous messages and dynamic settings.

By Kai Niu, Ping Zhang
arXiv Machine Learning
Sep 25

Decoupled Early Exits for Task-Dependent Compute Allocation in Flow-Matching VLAs

The paper introduces a framework for Flow‑Matching Vision‑Language‑Action (VLA) models that allows independent adjustment of backbone depth, action expert depth, and denoising steps. Lightweight Exit Transformers are added at intermediate layers to enable early exits, and a KV Cache synthesis mechanism manages skipped layers so the action expert can exit deeper than the backbone. Experiments on SmolVLA and π0.5 across LIBERO and Meta‑World show that joint tuning of these compute axes reduces latency by 79.2 % and FLOPs by 31.8 %, while improving mean success rate by 5.6 %.

By Riccardo Andrea Izzo, Rimvydas Rubavicius, Gianluca Bardaro, Subramanian Ramamoorthy, Matteo Matteucci, Alessandro Suglia
arXiv AI
Oct 7

Action Shaping: Policies Absorb What They Can Express

arXiv:2609.32752v2 Announce Type: replace Abstract: Reward shaping has a theorem: a potential-based term can be removed without changing the optimal policy. The same practice on the action channel, a...

By Yanjun Chen, Jinghan Wang, Xiaoyu Shen, Wenjie Li, Wei Zhang