Papers by Yuchen Li

58 papers
Tree-of-Evolution: Tree-Structured Instruction Evolution for Code Generation in Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Data synthesis is a key research area in large language models (LLMs).
Approach: They propose a framework that models code instruction synthesis process with a tree structure and optimization-driven evolution to alleviate constraints of unidirectional synthesis and randomness-driven generation.
Outcome: The proposed framework outperforms open-weight code LLMs on five widely-used benchmarks.
Graph-GRPO: Stabilizing Multi-Agent Topology Learning via Group Relative Policy Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Recent approaches to optimize communication topology rely on single-sample policy gradients with absolute rewards.
Approach: They propose a topology optimization framework that integrates Group Relative Policy Optimization.
Outcome: The proposed topology optimization framework outperforms state-of-the-art methods on reasoning and code generation benchmarks.
Reason-KE++: Aligning the Process, Not Just the Outcome, for Faithful LLM Knowledge Editing (2026.findings-acl)

Copied to clipboard

Challenge: Current methods for modifying parameters to integrate new knowledge are not accurate enough.
Approach: They propose an SFT+RL framework that instills process-level faithfulness by a stage-aware Reward mechanism and a Stage-assisted Reward Mechanism.
Outcome: The proposed framework instills process-level faithfulness while boosting final accuracy.
RippleCOT: Amplifying Ripple Effect of Knowledge Editing in Language Models via Chain-of-Thought In-Context Learning (2024.findings-emnlp)

Copied to clipboard

Challenge: et al., 2022: ripple effect challenges knowledge editing for large language models.
Approach: They propose a method to improve the accuracy of large language models by integrating Chain-of-Thought reasoning into the ICL editing approach.
Outcome: RIPPLE-COT outperforms the state-of-the-art on the ripple effect, with gains ranging from 7.8% to 87.1%.
Token Prepending: A Training-Free Approach for Eliciting Better Sentence Embeddings from LLMs (2025.acl-long)

Copied to clipboard

Challenge: Recent studies have focused on prompt engineering to extract sentence embeddings from large language models (LLMs) but these models are mostly decoder-only and the earlier tokens in the sentence cannot attend to the latter, resulting in biased encoding of sentence information and cascading effects on the final decoded token.
Approach: They propose a plug-and-play and training-free technique that prepends each layer’s decoded sentence embedding to the beginning of the sentence in the next layer’ s input.
Outcome: The proposed technique can significantly improve the performance of existing prompt-based sentence embedding methods across different LLMs while incurring negligible additional inference cost.
Gentopia.AI: A Collaborative Platform for Tool-Augmented LLMs (2023.emnlp-demo)

Copied to clipboard

Challenge: Existing frameworks for Augmented Language Models lack flexibility, democratization, and holistic evaluation.
Approach: They propose a lightweight and extensible framework for Augmented Language Models called Gentopia.
Outcome: The proposed framework integrates language models, task formats, prompting modules, and plugins into a unified paradigm.
Biology-Instructions: A Dataset and Benchmark for Multi-Omics Sequence Understanding Capability of Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Biology-Instructions is the first large-scale instruction-tuning dataset for multi-omics biological sequences.
Approach: They propose a large-scale instruction-tuning dataset for multi-omics biological sequences . they propose 'chatMultiOmics' to overcome limitations of current LLMs on multi-ome tasks .
Outcome: The proposed dataset bridges LLMs and complex biological sequence-related tasks while maintaining conversational fluency.
Enhancing Retrieval-Augmented Generation via Evidence Tree Search (2025.acl-long)

Copied to clipboard

Challenge: Evidence retrieval is used to enhance Large Language Models (LLMs) but in real-world applications, it often returns lengthy documents with redundant or irrelevant content, confusing downstream readers.
Approach: They propose a framework that reformulates evidence retrieval as a dynamic tree expansion process.
Outcome: The proposed framework outperforms existing methods on five datasets.
A Static Evaluation of Code Completion by Large Language Models (2023.acl-industry)

Copied to clipboard

