Demo Data from EDBT 2026 / reviewers in the wild / expert
Jingxiang Hao
dblp:387/3366
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0000-9926-234XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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 · 67% Robot manipulation · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot manipulation
diffusion policy |
1.0 | 1 | 2026 | CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action Space · AAAI 2026 |
Machine learning › Reinforcement learning › action space design
hybrid action space |
1.0 | 1 | 2026 | CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action Space · AAAI 2026 |
Machine learning › Reinforcement learning › action space design
parameterized action space |
1.0 | 1 | 2026 | CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action Space · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
q-function · 1.0diffusion policy · 1.0codebook · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action SpaceabstractHybrid action space, which combines discrete choices and continuous parameters, is prevalent in domains such as robot control and game AI. However, efficiently modeling and optimizing hybrid discrete-continuous action space remains a fundamental challenge, mainly due to limited policy expressiveness and poor scalability in high-dimensional settings. To address this challenge, we view the hybrid action space problem as a fully cooperative game and propose a Cooperative Hybrid Diffusion Policies (CHDP) framework to solve it. CHDP employs two cooperative agents that leverage a discrete and a continuous diffusion policy, respectively. The continuous policy is conditioned on the discrete action's representation, explicitly modeling the dependency between them. This cooperative design allows the diffusion policies to leverage their expressiveness to capture complex distributions in their respective action spaces. To mitigate the update conflicts arising from simultaneous policy updates in this cooperative setting, we employ a sequential update scheme that fosters co-adaptation. Moreover, to improve scalability when learning in high-dimensional discrete action space, we construct a codebook that embeds the action space into a low-dimensional latent space. This mapping enables the discrete policy to learn in a compact, structured space. Finally, we design a Q-function-based guidance mechanism to align the codebook's embeddings with the discrete policy's representation during training. On challenging hybrid action benchmarks, CHDP outperforms state-of-the-art method by up to 19.3% in success rate. Bingyi Liu, Jinbo He, Haiyong Shi, Enshu Wang, Weizhen Han, Jingxiang Hao, Peixi Wang |
AAAI | 6 |
| 2024 | Multi-Agent Reinforcement Learning Based Resource Allocation for Efficient Message Dissemination in C-V2X NetworksabstractIn order to support diverse applications in intelligent transportation, intelligent connected vehicles (ICVs) need to send multiple types of messages, such as periodic messages and event-driven messages with different frame specifications. However, existing researches often concentrate on the transmission of single-message types, overlooking hybrid communication scenarios where multiple types of messages coexist, posing challenges in meeting the diverse transmission needs of different message types. To optimize the Quality of Service (QoS) in such scenarios, we take the perspective of ICVs and formulate their decision making as a multi-agent reinforcement learning problem. More specifically, we propose a cooperative individual rewards assisted multi-agent reinforcement learning (CIRA) framework. The transformer structure in CIRA is used to avoid mutual interference during the transmission of different vehicles. Besides, the introduction of individual rewards and the dual-layer architecture of CIRA contribute to providing ICVs with more forward-looking message dissemination scheme. Finally, we set up a simulator to create dynamic traffic scenarios reflecting different real-world conditions. We conduct extensive experiments to evaluate the proposed CIRA framework’s performance. The results show that CIRA can significantly improve the packet reception rates and ensure low communication delays in various scenarios. Bingyi Liu, Jingxiang Hao, Enshu Wang, Dongyao Jia, Weizhen Han, Shengwu Xiong 0001 |
IWQoS | 2 |