Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zehua Zang

dblp:364/6601 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
9since 2021 · last 2026
0000-0001-8969-3218ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 2 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 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
3 papers
Reinforcement learning · 60% Multi-agent systems · 28% Learning theory · 12%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › multi-agent reinforcement learning
multi-agent communication
1.822026
M2I2: Learning Efficient Multi-Agent Communication via Masked State Modeling and Intention Inference · AAAI 2026
T2MAC: Targeted and Trusted Multi-Agent Communication through Selective Engagement and Evidence-Driven Integration · AAAI 2024
Machine learning › Reinforcement learning
multi-agent reinforcement learning
1.822026
M2I2: Learning Efficient Multi-Agent Communication via Masked State Modeling and Intention Inference · AAAI 2026
T2MAC: Targeted and Trusted Multi-Agent Communication through Selective Engagement and Evidence-Driven Integration · AAAI 2024
Knowledge, reasoning and agents › Multi-agent systems › multi-agent reasoning
intention inference
1.012026
M2I2: Learning Efficient Multi-Agent Communication via Masked State Modeling and Intention Inference · AAAI 2026
Knowledge, reasoning and agents › Multi-agent systems
multi-agent coordination
1.012026
M2I2: Learning Efficient Multi-Agent Communication via Masked State Modeling and Intention Inference · AAAI 2026
Machine learning › Learning theory
generalization
0.912025
Rethinking Generalizability and Discriminability of Self-Supervised Learning from Evolutionary Game Theory Perspective · Int. J. Comput. Vis. 2025
Machine learning › Reinforcement learning › multi-agent reinforcement learning
cooperative multi-agent reinforcement learning
0.812024
T2MAC: Targeted and Trusted Multi-Agent Communication through Selective Engagement and Evidence-Driven Integration · AAAI 2024

Methods — techniques the papers use, named apart from their topics

