mlsanityData to 14 Oct 2026

The Value of Information When Deciding What to Learn

arXiv 2110.13973 ↗First posted 26 Oct 2021cs.LG cs.IT math.ITcited by 15

Not on the map. Why?

Abstract (arXiv)

All sequential decision-making agents explore so as to acquire knowledge about a particular target. It is often the responsibility of the agent designer to construct this target which, in rich and complex environments, constitutes a onerous burden; without full knowledge of the environment itself, a designer may forge a sub-optimal learning target that poorly balances the amount of information an agent must acquire to identify the target against the target's associated performance shortfall. While recent work has developed a connection between learning targets and rate-distortion theory to address this challenge and empower agents that decide what to learn in an automated fashion, the proposed algorithm does not optimally tackle the equally important challenge of efficient information acquisition. In this work, building upon the seminal design principle of information-directed sampling (Russo & Van Roy, 2014), we address this shortcoming directly to couple optimal information acquisition with the optimal design of learning targets. Along the way, we offer new insights into learning targets from the literature on rate-distortion theory before turning to empirical results that confirm the value of information when deciding what to learn.

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

Builds on

22 of 59 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 752
  3. 2016Deep Exploration via Bootstrapped DQNcited by 527
  4. 2017A Tutorial on Thompson Samplingcited by 433
  5. 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
  6. 2014Learning to Optimize via Information-Directed Samplingcited by 168
  7. 2017Deep Exploration via Randomized Value Functionscited by 156
  8. 2014Generalization and Exploration via Randomized Value Functionscited by 112
  9. 2017The Uncertainty Bellman Equation and Explorationcited by 82
  10. 2017Ensemble Samplingcited by 62
  11. 2021Reinforcement Learning, Bit by Bitcited by 59
  12. 2018Information-Directed Exploration for Deep Reinforcement Learningcited by 52
10 more
  1. 2015Increasing the Action Gap: New Operators for Reinforcement Learningcited by 49
  2. 2019An Information-Theoretic Approach to Minimax Regret in Partial Monitoringcited by 42
  3. 2020Mirror Descent and the Information Ratiocited by 40
  4. 2018Satisficing in Time-Sensitive Bandit Learningcited by 39
  5. 2020Hypermodels for Explorationcited by 37
  6. 2018An Information-Theoretic Analysis for Thompson Sampling with Many Actionscited by 35
  7. 2020Asymptotically Optimal Information-Directed Samplingcited by 33
  8. 2019Connections Between Mirror Descent, Thompson Sampling and the Information Ratiocited by 23
  9. 2021Deciding What to Learn: A Rate-Distortion Approachcited by 23
  10. 2019First-Order Bayesian Regret Analysis of Thompson Samplingcited by 17

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 5; 2023: 2; 2024: 3; 2025: 2; 2026: 2.

15 papers.

Sort:

By area: