Pith. sign in

REVIEW 3 cited by

In-context Exploration-Exploitation for Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.06826 v1 pith:NYRHEEUS submitted 2024-03-11 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords learningin-contexticeeexploration-exploitationinferencetimebayesianepisodes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In-context learning is a promising approach for online policy learning of offline reinforcement learning (RL) methods, which can be achieved at inference time without gradient optimization. However, this method is hindered by significant computational costs resulting from the gathering of large training trajectory sets and the need to train large Transformer models. We address this challenge by introducing an In-context Exploration-Exploitation (ICEE) algorithm, designed to optimize the efficiency of in-context policy learning. Unlike existing models, ICEE performs an exploration-exploitation trade-off at inference time within a Transformer model, without the need for explicit Bayesian inference. Consequently, ICEE can solve Bayesian optimization problems as efficiently as Gaussian process biased methods do, but in significantly less time. Through experiments in grid world environments, we demonstrate that ICEE can learn to solve new RL tasks using only tens of episodes, marking a substantial improvement over the hundreds of episodes needed by the previous in-context learning method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ReBRAC-v2: The Return of the King

    cs.LG 2026-08 conditional novelty 5.0 of 10

    A fixed-recipe offline RL method combining normalizing-flow actors, categorical critics, staged training, and test-time refinement beats recent flow-based baselines by 22.5 points averaged over ten OGBench categories.

  2. Large Language Model-Enhanced Multi-Armed Bandits

    cs.LG 2025-02 conditional novelty 5.0 of 10

    Using an LLM as a reward predictor inside Thompson sampling and regression-oracle bandits outperforms LLM direct arm selection in the tested tasks.

  3. Meta-Prompt Optimization for LLM-Based Sequential Decision Making

    cs.LG 2025-02 conditional novelty 5.0 of 10

    EXPO uses adversarial bandit weighting over LLM-generated prompt variations to optimize the meta-prompt of LLM-based sequential decision-making agents, improving performance on optimization and bandit tasks.

Pith tools