activity
20132026
most citedDeep Exploration via Randomized Value Functions

160 citations · 1.2k across the 55 of their papers we have counts for

collaborators
Showing stat.MLShow all

8 papers · 1 filter

stat.ML2022

Evaluating High-Order Predictive Distributions in Deep Learning

Ian Osband, Zheng Wen, Seyed Mohammad Asghari +3

Most work on supervised learning research has focused on marginal predictions. In decision problems, joint predictive distributions are essential for good performance. Previous wor…

stat.ML2020★ 1 cited

Stochastic Low-rank Tensor Bandits for Multi-dimensional Online Decision Making

Jie Zhou, Botao Hao, Zheng Wen +2

Multi-dimensional online decision making plays a crucial role in many real applications such as online recommendation and digital marketing. In these problems, a decision at each t…

stat.ML2019★ 24 cited

Bootstrapping Upper Confidence Bound

Botao Hao, Yasin Abbasi-Yadkori, Zheng Wen +1

Upper Confidence Bound (UCB) method is arguably the most celebrated one used in online decision making with partial information feedback. Existing techniques for constructing confi…

stat.ML2019★ 8 cited

Scalable Thompson Sampling via Optimal Transport

Ruiyi Zhang, Zheng Wen, Changyou Chen +1

Thompson sampling (TS) is a class of algorithms for sequential decision-making, which requires maintaining a posterior distribution over a model. However, calculating exact posteri…

stat.ML2018★ 2 cited

Conservative Exploration using Interleaving

Sumeet Katariya, Branislav Kveton, Zheng Wen +1

In many practical problems, a learning agent may want to learn the best action in hindsight without ever taking a bad action, which is significantly worse than the default producti…

stat.ML2018★ 53 cited

Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit

Yang Cao, Zheng Wen, Branislav Kveton +1

Multi-armed bandit (MAB) is a class of online learning problems where a learning agent aims to maximize its expected cumulative reward while repeatedly selecting to pull arms with…

stat.ML2017★ 160 cited

Deep Exploration via Randomized Value Functions

Ian Osband, Benjamin Van Roy, Daniel Russo +1

We study the use of randomized value functions to guide deep exploration in reinforcement learning. This offers an elegant means for synthesizing statistically and computationally…

stat.ML2014★ 80 cited

Generalization and Exploration via Randomized Value Functions

Ian Osband, Benjamin Van Roy, Zheng Wen

We propose randomized least-squares value iteration (RLSVI) -- a new reinforcement learning algorithm designed to explore and generalize efficiently via linearly parameterized valu…