mlsanityData to 14 Oct 2026

Deep Reinforcement Learning with Explicit Context Representation

arXiv 2310.09924 ↗First posted 15 Oct 2023cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Reinforcement learning (RL) has shown an outstanding capability for solving complex computational problems. However, most RL algorithms lack an explicit method that would allow learning from contextual information. Humans use context to identify patterns and relations among elements in the environment, along with how to avoid making wrong actions. On the other hand, what may seem like an obviously wrong decision from a human perspective could take hundreds of steps for an RL agent to learn to avoid. This paper proposes a framework for discrete environments called Iota explicit context representation (IECR). The framework involves representing each state using contextual key frames (CKFs), which can then be used to extract a function that represents the affordances of the state; in addition, two loss functions are introduced with respect to the affordances of the state. The novelty of the IECR framework lies in its capacity to extract contextual information from the environment and learn from the CKFs' representation. We validate the framework by developing four new algorithms that learn using context: Iota deep Q-network (IDQN), Iota double deep Q-network (IDDQN), Iota dueling deep Q-network (IDuDQN), and Iota dueling double deep Q-network (IDDDQN). Furthermore, we evaluate the framework and the new algorithms in five discrete environments. We show that all the algorithms, which use contextual information, converge in around 40,000 training steps of the neural networks, significantly outperforming their state-of-the-art equivalents.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 22 of its 57 references that are in the map. First posted on arXiv 15 Oct 2023.

Builds on

22 of 57 references.

References · 22

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  3. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
  4. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
  5. 2015Prioritized Experience Replaycited by 1,099
  6. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 785
  7. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
  8. 2017A Brief Survey of Deep Reinforcement Learningcited by 483
  9. 2017Overcoming Exploration in Reinforcement Learning with Demonstrationscited by 340
  10. 2015Contextual Markov Decision Processescited by 220
  11. 2021Multi-Task Reinforcement Learning with Context-based Representationscited by 174
  12. 2017Deep Exploration via Randomized Value Functionscited by 156
10 more
  1. 2021Conservative Data Sharing for Multi-Task Offline Reinforcement Learningcited by 64
  2. 2022Contextualize Me -- The Case for Context in Reinforcement Learningcited by 46
  3. 2018Sample-Efficient Imitation Learning via Generative Adversarial Netscited by 36
  4. 2020Deep Reinforcement Learning based Automatic Exploration for Navigation in Unknown Environmentcited by 34
  5. 2021CARL: A Benchmark for Contextual and Adaptive Reinforcement Learningcited by 21
  6. 2019Deep Q-Learning for Same-Day Delivery with Vehicles and Dronescited by 15
  7. 2019Inverse Reinforcement Learning in Contextual MDPscited by 12
  8. 2020Transfer Reinforcement Learning under Unobserved Contextual Informationcited by 3
  9. 2019Playing a Strategy Game with Knowledge-Based Reinforcement Learningcited by 2
  10. 2020Cluster Based Deep Contextual Reinforcement Learning for top-k Recommendationscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.

3 papers.