7 citations · 26 across the 16 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LG2020★ 5 cited
Minimax Sample Complexity for Turn-based Stochastic Game
Qiwen Cui, Lin F. Yang
The empirical success of Multi-agent reinforcement learning is encouraging, while few theoretical guarantees have been revealed. In this work, we prove that the plug-in solver appr…
cs.LG2020★ 7 cited
Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning?
Qiwen Cui, Lin F. Yang
It is believed that a model-based approach for reinforcement learning (RL) is the key to reduce sample complexity. However, the understanding of the sample optimality of model-base…