Papers by Linfeng Liu

26 papers
Verified Critical Step Optimization for LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Critical Step Optimization (CSO) focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success.
Approach: They propose a method which focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success.
Outcome: The proposed method outperforms the existing methods on GAIA-Text-103 and XBench-DeepSearch while requiring supervision at only 16% of trajectory steps.
Augmenting Multi-Turn Text-to-SQL Datasets with Self-Play (2022.findings-emnlp)

Copied to clipboard

Challenge: Numerous architectures and pretraining methods have been proposed for context-dependent text-to-SQL, but the size of the datasets used has been limited due to the high cost of annotating multi-turn dialogue and SQL pairs.
Approach: They propose to augment training datasets using self-play which leverages contextual information to synthesize new interactions to adapt the model to new databases.
Outcome: The proposed model improves accuracy on SParC and CoSQL, two widely used cross-domain text-to-SQl datasets.
A Survey on Zero Pronoun Translation (2023.acl-long)

Copied to clipboard

Challenge: Zero pronouns (ZPs) are often omitted in pro-drop languages, but should be recalled in non-pro-drop language.
Approach: They propose to analyze the literature on zero pronoun translation after the neural revolution . they uncover that data limitation causes learning bias in languages and domains .
Outcome: The proposed method and methods are compared to other models and evaluation metrics on different benchmarks.
Sentence-State LSTM for Text Representation (P18-1)

Copied to clipboard

Challenge: LSTMs have been shown to suffer from various limitations due to their sequential nature.
Approach: They propose to model hidden states of all words simultaneously at each recurrent step rather than one word at a time.
Outcome: The proposed model has strong representation power, giving competitive performances compared to stacked BiLSTM models with similar parameter numbers.
TexSmart: A System for Enhanced Natural Language Understanding (2021.acl-demo)

Copied to clipboard