Challenge: Large language models trained on code have shown great potential to increase productivity of software developers.
Approach: They propose a static evaluation framework to quantify static errors in Python code completions by leveraging Abstract Syntax Trees.
Outcome: The proposed framework is more efficient and applicable to code in the wild.
Rethinking Text-to-SQL: Dynamic Multi-turn SQL Interaction for Real-world Database Exploration (2026.findings-acl)

Copied to clipboard

Challenge: Structured Query Language (SQL) is the cornerstone for data-driven decision-making.
Approach: They propose a benchmark to rigorously evaluate Large Language Models within a dynamic interaction framework.
Outcome: The proposed benchmark aims to rigorously evaluate LLMs within a dynamic interaction framework.
Evaluating Generative Language Models in Information Extraction as Subjective Question Correction (2024.lrec-main)

Copied to clipboard

Challenge: Modern large language models (LLMs) perform poorly in elementary tasks like relation extraction and event extraction due to two issues in conventional evaluation methods.
Approach: They propose a method to evaluate large language models by incorporating a human annotation schema.
Outcome: The proposed evaluation method improves matching between model outputs and golden labels.
CodeJudge-Eval: Can Large Language Models be Good Judges in Code Understanding? (2025.coling-main)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have showcased impressive code generation capabilities, primarily evaluated through language-to-code benchmarks.
Approach: They propose a benchmark to assess LLMs’ code understanding abilities from the perspective of code judging rather than code generation.
Outcome: The proposed benchmark evaluates 12 well-known large language models to determine the correctness of provided code solutions.
Are AI-Generated Text Detectors Robust to Adversarial Perturbations? (2024.acl-long)

Copied to clipboard

Challenge: Existing detectors for AI-generated text lack robustness against adversarial perturbations, with even minor changes in characters or words causing a reversal in distinguishing between human-created and AI-generated text.
Approach: They propose a siamese calibration technique to train the model to make equally confident predictions under different noise, which improves the model’s robustness against adversarial perturbations.
Outcome: The proposed detector outperforms baseline methods on four datasets and is more generalizable in cross-domain, cross-genre, and mixed-source scenarios.
Hephaestus: Improving Fundamental Agent Capabilities of Large Language Models through Continual Pre-Training (2025.naacl-long)

Copied to clipboard

