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

Nuwa Xi

dblp:329/4672 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
7since 2021 · last 2025
0009-0004-4813-0821ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 1 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Artificial intelligence
3 papers
Language models and text generation · 64% Representation and self-supervised learning · 28% Transfer learning and domain adaptation · 8%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning
0.812024
Manifold-Based Verbalizer Space Re-embedding for Tuning-Free Prompt-Based Classification · AAAI 2024
Natural language and speech › Language models and text generation › prompting
prompt-based classification
0.812024
Manifold-Based Verbalizer Space Re-embedding for Tuning-Free Prompt-Based Classification · AAAI 2024
Natural language and speech › Language models and text generation
prompting
0.812024
From Artificially Real to Real: Leveraging Pseudo Data from Large Language Models for Low-Resource Molecule Discovery · AAAI 2024
Bioinformatics and computational biology
molecule discovery
0.812024
From Artificially Real to Real: Leveraging Pseudo Data from Large Language Models for Low-Resource Molecule Discovery · AAAI 2024
Bioinformatics and computational biology › neuroscience › neuroinformatics
brain decoding
0.712023
UniCoRN: Unified Cognitive Signal ReconstructioN bridging cognitive signals and human language · ACL (1) 2023
Bioinformatics and computational biology › neuroscience › neuroinformatics › brain decoding
fMRI-to-text decoding
0.712023
UniCoRN: Unified Cognitive Signal ReconstructioN bridging cognitive signals and human language · ACL (1) 2023
Bioinformatics and computational biology › neuroscience
neuroinformatics
0.712023
UniCoRN: Unified Cognitive Signal ReconstructioN bridging cognitive signals and human language · ACL (1) 2023
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.212024
From Artificially Real to Real: Leveraging Pseudo Data from Large Language Models for Low-Resource Molecule Discovery · AAAI 2024

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

