4 citations · 6 across the 6 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2021★ 4 cited
Optimize Neural Fictitious Self-Play in Regret Minimization Thinking
Yuxuan Chen, Li Zhang, Shijian Li +1
Optimization of deep learning algorithms to approach Nash Equilibrium remains a significant problem in imperfect information games, e.g. StarCraft and poker. Neural Fictitious Self…
cs.AI2018
A Unified Approach for Multi-step Temporal-Difference Learning with Eligibility Traces in Reinforcement Learning
Long Yang, Minhao Shi, Qian Zheng +2
Recently, a new multi-step temporal learning algorithm, called , unifies -step Tree-Backup (when ) and -step Sarsa (when ) by introducing a sampling parameter…