default search action
Haobo Fu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Kai Li
, Hang Xu
Automatically designing counterfactual regret minimization algorithms for solving imperfect-information games. Artif. Intell. 337: 104232 (2024) - [c24]Jinmin He, Kai Li, Yifan Zang, Haobo Fu, Qiang Fu, Junliang Xing, Jian Cheng:
Not All Tasks Are Equally Difficult: Multi-Task Deep Reinforcement Learning with Dynamic Depth Routing. AAAI 2024: 12376-12384 - [c23]Yuheng Jing, Kai Li, Bingyun Liu, Yifan Zang, Haobo Fu, Qiang Fu, Junliang Xing, Jian Cheng:
Towards Offline Opponent Modeling with In-context Learning. ICLR 2024 - [c22]Jiarong Liu, Yifan Zhong, Siyi Hu, Haobo Fu, Qiang Fu, Xiaojun Chang, Yaodong Yang:
Maximum Entropy Heterogeneous-Agent Reinforcement Learning. ICLR 2024 - [c21]Hang Xu, Kai Li, Haobo Fu, Qiang Fu, Junliang Xing, Jian Cheng:
Dynamic Discounted Counterfactual Regret Minimization. ICLR 2024 - [c20]Hang Xu, Kai Li, Bingyun Liu, Haobo Fu, Qiang Fu, Junliang Xing, Jian Cheng:
Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent. IJCAI 2024: 5272-5280 - [i12]Shuang Wu, Liwen Zhu, Tao Yang, Shiwei Xu, Qiang Fu, Yang Wei, Haobo Fu:
Enhance Reasoning for Large Language Models in the Game Werewolf. CoRR abs/2402.02330 (2024) - [i11]Liangzhou Wang, Kaiwen Zhu, Fengming Zhu, Xinghu Yao, Shujie Zhang, Deheng Ye, Haobo Fu, Qiang Fu, Wei Yang:
Reaching Consensus in Cooperative Multi-Agent Reinforcement Learning with Goal Imagination. CoRR abs/2403.03172 (2024) - [i10]Hang Xu, Kai Li, Bingyun Liu, Haobo Fu, Qiang Fu, Junliang Xing, Jian Cheng:
Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent. CoRR abs/2404.13891 (2024) - [i9]Chen Qiu, Haobo Fu, Kai Li, Weixin Huang, Jiajia Zhang, Xuan Wang:
Enhanced Equilibria-Solving via Private Information Pre-Branch Structure in Adversarial Team Games. CoRR abs/2408.02283 (2024) - [i8]Hanlin Yang, Jian Yao, Weiming Liu, Qing Wang, Hanmin Qin, Hansheng Kong, Kirk Tang, Jiechao Xiong, Chao Yu, Kai Li, Junliang Xing, Hongwu Chen, Juchao Zhuo, Qiang Fu, Wei Yang, Haobo Fu:
Diverse Policies Recovering via Pointwise Mutual Information Weighted Imitation Learning. CoRR abs/2410.15910 (2024) - 2023
- [c19]Yifan Zang, Jinmin He, Kai Li, Haobo Fu, Qiang Fu, Junliang Xing:
Sequential Cooperative Multi-Agent Reinforcement Learning. AAMAS 2023: 485-493 - [c18]Yuxing Wang, Shuang Wu, Tiantian Zhang, Yongzhe Chang, Haobo Fu, Qiang Fu, Xueqian Wang:
PreCo: Enhancing Generalization in Co-Design of Modular Soft Robots via Brain-Body Pre-Training. CoRL 2023: 478-498 - [c17]Yuxing Wang, Shuang Wu, Haobo Fu, Qiang Fu, Tiantian Zhang, Yongzhe Chang, Xueqian Wang:
Curriculum-based Co-design of Morphology and Control of Voxel-based Soft Robots. ICLR 2023 - [c16]Shuang Wu, Jian Yao, Haobo Fu, Ye Tian, Chao Qian, Yaodong Yang, Qiang Fu, Wei Yang:
Quality-Similar Diversity via Population Based Reinforcement Learning. ICLR 2023 - [c15]Weiming Liu, Haobo Fu, Qiang Fu, Wei Yang:
Opponent-Limited Online Search for Imperfect Information Games. ICML 2023: 21567-21585 - [c14]Ren-Jian Wang
Multi-objective Optimization-based Selection for Quality-Diversity by Non-surrounded-dominated Sorting. IJCAI 2023: 4335-4343 - [c13]Ruozi Huang, Xipeng Wu, Hongsheng Yu, Zhong Fan, Haobo Fu, Qiang Fu, Wei Yang:
A Robust and Opponent-Aware League Training Method for StarCraft II. NeurIPS 2023 - [c12]Jian Yao, Weiming Liu, Haobo Fu, Yaodong Yang, Stephen McAleer, Qiang Fu, Wei Yang:
Policy Space Diversity for Non-Transitive Games. NeurIPS 2023 - [c11]Yifan Zang, Jinmin He, Kai Li, Haobo Fu, Qiang Fu, Junliang Xing, Jian Cheng:
Automatic Grouping for Efficient Cooperative Multi-Agent Reinforcement Learning. NeurIPS 2023 - [i7]Jiarong Liu, Yifan Zhong, Siyi Hu, Haobo Fu, Qiang Fu, Xiaojun Chang, Yaodong Yang
Maximum Entropy Heterogeneous-Agent Mirror Learning. CoRR abs/2306.10715 (2023) - [i6]Jian Yao, Weiming Liu, Haobo Fu, Yaodong Yang
Policy Space Diversity for Non-Transitive Games. CoRR abs/2306.16884 (2023) - [i5]Ren-Jian Wang
Diversity from Human Feedback. CoRR abs/2310.06648 (2023) - [i4]Muyao Zhong, Shengcai Liu, Bingdong Li, Haobo Fu, Ke Tang, Peng Yang:
Pointer Networks Trained Better via Evolutionary Algorithms. CoRR abs/2312.01150 (2023) - [i3]Jinmin He, Kai Li, Yifan Zang, Haobo Fu, Qiang Fu, Junliang Xing, Jian Cheng:
Not All Tasks Are Equally Difficult: Multi-Task Reinforcement Learning with Dynamic Depth Routing. CoRR abs/2312.14472 (2023) - 2022
- [c10]Hang Xu, Kai Li, Haobo Fu, Qiang Fu, Junliang Xing:
AutoCFR: Learning to Design Counterfactual Regret Minimization Algorithms. AAAI 2022: 5244-5251 - [c9]Jinqiu Li, Shuang Wu, Haobo Fu, Qiang Fu, Enmin Zhao, Junliang Xing:
Speedup Training Artificial Intelligence for Mahjong via Reward Variance Reduction. CoG 2022: 345-352 - [c8]Haobo Fu, Weiming Liu, Shuang Wu, Yijia Wang, Tao Yang, Kai Li, Junliang Xing, Bin Li, Bo Ma, Qiang Fu, Wei Yang:
Actor-Critic Policy Optimization in a Large-Scale Imperfect-Information Game. ICLR 2022 - [c7]Haobo Fu, Ye Tian, Hongxiang Yu, Weiming Liu, Shuang Wu, Jiechao Xiong, Ying Wen, Kai Li, Junliang Xing, Qiang Fu, Wei Yang:
Greedy when Sure and Conservative when Uncertain about the Opponents. ICML 2022: 6829-6848 - 2021
- [c6]Yunsheng Zhang, Dong Yan, Bei Shi, Haobo Fu, Qiang Fu, Hang Su, Jun Zhu, Ning Chen:
Combining Tree Search and Action Prediction for State-of-the-Art Performance in DouDiZhu. IJCAI 2021: 3413-3419 - [i2]Zhe Wu, Kai Li, Enmin Zhao, Hang Xu, Meng Zhang, Haobo Fu, Bo An, Junliang Xing:
L2E: Learning to Exploit Your Opponent. CoRR abs/2102.09381 (2021)
2010 – 2019
- 2018
- [i1]Jiechao Xiong, Qing Wang, Zhuoran Yang, Peng Sun, Lei Han, Yang Zheng, Haobo Fu, Tong Zhang, Ji Liu, Han Liu:
Parametrized Deep Q-Networks Learning: Reinforcement Learning with Discrete-Continuous Hybrid Action Space. CoRR abs/1810.06394 (2018) - 2015
- [j1]Haobo Fu, Bernhard Sendhoff
Robust Optimization Over Time: Problem Difficulties and Benchmark Problems. IEEE Trans. Evol. Comput. 19(5): 731-745 (2015) - 2014
- [c5]Yi-Nan Guo
Find robust solutions over time by two-layer multi-objective optimization method. IEEE Congress on Evolutionary Computation 2014: 1528-1535 - [c4]Haobo Fu, Peter R. Lewis
What are dynamic optimization problems? IEEE Congress on Evolutionary Computation 2014: 1550-1557 - 2013
- [c3]Haobo Fu, Bernhard Sendhoff, Ke Tang, Xin Yao:
Finding Robust Solutions to Dynamic Optimization Problems. EvoApplications 2013: 616-625 - 2012
- [c2]Haobo Fu, Bernhard Sendhoff
Characterizing environmental changes in Robust Optimization Over Time. IEEE Congress on Evolutionary Computation 2012: 1-8 - 2010
- [c1]Haobo Fu, Yi Mei
Memetic algorithm with heuristic candidate list strategy for Capacitated Arc Routing Problem. IEEE Congress on Evolutionary Computation 2010: 1-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-19 22:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: