Pith. sign in

REVIEW

Leveraging Demonstrations to Improve Online Learning: Quality Matters

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 2302.03319 v4 pith:IWL5DAQK submitted 2023-02-07 cs.LG math.STstat.MLstat.TH

classification cs.LGmath.STstat.MLstat.TH
keywords datademonstrationonlinealgorithmimproveimprovementlearningbayesian
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We investigate the extent to which offline demonstration data can improve online learning. It is natural to expect some improvement, but the question is how, and by how much? We show that the degree of improvement must depend on the quality of the demonstration data. To generate portable insights, we focus on Thompson sampling (TS) applied to a multi-armed bandit as a prototypical online learning algorithm and model. The demonstration data is generated by an expert with a given competence level, a notion we introduce. We propose an informed TS algorithm that utilizes the demonstration data in a coherent way through Bayes' rule and derive a prior-dependent Bayesian regret bound. This offers insight into how pretraining can greatly improve online performance and how the degree of improvement increases with the expert's competence level. We also develop a practical, approximate informed TS algorithm through Bayesian bootstrapping and show substantial empirical regret reduction through experiments.

Discussion (0). Continue with ORCID to comment.

Pith tools