mlsanityData to 7 Oct 2026

Agent-State Construction with Auxiliary Inputs

arXiv 2211.07805 ↗First posted 15 Nov 2022cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

In many, if not every realistic sequential decision-making task, the decision-making agent is not able to model the full complexity of the world. The environment is often much larger and more complex than the agent, a setting also known as partial observability. In such settings, the agent must leverage more than just the current sensory inputs; it must construct an agent state that summarizes previous interactions with the world. Currently, a popular approach for tackling this problem is to learn the agent-state function via a recurrent network from the agent's sensory stream as input. Many impressive reinforcement learning applications have instead relied on environment-specific functions to aid the agent's inputs for history summarization. These augmentations are done in multiple ways, from simple approaches like concatenating observations to more complex ones such as uncertainty estimates. Although ubiquitous in the field, these additional inputs, which we term auxiliary inputs, are rarely emphasized, and it is not clear what their role or impact is. In this work we explore this idea further, and relate these auxiliary inputs to prior classic approaches to state construction. We present a series of examples illustrating the different ways of using auxiliary inputs for reinforcement learning. We show that these auxiliary inputs can be used to discriminate between observations that would otherwise be aliased, leading to more expressive features that smoothly interpolate between different states. Finally, we show that this approach is complementary to state-of-the-art methods such as recurrent neural networks and truncated back-propagation through time, and acts as a heuristic that facilitates longer temporal credit assignment, leading to better performance.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 6 of its 40 references that are in the map. First posted on arXiv 15 Nov 2022.

Builds on

6 of 40 references.

References · 6

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
  3. 2017Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agentscited by 267
  4. 2015State of the Art Control of Atari Games Using Shallow Reinforcement Learningcited by 23
  5. 2018General Value Function Networkscited by 16
  6. 2020From Eye-blinks to State Construction: Diagnostic Benchmarks for Online Representation Learningcited by 13

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 2.

3 papers.