Papers by Yucheng Wang

20 papers
Visual In-Context Learning for Large Vision-Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Existing approaches to improve the performance of Large Visual Language Models (LVLMs) are limited by cross-modal interactions and representation disparities.
Approach: They propose a Visual In-Context Learning method that retrieves images via a 'Retrieval & Rerank' paradigm and summarises images with task intent and task-specific visual parsing to compose language-based demonstrations that reduce token count.
Outcome: The proposed method reduces token count and alleviates cross-modal interaction problem on visual reasoning datasets.
Compatibility-Aware Dynamic Fine-Tuning for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Recent work attributes optimization instability to the low probability of demonstrations being incompatible with the sample level.
Approach: They propose a Dynamic Fine-Tuning extension of DFT that controls sample-level optimization variance.
Outcome: The proposed model can generalize token-level stabilization to the sample level while remaining fully supervised and free of reward modeling.
ORANGE: Text-video Retrieval via Watch-time-aware Heterogeneous Graph Contrastive Learning (2023.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for text-video retrieval focus on informative representations and delicate matching mechanisms, but real-world scenarios often involve brief, ambiguous queries and low-quality videos.
Approach: They propose a novel method to learn informative embeddings for queries and videos . they use a watch-time-aware contrastive learning paradigm to capture dependencies .
Outcome: The proposed method is effective in a real-world video-search service.
Metaphor Detection via Explicit Basic Meanings Modelling (2023.acl-short)

Copied to clipboard

Challenge: Existing methods for metaphor detection use the aggregated meaning of a word to approximate its basic meaning.
Approach: They propose a method which models the basic meaning of a word based on literal annotations and compares this with the contextual meaning in a target sentence to identify metaphors.
Outcome: The proposed method outperforms the state-of-the-art method significantly in the F1 score and even reaches the theoretical upper bound on the VUA18 benchmark.
Discontinuous Named Entity Recognition as Maximal Clique Discovery (2021.acl-long)

Copied to clipboard

Challenge: Existing methods for named entity recognition break the recognition process into several sequential steps.
Approach: They propose a method that breaks the recognition process into several sequential steps . they construct a segment graph for each sentence and a grid tagging scheme to learn it .
Outcome: Experiments show that the proposed method outperforms the state-of-the-art model and achieves 5x speedup over the SOTA model.
LADR: Locality-Aware Dynamic Rescue for Efficient Text-to-Image Generation with Diffusion Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for inference are expensive and lack spatial redundancy . Discrete Diffusion Language Models are a promising paradigm for multimodal generation .
Approach: They propose a locality-aware dynamic rescue method that exploits spatial Markov property of images.
Outcome: The proposed method achieves an approximate 4 speedup over baselines on four text-to-image generation benchmarks.
COPNER: Contrastive Learning with Prompt Guiding for Few-shot Named Entity Recognition (2022.coling-1)

Copied to clipboard

Challenge: Existing methods for Named Entity Recognition (NER) use a similarity metric to measure semantic similarity between test samples and referents, but their performance is limited due to the label scarcity.
Approach: They propose a novel approach to learn a similarity metric for measuring the semantic similarity between test samples and referents, where each referent represents an entity class.
Outcome: The proposed approach outperforms state-of-the-art models with a significant margin in most cases.
Don’t Miss the Potential Customers! Retrieving Similar Ads to Improve User Targeting (2021.findings-emnlp)

Copied to clipboard

Challenge: a method for user targeting is developed to identify online users to whom an ad should be targeted.
Approach: They propose a method for automatic augmentation of positive and negative clickthrough data for user targeting models.
Outcome: The proposed method can increase positive and negative instances of positive training instances on two datasets.
NoteChat: A Dataset of Synthetic Patient-Physician Conversations Conditioned on Clinical Notes (2024.findings-acl)

Copied to clipboard

Challenge: NoteChat is a cooperative multi-agent framework for generating patient-physician dialogues . evaluator finds it outperforms state-of-the-art models for generating clinical notes . clinical documentation is largely done by physicians at both steps .
Approach: They propose a cooperative multi-agent framework leveraging Large Language Models to generate patient-physician dialogues.
Outcome: The proposed framework outperforms state-of-the-art models for generating clinical notes . it can engage patients directly and help clinical documentation, a leading cause of physician burnout .
Reinforced Informativeness Optimization for Long-Form Retrieval-Augmented Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing reinforcement learning systems lack verifiable reward mechanisms for long-form question answering . current systems lack reliable long-term answers due to lack of factual content .
Approach: They propose a framework for reinforced verifiable informativeness optimization . it defines informativeness as measurable and externally verifier objective for RL .
Outcome: Experiments show that RioRAG achieves higher factual recall and faithfulness . the proposed framework is based on a framework that uses nugget-centric verification with cross-source checks .
TRUE-UIE: Two Universal Relations Unify Information Extraction Tasks (2024.naacl-long)

Copied to clipboard

Challenge: Information extraction (IE) tasks have a variety of schemas and objectives that differ across tasks.
Approach: They propose a paradigm where all IE tasks are aligned to learn the same goals . they use two universal relations to extract mention spans and type recognition .
Outcome: The proposed model achieves state-of-the-art on established benchmarks spanning 16 datasets, spanning 7 diverse IE tasks.
DREAM: Disentangling Risks to Enhance Safety Alignment in Multimodal Large Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) pose unique safety challenges due to their integration of visual and textual data.
Approach: They propose a method to disentangle risks through step-by-step reasoning within multimodal inputs.
Outcome: The proposed approach improves safety alignment in MLLMs by fine-tuning and iterative Reinforcement Learning from AI feedback.
Maximal Clique Based Non-Autoregressive Open Information Extraction (2021.emnlp-main)

