Papers by Yongxin Wang

18 papers
TC–RAG: Turing–Complete RAG’s Case study on Medical LLM Systems (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to RAG neglect system state variables, resulting in poor performance and erroneous knowledge accumulation.
Approach: They propose a framework that incorporates a Turing Complete System to manage state variables and manage retrieval halting.
Outcome: The proposed framework improves on seven real-world healthcare datasets and shows that it is more accurate than existing methods.
Data Interpreter: An LLM Agent for Data Science (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) excel in various domains but face challenges when applied to data science workflows due to their complex, multi-stage nature.
Approach: They propose a hierarchical graph-based agent that represents complexity and a progressive strategy for step-by-step verification, refinement, and consistent context management.
Outcome: The proposed agent surpasses state-of-the-art baselines on the MATH dataset and performs better on InfiAgent-DABench.
3DS: Medical Domain Adaptation of LLMs via Decomposed Difficulty-based Data Selection (2025.emnlp-main)

Copied to clipboard

Challenge: Effective domain adaptation typically involves supervised fine-tuning on carefully selected instruction-tuned data.
Approach: They propose a model-centric data selection framework that aligns data selection with the model’s knowledge distribution to improve model performance.
Outcome: The proposed framework outperforms existing methods by up to 2.97% accuracy in the healthcare domain.
HyKGE: A Hypothesis Knowledge Graph Enhanced RAG Framework for Accurate and Reliable Medical LLMs Responses (2025.acl-long)

Copied to clipboard

Challenge: Recent approaches suffer from insufficient and repetitive knowledge retrieval, tedious and time-consuming query parsing, and monotonous knowledge utilization.
Approach: They propose a retrieval-augmented generation framework which leverages LLMs’ powerful reasoning capacity to compensate for the incompleteness of user queries.
Outcome: The proposed framework improves the accuracy and reliability of Large Language Models (LLMs) by combining the rich knowledge of LLMs with Hypothesis Outputs.
R2IF: Aligning Reasoning with Decisions via Composite Rewards for Interpretable LLM Function Calling (2026.acl-long)

Copied to clipboard

Challenge: Existing RL-based approaches to function calling are misaligned between reasoning processes and tool-call decisions.
Approach: They propose a reasoning-aware RL framework for interpretable function calling . they integrate a composite reward integrating format/correctness constraints, CER, and SMV .
Outcome: Experiments on BFCL/ACEBench show R2IF outperforms baselines by 34.62% with positive Average CoT Effectiveness.
ITAKE: Interactive Unstructured Text Annotation and Knowledge Extraction System with LLMs and ModelOps (2024.acl-demos)

Copied to clipboard

Challenge: Unstructured text data contains a large amount of valuable knowledge, but there are many tools that do not meet the needs of actual business.
Approach: They propose an unstructured text annotation and knowledge extraction system that integrates Large Language Models and ModelOps to improve model supervision and performance.
Outcome: The proposed system integrates large language models and ModelOps to improve performance in low-resource contexts.
SOLAR: Serendipity Optimized Language Model Aligned for Recommendation (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models have shown strong potential in recommendation tasks . however, their application to serendipity-oriented recommendations remains challenging .
Approach: They propose a domain-adaptive instruction tuning method that aligns Large Language Models with recommendation tasks.
Outcome: The proposed framework bridges the domain gap between LLMs and recommendation tasks.
MTAG: Modal-Temporal Attention Graph for Unaligned Human Multimodal Language Sequences (2021.naacl-main)

Copied to clipboard

Challenge: a novel graph-based neural model for multimodal sequential data is proposed . fusion is the process of blending information from multiple modalities, usually preceded by alignment .
Approach: They propose a graph-based neural model that converts unaligned data into a modal-temporal graph . they use a dynamic pruning and read-out technique to efficiently process the graph fusion operation .
Outcome: The proposed model performs state-of-the-art on multimodal sentiment analysis and emotion recognition benchmarks while utilizing significantly fewer model parameters.
Recurrent Knowledge Identification and Fusion for Language Model Continual Learning (2025.acl-long)

Copied to clipboard

Challenge: Continual learning (CL) is crucial for large language models without costly retraining.
Approach: They propose a framework for recurrent knowledge identification and fusion that enables dynamic estimation of parameter importance distributions to enhance knowledge transfer.
Outcome: The proposed framework mitigates catastrophic forgetting and enhances knowledge transfer.
Improving Semantic Matching through Dependency-Enhanced Pre-trained Model with Adaptive Fusion (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing work on dependency prior structure integration into pre-trained models is still unclear.
Approach: They propose a dependency-based fusion attention paradigm which explicitly introduces dependency prior structure into pre-trained models and adaptively fuses it with semantic information.
Outcome: The proposed model achieves state-of-the-art or competitive performance on 10 public datasets, demonstrating the benefits of adaptively fusing dependency structure in semantic matching task.
Parenting: Optimizing Knowledge Selection of Retrieval-Augmented Language Models with Parameter Decoupling and Tailored Tuning (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for integrating internal and external knowledge lack effective control mechanisms for generating hallucinations and dealing with outdated knowledge.
Approach: They propose a framework that decouples, identifies, and purposefully optimizes parameter subspaces related to adherence and robustness.
Outcome: The proposed framework decouples, identifies, and purposefully optimizes parameter subspaces related to adherence and robustness.
AutoSUIT Bench - Automated Security UnIt Test Benchmark for LLM Coding (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are evolving rapidly on code generation tasks.
Approach: They propose to automate the vulnerability code benchmark creation with iterative auto validation.
Outcome: The proposed benchmark covers 232 CWE categories across C/C++, Java, and Python languages.
Modular Sentence Encoders: Separating Language Specialization from Cross-Lingual Alignment (2025.acl-long)

Copied to clipboard

Challenge: Multilingual sentence encoders are often trained to map sentences from different languages into a shared semantic vector space . cross-lingual alignment training distorts optimal monolingual structure of semantic spaces of individual languages . a modular solution can be used for cross-linguistic tasks such as cross-language semantic similarity and zero-shot transfer .
Approach: They propose a modular training system that embeds sentences from different languages into a shared semantic vector space.
Outcome: The proposed solution achieves better performance across all tasks compared to monolithic models.
Adaptive Prompt Structure Factorization: A Framework for Self-Discovering and Optimizing Compositional Prompt Programs (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) exhibit strong capabilities in reasoning, coding, and complex generation, yet their performance is highly sensitive to prompt design.
Approach: They propose an API-only framework that decomposes a single prompt into semantic factors and updates selected factors while freezing the rest.
Outcome: The proposed framework outperforms strong baselines, improves accuracy by up to +4.29 percentage points on average, and reduces optimization cost by 45–87% tokens on MultiArith while reaching peak validation in 1 step.
DFAMS: Dynamic-flow guided Federated Alignment based Multi-prototype Search (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for ambiguous queries struggle to retrieve high-quality documents . DFAMS outperforms advanced FR methods by 14.37% in knowledge classification accuracy .
Approach: They propose a framework that leverages dynamic information flow to identify latent query intents and construct semantically aligned knowledge partitions for accurate retrieval across heterogeneous sources.
Outcome: The proposed framework outperforms existing methods in classification accuracy and retrieval recall tests.
GeoEdit: Geometric Knowledge Editing for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing training-based model editing methods struggle to incorporate new knowledge while preserving unrelated general knowledge.
Approach: They propose a framework that uses geometric relationships to differentiate between neurons associated with new knowledge updates and those related to general knowledge perturbations.
Outcome: The proposed framework avoids updating neurons with directions approximately orthogonal to existing knowledge, thus preserving the model’s generalization ability.
TextFlint: Unified Multilingual Robustness Evaluation Toolkit for Natural Language Processing (2021.acl-demo)

Copied to clipboard

Challenge: Existing approaches to textual robustness evaluation focus on slightly modifying the input data, which maintains the original meaning and results in a different prediction.
Approach: They propose a multilingual robustness evaluation toolkit for NLP that integrates universal text transformations, task-specific transformations and adversarial attack.
Outcome: The toolkit includes universal text transformation, task-specific transformation, adversarial attack, subpopulation, and their combinations to provide comprehensive robustness analyses.
AdaSent: Efficient Domain-Adapted Sentence Embeddings for Few-Shot Classification (2023.emnlp-main)

Copied to clipboard

Challenge: Recent work has found that few-shot sentence classification based on pre-trained Sentence Encoders (SEs) is efficient, robust, and effective.
Approach: They propose a domain-specialization approach that decouples SEPT from DAPT by training a SEPT adapter on a pre-trained PLM.
Outcome: The proposed approach matches or surpasses the performance of full SEPT on DAPT-ed PLMs while significantly reducing training costs.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations