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

Xu Guo 0002

dblp:46/5508-2 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
9since 2021 · last 2025
0000-0003-1034-9508ORCID · conflict

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

Artificial intelligence and machine learning · 8 · 2 first-author · 7 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
4 papers
Information extraction and text analysis · 19% Generative modeling · 19% Language models and text generation · 16%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
chain-of-thought reasoning
0.912025
SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMs · ACL (1) 2025
Machine learning › Efficient and distributed learning
inference efficiency
0.812024
RevMUX: Data Multiplexing with Reversible Adapters for Efficient LLM Batch Inference · EMNLP 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
PairCFR: Enhancing Model Training on Paired Counterfactually Augmented Data through Contrastive Learning · ACL (1) 2024
Computer vision › 3D vision
cross-modal data augmentation
0.712023
Training Multimedia Event Extraction With Generated Images and Captions · ACM Multimedia 2023
Natural language and speech › Information extraction and text analysis
event extraction
0.712023
Training Multimedia Event Extraction With Generated Images and Captions · ACM Multimedia 2023
Machine learning › Generative modeling
image generation
0.712023
Training Multimedia Event Extraction With Generated Images and Captions · ACM Multimedia 2023
Natural language and speech › Information extraction and text analysis › event extraction
multimodal event extraction
0.712023
Training Multimedia Event Extraction With Generated Images and Captions · ACM Multimedia 2023
Computer vision › Vision and language
multimodal training data
0.712023
Training Multimedia Event Extraction With Generated Images and Captions · ACM Multimedia 2023
Machine learning › Generative modeling
synthetic training data
0.712023
Training Multimedia Event Extraction With Generated Images and Captions · ACM Multimedia 2023
Medical and health informatics
clinical decision support
0.412019
Agent-based Decision Support for Pain Management in Primary Care Settings · IJCAI 2019
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.312025
SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMs · ACL (1) 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.212024
PairCFR: Enhancing Model Training on Paired Counterfactually Augmented Data through Contrastive Learning · ACL (1) 2024
Natural language and speech › Language models and text generation
large language model inference
0.212024
RevMUX: Data Multiplexing with Reversible Adapters for Efficient LLM Batch Inference · EMNLP 2024

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