Copied to clipboard

Challenge: Open Information Extraction (OpenIE) aims to discover textual facts from a given sentence.
Approach: They propose a non-autoregressive framework that generates a fact graph and a graph with an edge linking two nodes that belong to the same fact.
Outcome: The proposed framework outperforms current state-of-the-art methods on two benchmark datasets and significantly outperformed the existing ones.
From Knowing to Teaching: Scaffolding Pedagogical Decisions for LLM Agent (2026.acl-long)

Copied to clipboard

Challenge: Large language models produce content lacking pedagogical depth when asked to generate lessons .
Approach: They propose a framework that allows teachers to select content according to pedagogical intent and sequence topics so foundations precede applications.
Outcome: The framework achieves 67.8% win rate in human evaluation and 79.6% in LLM-based evaluation against eight baselines.
Metaphor Detection with Effective Context Denoising (2023.eacl-main)

Copied to clipboard

Challenge: Existing models focus on semantically relevant information and provide a target-oriented parse tree structure for metaphor detection.
Approach: They propose a new model which introduces a target-oriented parse tree structure for metaphor detection.
Outcome: The proposed model achieves state-of-the-art on several main metaphor datasets and compares with other methods.
FrameBERT: Conceptual Metaphor Detection with Frame Embedding Learning (2023.eacl-main)

Copied to clipboard

Challenge: Existing models for concept-level metaphor detection lack explicit knowledge of FrameNet . Metaphor detection is a pervasive linguistic device that is used in cognitive and communicative functions of language.
Approach: They propose a BERT-based model that explicitly learns FrameNet Embeddings for metaphor detection.
Outcome: The proposed model is more explainable and interpretable than existing models.
Rewarding the Rare: Uniqueness-Aware RL for Creative Problem Solving in LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning (RL) is a paradigm for post-training large language models, but it suffers from exploration collapse . a new study finds that RL fails to reward correct solutions that exhibit rare high-level strategies .
Approach: They propose a method that rewards correct solutions that exhibit rare high-level strategies by clustering rollouts according to their high- level solution strategies.
Outcome: The proposed approach improves pass@k across large sampling budgets and increases area under the pass@K curve (AUC@K) without sacrificing pass@1.
Automatic Essay Scoring Incorporating Rating Schema via Reinforcement Learning (D18-1)

Copied to clipboard

Challenge: Existing systems for automatic essay scoring are trained to predict the score of each essay at a time without considering rating schema.
Approach: They propose a reinforcement learning framework that incorporates quadratic weighted kappa as guidance to optimize the scoring system.
Outcome: Experiments on benchmark datasets show the proposed framework is effective.
TPLinker: Single-stage Joint Extraction of Entities and Relations Through Token Pair Linking (2020.coling-main)

Copied to clipboard

Challenge: Existing methods to extract entities and relations from unstructured text are susceptible to cascading errors due to the separation of entity detection and relation classification.
Approach: They propose a one-stage joint extraction model that detects overlapping relations while being immune from exposure bias.
Outcome: The proposed model can identify overlapping relations while being immune from exposure bias.
Crab: A Novel Configurable Role-Playing LLM with Assessing Benchmark (2025.acl-long)

Copied to clipboard

Challenge: Existing RP-LLMs employ only a single role with numerous dialogues, but Crab enables dynamic configuration of desired roles, thereby enhancing related flexibility and adaptability.
Approach: They propose a Configurable Role-Playing LLM with Assessing Benchmark that combines a Role dataset curation, persona-emodying Llm construction, and comprehensive benchmark creation for RP dialogue generation.
Outcome: The proposed model outperforms existing LLMs in performing fine-grained evaluations of RP while keeping dialogue per role minimal.

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