Challenge: Existing LLMs often rely on complex prompting or extensive fine-tuning to introduce new capabilities while preserving strong generalizability.
Approach: They propose a large-scale pre-training corpus to enhance LLM agents' capabilities . they use 103B agent-specific data encompassing 76,537 APIs .
Outcome: The proposed training corpus outperforms open-source LLMs and commercial LLM agents on three agent benchmarks.
UnClE: Explicitly Leveraging Semantic Similarity to Reduce the Parameters of Word Embeddings (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to reduce word embedding parameters ignore semantic information . existing methods do not consider semantic information, allowing for performance degradation .
Approach: They propose a method that leverages semantic similarity with weight sharing to reduce dimensionality of word embeddings.
Outcome: The proposed method reduces word embedding parameters by more than 11x on a standard English-German dataset.
MINED: Probing and Updating with Multimodal Time-Sensitive Knowledge for Large Multimodal Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for Large Multimodal Models (LMMs) are constrained by static representations, inadequately evaluating their ability to understand time-sensitive knowledge.
Approach: They propose a benchmark containing 2,104 time-sensitive knowledge samples spanning six knowledge types to evaluate temporal awareness along 6 key dimensions and 11 challenging tasks.
Outcome: The proposed benchmark measures temporal awareness along 6 key dimensions and 11 tasks, while most open-source LMMs still lack time understanding ability.
When Efficiency Becomes a Vulnerability: Computational Cost Attacks on WebAgents (2026.acl-long)

Copied to clipboard

Challenge: Existing WebAgents suffer from computational cost attacks due to long reasoning processes and excessive computational cost.
Approach: They propose a framework that generates adversarial prompts and a reinforcement learning-enhanced selector to identify the most effective perturbations.
Outcome: The proposed framework exploits large language models to generate diverse adversarial prompts and a reinforcement learning–enhanced selector to identify the most effective perturbations.
GenTranslate: Large Language Models are Generative Multilingual Speech and Machine Translators (2024.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have stepped forward the development of multilingual speech and machine translation by its reduced representation errors and incorporated external knowledge.
Approach: They propose a generative paradigm for translation tasks that integrates the diverse translation versions in N-best list.
Outcome: The proposed model outperforms the state-of-the-art model on speech and machine translation benchmarks on various languages.
Adversarial Yet Cooperative: Multi-Perspective Reasoning in Retrieved-Augmented Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing training paradigms rely on outcome-oriented rewards, which provide insufficient signal for shaping the complex, multi-step reasoning process.
Approach: They propose a framework that integrates large reasoning models with retrieval-augmented generation to improve reasoning fidelity and verification rigor.
Outcome: Experiments on multiple benchmarks demonstrate the effectiveness of the proposed framework.
ReasonRank: Empowering Passage Ranking with Strong Reasoning Ability (2026.acl-long)

Copied to clipboard

Challenge: Existing rerankers perform poorly in complex ranking scenarios due to the scarcity of reasoning-intensive training data.
Approach: They propose an automated reasoning-intensive training framework which generates high-quality training labels from training queries and passages.
Outcome: The proposed model outperforms baselines significantly and achieves much lower latency than the pointwise reranker.
Counterfactual Generator: A Weakly-Supervised Method for Named Entity Recognition (2020.emnlp-main)

Copied to clipboard

Challenge: Using labeled data, named entity recognition is labor-intensive, time-consuming and expensive.
Approach: They propose a method which decomposes named entity into two parts: entity and context.
Outcome: The proposed method improves the generalization ability of models under limited observational examples.
Dr. Assistant: Enhancing Clinical Diagnostic Inquiry via Structured Diagnostic Reasoning Data and Reinforcement Learning (2026.findings-acl)

Copied to clipboard

Challenge: Clinical Decision Support Systems (CDSSs) provide reasoning and inquiry guidance for physicians, yet they face high maintenance costs and low generalization capability.
Approach: They propose a clinical diagnostic model with clinical reasoning and inquiry skills, the Dr. Assistant, and a pipeline to capture abstract reasoning logic.
Outcome: The proposed model outperforms open-source models and achieves competitive performance to closed-source model.
Agentic-R: Learning to Retrieve for Agentic Search (2026.findings-acl)

Copied to clipboard

Challenge: Existing retrievers for single-turn retrieval-augmented generation (RAG) rely on similarity-based retrievers, but similar passages are not always useful for final answer generation.
Approach: They propose a retrieval-augmented-generation retriever that integrates reasoning with retrieval . they use local query-passage relevance and global answer correctness to measure passage utility .
Outcome: The proposed retriever outperforms existing retrievers on QA benchmarks on seven single-hop and multi-hop searches.
Cultivating Forensic Reasoning for Generalizable Multimodal Manipulation Detection (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for manipulation detection and grounding focus on manipulator type classification under result-oriented supervision.
Approach: They propose a reasoning-driven framework that shifts learning from outcome fitting to process modeling.
Outcome: The proposed framework achieves state-of-the-art with superior generalization on large-scale datasets.
Visual Attention Reasoning via Hierarchical Search and Self-Verification (2026.acl-long)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) often hallucinate due to fragile, linear reasoning and weak visual grounding.
Approach: They propose a framework that reformulates reasoning as a hierarchical search with self-verification and replaces linear Chain-of-Thought with a tree-search policy capable of backtracking to correct logical errors.
Outcome: The proposed framework outperforms state-of-the-art methods on hallucination and safety benchmarks.
ReSel: N-ary Relation Extraction from Scientific Text and Tables by Learning to Retrieve and Select (2022.emnlp-main)

Copied to clipboard

Challenge: Our proposed method extracts N-ary relation tuples from scientific articles.
Approach: They propose a method that decomposes the task into two stages . they propose modal query and modal entity selection . their results show that ReSel outperforms state-of-the-art baselines significantly .
Outcome: The proposed method outperforms state-of-the-art baselines on three scientific information extraction datasets.
Noisy Positive-Unlabeled Learning with Self-Training for Speculative Knowledge Graph Reasoning (2023.findings-acl)

Copied to clipboard

Challenge: State-of-the-art methods fail in speculative reasoning task on knowledge graphs . state-of the-art approaches assume correctness of fact is determined by its presence in KG .
Approach: They propose a speculative reasoning task on real-world knowledge graphs . they propose nPUGraph that estimates correctness of both collected and uncollected facts .
Outcome: The proposed framework improves the robustness of a label posterior-aware graph encoder against false positive links and identifies missing facts to provide high-quality grounds of reasoning.
Listen Again and Choose the Right Answer: A New Paradigm for Automatic Speech Recognition with Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have promoted generative error correction (GER) for automatic speech recognition (ASR).
Approach: They propose a multimodal LLM to receive source speech as extra input and reformat it as a cloze test with logits calibration to remove input information redundancy and simplify GER with clear instructions.
Outcome: The proposed model improves on 9 popular ASR datasets and is faster than vanilla GER.
Dynamic Generation of Multi LLM Agents Communication Topologies with Graph Diffusion Models (2026.acl-long)

Copied to clipboard

Challenge: Existing frameworks rely on static or rule-based topologies that fail to adapt to task requirements.
Approach: They propose a generative framework that generates highly task-adaptive topologies . they validated the framework on multiple benchmarks and validated it on multiple platforms .
Outcome: The proposed framework outperforms existing frameworks in task-adaptive communication topologies.
Robust Knowledge Editing via Explicit Reasoning Chains for Distractor-Resilient Multi-Hop QA (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models encode vast amounts of knowledge but remain static once trained, making timely integration of emerging facts prohibitively expensive via full retraining.
Approach: They introduce a reasoning-chain-based editing framework that steers a pretrained LLM through four structured stages to filter distractors in a single pass.
Outcome: The proposed framework steers a pretrained LLM through four structured stages to filter distractors in a single pass.
CriticLean: Critic-Guided Reinforcement Learning for Mathematical Formalization (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to formalizing mathematical statements face limitations in accuracy, especially in the context of complex, highlevel problems that involve sophisticated mathematical reasoning.
Approach: They propose a CriticLean framework that elevates the role of the critic from a passive validator to an active learning component and introduce a benchmark to measure models’ ability to distinguish semantically correct from incorrect formalizations.
Outcome: The proposed framework outperforms open- and closed-source benchmarks and shows that it significantly outperformed existing models.
Solver-Independent Automated Problem Formulation via LLMs for High-Cost Simulation-Driven Design (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to translating ambiguous design requirements into a mathematical optimization formulation are expensive and time-consuming.
Approach: They propose a solver-independent framework that converts engineers’ natural language requirements into executable optimization models.
Outcome: The proposed framework outperforms existing methods in the accuracy of requirement formalization and quality of resulting radiation efficiency curves on antenna design.
DORM: Preference Data Weights Optimization for Reward Modeling in LLM Alignment (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to align large language models with human preferences are noisy and varying in importance of preference samples.
Approach: a new method enhances reward modeling by learning to dynamically weigh preference data.
Outcome: a new method improves the performance of large language models with human preferences . it initializes data importance and iteratively refines them to maximize validation performance.
MM-CRITIC: A Holistic Evaluation of Large Multimodal Models as Multimodal Critique (2025.findings-emnlp)

Copied to clipboard

Challenge: e MM-CRITIC is a holistic benchmark for evaluating the critique ability of Large Multimodal Models (LMMs) covering 8 main task types and over 500 tasks, covering 4471 samples.
Approach: They introduce a holistic benchmark for evaluating the critique ability of Large Multimodal Models across multiple dimensions: basic, correction, and comparison.
Outcome: The proposed benchmark covers 8 main task types and over 500 tasks and is composed of 4471 samples.
The Limitations of Limited Context for Constituency Parsing (2021.acl-long)

Copied to clipboard

Challenge: a language model that is syntax-aware can produce better samples, authors say . a recent study shows that neural approaches to syntax can perform unsupervised syntactic parsing .
Approach: They propose to incorporate syntax into neural approaches in NLP to produce better samples . they find that the first time neural approaches were able to perform unsupervised syntactic parsing .
Outcome: The proposed models can perform unsupervised syntactic parsing, but they are lagging behind . the proposed models are based on a sandbox of probabilistic context-free-grammars .
SAM3-I: Segment Anything with Instructions (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for concept-level grounding and instruction-level reasoning use coarse representations and iterative mask filtering.
Approach: They propose an instruction-following extension of the Segment Anything Model 3 family that unifies concept-level grounding and instruction-level reasoning within a single segmentation framework.
Outcome: Experiments show that SAM3-I achieves appealing performance across referring and reasoning-based segmentation while maintaining its strong concept recall ability.
Rethinking Repetition Problems of LLMs in Code Generation (2025.acl-long)

Copied to clipboard

Challenge: Recent studies have focused on content repetition, but structural repetition is a more prevalent problem in code generation.
Approach: They propose a decoding approach that eliminates repetition problems in code generation by identifying grammar rules and strategically decaying the likelihood of critical tokens that contribute to repetitions.
Outcome: The proposed approach outperforms baselines and humanEval benchmarks on CodeRepetEval dataset and MBPP benchmarks, effectively reducing repetitions and enhancing the quality of generated code.
Edit Once, Update Everywhere: A Simple Framework for Cross-Lingual Knowledge Synchronization in LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods to update large language models focus on single-language editing or basic multilingual editing, failing to achieve true cross-linguistic knowledge synchronization.
Approach: They propose a cross-linguistic knowledge democracy edit technique to improve cross-lingual performance.
Outcome: The proposed method improves cross-lingual performance while maintaining high accuracy in monolingual settings.
M3ED: Multi-modal Multi-scene Multi-label Emotional Dialogue Database (2022.acl-long)

Copied to clipboard

Challenge: Existing data resources to support multimodal affective analysis in dialogues are limited in scale and diversity.
Approach: They propose a multimodal multi-scene multi-label Emotional Dialogue dataset, M3ED, which contains 990 dyadic emotional dialogues from 56 different TV series.
Outcome: The proposed dataset contains 990 dyadic emotional dialogues from 56 different TV series, a total of 9,082 turns and 24,449 utterances.
Hearing Lips in Noise: Universal Viseme-Phoneme Mapping and Transfer for Robust Audio-Visual Speech Recognition (2023.acl-long)

Copied to clipboard

Challenge: Existing efforts to improve robustness of audio-visual speech recognition with visual information focus on audio modality . current approaches introduce noise adaptation techniques to improve reliability of AVSR task .
Approach: They propose a visual-invariant modality to strengthen robustness of audio-visual speech recognition (AVSR) it can adapt to any testing noises without dependence on noisy training data, a.k.a., unsupervised noise adaptation.
Outcome: The proposed method outperforms existing state-of-the-arts on visual speech recognition task under various noisy and clean conditions.
On the Representation Geometry of LoRA Model Merging (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for low-rank Adaptation (LoRA) fine-tuning focus on globally shared structure . combining SVD with CUR improves performance of LoRA model merging .
Approach: They propose a training-free method that combines SVD and CUR decomposition to improve LoRA merging performance.
Outcome: The proposed procedure improves on vision and language benchmarks.
InfiAgent: An Infinite-Horizon Framework for General-Purpose Autonomous Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing LLMs break down on long-horizon tasks due to unbounded context growth and accumulated errors.
Approach: They propose a framework that externalizes persistent state into a file-centric state abstraction and keeps the agent’s reasoning context strictly bounded regardless of task duration.
Outcome: Experiments on DeepResearch and an 80-paper literature review show that the proposed framework maintains higher long-horizon coverage than baseline models without task-specific fine-tuning.
Easy Dataset: A Unified and Extensible Framework for Synthesizing LLM Fine-Tuning Data from Unstructured Documents (2025.emnlp-demos)

Copied to clipboard

Challenge: Existing data synthesis tools struggle to extract reliable fine-tuning data from heterogeneous documents.
Approach: They propose a framework for synthesizing fine-tuning data from unstructured documents via an intuitive graphical user interface.
Outcome: The proposed framework can extract reliable data from unstructured documents via an intuitive graphical user interface (GUI) it leverages persona-driven prompting approach to generate diverse question-answer pairs using public-available LLMs.
PaSa: An LLM Agent for Comprehensive Academic Paper Search (2025.acl-long)

Copied to clipboard

Challenge: We introduce PaSa, an advanced Paper Search agent powered by large language models . despite being trained on synthetic data, PaSA outperforms existing baselines on RealScholarQuery .
Approach: They introduce PaSa, an advanced Paper Search agent powered by large language models . they optimize PaSA using a synthetic dataset, AutoScholarQuery, which includes 35k fine-grained queries .
Outcome: The paper analyzes the performance of a paper search agent using a synthetic dataset . it significantly outperforms existing benchmarks on RealScholarQuery .
From Storage to Experience: A Survey on the Evolution of LLM Agent Memory Mechanisms (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs)-based agents have fundamentally reshaped artificial intelligence . however, the inherent statelessness of LLMs hinders their ability to maintain logical consistency across complex, multi-step tasks .
Approach: They propose a framework for LLM agent memory mechanisms that formalizes the development process into three stages: storage, reflection, and experience.
Outcome: The proposed framework breaks the development process into three stages . it analyzes the need for long-range consistency, challenges in dynamic environments, and the ultimate goal of continual learning.
GRADUAL: Granularity-aware Dual Prototype Learning for Better Few-Shot Relation Extraction (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for few-shot relation extraction use text labels and context sentences to learn prototype representations.
Approach: They propose a "dual prototype learning method" that integrates text labels and context sentences into prototype representations.
Outcome: The proposed method achieves state-of-the-art performance in few-shot relation extraction.
CodeTransOcean: A Comprehensive Multilingual Benchmark for Code Translation (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing code translation datasets focus on a single pair of programming languages . early software systems are developed using programming languages such as Fortran and COBOL .
Approach: They propose a large-scale comprehensive benchmark that supports the largest variety of programming languages for code translation.
Outcome: The proposed framework supports translations between multiple programming languages and a cross-framework dataset for deep learning code across different frameworks.
Overcoming Catastrophic Forgetting by Exemplar Selection in Task-oriented Dialogue System (2024.findings-acl)

Copied to clipboard

Challenge: Experimental results show that HESIT effectively alleviates catastrophic forgetting by exemplar selection, and achieves state-of-the-art performance on the largest CL benchmark of ToDs in terms of all metrics.
Approach: They propose a method to overcome catastrophic forgetting in task-oriented dialogue systems by tracing their hyper-gradients and a retraining strategy that uses influential exemplars for periodic retrains.
Outcome: The proposed method achieves state-of-the-art on the largest CL benchmark of ToDs in terms of all metrics.
Continual Few-shot Intent Detection (2022.coling-1)

Copied to clipboard

Challenge: Existing intent detection systems are trained with lots of labeled data over a predefined set of intent classes.
Approach: They propose a prefix-guided lightweight encoder with three auxiliary strategies to prevent catastrophic forgetting and negative knowledge transfer across tasks.
Outcome: The proposed system prevents catastrophic forgetting and encourages positive knowledge transfer across tasks.
MMCode: Benchmarking Multimodal Large Language Models for Code Generation with Visually Rich Programming Problems (2024.findings-emnlp)

Copied to clipboard

Challenge: Programming often involves translating detailed and complex specifications into code . current state-of-the-art models struggle to solve these problems, a new study shows .
Approach: They propose a multi-modal coding dataset to evaluate algorithmic problem-solving skills in visually rich contexts.
Outcome: The proposed model lacks powerful vision-code models due to the extreme demand for reasoning abilities.
MIR-GAN: Refining Frame-Level Modality-Invariant Representations with Adversarial Network for Audio-Visual Speech Recognition (2023.acl-long)

Copied to clipboard

Challenge: Audio-visual speech recognition (AVSR) leverages multimodal signals to understand human speech.
Approach: They propose an adversarial network to refine frame-level modality-invariant representations to bridge the distribution gap between modalities.
Outcome: The proposed approach outperforms the state-of-the-art on public benchmarks LRS3 and LRS2 on the modalities of AVSR.
POLYIE: A Dataset of Information Extraction from Polymer Material Scientific Literature (2024.naacl-long)

Copied to clipboard

Challenge: SciIE datasets for polymer materials are lacking for this class of materials . POLYIE is curated from 146 full-length polymer scholarly articles .
Approach: They propose a SciIE dataset for polymer materials that uses entity annotations from 146 full-length articles.
Outcome: The proposed dataset is curated from 146 full-length polymer scholarly articles . it presents challenges due to diverse lexical formats of entities and ambiguity between entities .
DialogueEIN: Emotion Interaction Network for Dialogue Affective Analysis (2022.coling-1)

Copied to clipboard

Challenge: Emotion Recognition in Conversation (ERC) has attracted increasing research attention in recent years.
Approach: They propose to model the emotional interactions between speakers to simulate the emotional inertia, emotional stimulus, global and local emotional evolution in dialogues.
Outcome: The proposed model can achieve superior performance compared to state-of-the-art methods on four ERC benchmark datasets, IEMOCAP, MELD, EmoryNLP and DailyDialog.
Analyzing the Quality of Counseling Conversations: the Tell-Tale Signs of High-quality Counseling (L18-1)

Copied to clipboard

Challenge: Behavioral and mental health disorders are the most costly and prevalent conditions worldwide.
Approach: They propose to use a dataset to analyze counseling interactions by using aspects such as mirroring, empathy, and reflective listening to build text-based classifiers.
Outcome: The proposed dataset can be used to build text-based classifiers able to predict the overall quality of a counseling conversation and provide insights into the linguistic differences between low-quality and high-quality counseling.
CARE-STaR: Constraint-aware Self-taught Reasoner (2025.findings-acl)

Copied to clipboard

Challenge: Recent research on instruction following has demonstrated that LLMs can handle complex instructions.
Approach: They propose to assign constraints to different levels of constraints in instructions . they use chain-of-thought and self-taught reasoner methods to identify constraints .
Outcome: The proposed method outperforms supervised fine-tuning (SFT) on three instruction-following benchmarks.
Logic Jailbreak: Efficiently Unlocking LLM Safety Restrictions Through Formal Logical Expression (2026.findings-acl)

Copied to clipboard

Challenge: Despite advances in aligning LLMs with human values, current safety mechanisms remain vulnerable to jailbreak attacks.
Approach: They propose a black-box jailbreak method that uses logical expression translation to bypass LLM safety mechanisms.
Outcome: The proposed method exploits the distributional gap between alignment data and logic-expressed inputs while preserving the underlying semantic intent and readability while evading safety constraints.
UniCreative: Unifying Long-form Logic and Short-form Sparkle via Reference-Free Reinforcement Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing alignment paradigms for creative writing use static reward signals and supervised data.
Approach: They propose a constraint-aware reward model that synthesizes query-specific criteria to provide fine-grained preference judgments.
Outcome: The proposed framework aligns models with human preferences across content quality and structural paradigms without supervised fine-tuning and ground-truth references.
Untangle the KNOT: Interweaving Conflicting Knowledge and Reasoning Skills in Large Language Models (2024.lrec-main)

Copied to clipboard

Challenge: Existing studies have explained to what extent LLMs extract conflicting knowledge from the provided text, but they neglect the necessity to reason with conflicting information.
Approach: They construct a dataset for knowledge conflict resolution examination in the form of question answering that divides reasoning with conflicting knowledge into three levels.
Outcome: The proposed dataset enables analysis of reasoning with conflicting knowledge in the form of question answering.

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