Demo Data from SIGIR 2026 / reviewers in the wild / expert
Cong-Minh Bui
dblp:246/2909
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › multi-agent reinforcement learning
experience sharing |
0.4 | 1 | 2019 | Sharing Experience in Multitask Reinforcement Learning · IJCAI 2019 |
Machine learning › Reinforcement learning
multi-task reinforcement learning |
0.4 | 1 | 2019 | Sharing Experience in Multitask Reinforcement Learning · IJCAI 2019 |
Methods — techniques the papers use, named apart from their topics
confidence sharing agent · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Sharing Experience in Multitask Reinforcement LearningabstractIn multitask reinforcement learning, tasks often have sub-tasks that share the same solution, even though the overall tasks are different. If the shared-portions could be effectively identified, then the learning process could be improved since all the samples between tasks in the shared space could be used. In this paper, we propose a Sharing Experience Framework (SEF) for simultaneously training of multiple tasks. In SEF, a confidence sharing agent uses task-specific rewards from the environment to identify similar parts that should be shared across tasks and defines those parts as shared-regions between tasks. The shared-regions are expected to guide task-policies sharing their experience during the learning process. The experiments highlight that our framework improves the performance and the stability of learning task-policies, and is possible to help task-policies avoid local optimums. Tung Long Vuong, Do-Van Nguyen, Tai-Long Nguyen, Cong-Minh Bui, Hai-Dang Kieu, Viet Cuong Ta, Quoc-Long Tran |
IJCAI | 4 |