speculative generation · 0.9soft thought tokens · 0.9projection module · 0.9reversible adapters · 0.8parameter-efficient fine-tuning · 0.8counterfactual augmentation · 0.8contrastive learning · 0.8stable diffusion · 0.7iterative training · 0.7BLIP · 0.7representation learning · 0.4
YearPublicationVenuePosition
2025 SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMs
abstract
Chain-of-Thought (CoT) reasoning enables Large Language Models (LLMs) to solve complex reasoning tasks by generating intermediate reasoning steps.However, most existing approaches focus on hard token decoding, which constrains reasoning within the discrete vocabulary space and may not always be optimal.While recent efforts explore continuousspace reasoning, they often require full-model fine-tuning and suffer from catastrophic forgetting, limiting their applicability to state-of-theart LLMs that already perform well in zeroshot settings with a proper instruction.To address this challenge, we propose a novel approach for continuous-space reasoning that does not require modifying the LLM.Specifically, we employ a lightweight fixed assistant model to speculatively generate instancespecific soft thought tokens as the initial chain of thoughts, which are then mapped into the LLM's representation space via a trainable projection module.Experimental results on five reasoning benchmarks demonstrate that our method enhances LLM reasoning performance through supervised, parameter-efficient fine-tuning.Source code is available at https: //github.com/xuyige/SoftCoT.
Yige Xu 0001, Xu Guo 0002, Chunyan Miao
ACL (1)2
2025 Diffusion-Guided Diversity for Single Domain Generalization in Time Series Classification
abstract
Single-domain generalization (SDG) in time series classification (TSC) poses significant challenges for current time-series domain generalization methods due to the extremely limited data available from only one source domain. In this study, we propose Segment-dErived Expansion of Domains (SEED), a diffusion-based method that effectively expands domain diversity for SDG. We reveal that individual instances exhibit intrinsic temporal shifts over time, which provides a principled foundation for creating multiple pseudo domains by segmenting each instance into distinct parts. To do so, SEED extracts two complementary representations from each time-series segment: 1) a segment-specific representation that captures diverse distributional variations, and 2) a segment-invariant representation that preserves class semantics. SEED formulates these representations as pseudo-domain prompts to guide a diffusion model in generating diverse yet semantically consistent time-series data. Additionally, SEED introduces a novel prompt-fused sampling for diffusion, enabling flexible recombination of segment-specific features to continuously expand the pseudo-domain space. We provide both theoretical analysis and extensive empirical evaluations on four widely used TSC benchmarks to validate its ability in reducing generalization error and improving model's performances in SDG. In our experiments, SEED significantly improves classification accuracy by 7.68% on average compared to the strong baselines.
Junru Zhang 0001, Lang Feng 0002, Xu Guo 0002, Han Yu 0001, Yabo Dong, Duanqing Xu
KDD (2)3
2024 PairCFR: Enhancing Model Training on Paired Counterfactually Augmented Data through Contrastive Learning
abstract
Counterfactually Augmented Data (CAD) involves creating new data samples by applying minimal yet sufficient modifications to flip the label of existing data samples to other classes.Training with CAD enhances model robustness against spurious features that happen to correlate with labels by spreading the casual relationships across different classes.Yet, recent research reveals that training with CAD may lead models to overly focus on modified features while ignoring other important contextual information, inadvertently introducing biases that may impair performance on out-ofdistribution (OOD) datasets.To mitigate this issue, we employ contrastive learning to promote global feature alignment in addition to learning counterfactual clues.We theoretically prove that contrastive loss can encourage models to leverage a broader range of features beyond those modified ones.Comprehensive experiments on two human-edited CAD datasets demonstrate that our proposed method outperforms the state-of-the-art on OOD datasets.
Xiaoqi Qiu, Xu Guo 0002, Yu Yue, Yuhong Feng, Chunyan Miao
ACL (1)3
2024 RevMUX: Data Multiplexing with Reversible Adapters for Efficient LLM Batch Inference
abstract
Large language models (LLMs) have brought a great breakthrough to the natural language processing (NLP) community, while leading the challenge of handling concurrent customer queries due to their high throughput demands.Data multiplexing addresses this by merging multiple inputs into a single composite input, allowing more efficient inference through a shared forward pass.However, as distinguishing individuals from a composite input is challenging, conventional methods typically require training the entire backbone, yet still suffer from performance degradation.In this paper, we introduce RevMUX, a parameterefficient data multiplexing framework that incorporates a reversible design in the multiplexer, which can be reused by the demultiplexer to perform reverse operations and restore individual samples for classification.Extensive experiments on four datasets and three types of LLM backbones demonstrate the effectiveness of RevMUX for enhancing LLM inference efficiency while retaining a satisfactory classification performance.
Yige Xu 0001, Xu Guo 0002, Chunyan Miao
EMNLP2
2023 GranCATs: Cross-Lingual Enhancement through Granularity-Specific Contrastive Adapters
abstract
Multilingual language models (MLLMs) have demonstrated remarkable success in various cross-lingual downstream tasks, facilitating the transfer of knowledge across numerous languages, whereas this transfer is not universally effective. Our study reveals that while existing MLLMs like mBERT can capturephrase-level alignments across the language families, they struggle to effectively capturesentence-level andparagraph-level alignments. To address this limitation, we propose GranCATs, Granularity-specific Contrastive AdapTers. We collect a new dataset that observes each sample at three distinct levels of granularity and employ contrastive learning as a pre-training task to train GranCATs on this dataset. Our objective is to enhance MLLMs' adaptation to a broader range of cross-lingual tasks by equipping them with improved capabilities to capture global information at different levels of granularity. Extensive experiments show that MLLMs with GranCATs yield significant performance advancements across various language tasks with different text granularities, including entity alignment, relation extraction, sentence classification and retrieval, and question-answering. These results validate the effectiveness of our proposed GranCATs in enhancing cross-lingual alignments across various text granularities and effectively transferring this knowledge to downstream tasks.
Meizhen Liu 0001, Jiakai He, Xu Guo 0002, Jianye Chen, Siu Cheung Hui, Fengyu Zhou 0002
CIKM3
2023 Training Multimedia Event Extraction With Generated Images and Captions
abstract
Contemporary news reporting increasingly features multimedia content, motivating research on multimedia event extraction. However, the task lacks annotated multimodal training data and artificially generated training data suffer from the distribution shift from the real-world data. In this paper, we propose Cross-modality Augmented Multimedia Event Learning (CAMEL), which successfully utilizes artificially generated multimodal training data and achieves state-of-the-art performance. Conditioned on unimodal training data, we generate multimodal training data using off-the-shelf image generators like Stable Diffusion [45] and image captioners like BLIP [24]. After that, we train the network on the resultant multimodal datasets. In order to learn robust features that are effective across domains, we devise an iterative and gradual training strategy. Substantial experiments show that CAMEL surpasses state-of-the-art (SOTA) baselines on the M2E2 benchmark. On multimedia events in particular, we outperform the prior SOTA by 4.2% F1 on event mention identification and by 9.8% F1 on argument identification, which demonstrates that CAMEL learns synergistic representations from the two modalities. Our work demonstrates a recipe to unleash the power of synthetic training data in structured prediction.
Zilin Du, Yunxin Li, Xu Guo 0002, Boyang Li 0001
ACM Multimedia3
2022 Missing Value Imputation for Diabetes Prediction
abstract
Machine learning (ML) models have been widely used to improve the accuracy and efficiency of various types of disease diagnostic tasks. However, it is still challenging to apply ML models to perform diabetes-related prediction tasks mainly because patients' health records are sparse and have a vast amount of missing values. Missing values often break the diabetes prediction pipelines, posing challenges to existing approaches. Such problem deteriorates significantly when critical attribute values (e.g., blood test results on HbAlc, FPG and OGTT2hr) are missing. In this paper, we introduce a large-scale diabetes-related dataset named Chronic Disease Management System (CDMS) dataset, which collects the clinical records of more than 700,000 visits of over 65,000 patients across eight years. CDMS is anonymously collected and has a high percentage of missing values on several critical attributes for diabetes prediction. If not being dealt with carefully, the missing values will cause significant performance degradation of the applied ML models. In this paper, we also investigate the effectiveness of multiple data imputation methods through conducting extensive experiments using CDMS. Experimental results show that k-Nearest Neighbor Imputation (KNNI) performs better than other methods in this diabetes prediction task. Specifically, with KNNI applied, the diabetes prediction accuracy and precision are both over 0.8 using various ML predictive models.
Hangwei Qian, Di Wang 0004, Xu Guo 0002, Eng Sing Lee, Hui Hwang Teong, Ray Tian Rui Lai, Chunyan Miao
IJCNN4
2022 Federated Learning for Personalized Humor Recognition
abstract
Computational understanding of humor is an important topic under creative language understanding and modeling. It can play a key role in complex human-AI interactions. The challenge here is that human perception of humorous content is highly subjective. The same joke may receive different funniness ratings from different readers. This makes it highly challenging for humor recognition models to achieve personalization in practical scenarios. Existing approaches are generally designed based on the assumption that users have a consensus on whether a given text is humorous or not. Thus, they cannot handle diverse humor preferences well. In this article, we propose the FedHumor approach for the recognition of humorous content in a personalized manner through Federated Learning (FL). Extending a pre-trained language model, FedHumor guides the fine-tuning process by considering diverse distributions of humor preferences from individuals. It incorporates a diversity adaptation strategy into the FL paradigm to train a personalized humor recognition model. To the best of our knowledge, FedHumor is the first text-based personalized humor recognition model through federated learning. Extensive experiments demonstrate the advantage of FedHumor in recognizing humorous texts compared to nine state-of-the-art humor recognition approaches with superior capability for handling the diversity in humor labels produced by users with diverse preferences.
Xu Guo 0002, Han Yu 0001, Boyang Li 0001, Hao Wang 0005, Pengwei Xing, Siwei Feng, Zaiqing Nie, Chunyan Miao
ACM Trans. Intell. Syst. Technol.1
2021 Latent-Optimized Adversarial Neural Transfer for Sarcasm Detection
abstract
The existence of multiple datasets for sarcasm detection prompts us to apply transfer learning to exploit their commonality.The adversarial neural transfer (ANT) framework utilizes multiple loss terms that encourage the source-domain and the target-domain feature distributions to be similar while optimizing for domain-specific performance.However, these objectives may be in conflict, which can lead to optimization difficulties and sometimes diminished transfer.We propose a generalized latent optimization strategy that allows different losses to accommodate each other and improves training dynamics.The proposed method outperforms transfer learning and meta-learning baselines.In particular, we achieve 10.02% absolute performance gain over the previous state of the art on the iSarcasm dataset.
Xu Guo 0002, Boyang Li 0001, Han Yu 0001, Chunyan Miao
NAACL-HLT1
2019 Agent-based Decision Support for Pain Management in Primary Care Settings
abstract
The lack of systematic pain management training and support among primary care physicians (PCPs) limits their ability to provide quality care for patients with pain. Here, we demonstrate an Agent-based Clinical Decision Support System to empower PCPs to leverage knowledge from pain specialists. The system learns a general-purpose representation space on patients, automatically diagnoses pain, recommends therapy and medicine, and suggests a referral program to PCPs in their decision-making tasks.
Xu Guo 0002, Han Yu 0001, Chunyan Miao, Yiqiang Chen 0001
IJCAI1