Cheap Retrieval and Observation Credit Assignment from One Quantity: The Value of Information

Paper recorded by Signals 4 on 2026-10-29 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-29 on arXiv · recorded by Signals 4 on 2026-10-30

Category: cs.LG · 机器学习 · first seen 2026-10-30

Abstract

Memory in reinforcement learning raises two problems. Attention finds the relevant item by scoring the whole store, which is costly for robots under latency and energy limits. When a retrieved memory pays off, credit for acquiring it must cross the whole sequence. We argue that both are governed by one quantity, the value of information, and propose to estimate it from archived rollouts with a lea

Read on arXiv →