2025
An Open-Ended Learning Framework for Opponent Modeling.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025
2024
Optimizing Latent Goal by Learning from Trajectory Preference.
CoRR, 2024
Diverse Policies Recovering via Pointwise Mutual Information Weighted Imitation Learning.
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
CoRR, 2024
Enhanced Equilibria-Solving via Private Information Pre-Branch Structure in Adversarial Team Games.
CoRR, 2024
Reaching Consensus in Cooperative Multi-Agent Reinforcement Learning with Goal Imagination.
CoRR, 2024
Enhance Reasoning for Large Language Models in the Game Werewolf.
CoRR, 2024
Automatically designing counterfactual regret minimization algorithms for solving imperfect-information games.
Artif. Intell., 2024
Opponent Modeling with In-context Search.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024
Efficient Multi-task Reinforcement Learning with Cross-Task Policy Guidance.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024
Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
Dynamic Discounted Counterfactual Regret Minimization.
Proceedings of the Twelfth International Conference on Learning Representations, 2024
Maximum Entropy Heterogeneous-Agent Reinforcement Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024
Towards Offline Opponent Modeling with In-context Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024
Not All Tasks Are Equally Difficult: Multi-Task Deep Reinforcement Learning with Dynamic Depth Routing.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Not All Tasks Are Equally Difficult: Multi-Task Reinforcement Learning with Dynamic Depth Routing.
CoRR, 2023
Pointer Networks Trained Better via Evolutionary Algorithms.
CoRR, 2023
Diversity from Human Feedback.
CoRR, 2023
Maximum Entropy Heterogeneous-Agent Mirror Learning.
CoRR, 2023
Automatic Grouping for Efficient Cooperative Multi-Agent Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Policy Space Diversity for Non-Transitive Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
A Robust and Opponent-Aware League Training Method for StarCraft II.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Multi-objective Optimization-based Selection for Quality-Diversity by Non-surrounded-dominated Sorting.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Opponent-Limited Online Search for Imperfect Information Games.
Proceedings of the International Conference on Machine Learning, 2023
Quality-Similar Diversity via Population Based Reinforcement Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023
Curriculum-based Co-design of Morphology and Control of Voxel-based Soft Robots.
Proceedings of the Eleventh International Conference on Learning Representations, 2023
PreCo: Enhancing Generalization in Co-Design of Modular Soft Robots via Brain-Body Pre-Training.
Proceedings of the Conference on Robot Learning, 2023
Sequential Cooperative Multi-Agent Reinforcement Learning.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
2022
Greedy when Sure and Conservative when Uncertain about the Opponents.
,
,
,
,
,
,
,
,
,
,
Proceedings of the International Conference on Machine Learning, 2022
Actor-Critic Policy Optimization in a Large-Scale Imperfect-Information Game.
,
,
,
,
,
,
,
,
,
,
Proceedings of the Tenth International Conference on Learning Representations, 2022
Speedup Training Artificial Intelligence for Mahjong via Reward Variance Reduction.
Proceedings of the IEEE Conference on Games, CoG 2022, Beijing, 2022
AutoCFR: Learning to Design Counterfactual Regret Minimization Algorithms.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
L2E: Learning to Exploit Your Opponent.
CoRR, 2021
Combining Tree Search and Action Prediction for State-of-the-Art Performance in DouDiZhu.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021
2018
Parametrized Deep Q-Networks Learning: Reinforcement Learning with Discrete-Continuous Hybrid Action Space.
CoRR, 2018
2015
Robust Optimization Over Time: Problem Difficulties and Benchmark Problems.
IEEE Trans. Evol. Comput., 2015
2014
Find robust solutions over time by two-layer multi-objective optimization method.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014
What are dynamic optimization problems?
Proceedings of the IEEE Congress on Evolutionary Computation, 2014
2013
Finding Robust Solutions to Dynamic Optimization Problems.
Proceedings of the Applications of Evolutionary Computation - 16th European Conference, 2013
2012
Characterizing environmental changes in Robust Optimization Over Time.
Proceedings of the IEEE Congress on Evolutionary Computation, 2012
2010
Memetic algorithm with heuristic candidate list strategy for Capacitated Arc Routing Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010