activity
20192023
most citedBatch Policy Learning in Average Reward Markov Decision Processes

15 citations · 52 across the 23 of their papers we have counts for

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2023★ 1 cited

PASTA: Pessimistic Assortment Optimization

Juncheng Dong, Weibin Mo, Zhengling Qi +3

We consider a class of assortment optimization problems in an offline data-driven setting. A firm does not know the underlying customer choice model but has access to an offline da…

cs.LG2022★ 3 cited

RISE: Robust Individualized Decision Learning with Sensitive Variables

Xiaoqing Tan, Zhengling Qi, Christopher W. Seymour +1

This paper introduces RISE, a robust individualized decision learning framework with sensitive variables, where sensitive variables are collectible data and important to the interv…

cs.LG2022★ 6 cited

Offline Reinforcement Learning with Instrumental Variables in Confounded Markov Decision Processes

Zuyue Fu, Zhengling Qi, Zhaoran Wang +3

We study the offline reinforcement learning (RL) in the face of unmeasured confounders. Due to the lack of online interaction with the environment, offline RL is facing the followi…

cs.LG2021★ 1 cited

Pessimistic Model Selection for Offline Deep Reinforcement Learning

Chao-Han Huck Yang, Zhengling Qi, Yifan Cui +1

Deep Reinforcement Learning (DRL) has demonstrated great potentials in solving sequential decision making problems in many applications. Despite its promising performance, practica…

cs.LG2021★ 3 cited

Projected State-action Balancing Weights for Offline Reinforcement Learning

Jiayi Wang, Zhengling Qi, Raymond K. W. Wong

Offline policy evaluation (OPE) is considered a fundamental and challenging problem in reinforcement learning (RL). This paper focuses on the value estimation of a target policy ba…