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

Yuhang Shao

dblp:297/7767 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

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 first-author · 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
Information extraction and text analysis · 46% Generative modeling · 23% Multi-agent systems · 23%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › event extraction › event argument extraction
document-level event argument extraction
1.012026
Learning to Generate and Extract: A Multi-Agent Collaboration Framework for Zero-Shot Document-Level Event Arguments Extraction · AAAI 2026
Natural language and speech › Information extraction and text analysis › event extraction
event argument extraction
1.012026
Learning to Generate and Extract: A Multi-Agent Collaboration Framework for Zero-Shot Document-Level Event Arguments Extraction · AAAI 2026
Knowledge, reasoning and agents › Multi-agent systems
multi-agent data synthesis
1.012026
Learning to Generate and Extract: A Multi-Agent Collaboration Framework for Zero-Shot Document-Level Event Arguments Extraction · AAAI 2026
Machine learning › Generative modeling
synthetic data generation
1.012026
Learning to Generate and Extract: A Multi-Agent Collaboration Framework for Zero-Shot Document-Level Event Arguments Extraction · AAAI 2026
Natural language and speech › Language models and text generation
prompting
0.312026
Learning to Generate and Extract: A Multi-Agent Collaboration Framework for Zero-Shot Document-Level Event Arguments Extraction · AAAI 2026

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

reinforcement learning · 1.0multi-agent collaboration · 1.0large language model · 1.0
YearPublicationVenuePosition
2026 Learning to Generate and Extract: A Multi-Agent Collaboration Framework for Zero-Shot Document-Level Event Arguments Extraction
abstract
Document-level event argument extraction (DEAE) is essential for knowledge acquisition, aiming to extract participants of events from documents. In the zero-shot setting, existing methods employ LLMs to generate synthetic data to address the challenge posed by the scarcity of annotated data. However, relying solely on Event-type-only prompts makes it difficult for the generated content to accurately capture the contextual and structural relationships of unseen events. Moreover, ensuring the reliability and usability of synthetic data remains a significant challenge due to the absence of quality evaluation mechanisms. To this end, we introduce a multi-agent collaboration framework for zero-shot document-level event argument extraction (ZS-DEAE), which simulates the human collaborative cognitive process of “Propose–Evaluate–Revise.” Specifically, the framework comprises a generation agent and an evaluation agent. The generation agent synthesizes data for unseen events by leveraging knowledge from seen events, while the evaluation agent extracts arguments from the synthetic data and assesses their semantic consistency with the context. The evaluation results are subsequently converted into reward signals, with event structure constraints incorporated into the reward design to enable iterative optimization of both agents via reinforcement learning. In three zero-shot scenarios constructed from the RAMS and WikiEvents datasets, our method achieves improvements both in data generation quality and argument extraction performance, while the generated data also effectively enhances the zero-shot performance of other DEAE models.
Hu Zhang 0003, Yazhou Han, Yuhang Shao, Hongye Tan, Ru Li 0001
AAAI5
2022 Privacy-Preserving and Verifiable Cloud-Aided Disease Diagnosis and Prediction With Hyperplane Decision-Based Classifier
abstract
With the vigorous development and gradual maturity of machine learning (ML) technologies, the AI-assisted disease diagnosis and prediction ($\mathcal {AADP}$) system has been extensively studied and can be expected to be intensively deployed in the real world. However, as the scale of ML data increases exponentially, the training and application of ML models impose a great burden on resource-constrained terminals. Designing cloud/edge server-aided$\mathcal {AADP}$protocols is becoming a popular topic. Whereas, the sensitivity of ML data, the intellectual property of ML models, and the uncontrollability of servers bring great security challenges to this promising computing paradigm. In this article, we initialize a new four-party framework for the$\mathcal {AADP}$system which consists of users, third-party test institution, AI doctor, and cloud/edge server. With this framework, we design two high-efficiency and secure outsourcing$\mathcal {AADP}$protocols under two different security models. By comprehensively employing secure hash functions, Householder transformations, and random permutations, we realize the following design objectives: 1) user’s actual identification is invisible to the other parties; 2) user’s feature vector is blinded to the AI doctor and the server; 3) the ML model of the AI doctor is confidential to the server; 4) AI doctor can obtain decent computational savings compared with achieving the diagnosis task by itself; and 5) AI doctor can verify the server’s misbehaviors with a nonnegligible probability under the security model with a fully malicious server. We argue these claims with rigid theoretical proofs and corroborate them with extensive experimental analysis.
Yuhang Shao, Chengliang Tian, Lidong Han, Hequn Xian, Jia Yu 0003
IEEE Internet Things J.1