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 2020Show all

9 papers · 1 filter

cs.LG2020★ 18 cited

Neural Contextual Bandits with Deep Representation and Shallow Exploration

Pan Xu, Zheng Wen, Handong Zhao +1

We study a general class of contextual bandits, where each context-action pair is associated with a raw feature vector, but the reward generating function is unknown. We propose a…

cs.CV2020★ 5 cited

A Benchmark and Baseline for Language-Driven Image Editing

Jing Shi, Ning Xu, Trung Bui +3

Language-driven image editing can significantly save the laborious image editing work and be friendly to the photography novice. However, most similar work can only deal with a spe…

cs.LG2020★ 4 cited

On the Sample Complexity of Reinforcement Learning with Policy Space Generalization

Wenlong Mou, Zheng Wen, Xi Chen

We study the optimal sample complexity in large-scale Reinforcement Learning (RL) problems with policy space generalization, i.e. the agent has a prior knowledge that the optimal p…

cs.AI2020★ 6 cited

Structured Policy Iteration for Linear Quadratic Regulator

Youngsuk Park, Ryan A. Rossi, Zheng Wen +2

Linear quadratic regulator (LQR) is one of the most popular frameworks to tackle continuous Markov decision process tasks. With its fundamental theory and tractable optimal policy,…

cs.LG2020

Influence Diagram Bandits: Variational Thompson Sampling for Structured Bandit Problems

Tong Yu, Branislav Kveton, Zheng Wen +2

We propose a novel framework for structured bandits, which we call an influence diagram bandit. Our framework captures complex statistical dependencies between actions, latent vari…

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…

cs.LG2020★ 10 cited

Hypermodels for Exploration

Vikranth Dwaracherla, Xiuyuan Lu, Morteza Ibrahimi +3

We study the use of hypermodels to represent epistemic uncertainty and guide exploration. This generalizes and extends the use of ensembles to approximate Thompson sampling. The co…

cs.CL2020

Improving Adversarial Text Generation by Modeling the Distant Future

Ruiyi Zhang, Changyou Chen, Zhe Gan +5

Auto-regressive text generation models usually focus on local fluency, and may cause inconsistent semantic meaning in long text generation. Further, automatically generating words…

cs.CL2020★ 1 cited

Nested-Wasserstein Self-Imitation Learning for Sequence Generation

Ruiyi Zhang, Changyou Chen, Zhe Gan +3

Reinforcement learning (RL) has been widely studied for improving sequence-generation models. However, the conventional rewards used for RL training typically cannot capture suffic…