mlsanityData to 7 Oct 2026

LICORICE: Label-Efficient Concept-Based Interpretable Reinforcement Learning

arXiv 2407.15786 ↗First posted 22 Jul 2024cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Recent advances in reinforcement learning (RL) have predominantly leveraged neural network policies for decision-making, yet these models often lack interpretability, posing challenges for stakeholder comprehension and trust. Concept bottleneck models offer an interpretable alternative by integrating human-understandable concepts into policies. However, prior work assumes that concept annotations are readily available during training. For RL, this requirement poses a significant limitation: it necessitates continuous real-time concept annotation, which either places an impractical burden on human annotators or incurs substantial costs in API queries and inference time when employing automated labeling methods. To overcome this limitation, we introduce a novel training scheme that enables RL agents to efficiently learn a concept-based policy by only querying annotators to label a small set of data. Our algorithm, LICORICE, involves three main contributions: interleaving concept learning and RL training, using an ensemble to actively select informative data points for labeling, and decorrelating the concept data. We show how LICORICE reduces human labeling efforts to 500 or fewer concept labels in three environments, and 5000 or fewer in two more complex environments, all at no cost to performance. We also explore the use of VLMs as automated concept annotators, finding them effective in some cases but imperfect in others. Our work significantly reduces the annotation burden for interpretable RL, making it more practical for real-world applications that necessitate transparency.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 25 of its 45 references that are in the map. First posted on arXiv 22 Jul 2024.

Builds on

25 of 45 references.

References · 25

  1. 2017Attention Is All You Needcited by 59,932
  2. 2023GPT-4 Technical Reportcited by 18,132
  3. 2017Proximal Policy Optimization Algorithmscited by 14,441
  4. 2020Concept Bottleneck Modelscited by 1,022
  5. 2023Minigrid & Miniworld: Modular & Customizable Reinforcement Learning Environments for Goal-Oriented Taskscited by 320
  6. 2019Reinforcement Learning in Healthcare: A Surveycited by 308
  7. 2023Label-Free Concept Bottleneck Modelscited by 282
  8. 2018Programmatically Interpretable Reinforcement Learningcited by 192
  9. 2018Verifiable Reinforcement Learning via Policy Extractioncited by 176
  10. 2023Concept-based Explainable Artificial Intelligence: A Surveycited by 97
  11. 2022Interactive Concept Bottleneck Modelscited by 79
  12. 2021A Survey on Interpretable Reinforcement Learningcited by 70
13 more
  1. 2023Who Should Predict? Exact Algorithms For Learning to Defer to Humanscited by 68
  2. 2022Learning to Defer to Multiple Experts: Consistent Surrogate Losses, Confidence Calibration, and Conformal Ensemblescited by 59
  3. 2023Interpretable and Explainable Logical Policies via Neurally Guided Symbolic Abstractioncited by 45
  4. 2023Learning to Receive Help: Intervention-Aware Concept Embedding Modelscited by 41
  5. 2023Human Uncertainty in Concept-Based AI Systemscited by 39
  6. 2023Auxiliary Losses for Learning Generalizable Concept-based Modelscited by 35
  7. 2021Iterative Bounding MDPs: Learning Interpretable Policies via Non-Interpretable Methodscited by 31
  8. 2023OCAtari: Object-Centric Atari 2600 Reinforcement Learning Environmentscited by 30
  9. 2023Programmatically Grounded, Compositionally Generalizable Robotic Manipulationcited by 26
  10. 2023Concept Learning for Interpretable Multi-Agent Reinforcement Learningcited by 18
  11. 2020Learning Interpretable Concept-Based Models with Human Feedbackcited by 17
  12. 2023State2Explanation: Concept-Based Explanations to Benefit Agent Learning and User Understandingcited by 17
  13. 2019Learning Programmatically Structured Representations with Perceptor Gradientscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 0; 2026: 2.

4 papers.