retrieval-based prompting · 1.5pseudo data generation · 1.5large language model · 1.5unified encoder for fMRI and EEG · 1.3pre-trained language model decoder · 1.3locally linear embedding · 0.8intra-class neighborhood constraint · 0.8
YearPublicationVenuePosition
2025 LLMs May Perform MCQA by Selecting the Least Incorrect Option
abstract
In the field of NLP, Large Language Models (LLMs) have markedly enhanced performance across a variety of tasks. However, the comprehensive evaluation of LLMs remains an inevitable challenge for the community. Recently, the adoption of Multiple Choice Question Answering (MCQA) as a benchmark for assessing LLMs has gained considerable traction. However, concerns regarding the robustness of this evaluative method persist. Building upon previous discussions on the issue of variability, we reveal an additional dimension of concern: LLMs may perform MCQA by selecting the least incorrect option rather than distinctly correct. This observation suggests that LLMs might regard multiple options as correct, which could undermine the reliability of MCQA as a metric for evaluating LLMs. To address this challenge, we introduce an enhanced dataset augmentation method for MCQA, termed MCQA+, to provide a more accurate reflection of the performance, thereby highlighting the necessity for more sophisticated evaluation mechanisms in the assessment of LLM capabilities.
Haochun Wang, Sendong Zhao, Zewen Qiang, Nuwa Xi, Bing Qin 0001, Ting Liu 0001
COLING4
2025 Knowledge-tuning Large Language Models with Structured Medical Knowledge Bases for Trustworthy Response Generation in Chinese
abstract
Large Language Models (LLMs) have demonstrated remarkable success in diverse natural language processing (NLP) tasks in general domains. However, LLMs sometimes generate responses with the hallucination about medical facts due to limited domain knowledge. Such shortcomings pose potential risks in the utilization of LLMs within medical contexts. To address this challenge, we propose knowledge-tuning, which leverages structured medical knowledge bases for the LLMs to grasp domain knowledge efficiently and facilitate trustworthy response generation. We also release cMedKnowQA, a Chinese medical knowledge question-answering dataset constructed from medical knowledge bases to assess the medical knowledge proficiency of LLMs. Experimental results show that the LLMs which are knowledge-tuned with cMedKnowQA can exhibit higher levels of accuracy in response generation compared with vanilla instruction-tuning and offer a new trustworthy way for the domain adaptation of LLMs. We release our code and data at https://github.com/SCIR-HI/Huatuo-Llama-Med-Chinese .
Haochun Wang, Sendong Zhao, Zewen Qiang, Zijian Li 0020, Chi Liu 0003, Nuwa Xi, Yanrui Du, Bing Qin 0001, Ting Liu 0001
ACM Trans. Knowl. Discov. Data6
2024 From Artificially Real to Real: Leveraging Pseudo Data from Large Language Models for Low-Resource Molecule Discovery
abstract
Molecule discovery serves as a cornerstone in numerous scientific domains, fueling the development of new materials and innovative drug designs. Recent developments of in-silico molecule discovery have highlighted the promising results of cross-modal techniques, which bridge molecular structures with their descriptive annotations. However, these cross-modal methods frequently encounter the issue of data scarcity, hampering their performance and application. In this paper, we address the low-resource challenge by utilizing artificially-real data generated by Large Language Models (LLMs). We first introduce a retrieval-based prompting strategy to construct high-quality pseudo data, then explore the optimal method to effectively leverage this pseudo data. Experiments show that using pseudo data for domain adaptation outperforms all existing methods, while also requiring a smaller model scale, reduced data size and lower training cost, highlighting its efficiency. Furthermore, our method shows a sustained improvement as the volume of pseudo data increases, revealing the great potential of pseudo data in advancing low-resource cross-modal molecule discovery.
Yuhan Chen 0002, Nuwa Xi, Yanrui Du, Haochun Wang, Sendong Zhao, Bing Qin 0001
AAAI2
2024 Manifold-Based Verbalizer Space Re-embedding for Tuning-Free Prompt-Based Classification
abstract
Prompt-based classification adapts tasks to a cloze question format utilizing the [MASK] token and the filled tokens are then mapped to labels through pre-defined verbalizers. Recent studies have explored the use of verbalizer embeddings to reduce labor in this process. However, all existing studies require a tuning process for either the pre-trained models or additional trainable embeddings. Meanwhile, the distance between high-dimensional verbalizer embeddings should not be measured by Euclidean distance due to the potential for non-linear manifolds in the representation space. In this study, we propose a tuning-free manifold-based space re-embedding method called Locally Linear Embedding with Intra-class Neighborhood Constraint (LLE-INC) for verbalizer embeddings, which preserves local properties within the same class as guidance for classification. Experimental results indicate that even without tuning any parameters, our LLE-INC is on par with automated verbalizers with parameter tuning. And with the parameter updating, our approach further enhances prompt-based tuning by up to 3.2%. Furthermore, experiments with the LLaMA-7B&13B indicate that LLE-INC is an efficient tuning-free classification approach for the hyper-scale language models.
Haochun Wang, Sendong Zhao, Chi Liu 0003, Nuwa Xi, Muzhen Cai, Bing Qin 0001, Ting Liu 0001
AAAI4
2023 UniCoRN: Unified Cognitive Signal ReconstructioN bridging cognitive signals and human language
abstract
Decoding text stimuli from cognitive signals (e.g.fMRI) enhances our understanding of the human language system, paving the way for building versatile Brain-Computer Interface.However, existing studies largely focus on decoding individual word-level fMRI volumes from a restricted vocabulary, which is far too idealized for real-world application.In this paper, we propose fMRI2text, the first openvocabulary task aiming to bridge fMRI time series and human language.Furthermore, to explore the potential of this new task, we present a baseline solution, UniCoRN: the Unified Cognitive Signal ReconstructioN for Brain Decoding.By reconstructing both individual time points and time series, UniCoRN establishes a robust encoder for cognitive signals (fMRI & EEG).Leveraging a pre-trained language model as decoder, UniCoRN proves its efficacy in decoding coherent text from fMRI series across various split settings.Our model achieves a 34.77%BLEU score on fMRI2text, and a 37.04% BLEU when generalized to EEGto-text decoding, thereby surpassing the former baseline.Experimental results indicate the feasibility of decoding consecutive fMRI volumes, and the effectiveness of decoding different cognitive signals using a unified structure.
Nuwa Xi, Sendong Zhao, Haochun Wang, Chi Liu 0003, Bing Qin 0001, Ting Liu 0001
ACL (1)1
2023 Global Prompt Cell: A Portable Control Module for Effective Prompt Tuning
Chi Liu 0003, Haochun Wang, Nuwa Xi, Sendong Zhao, Bing Qin 0001
NLPCC (1)3
2022 Prompt Combines Paraphrase: Teaching Pre-trained Models to Understand Rare Biomedical Words
abstract
Prompt-based fine-tuning for pre-trained models has proven effective for many natural language processing tasks under few-shot settings in general domain. However, tuning with prompt in biomedical domain has not been investigated thoroughly. Biomedical words are often rare in general domain, but quite ubiquitous in biomedical contexts, which dramatically deteriorates the performance of pre-trained models on downstream biomedical applications even after fine-tuning, especially in low-resource scenarios. We propose a simple yet effective approach to helping models learn rare biomedical words during tuning with prompt. Experimental results show that our method can achieve up to 6% improvement in biomedical natural language inference task without any extra parameters or training steps using few-shot vanilla prompt settings.
Haochun Wang, Chi Liu 0003, Nuwa Xi, Sendong Zhao, Meizhi Ju, Yefeng Zheng 0001, Bing Qin 0001, Ting Liu 0001
COLING3