Challenge: TexSmart supports fine-grained named entity recognition (NER) Large-scale fine-granular entity types are expected to provide richer semantic information for downstream NLP applications.
Approach: They introduce TexSmart, a text understanding system that supports fine-grained named entity recognition (NER) and enhanced semantic analysis functionalities.
Outcome: The proposed system supports fine-grained named entity recognition (NER) and enhanced semantic analysis functions.
Optimizing User Profiles via Contextual Bandits for Retrieval-Augmented LLM Personalization (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches for personalizing large language models require modifying parameters.
Approach: They propose a lightweight approach to personalizing large language models via retrieval augmentation . relevance serves as an unreliable proxy for utility, they argue .
Outcome: The proposed framework outperforms strong heuristic and retrieval-augmented baselines on nine personalization tasks.
LED-Merging: Mitigating Safety-Utility Conflicts in Model Merging with Location-Election-Disjoint (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for fine-tuning large language models for specialized tasks are costly and time-consuming.
Approach: They propose a framework that locates task-specific neurons via gradient-based attribution and dynamically Elects critical neurons through multi-model importance fusion.
Outcome: The proposed framework reduces harmful response rates while preserving 95% of utility performance.
Beyond Black-Box Interventions: Latent Probing for Faithful Retrieval-Augmented Generation (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to improve contextual faithfulness treat the LLM as a black box, generating responses that are inconsistent with the provided context.
Approach: They propose a framework for faithful RAG that operates in three stages: (i) fine-grained knowledge pruning to filter irrelevant context, (ii) latent conflict probing to identify hard conflicts in the model’s latent space, and (iv) conflict-aware attention to modulate attention heads toward faithful context integration.
Outcome: Experiments show that ProbeRAG significantly improves both accuracy and contextual faithfulness.
Evolving Chinese Spelling Correction with Corrector-Verifier Collaboration (2025.emnlp-main)

Copied to clipboard

Challenge: Recent methods address Chinese Spelling Correction (CSC) with either BERT-based models or large language models (LLMs) however, both of them face challenges.
Approach: They propose a model collaboration pipeline to iteratively optimize a BERT-based corrector.
Outcome: The proposed model outperforms existing methods and outperformed human annotation methods.
Bypassing Neural Evaluations for Fast Audio Editing via Adaptive Trajectory Extrapolation (2026.findings-acl)

Copied to clipboard

Challenge: Recent advances in audio diffusion models have significantly improved text-to-audio editing via inversion techniques, but these models typically rely on dense, fixed-step sampling trajectories to maintain structural integrity.
Approach: They propose a model-agnostic Adaptive Trajectory Extrapolation framework that accelerates inversion-based editing process by dynamically evaluating only the most critical generative phases.
Outcome: The proposed framework achieves a 3.9 speedup with negligible loss in fidelity.
SDAR: A Synergistic Diffusion-AutoRegression Paradigm for Scalable Sequence Generation (2026.findings-acl)

Copied to clipboard

Challenge: Autoregressive (AR) language models are a dominant paradigm in the field of parallelism and non-causal modeling.
Approach: They propose a blockwise discrete diffusion model that preserves AR-compatible serving while enabling parallel intra-block generation.
Outcome: The proposed model achieves theoretical speedups over 5 and wall-clock speedup of 2.3 on H200 GPUs in latency-critical regimes.
GuoFeng: A Benchmark for Zero Pronoun Recovery and Translation (2022.emnlp-main)

Copied to clipboard

Challenge: ZPs are often omitted when they can be pragmatically or grammatically inferred from intraand inter-sentential contexts.
Approach: They propose a benchmark testset for target evaluation on Chinese-English ZP translation.
Outcome: The proposed testset covers five genres and identifies current challenges for evaluation.
SDAR-VL: Stable and Efficient Block-wise Diffusion for Vision-Language Understanding (2026.acl-long)

Copied to clipboard

Challenge: Existing block-wise discrete diffusion models lack robust autoregressive (AR) decoders.
Approach: They propose a block-wise discrete diffusion framework for large-scale vision-language understanding with a progressive beta noise curriculum.
Outcome: The proposed framework improves training efficiency, convergence stability, and task performance over conventional block diffusion.
Getting the Most out of Simile Recognition (2022.findings-emnlp)

Copied to clipboard

Challenge: Recent work ignores features other than surface strings and suffers from data hunger issue.
Approach: They propose to use simile sentence classification and simile component extraction to find simile components.
Outcome: The proposed model outperforms current state-of-the-art systems and baselines.
LLM Safety From Within: Detecting Harmful Content with Internal Representations (2026.acl-long)

Copied to clipboard

Challenge: State-of-the-art guard models rely on terminal-layer representations and overlook safety-relevant features encoded across internal layers.
Approach: They propose a lightweight guard model that harnesses safety neurons from LLM internals without modifying the underlying model.
Outcome: The proposed model outperforms open-source guard models across multiple benchmarks while using 250 fewer trainable parameters.
Driving Chinese Spelling Correction from a Fine-Grained Perspective (2025.coling-main)

Copied to clipboard

Challenge: Existing evaluations for Chinese spelling correction lack nuanced typology for spelling errors, creating an "invisible" bottleneck .
Approach: They propose a fine-grained evaluation principle for Chinese spelling correction (CSC) they categorize spelling errors into six different types and use it to evaluate models .
Outcome: The proposed evaluation principle can be leveraged to enhance CSC training models.
EconProver: Towards More Economical Test-Time Scaling for Automated Theorem Proving (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have recently advanced the field of Automated Theorem Proving (ATP) Existing cost analyses regulate only the number of sampling passes, ignoring the substantial disparities in sampling costs.
Approach: They propose to integrate two complementary methods into a unified EconRL pipeline to increase pass rates under constrained sampling passes.
Outcome: The proposed method reduces token usage and sample passes while maintaining the original performance.
Video Compression Commander: Plug-and-Play Inference Acceleration for Video Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that Video Large Language Models (Vide-oLLMs) are efficient at video understanding but lack the quadratic complexity of visual tokens.
Approach: They propose a plug-and-play inference acceleration framework for VideoLLM token compression that quantifies each frame’s uniqueness and adaptively adjusts compression intensity across frames.
Outcome: Extensive experiments on video large language models and benchmarks show that the proposed framework can preserve essential information while reducing redundancy in video sequences.
AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems (2026.acl-long)

Copied to clipboard

Challenge: Automated expansion methods often result in bloated structures with redundant agents, leading to excessive token consumption.
Approach: They propose a plug-and-play compression framework for graph-structured multi-agent workflows . they estimate the importance score of each agent and remove redundant agents .
Outcome: Experiments show that AgentSlimming reduces average token cost by 78.9% with negligible performance degradation.
Evaluating the Impact of Verbal Multiword Expressions on Machine Translation (2026.acl-long)

Copied to clipboard

Challenge: Verbal multiword expressions (VMWEs) are difficult for machine translation because their meanings are often not recoverable from their component words.
Approach: They analyze the impact of verbal idioms, verb-particle constructions, and light verb constructions on machine translation quality from English to multiple languages.
Outcome: The proposed system improves translation quality by focusing on verb idioms, verb-particle constructions and light verb constructions.
MelTrim: Coarse-to-Fine Data Pruning for Speech Classification (2026.findings-acl)

Copied to clipboard

Challenge: Unlike image or text classification, speech classification tasks are particularly challenging due to the difficulty in capturing the acoustic, semantic, and contextual representations.
Approach: They propose a dataset pruning method that coarsely filters redundant samples using DBSCAN clustering on Mel-Frequency Cepstral Coefficients (MFCC) features.
Outcome: The proposed method achieves 49.5% improvement in WA on the MEAD dataset and 41.9% reduction in EER on speaker identification tasks.
Unlocking Speech Instruction Data Potential with Query Rewriting (2025.findings-acl)

Copied to clipboard

Challenge: Existing LLMs lack datasets and biased training tasks to follow speech instructions.
Approach: They propose a query rewriting framework that uses multiple agents to annotate and validate the synthesized speech.
Outcome: The proposed framework can transform text instructions into distributions more suitable for TTS models for speech synthesis without human annotation.
Preference Heads in Large Language Models: A Mechanistic Framework for Interpretable Personalization (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models exhibit strong implicit personalization ability, but most approaches treat this behavior as a black box.
Approach: They propose a mechanistic interpretation perspective and propose 'sparse' set of Preference Heads . they compute a Preference Contribution Score for each attention head and compare their predictions .
Outcome: The proposed framework computes a Preference Contribution Score (PCS) for each attention head and measures its causal impact on user aligned outputs.
A Computational Approach to Visual Metonymy (2026.eacl-long)

Copied to clipboard

Challenge: Visual metonymy is a form of indirect representation in which an image evokes a concept not by depicting it directly, but by presenting visually associated cues that invite the viewer to infer the intended meaning.
Approach: They propose a pipeline grounded in semiotic theory that leverages large language models and text-to-image models to generate metonymic visual representations.
Outcome: The proposed pipeline exploits large language models and text-to-image models to generate metonymic visual representations.
Empower Nested Boolean Logic via Self-Supervised Curriculum Learning (2023.emnlp-main)

Copied to clipboard

Challenge: a new self-supervised learning method allows language models to generalize to much harder and longer-hop logic.
Approach: They propose a self-supervised learning method to empower language models with boolean logic . they augment training data with nested booles and program training from simpler to harder ones .
Outcome: The proposed method allows language models to generalize to much harder and longer-hop logic, which can hardly be learned through naive training.

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