6 papers · 1 filter
Deep (Predictive) Discounted Counterfactual Regret Minimization
Hang Xu, Kai Li, Haobo Fu +3
Counterfactual regret minimization (CFR) is a family of algorithms for effectively solving imperfect-information games. To enhance CFR's applicability in large games, researchers u…
Goal-Oriented Skill Abstraction for Offline Multi-Task Reinforcement Learning
Jinmin He, Kai Li, Yifan Zang +4
Offline multi-task reinforcement learning aims to learn a unified policy capable of solving multiple tasks using only pre-collected task-mixed datasets, without requiring any onlin…
Efficient Multi-Task Reinforcement Learning with Cross-Task Policy Guidance
Jinmin He, Kai Li, Yifan Zang +4
Multi-task reinforcement learning endeavors to efficiently leverage shared information across various tasks, facilitating the simultaneous learning of multiple tasks. Existing appr…
Diversity from Human Feedback
Ren-Jian Wang, Ke Xue, Yutong Wang +4
Diversity plays a significant role in many problems, such as ensemble learning, reinforcement learning, and combinatorial optimization. How to define the diversity measure is a lon…
Diverse Policies Recovering via Pointwise Mutual Information Weighted Imitation Learning
Hanlin Yang, Jian Yao, Weiming Liu +13
Recovering a spectrum of diverse policies from a set of expert trajectories is an important research topic in imitation learning. After determining a latent style for a trajectory,…
Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
Hang Xu, Kai Li, Bingyun Liu +4
Counterfactual regret minimization (CFR) is a family of algorithms for effectively solving imperfect-information games. It decomposes the total regret into counterfactual regrets,…