Demo Data from VLDB 2026 / reviewers in the wild / expert
Changxi Zhu
dblp:241/7775
· DBLP profile ↗
9ranked-venue papers
6as first author
8since 2021 · last 2025
0000-0002-2910-5506ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 5 first-author · 7 since 2021Systems, architecture and hardware · 1 · 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
2 papers |
Question answering and dialogue systems · 57% Information extraction and text analysis · 43% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Question answering and dialogue systems › dialogue management
dialogue policy |
0.5 | 1 | 2021 | Efficient Dialogue Complementary Policy Learning via Deep Q-network Policy and Episodic Memory Policy · EMNLP (1) 2021 |
Natural language and speech › Question answering and dialogue systems › task-oriented dialogue
dialogue policy learning |
0.5 | 1 | 2021 | Efficient Dialogue Complementary Policy Learning via Deep Q-network Policy and Episodic Memory Policy · EMNLP (1) 2021 |
Natural language and speech › Information extraction and text analysis › sentiment analysis › aspect-based sentiment analysis
aspect-level sentiment classification |
0.4 | 1 | 2019 | Recognizing Conflict Opinions in Aspect-level Sentiment Classification with Dual Attention Networks · EMNLP/IJCNLP (1) 2019 |
Natural language and speech › Information extraction and text analysis
sentiment analysis |
0.4 | 1 | 2019 | Recognizing Conflict Opinions in Aspect-level Sentiment Classification with Dual Attention Networks · EMNLP/IJCNLP (1) 2019 |
Methods — techniques the papers use, named apart from their topics
episodic memory · 0.5deep q-network · 0.5confidence controller · 0.5dual attention network · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Reducing Variance Caused by Communication in Decentralized Multi-agent Deep Reinforcement Learning
Changxi Zhu, Mehdi Dastani, Shihan Wang 0001 |
AAMAS | 1 |
| 2025 | Communication with factorized policy gradients in multi-agent deep reinforcement learningabstractAbstract In multi-agent deep reinforcement learning (MADRL), agents can learn to communicate to broaden their view and understanding of the environment and their teammates. Previous works on communication in MADRL mainly rely on centralized or independent value functions for learning communication, which cannot differentiate how communicating agents individually contribute to the overall learning process. Moreover, continuous environments that incorporate continuous state/action spaces have received limited attention in previous research. In this paper, we propose a novel architecture for communicating agents and apply centralized but factorized value functions to differentiate how each agent contributes to learning during communication, along with gradient backpropagation. Additionally, to address the complexity introduced by communication, we investigate the use of an attention mechanism that aggregates messages, enabling policies to maintain a fixed input length. We then present a new policy gradient method termed communication with factorized policy gradients (CFPG), featuring full backpropagation from factorized value functions to communicating agents’ architecture. We demonstrate that CFPG can enhance performance and accelerate learning in continuous predator–prey scenarios and multi-agent MuJoCo, when compared to other learning communication methods. Changxi Zhu, Mehdi Dastani, Shihan Wang 0001 |
Neural Comput. Appl. | 1 |
| 2024 | A survey of multi-agent deep reinforcement learning with communicationabstractAbstract Communication is an effective mechanism for coordinating the behaviors of multiple agents, broadening their views of the environment, and to support their collaborations. In the field of multi-agent deep reinforcement learning (MADRL), agents can improve the overall learning performance and achieve their objectives by communication. Agents can communicate various types of messages, either to all agents or to specific agent groups, or conditioned on specific constraints. With the growing body of research work in MADRL with communication (Comm-MADRL), there is a lack of a systematic and structural approach to distinguish and classify existing Comm-MADRL approaches. In this paper, we survey recent works in the Comm-MADRL field and consider various aspects of communication that can play a role in designing and developing multi-agent reinforcement learning systems. With these aspects in mind, we propose 9 dimensions along which Comm-MADRL approaches can be analyzed, developed, and compared. By projecting existing works into the multi-dimensional space, we discover interesting trends. We also propose some novel directions for designing future Comm-MADRL systems through exploring possible combinations of the dimensions. Changxi Zhu, Mehdi Dastani, Shihan Wang 0001 |
Auton. Agents Multi Agent Syst. | 1 |
| 2024 | Correction: A survey of multi-agent deep reinforcement learning with communicationabstractguideline of Comm-MADRL systems. The guideline positions dimensions where communication influences interaction with the environment and training phases. Changxi Zhu, Mehdi Dastani, Shihan Wang 0001 |
Auton. Agents Multi Agent Syst. | 1 |
| 2023 | Learning by reusing previous advice: a memory-based teacher-student framework
Changxi Zhu, Yi Cai 0001, Shuyue Hu, Ho-fung Leung, Dickson K. W. Chiu |
Auton. Agents Multi Agent Syst. | 1 |
| 2023 | Detecting Dependency-Related Sentiment Features for Aspect-Level Sentiment ClassificationabstractAspect-level sentiment classification aims to determine the sentiment polarity of a sentence toward a given aspect term or aspect category. For sentiment classification toward a given aspect term, some opinions may exist that are not the given aspect term's modifiers because a sentence may contain more than one aspect term. Hence, It is necessary to capture relevant opinion for a certain aspect term. To capture the nearest opinion of the aspect term, researchers have used the relative distance between an aspect term and all other words in a sentence. However, this can be infeasible when the sentence has a complex syntactic structure. In this paper, we introduce dependency relation to detect the dependency-related sentiment feature for the aspect term in the dependency parse tree, and integrate this relationship into the convolutional neural network and bidirectional long short-term memory. Experiments show that the related sentiment features for an aspect term help models discriminate its sentiment polarity. The proposed models achieve state-of-the-art results among neural networks. The codes and datasets are released onhttps://github.com/LittleSummer114/DW-CNN. Yi Cai 0001, Xingwei Tan, Changxi Zhu |
IEEE Trans. Affect. Comput. | 5 |
| 2021 | Efficient Dialogue Complementary Policy Learning via Deep Q-network Policy and Episodic Memory PolicyabstractDeep reinforcement learning has shown great potential in training dialogue policies.However, its favorable performance comes at the cost of many rounds of interaction.Most of the existing dialogue policy methods rely on a single learning system, while the human brain has two specialized learning and memory systems, supporting to find good solutions without requiring copious examples.Inspired by the human brain, this paper proposes a novel complementary policy learning (CPL) framework, which exploits the complementary advantages of the episodic memory (EM) policy and the deep Q-network (DQN) policy to achieve fast and effective dialogue policy learning.In order to coordinate between the two policies, we proposed a confidence controller to control the complementary time according to their relative efficacy at different stages.Furthermore, memory connectivity and time pruning are proposed to guarantee the flexible and adaptive generalization of the EM policy in dialog tasks.Experimental results on three dialogue datasets show that our method significantly outperforms existing methods relying on a single learning system. Zhenyu Wang 0001, Changxi Zhu, Shihan Wang 0001 |
EMNLP (1) | 3 |
| 2021 | A Q-values Sharing Framework for Multi-agent Reinforcement Learning under Budget ConstraintabstractIn teacher-student framework, a more experienced agent (teacher) helps accelerate the learning of another agent (student) by suggesting actions to take in certain states. In cooperative multiagent reinforcement learning (MARL), where agents need to cooperate with one another, a student may fail to cooperate well with others even by following the teachers' suggested actions, as the polices of all agents are ever changing before convergence. When the number of times that agents communicate with one another is limited (i.e., there is budget constraint), the advising strategy that uses actions as advices may not be good enough. We propose a partaker-sharer advising framework (PSAF) for cooperative MARL agents learning with budget constraint. In PSAF, each Q-learner can decide when to ask for Q-values and share its Q-values. We perform experiments in three typical multiagent learning problems. Evaluation results show that our approach PSAF outperforms existing advising methods under both unlimited and limited budget, and we give an analysis of the impact of advising actions and sharing Q-values on agents' learning. Changxi Zhu, Ho-fung Leung, Shuyue Hu, Yi Cai 0001 |
ACM Trans. Auton. Adapt. Syst. | 1 |
| 2019 | Recognizing Conflict Opinions in Aspect-level Sentiment Classification with Dual Attention NetworksabstractXingwei Tan, Yi Cai, Changxi Zhu. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019. Xingwei Tan, Yi Cai 0001, Changxi Zhu |
EMNLP/IJCNLP (1) | 3 |