Pith. sign in

REVIEW 2 cited by

Bootstrapped Thompson Sampling and Deep Exploration

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 1507.00300 v1 pith:WYMNCCIP submitted 2015-07-01 stat.ML cs.LG

Bootstrapped Thompson Sampling and Deep Exploration

classification stat.ML cs.LG
keywords approachexplorationsamplingthompsondeepdistributionlearningmaintaining
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This technical note presents a new approach to carrying out the kind of exploration achieved by Thompson sampling, but without explicitly maintaining or sampling from posterior distributions. The approach is based on a bootstrap technique that uses a combination of observed and artificially generated data. The latter serves to induce a prior distribution which, as we will demonstrate, is critical to effective exploration. We explain how the approach can be applied to multi-armed bandit and reinforcement learning problems and how it relates to Thompson sampling. The approach is particularly well-suited for contexts in which exploration is coupled with deep learning, since in these settings, maintaining or generating samples from a posterior distribution becomes computationally infeasible.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Diffusion Approximations for Thompson Sampling in the Small Gap Regime

    cs.LG 2021-05 unverdicted novelty 7.0

    In the small gap regime, Thompson sampling and a broad class of sampling-based algorithms converge weakly to identical SDE limits, making regret performance insensitive to likelihood misspecification.

  2. AutoPilot: Learning to Steer High Speed Robust BFT

    cs.DC 2026-06 unverdicted novelty 5.0

    AutoPilot uses decentralized reinforcement learning to continuously adjust BFT protocol parameters online, achieving 49.8% lower end-to-end latency than static defaults in dynamic environments.