scientific article; zbMATH DE number 7415076

MaRDI QIDQ5159398

Alekh Agarwal, John Langford, Alberto Bietti

Publication date: 27 October 2021

Full work available at URL: https://arxiv.org/abs/1802.04064

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

evaluationonline learningcontextual bandits

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits ⋮ Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Doubly robust policy evaluation and optimization
• Risk bounds for statistical learning
• A Tutorial on Thompson Sampling
• Theory of Disagreement-Based Active Learning

This page was built for publication: