Efficient Contextual Bandits with Continuous Actions

Akshay Krishnamurthy; Aleksandrs Slivkins; Chicheng Zhang; John Langford; Maryam Majzoubi; Rajan Chari

REVIEW

Efficient Contextual Bandits with Continuous Actions

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2006.06040 v2 pith:ABBXXWYV submitted 2020-06-10 cs.LG stat.ML

Efficient Contextual Bandits with Continuous Actions

Maryam Majzoubi , Chicheng Zhang , Rajan Chari , Akshay Krishnamurthy , John Langford , Aleksandrs Slivkins This is my paper

classification cs.LG stat.ML

keywords actionsalgorithmbanditscontextualcontinuouscomposescomputationallycreate

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We create a computationally tractable algorithm for contextual bandits with continuous actions having unknown structure. Our reduction-style algorithm composes with most supervised learning representations. We prove that it works in a general sense and verify the new functionality with large-scale experiments.

Efficient Contextual Bandits with Continuous Actions

discussion (0)