4 papers
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…
Hamiltonian Descent Algorithms for Optimization: Accelerated Rates via Randomized Integration Time
Qiang Fu, Andre Wibisono
We study the Hamiltonian flow for optimization (HF-opt), which simulates the Hamiltonian dynamics for some integration time and resets the velocity to to decrease the objective…