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

Yongxuan Wu

dblp:392/6271 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0002-1622-5434ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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
3 papers
Representation and self-supervised learning · 30% Reinforcement learning · 17% Language models and text generation · 17%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model
1.012026
CIA: Inferring the Communication Topology from LLM-based Multi-Agent Systems · ACL (1) 2026
Knowledge, reasoning and agents › Multi-agent systems
LLM-based multi-agent systems
1.012026
CIA: Inferring the Communication Topology from LLM-based Multi-Agent Systems · ACL (1) 2026
Machine learning › Reinforcement learning › multi-agent reinforcement learning
multi-agent communication
1.012026
CIA: Inferring the Communication Topology from LLM-based Multi-Agent Systems · ACL (1) 2026
Machine learning › Representation and self-supervised learning
contrastive learning
0.912025
Contrastive Modality-Disentangled Learning for Multimodal Recommendation · ACM Trans. Inf. Syst. 2025
Machine learning › Trustworthy machine learning
fairness
0.912025
FairCDR: Transferring Fairness and User Preferences for Cross-Domain Recommendation · KDD (2) 2025
Machine learning › Representation and self-supervised learning › representation learning › disentangled representation learning
modality disentanglement
0.912025
Contrastive Modality-Disentangled Learning for Multimodal Recommendation · ACM Trans. Inf. Syst. 2025
Recommender systems
cross-domain recommendation
0.912025
FairCDR: Transferring Fairness and User Preferences for Cross-Domain Recommendation · KDD (2) 2025
Recommender systems
multimodal recommendation
0.912025
Contrastive Modality-Disentangled Learning for Multimodal Recommendation · ACM Trans. Inf. Syst. 2025
Machine learning › Graph learning
graph structure learning
0.312026
CIA: Inferring the Communication Topology from LLM-based Multi-Agent Systems · ACL (1) 2026
Recommender systems › user modeling
user preference modeling
0.312025
Contrastive Modality-Disentangled Learning for Multimodal Recommendation · ACM Trans. Inf. Syst. 2025

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

mutual learning · 1.7mutual information estimation · 1.7diffusion model · 1.7contrastive learning · 1.7adversarial learning · 1.7communication topology inference · 1.0
YearPublicationVenuePosition
2026 CIA: Inferring the Communication Topology from LLM-based Multi-Agent Systems
abstract
Yongxuan Wu, Xixun Lin, He Zhang, Nan Sun, Kun Wang, Chuan Zhou, Shirui Pan, Yanan Cao. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Yongxuan Wu, Xixun Lin, He Zhang 0012, Kun Wang 0056, Chuan Zhou 0001, Shirui Pan, Yanan Cao 0001
ACL (1)1
2025 FairCDR: Transferring Fairness and User Preferences for Cross-Domain Recommendation
abstract
Cross-domain recommendation (CDR) has gained significant attention for its ability to address data sparsity issue. However, most existing CDR methods focus primarily on improving recommendation accuracy while largely overlooking fairness considerations, which can lead to biased outcomes and unfair treatment of different user groups. To solve this critical problem, we investigate whether fairness can be transferred from the source domain to the target domain. Our analysis suggests that fairness can be effectively transferred if the fairness of the source domain is ensured and the distributions of the source and target domains are well aligned. Based on this, we propose the FairCDR, a novel framework that can achieve the knowledge transfer of fairness and user preferences simultaneously. FairCDR owns two phases: single-domain fairness guarantee and inter-domain distribution alignment. In the first phase, we employ an adversarial learning-based recommender (ALR) to disentangle user preferences from sensitive attributes in the source domain. In the second phase, we introduce a new mutual learning-based diffusion model (MLDiff), which engages in mutual learning with ALR to progressively align the distributions of the source and target domains. This improves ALR's adaptability to distribution shifts, ultimately ensuring fairness and recommendation performance in the target domain. Extensive experiments on multiple real-world cross-domain datasets demonstrate that FairCDR surpasses existing strong baselines in both fairness and recommendation quality.
Yongxuan Wu, Yang Aron Liu, Xixun Lin, Yanan Cao 0001, Lixin Zou, Yanmin Shang, Yanbing Liu 0007
KDD (2)1
2025 Contrastive Modality-Disentangled Learning for Multimodal Recommendation
abstract
Multimodal recommendation, which utilizes rich multimodal information to learn user preferences, has attracted significant attention. Most works focus on designing powerful encoders for extracting multimodal features, and simply aggregate the learned features together to make prediction. Consequently, they have a limited capacity to learn the inter-modality knowledge including the modality-shared and modality-unique knowledge. In fact, learning the modality-shared knowledge enables us to align cross-modality data for fusing heterogeneous modality features. Learning the modality-unique knowledge is equally important when recommendation tasks only involve a small amount of shared features and the necessary information is contained within specific modality. In this article, we propose Contrastive Modality-Disentangled Learning (CMDL) to overcome this critical limitation. CMDL exactly captures the inter-modality knowledge by achieving modality disentanglement. Specifically, CMDL first disentangles the initial representation into the modality-invariant and modality-specific representations. Afterwards, CMDL introduces a novel manner of contrastive learning to approximate the MI upper bounds for achieving disentanglement regularization. Building upon the proposed regularization, CMDL encourages the modality-invariant and modality-specific representations to capture the modality-shared and modality-unique knowledge respectively and to be statistically independent to each other. Empirically, extensive experiments are conducted on benchmark datasets, demonstrating the superior performance of CMDL compared with strong multimodal recommenders.
Xixun Lin, Rui Liu 0032, Yanan Cao 0001, Lixin Zou, Qian Li 0003, Yongxuan Wu, Yang Aron Liu, Dawei Yin 0001, Guandong Xu
ACM Trans. Inf. Syst.6
2025 A data-centric framework of improving graph neural networks for knowledge graph embedding
Yanan Cao 0001, Xixun Lin, Yongxuan Wu, Fengzhao Shi, Yanmin Shang, Qingfeng Tan, Chuan Zhou 0001, Peng Zhang 0001
World Wide Web (WWW)3