meta-learning · 1.0masked state modeling · 1.0joint-action prediction · 1.0evolutionary game theory · 0.9selective engagement · 0.8evidence-driven integration · 0.8
YearPublicationVenuePosition
2026 M2I2: Learning Efficient Multi-Agent Communication via Masked State Modeling and Intention Inference
abstract
Communication is essential in coordinating the behaviors of multiple agents. However, existing methods primarily emphasize content, timing, and partners for information sharing, often neglecting the critical aspect of integrating shared information. This gap can significantly impact agents' ability to understand and respond to complex, uncertain interactions, thus affecting overall communication efficiency. To address this issue, we introduce M2I2, a novel framework designed to enhance the agents' capabilities to assimilate and utilize received information effectively. M2I2 equips agents with advanced capabilities for masked state modeling and joint-action prediction, enriching their perception of environmental uncertainties and facilitating the anticipation of teammates' intentions. This approach ensures that agents are furnished with both comprehensive and relevant information, bolstering more informed and synergistic behaviors. Moreover, we propose a Dimensional Rational Network, innovatively trained via a meta-learning paradigm, to identify the importance of dimensional pieces of information, evaluating their contributions to decision-making and auxiliary tasks. Then, we implement an importance-based heuristic for selective information masking and sharing. This strategy optimizes the efficiency of masked state modeling and the rationale behind information sharing. We evaluate M2I2 across diverse multi-agent tasks, the results demonstrate its superior performance, efficiency, and generalization capabilities, over existing state-of-the-art methods in various complex scenarios.
Chuxiong Sun, Qirui Ji, Zehua Zang, Jiangmeng Li, Rui Wang 0079, Wei Wang 0353
AAAI4
2026 Visual reinforcement learning via sequential consistency preserved policy contrast from optimal transport view
Zehua Zang, Jiangmeng Li, Chuxiong Sun, Rui Wang 0079, Fuchun Sun 0001
Neural Networks1
2025 Mastering Visual Reinforcement Learning via Positive Unlabeled Policy-Guided Contrast
Zehua Zang, Qirui Ji, Rui Wang 0079, Kai Li 0047, Fuchun Sun 0001
ICIC (12)1
2025 A Game of Finding Delicate Data Augmentations: Reinforcement Contrastive Learning of Visual Representations
Zehua Zang, Rui Wang 0079, Fuchun Sun 0001
ICIC (12)1
2025 RBDN: A Robust Background Denoising Network for Weakly Supervised Temporal Language Grounding
abstract
Temporal Language Grounding (TLG) with weak supervision aims to retrieve events in untrimmed videos corresponding to text queries using only video-text pairs as annotations. However, noisy background semantics in videos lead to inconsistencies in cross-modal alignment, which further hinder the grounding of query events. To address this, we introduce a Robust Background Denoising Network (RBDN), which refines backgrounds and mitigates their negative impact on events. RBDN leverages robust PCA and Frequency Augmentation techniques to filter out spatially static and temporally regular background information, thereby denoising the undesired gradient influence. Extensive experiments on well-known datasets, such as Charades-Sta and ActivityNet-Captions, demonstrate that our approach significantly outperforms current benchmarks.
Zehua Zang, Hongzhou Wu, Jiangmeng Li
ICME2
2025 Loss of Plasticity: A New Perspective on Solving Multi-Agent Exploration for Sparse Reward Tasks
Zehua Zang, Chuxiong Sun, Fuchun Sun 0001, Changwen Zheng
AAMAS1
2025 Rethinking Generalizability and Discriminability of Self-Supervised Learning from Evolutionary Game Theory Perspective
Jiangmeng Li, Zehua Zang, Qirui Ji, Chuxiong Sun, Wenwen Qiang, Junge Zhang, Changwen Zheng, Fuchun Sun 0001, Hui Xiong 0001
Int. J. Comput. Vis.2
2024 T2MAC: Targeted and Trusted Multi-Agent Communication through Selective Engagement and Evidence-Driven Integration
abstract
Communication stands as a potent mechanism to harmonize the behaviors of multiple agents. However, existing work primarily concentrates on broadcast communication, which not only lacks practicality, but also leads to information redundancy. This surplus, one-fits-all information could adversely impact the communication efficiency. Furthermore, existing works often resort to basic mechanisms to integrate observed and received information, impairing the learning process. To tackle these difficulties, we propose Targeted and Trusted Multi-Agent Communication (T2MAC), a straightforward yet effective method that enables agents to learn selective engagement and evidence-driven integration. With T2MAC, agents have the capability to craft individualized messages, pinpoint ideal communication windows, and engage with reliable partners, thereby refining communication efficiency. Following the reception of messages, the agents integrate information observed and received from different sources at an evidence level. This process enables agents to collectively use evidence garnered from multiple perspectives, fostering trusted and cooperative behaviors. We evaluate our method on a diverse set of cooperative multi-agent tasks, with varying difficulties, involving different scales and ranging from Hallway, MPE to SMAC. The experiments indicate that the proposed model not only surpasses the state-of-the-art methods in terms of cooperative performance and communication efficiency, but also exhibits impressive generalization.
Chuxiong Sun, Zehua Zang, Jiangmeng Li, Rui Wang 0079, Changwen Zheng
AAAI2
2024 Unsupervised social event detection via hybrid graph contrastive learning and reinforced incremental clustering
abstract
Detecting events from social media data streams is gradually attracting researchers. The innate challenge for detecting events is to extract discriminative information from social media data thereby assigning the data into different events. Due to the excessive diversity and high updating frequency of social data, using supervised approaches to detect events from social messages is hardly achieved. To this end, recent works explore learning discriminative information from social messages by leveraging graph contrastive learning (GCL) and embedding clustering in an unsupervised manner. However, two intrinsic issues exist in benchmark methods: conventional GCL can only roughly explore partial attributes, thereby insufficiently learning the discriminative information of social messages; for benchmark methods, the learned embeddings are clustered in the latent space by taking advantage of certain specific prior knowledge , which conflicts with the principle of unsupervised learning paradigm . In this paper, we propose a novel unsupervised social media event detection method via hybrid graph contrastive learning and reinforced incremental clustering (HCRC), which uses hybrid graph contrastive learning to comprehensively learn semantic and structural discriminative information from social messages and reinforced incremental clustering to perform efficient clustering in a solidly unsupervised manner. We conduct comprehensive experiments to evaluate HCRC on the Twitter and Maven datasets. The experimental results demonstrate that our approach yields consistent significant performance boosts. In traditional incremental setting, semi-supervised incremental setting and solidly unsupervised setting, the model performance has achieved maximum improvements of 53%, 45%, and 37%, respectively.
Zehua Zang, Hang Gao 0004, Rui Wang 0086, Jiangmeng Li
Knowl. Based Syst.2