Demo Data from EDBT 2026 / reviewers in the wild / expert
Yangkun Chen
dblp:20/9072
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0003-0824-1442ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021
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 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
exploration |
0.9 | 1 | 2025 | Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement Learning · AAAI 2025 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
0.9 | 1 | 2025 | Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement Learning · AAAI 2025 |
Machine learning › Reinforcement learning › exploration
novelty-based exploration |
0.9 | 1 | 2025 | Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement Learning · AAAI 2025 |
Machine learning › Reinforcement learning
sample efficiency |
0.9 | 1 | 2025 | Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement Learning · AAAI 2025 |
Machine learning › Reinforcement learning › off-policy reinforcement learning
experience replay |
0.3 | 1 | 2025 | Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement Learning · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
random network distillation · 0.9novelty-guided sample reuse · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement LearningabstractRecently, deep Multi-Agent Reinforcement Learning (MARL) has demonstrated its potential to tackle complex cooperative tasks, pushing the boundaries of AI in collaborative environments. However, the efficiency of these systems is often compromised by inadequate sample utilization and a lack of diversity in learning strategies. To enhance MARL performance, we introduce a novel sample reuse approach that dynamically adjusts policy updates based on observation novelty. Specifically, we employ a Random Network Distillation (RND) network to gauge the novelty of each agent's current state, assigning additional sample update opportunities based on the uniqueness of the data. We name our method Multi-Agent Novelty-GuidEd sample Reuse (MANGER). This method increases sample efficiency while promoting exploration and diverse agent behaviors. Our evaluations confirm substantial improvements in MARL effectiveness in complex cooperative scenarios such as Google Research Football and super-hard StarCraft II micromanagement tasks. Yangkun Chen, Jiafei Lyu |
AAAI | 1 |
| 2024 | Multi-agent Exploration with Sub-state Entropy EstimationabstractResearchers have integrated exploration techniques into multi-agent reinforcement learning (MARL) algorithms, drawing on their remarkable success in deep reinforcement learning. Nonetheless, exploration in MARL presents a more substantial challenge, as agents need to coordinate their efforts to achieve comprehensive state coverage. Reaching a unanimous agreement on which kinds of states warrant exploring can be a struggle for agents in this context. We introduce Multi-agent Exploration based on Sub-state Entropy (MESE ) to address this limitation. This novel approach incentivizes agents to explore states cooperatively by directing them to achieve consensus via an extra team reward. Calculating the additional reward is based on the novelty of the current sub-state that merits cooperative exploration. MESE employs a conditioned entropy approach to select the sub-state, which uses particle-based entropy estimation to calculate the entropy and uses Random Network Distillation(RND) to calculate the team’s intrinsic reward. MESE is a plug-and-play module that can be seamlessly integrated into most existing MARL algorithms, which makes it a highly effective tool for reinforcement learning. Our experiments demonstrate that MESE can substantially improve the performance of MAPPO and QMIX on various tasks in the StarCraft multi-agent challenge (SMAC). Yangkun Chen, Yang Zhang 0072, Kai Yang 0050, Xiu Li 0001 |
IJCNN | 2 |
| 2011 | An active steganalysis approach for echo hiding based on Sliding Windowed Cepstrum
Chunhui Xie, Yimin Cheng, Yangkun Chen |
Signal Process. | 3 |