Pith. sign in

BAIL: Best-Action Imitation Learning for Batch Deep Reinforcement Learning

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

There has recently been a surge in research in batch Deep Reinforcement Learning (DRL), which aims for learning a high-performing policy from a given dataset without additional interactions with the environment. We propose a new algorithm, Best-Action Imitation Learning (BAIL), which strives for both simplicity and performance. BAIL learns a V function, uses the V function to select actions it believes to be high-performing, and then uses those actions to train a policy network using imitation learning. For the MuJoCo benchmark, we provide a comprehensive experimental study of BAIL, comparing its performance to four other batch Q-learning and imitation-learning schemes for a large variety of batch datasets. Our experiments show that BAIL's performance is much higher than the other schemes, and is also computationally much faster than the batch Q-learning schemes.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Offline Learning for Combinatorial Multi-armed Bandits

cs.LG · 2025-01-31 · conditional · novelty 7.0

A pessimistic lower-confidence-bound algorithm achieves suboptimality bounds for offline combinatorial multi-armed bandits with probabilistically triggered arms, under coverage conditions requiring observation of each arm of the optimal action.

citing papers explorer

Showing 1 of 1 citing paper.

  • Offline Learning for Combinatorial Multi-armed Bandits cs.LG · 2025-01-31 · conditional · none · ref 1716 · internal anchor

    A pessimistic lower-confidence-bound algorithm achieves suboptimality bounds for offline combinatorial multi-armed bandits with probabilistically triggered arms, under coverage conditions requiring observation of each arm of the optimal action.