Foundations of Reinforcement Learning and Interactive Decision Making

• URL: http://arxiv.org/abs/2312.16730v1
• Date: Wed, 27 Dec 2023 21:58:45 GMT
• Title: Foundations of Reinforcement Learning and Interactive Decision Making
• Authors: Dylan J. Foster and Alexander Rakhlin
• Abstract summary: We present a unifying framework for addressing the exploration-exploitation dilemma using frequentist and Bayesian approaches. Special attention is paid to function approximation and flexible model classes such as neural networks.
• Score: 81.76863968810423
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: These lecture notes give a statistical perspective on the foundations of reinforcement learning and interactive decision making. We present a unifying framework for addressing the exploration-exploitation dilemma using frequentist and Bayesian approaches, with connections and parallels between supervised learning/estimation and decision making as an overarching theme. Special attention is paid to function approximation and flexible model classes such as neural networks. Topics covered include multi-armed and contextual bandits, structured bandits, and reinforcement learning with high-dimensional feedback.

Related papers

• Induced Modularity and Community Detection for Functionally Interpretable Reinforcement Learning [1.597617022056624]
  Interpretability in reinforcement learning is crucial for ensuring AI systems align with human values. We show how penalisation of non-local weights leads to the emergence of functionally independent modules in the policy network of a reinforcement learning agent.
  arXiv  Detail & Related papers  (2025-01-28T17:02:16Z)
• Knowledge-Enhanced Hierarchical Information Correlation Learning for Multi-Modal Rumor Detection [82.94413676131545]
  We propose a novel knowledge-enhanced hierarchical information correlation learning approach (KhiCL) for multi-modal rumor detection. KhiCL exploits cross-modal joint dictionary to transfer the heterogeneous unimodality features into the common feature space. It extracts visual and textual entities from images and text, and designs a knowledge relevance reasoning strategy.
  arXiv  Detail & Related papers  (2023-06-28T06:08:20Z)
• Bayesian Learning for Neural Networks: an algorithmic survey [95.42181254494287]
  This self-contained survey engages and introduces readers to the principles and algorithms of Bayesian Learning for Neural Networks. It provides an introduction to the topic from an accessible, practical-algorithmic perspective.
  arXiv  Detail & Related papers  (2022-11-21T21:36:58Z)
• On the Complexity of Adversarial Decision Making [101.14158787665252]
  We show that the Decision-Estimation Coefficient is necessary and sufficient to obtain low regret for adversarial decision making. We provide new structural results that connect the Decision-Estimation Coefficient to variants of other well-known complexity measures.
  arXiv  Detail & Related papers  (2022-06-27T06:20:37Z)
• It Takes Two Flints to Make a Fire: Multitask Learning of Neural Relation and Explanation Classifiers [40.666590079580544]
  We propose an explainable approach for relation extraction that mitigates the tension between generalization and explainability. Our approach uses a multi-task learning architecture, which jointly trains a classifier for relation extraction. We convert the model outputs to rules to bring global explanations to this approach.
  arXiv  Detail & Related papers  (2022-04-25T03:53:12Z)
• Standardized feature extraction from pairwise conflicts applied to the train rescheduling problem [0.0]
  We implement an analytical method which identifies and optimally solves every conflict arising between two trains. We design a corresponding observation space which features the most relevant information considering these conflicts. The data obtained this way then translates to actions in the context of the reinforcement learning framework.
  arXiv  Detail & Related papers  (2022-04-06T19:52:43Z)
• Behavior Priors for Efficient Reinforcement Learning [97.81587970962232]
  We consider how information and architectural constraints can be combined with ideas from the probabilistic modeling literature to learn behavior priors. We discuss how such latent variable formulations connect to related work on hierarchical reinforcement learning (HRL) and mutual information and curiosity based objectives. We demonstrate the effectiveness of our framework by applying it to a range of simulated continuous control domains.
  arXiv  Detail & Related papers  (2020-10-27T13:17:18Z)
• Knowledge-guided Deep Reinforcement Learning for Interactive Recommendation [49.32287384774351]
  Interactive recommendation aims to learn from dynamic interactions between items and users to achieve responsiveness and accuracy. We propose Knowledge-Guided deep Reinforcement learning to harness the advantages of both reinforcement learning and knowledge graphs for interactive recommendation.
  arXiv  Detail & Related papers  (2020-04-17T05:26:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.