scientific article; zbMATH DE number 7255168

MaRDI QIDQ4969248

Chicheng Zhang, Akshay Krishnamurthy, John Langford, Aleksandrs Slivkins

Publication date: 5 October 2020

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

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

zbMATH Keywords

contextual banditsnonparametric learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

A Single-Index Model With a Surface-Link for Optimizing Individualized Dose Rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On general minimax theorems
• Adaptive-treed bandits
• A decision-theoretic generalization of on-line learning and an application to boosting
• Triangulation and embedding using small sets of beacons
• Every complete doubling metric space carries a doubling measure
• The Nonstochastic Multiarmed Bandit Problem
• The Continuum-Armed Bandit Problem
• Spatial gossip and resource location protocols
• Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting

This page was built for publication: