In statistical mechanics, stochastic resetting is a trick for finding targets faster: periodically teleport a random walker back to its starting point. If the target is nearby, resetting prevents the walker from drifting too far away. The optimal resetting rate balances exploration (letting the walker search) against exploitation (preventing wasted excursions). The theory is elegant and has been applied to search, queuing, and first-passage problems.

Applied to reinforcement learning (arXiv:2603.16842), resetting — randomly returning the agent to its initial state during training — accelerates policy convergence. Not by the same mechanism as classical search, but by truncating long, uninformative trajectories. When exploration is hard and rewards are sparse, the agent can spend episodes wandering without learning anything useful. Resetting cuts these episodes short and redirects the agent’s experience toward states where value information can propagate.

The important detail: unlike temporal discounting (which also devalues distant rewards), resetting doesn’t change the optimal policy. The agent still learns the globally optimal behavior. It just learns it faster, because it wastes less time in low-information regions of the trajectory space. Discounting changes what’s optimal. Resetting changes how quickly you find it.

The through-claim: forgetting where you are is sometimes the fastest way to learn what to do. The information in a trajectory has diminishing returns — the first steps from a familiar state teach more than the hundredth step in an unfamiliar one. Resetting doesn’t add information. It reallocates the agent’s experience budget toward high-information-density regions.