Papers by Tianyu Liu

100 papers
Enhancing Continual Relation Extraction via Classifier Decomposition (2023.findings-acl)

Copied to clipboard

Challenge: Existing studies only adopt a vanilla strategy when learning representations of new relations . experimental results show that the importance of the first training stage to CRE models may be underestimated.
Approach: They propose a framework that splits the last FFN layer into separated previous and current classifiers to maintain previous knowledge and encourage model to learn more robust representations at this training stage.
Outcome: The proposed framework outperforms the state-of-the-art models on two benchmarks.
L2Dir: Integrating L_2-Norm and Directional Alignment for Unsupervised Contrastive Representation Learning in Multimodal Retrieval (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to multimodal representation learning focus on directional alignment and embedding magnitudes (L2-norm) however, these methods often fail to account for the intrinsic role of L2-norm in the contrastive process.
Approach: They propose a plug-and-play framework that optimizes L2-norm alignment and Directional consistency jointly.
Outcome: The proposed framework achieves consistent and significant performance gains over established baselines across 95 tasks using UniIR and VLM2Vec-V2 frameworks.
DialogQAE: N-to-N Question Answer Pair Extraction from Customer Service Chatlog (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing work on question-answer extraction fails to integrate incomplete utterances from dialog context for composite QA retrieval.
Approach: They propose a task where questions and corresponding answers might be separated across different utterances.
Outcome: The proposed methods perform well on 5 customer service datasets and set a benchmark for N-to-N DialogQAE with utterance and session level evaluation metrics.
Automatic Label Sequence Generation for Prompting Sequence-to-sequence Models (2022.coling-1)

Copied to clipboard

Challenge: Prompting has shown to be sample efficient compared to fine-tuning with pre-trained models.
Approach: They propose a fully automatic prompting method that uses natural language prompts on sequence-to-sequence models and a beam search method to generate a large amount of label sequence candidates.
Outcome: The proposed method significantly outperforms other no-manual-design methods on single label words and generates large amount of label sequence candidates.
Large Language Models are not Fair Evaluators (2024.acl-long)

Copied to clipboard

Challenge: Existing evaluation frameworks that use large language models as referees are insufficient for accurately assessing their alignment with human intent.
Approach: They propose a calibration framework to address positional bias in large language models as evaluators by manually annotating the “win/tie/lose” outcomes of responses from ChatGPT and Vicuna-13B in the Vicun A Benchmark’s question prompt.
Outcome: The proposed framework alleviates evaluation bias, resulting in closer alignment with human judgments.
HTMuon: Improving Muon via Heavy-Tailed Spectral Correction (2026.findings-acl)

Copied to clipboard

Challenge: Muon’s orthogonalized update rule suppresses the emergence of heavy-tailed weight spectra and over-emphasizes the training along noise-dominated directions.
Approach: They propose to preserve Muon's ability to capture parameter interdependencies while producing heavier-tailed updates and inducing heavier-tail weight spectra.
Outcome: The proposed algorithm suppresses the emergence of heavy-tailed weight spectra and over-emphasizes training along noise-dominated directions.
Bi-Drop: Enhancing Fine-tuning Generalization via Synchronous sub-net Estimation and Optimization (2023.findings-emnlp)

Copied to clipboard

Challenge: Pretrained language models can be fine-tuned on limited training data, which can overfit and thus diminish performance.
Approach: They propose a fine-tuning strategy that selectively updates model parameters using gradients from various sub-nets dynamically generated by dropout.
Outcome: The proposed method outperforms existing methods on the GLUE benchmark and exhibits excellent generalization ability and robustness for domain transfer, data imbalance, and low-resource scenarios.
Discourse-Centric Evaluation of Document-level Machine Translation with a New Densely Annotated Parallel Corpus of Novels (2023.acl-long)

Copied to clipboard

Challenge: Several recent papers claim to have achieved human parity at sentence-level machine translation.
Approach: They propose to use a dataset with rich discourse annotations to evaluate MT performance . they find that MT outputs differ fundamentally from human translations in terms of latent discourse structures.
Outcome: The proposed dataset builds upon the large-scale parallel corpus BWB . it covers 15,095 entity mentions in both languages and compares them to human translations .
IW-Bench: Evaluating Large Multimodal Models for Converting Image-to-Web (2025.findings-acl)

Copied to clipboard

Challenge: Existing models have been introduced to improve image comprehension, but there is no robust benchmark for imagetoweb conversion.
Approach: They propose a benchmark to assess imagetoweb conversion proficiency of large multimodal models . they propose to measure layout information of web pages by parsing the Document Object Model tree .
Outcome: The proposed benchmark measures the layout information of web pages—i.e., the positional relationships between elements—which has been overlooked by prior work.
Hexatagging: Projective Dependency Parsing as Tagging (2023.acl-short)

Copied to clipboard

Challenge: Using a pretrained language model, we can train language models on increasingly large amounts of data.
Approach: They propose a dependency parser that constructs dependency trees by tagging words with elements from a finite set of possible tags.
Outcome: The proposed approach achieves state-of-the-art performance of 96.4 LAS and 97.4 UAS on the Penn Treebank test set.
LoopCoder: Scaling Code Intelligence via Looped Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Large language models have mastered syntax-level code generation, but complex algorithmic reasoning remains a challenge.
Approach: They propose a recurrent inductive bias that aligns with the recursive nature of programming logic.
Outcome: The proposed model achieves comparable performance to standard dense models with more parameters.
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.
Enhancing Topic-to-Essay Generation with External Commonsense Knowledge (P19-1)

Copied to clipboard

Challenge: Existing methods for topic-to-essay generation are insufficient for generating novel, diverse, and topic-consistent paragraph-level text with a set of topics.
Approach: They propose to integrate commonsense from external knowledge base into the generator through dynamic memory mechanism and adversarial training to further improve topic-consistency.
Outcome: The proposed task is more novel, diverse, and topic-consistent than existing methods in terms of both automatic and human evaluation.
Autoregressive Structured Prediction with Language Models (2022.findings-emnlp)

Copied to clipboard

Challenge: Recent years have seen a paradigm shift in NLP towards using pretrained language models for a wide range of tasks.
Approach: They propose to model structures as sequences of actions in autoregressive manner with PLMs . their approach allows in-structure dependencies to be learned without any loss .
Outcome: The proposed approach achieves state-of-the-art on all structured prediction tasks.
More Data, More Relations, More Context and More Openness: A Review and Outlook for Relation Extraction (2020.aacl-main)

Copied to clipboard

Challenge: Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically .
Approach: They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE .
Outcome: The proposed methods can extract relational facts from text, but they are still lacking in the current field.
Denoising Bottleneck with Mutual Information Maximization for Video Multimodal Fusion (2023.acl-long)

Copied to clipboard

Challenge: Prior denoising methods suppress redundant and noisy information at risk of losing critical information.
Approach: They propose a denoising bottleneck fusion model for fine-grained video multimodal fusion . they employ a bottleneck mechanism to filter out noise and redundancy with a restrained receptive field .
Outcome: The proposed model improves on state-of-the-art video multimodal fusion benchmarks.
KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation (2021.tacl-1)

Copied to clipboard

Challenge: Existing language representation models (PLMs) cannot capture factual knowledge from text.
Approach: They propose a unified model for Knowledge Embedding and Pre-trained LanguagERepresentation which integrates factual knowledge into PLMs and produces effective text-enhanced KE with the strong PLM.
Outcome: The proposed model improves on existing pre-trained language representation models and improves their performance on various NLP tasks.
Self-Distillation Bridges Distribution Gap in Language Model Fine-Tuning (2024.acl-long)

Copied to clipboard

Challenge: Experimental results show that fine-tuning of large language models for specific tasks can be challenging . distribution shift during fine-timing can lead to performance degradation in general task capabilities .
Approach: They propose a new approach that bridges the distribution gap between task datasets and LLMs by guiding fine-tuning with a distilled dataset generated by the model itself.
Outcome: The proposed approach achieves comparable or superior performance on downstream tasks compared to the vanilla approach.
Meta-Information Guided Meta-Learning for Few-Shot Relation Classification (2020.coling-main)

Copied to clipboard

Challenge: Existing meta-learning models rely on implicit instance statistics and are unreliability and weak interpretability.
Approach: They propose a meta-information guided meta-learning framework that uses semantics to guide meta- learning . experimental results demonstrate the effectiveness of the proposed framework .
Outcome: The proposed framework can establish connections between instance-based information and semantic-based data, enabling faster initialization and adaptation.
Towards Comprehensive Description Generation from Factual Attribute-value Tables (P19-1)

Copied to clipboard

Challenge: Existing models for comprehensive descriptions for factual attribute-value tables might suffer from missing key attributes and groundless information problems.
Approach: They propose a force attention method to encourage the generator to pay more attention to uncovered attributes to avoid potential key attributes missing.
Outcome: The proposed model outperforms the state-of-the-art baselines on automatic and human evaluation.
SceMQA: A Scientific College Entrance Level Multimodal Question Answering Benchmark (2024.acl-short)

Copied to clipboard

Challenge: SceMQA focuses on core science subjects including Mathematics, Physics, Chemistry, and Biology.
Approach: They propose to use SceMQA to evaluate multimodal question answering at college entrance level.
Outcome: The proposed model provides specific knowledge points for each problem and detailed explanations for each answer.
ResoFilter: Fine-grained Synthetic Data Filtering for Large Language Models through Data-Parameter Resonance Analysis (2025.findings-naacl)

Copied to clipboard

Challenge: Existing methods for enhancing large language models lack clear metrics for evaluating data characteristics.
Approach: They propose a method that integrates models, data, and tasks to refine datasets.
Outcome: The proposed method achieves comparable results to full-scale fine-tuning using only half the data in mathematical tasks and exhibits strong generalization across different models and domains.
Can Large Language Models Always Solve Easy Problems if They Can Solve Harder Ones? (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have impressive capabilities, but still suffer from inconsistency issues.
Approach: They develop a ConsisEval benchmark to evaluate LLMs' inconsistency . they find that LLM models can paradoxically fail at easier problems .
Outcome: The proposed model achieves highest consistency score but inconsistent to specific questions due to distraction by redundant information, misinterpretation of questions, etc.
LLM Critics Help Catch Bugs in Mathematics: Towards a Better Mathematical Verifier with Natural Language Feedback (2025.findings-acl)

Copied to clipboard

Challenge: Existing mathematical verifiers are trained with binary classification labels, which are not informative enough for the model to accurately assess the solutions.
Approach: They propose a natural language feedback-enhanced verifier that can validate the correctness of response generated by policy models by constructing automatically generated training data and a two-stage training paradigm.
Outcome: The proposed verifier significantly improves in verification and reinforcement learning and alleviates data-demanding problems of the reward model.
ImageNetVC: Zero- and Few-Shot Visual Commonsense Evaluation on 1000 ImageNet Categories (2023.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) are becoming general-purpose APIs, requiring visual knowledge to be understood.
Approach: They propose to evaluate the visual capability of large-scale large-language models through visual commonsense evaluation using a human-annotated dataset.
Outcome: The proposed dataset compares the visual commonsense knowledge of large-scale models with those of unimodal LLMs and visually augmented models.
RA-ISF: Learning to Answer and Understand from Retrieval Augmentation via Iterative Self-Feedback (2024.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated excellent performance in numerous tasks but the parameterized knowledge stored within LLMs may be incomplete and hard to incorporate up-to-date knowledge.
Approach: They propose a framework that iteratively decomposes tasks and processes them in three submodules to enhance the model’s problem-solving capabilities.
Outcome: The proposed method outperforms existing benchmarks on GPT3.5, Llama2 and other large language models significantly enhancing factual reasoning capabilities and reducing hallucinations.
Learning Robust Representations for Continual Relation Extraction via Adversarial Class Augmentation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing studies attribute catastrophic forgetting to the corruption of the learned representations as new relations come . Continual relation extraction models suffer from catastrophic forgetting when learning new relations .
Approach: They propose to use adversarial class augmentation mechanism to learn more precise representations . they propose to train the model on a sequence of tasks where two new relations are discovered .
Outcome: The proposed model improves on two popular benchmarks.
HPT: Hierarchy-aware Prompt Tuning for Hierarchical Text Classification (2022.emnlp-main)

Copied to clipboard

Challenge: Hierarchical text classification (HTC) is a multi-label classification problem with a complex label hierarchy.
Approach: They propose a Hierarchy-aware Prompt Tuning method to handle HTC from a multi-label perspective using a dynamic virtual template and label words that take the form of soft prompts to fuse the label hierarchy knowledge.
Outcome: The proposed method achieves state-of-the-art performance on 3 popular HTC datasets and is adept at handling imbalance and low resource situations.
Hierarchical Curriculum Learning for AMR Parsing (2022.acl-short)

Copied to clipboard

Challenge: Abstract Meaning Representation (AMR) parsing aims to translate sentences to semantic representation with a hierarchical structure, but there is a gap between their flat training objective and the hierarchic structure, which limits the model generalization.
Approach: They propose a Hierarchical Curriculum Learning framework with Structure-level (SC) and Instance-level curricula (IC) that aims to translate sentences to semantic representation with a hierarchical structure.
Outcome: Experiments on AMR2.0, AMR3.0, structure-complex and out-of-distribution situations confirm the effectiveness of the proposed framework.
VocalRep: Structure-Aware Vocal Representations for Multimodal Generation (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to vocal separation are optimized for signal-level reconstruction, but they overlook structural disentanglement required for downstream generation tasks.
Approach: They propose a structure-aware learning framework to disentangle vocals, harmonies, and accompaniment . they combine global vocal identity conditioning with ranking-based objectives .
Outcome: The proposed framework disentangles lead vocals, harmonies, and accompaniment while enforcing role consistency across long-form audio.
Exploiting Edited Large Language Models as General Scientific Optimizers (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for solving optimization problems in scientific scenarios use observational feedback as additional textual descriptions, but these methods struggle to utilize it effectively.
Approach: They propose a generalized approach to boost mathematical optimization in scientific scenarios by using observational feedback from LLMs as additional textual descriptions.
Outcome: The proposed method outperforms existing state-of-the-art methods on six different tasks using six different LLM backbones.
M2PO: Multi-Perspective Multi-Pair Preference Optimization for Machine Translation (2026.acl-long)

Copied to clipboard

Challenge: prevailing methods for machine translation are often hindered by misleading reward signals.
Approach: They propose a framework that aligns large language models to human preferences . they propose 'M2PO' to correct the bias towards partial errors .
Outcome: The proposed framework outperforms open-source models and achieves parity with proprietary models.
DialogUSR: Complex Dialogue Utterance Splitting and Reformulation for Multiple Intent Detection (2022.findings-emnlp)

Copied to clipboard

Challenge: DialogUSR is a plug-in and domain-agnostic module that empowers multi-intent detection for chatbots . a single user query triggers inquiries on highspeed train ticket price and weather of destination.
Approach: They propose a dialog utterance splitting and reformulation task that splits multi-intent user query into multiple single-intention sub-queries and recovers all coreferred and omitted information in the sub-questions.
Outcome: The proposed model can be used to split multi-intent user queries into multiple sub-queries . it can be trained in two stages and perform in-depth analyses on the proposed models .
Learning Invariant Representation Improves Robustness for MRC Models (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to improve machine reading comprehension models are vulnerable and not robust to adversarial examples.
Approach: They propose to construct positive example pairs which have same answer by augmentation and then introduce stability and contrastive loss to improve invariance of representation.
Outcome: The proposed approach boosts the robustness of QA models across different tasks and attack sets significantly and consistently.
A Fast and High-quality Text-to-Speech Method with Compressed Auxiliary Corpus and Limited Target Speaker Corpus (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to generate high-quality speech with limited target speaker corpus require extensive training data.
Approach: They propose an auxiliary corpus compression algorithm that reduces the training cost while the naturalness of synthesized speech is not significantly degraded.
Outcome: The proposed method significantly reduces training costs while maintaining the naturalness of synthesized speech.
OpenNRE: An Open and Extensible Toolkit for Neural Relation Extraction (D19-3)

Copied to clipboard

Challenge: OpenNRE provides a framework to implement neural relation extraction (RE) . the toolkit provides various functional modules based on TensorFlow and PyTorch .
Approach: OpenNRE is an open-source framework to implement neural relation extraction models. they also release an online system to meet real-time extraction without any training and deployment.
Outcome: OpenNRE provides a framework to implement neural models for relation extraction (RE) the toolkit also includes an online system to meet real-time extraction without training and deployment .
InfoCL: Alleviating Catastrophic Forgetting in Continual Text Classification from An Information Theoretic Perspective (2023.findings-emnlp)

Copied to clipboard

Challenge: Recent studies have identified the severe performance decrease on analogous classes as a key factor for catastrophic forgetting.
Approach: They propose a replay-based continual text classification method that uses fast-slow and current-past contrastive learning to perform mutual information maximization and better recover previously learned representations.
Outcome: The proposed method achieves state-of-the-art on three text classification tasks.
VulLibGen: Generating Names of Vulnerability-Affected Packages via a Large Language Model (2024.acl-long)

Copied to clipboard

Challenge: Existing work on affected package identification is limited by large language models . a recent study shows that 84% third-party packages contain security vulnerabilities .
Approach: They propose a method to use LLM to generate the affected package . they propose supervised fine-tuning, retrieval augmented generation and a local search algorithm .
Outcome: The proposed method has an average precision of 0.806 for identifying vulnerable packages in four most popular ecosystems in GitHub Advisory.
Model Balancing Helps Low-data Training and Fine-tuning (2024.emnlp-main)

Copied to clipboard

Challenge: Recent advances in foundation models have emphasized the need to align pre-trained models with specialized domains using small, curated datasets.
Approach: They propose a layer-wise learning rate scheduler that balances training quality across layers . they adapt it to a curated dataset to achieve alignment with specialized domains .
Outcome: The proposed model shows that it can be used to balance training quality across layers and improve low-data training and fine-tuning for both NLP and SciML tasks.
FewRel 2.0: Towards More Challenging Few-Shot Relation Classification (D19-1)

Copied to clipboard

Challenge: Few-shot domain adaptation and NOTA detection are two real-world challenges for few-shot relation classification models.
Approach: They propose a task to investigate two aspects of few-shot relation classification models . they build upon the FewRel dataset by adding a new test set in a different domain .
Outcome: The proposed task can evaluate few-shot domain adaptation and few- shot none-of-the-above detection on a new domain and NOTA relation choice.
Linear-Time Modeling of Linguistic Structure: An Order-Theoretic Perspective (2023.emnlp-main)

Copied to clipboard

Challenge: a new framework for structured prediction is developed for natural language processing . a systematic approach to structured prediction requires exhaustive pair-wise comparisons of tokens .
Approach: They propose a method that models the relationship between pairs of tokens in a string . they use a parallel method that predicts real numbers for each token in .
Outcome: The proposed method doubles the speed of graph-based dependency parsers and brings 10-times speed-up over graph-driven dependency parses.
Leveraging Word-Formation Knowledge for Chinese Word Sense Disambiguation (2021.findings-emnlp)

Copied to clipboard

Challenge: Word sense disambiguation (WSD) methods have not explored word-formations in parataxis languages like Chinese.
Approach: They propose to leverage word-formation knowledge to enhance Chinese WSD by incorporating word-forms into sense disambiguation models.
Outcome: The proposed model improves on baselines in Chinese word sense disambiguation (WSD) with word-formation knowledge, the results show.
ChatMusician: Understanding and Generating Music Intrinsically with LLM (2024.findings-acl)

Copied to clipboard

Challenge: Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task.
Approach: They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5.
Outcome: The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers.
Discriminatively-Tuned Generative Classifiers for Robust Natural Language Inference (2020.emnlp-main)

Copied to clipboard

Challenge: Recent work has shown advantages of generative classifiers in terms of data efficiency and robustness.
Approach: They propose a generative classifier for natural language inference (NLI) they compare it to discriminative models and large-scale pretrained models like BERT .
Outcome: The proposed classifier outperforms discriminative and pretrained baselines across several challenging NLI experimental settings, including small training sets, imbalanced label distributions, and label noise.
Document-level Event Extraction via Heterogeneous Graph-based Interaction Model with a Tracker (2021.acl-long)

Copied to clipboard

Challenge: Existing methods for document-level event extraction are not effective due to two challenges . existing methods fail to extract events whose arguments spread in multiple sentences .
Approach: They propose a document-level event extraction model with a tracker to capture interdependency among the extracted events.
Outcome: The proposed model outperforms existing models on a large-scale dataset by 2.8 F1 . it extracts multiple correlated events and event arguments that scatter across the document .
Premise-based Multimodal Reasoning: Conditional Inference on Joint Textual and Visual Clues (2022.acl-long)

Copied to clipboard

Challenge: Existing work in vision language cross-modal reasoning uses binary or multi-choice classification based on source image and textual query.
Approach: They propose a task where a textual premise is the background presumption on each source image.
Outcome: The proposed task is based on a dataset of 15,360 movie screenshots and human-curated premise templates from 6 pre-defined categories.
Double: Breaking the Acceleration Limit via Double Retrieval Speculative Parallelism (2026.acl-long)

Copied to clipboard

Challenge: Parallel Speculative Decoding (PSD) has limitations due to speedup limits and high computational waste . a novel synchronous mechanism solves the Retrieval Precision-Efficiency Dilemma .
Approach: They propose a framework that combines a draft-verification-based approach with a synchronous mechanism to solve the Retrieval Precision-Efficiency Dilemma.
Outcome: The proposed framework breaks speedup limits for Speculative Decoding by overlapping draft generation with verification.
An Anchor-Based Automatic Evaluation Metric for Document Summarization (2020.coling-main)

Copied to clipboard

Challenge: Existing reference-based evaluation metrics such as ROUGE have their own drawbacks.
Approach: They propose a protocol for a reference-based automatic evaluation metric that requires the endorsement of source document.
Outcome: The proposed metric is anchored on source document and has higher correlation with human judgments.
A Two-Stream AMR-enhanced Model for Document-level Event Argument Extraction (2022.naacl-main)

Copied to clipboard

Challenge: Existing studies aim at extracting event arguments from a single sentence . document-level event extraction still remains under-explored .
Approach: They propose a two-stream abstract meaning representation enhanced extraction model to extract event arguments from an entire document.
Outcome: The proposed model outperforms state-of-the-art in extracting event arguments from documents by 2.54 F1 and 5.13 F1 on public RAMS and WikiEvents datasets.
An Exploration of Arbitrary-Order Sequence Labeling via Energy-Based Inference Networks (2020.emnlp-main)

Copied to clipboard

Challenge: Recent work shows that conditional random fields (CRFs) perform well in sequence labeling tasks.
Approach: They propose several high-order energy terms to capture dependencies among labels in sequence labeling . they use convolutional, recurrent, and self-attention networks to construct these energy terms .
Outcome: The proposed approach improves on four sequence labeling tasks while having the same decoding speed as simple classifiers.
HypoNLI: Exploring the Artificial Patterns of Hypothesis-only Bias in Natural Language Inference (2020.lrec-1)

Copied to clipboard

Challenge: Recent studies have shown that for models trained on datasets for natural language inference (NLI), it is possible to make correct predictions by looking at the hypothesis while completely ignoring the premise.
Approach: They propose to derive adversarial examples in terms of the hypothesis-only bias and explore eligible ways to mitigate such bias.
Outcome: The proposed models can be used to mitigate the hypothesis-only bias by using down-sampling and adversarial training.
Physics: Benchmarking Foundation Models on University-Level Physics Problem Solving (2025.findings-acl)

Copied to clipboard

Challenge: a benchmark for university-level physics problem solving contains 1,297 expert-annotated problems . a proprietary model, o3-mini, achieves only 59.9% accuracy, highlighting fundamental weaknesses in scientific reasoning, conceptual understanding, and mathematical precision.
Approach: They introduce Physics, a benchmark for university-level physics problem solving.
Outcome: The proposed model achieves only 59.9% accuracy on the most advanced model, o3-mini . the proposed model is a powerful tool for evaluating models on advanced problems .
Multi-Docker-Eval: A ‘Shovel of the Gold Rush’ Benchmark on Automatic Environment Building for Software Engineering (2026.findings-acl)

Copied to clipboard

Challenge: Automated environment configuration is a critical bottleneck in scaling software engineering (SWE) automation.
Approach: They propose a reliable evaluation standard for automated environment configuration for 40 real-world repositories spanning 9 programming languages.
Outcome: The proposed benchmark includes 40 real-world repositories spanning 9 programming languages and measures success in achieving executable states and efficiency under realistic constraints.
Key Fact as Pivot: A Two-Stage Model for Low Resource Table-to-Text Generation (P19-1)

Copied to clipboard

Challenge: Existing methods for table-to-text generation use encoder-decoder framework, but lack of large parallel data is a problem for many domains.
Approach: They propose a model to separate table-to-text generation into two stages: key fact prediction and surface realization.
Outcome: The proposed model achieves 27.34 BLEU score with only 1,000 parallel data, while the baseline model only achieves 9.71 BLUE score.
A Probability–Quality Trade-off in Aligned Language Models and its Relation to Sampling Adaptors (2024.emnlp-main)

Copied to clipboard

Challenge: a relationship exists between the quality of a string and its probability, p(y), under a language model, and the quality and quality of the string.
Approach: They examine the probability-quality relationship in language models aligned to human preferences through reinforcement learning through human feedback.
Outcome: The proposed method improves the quality of text sampled from a language model by skewing the model towards high-probability strings.
Quest2DataAgent: Automating End-to-End Scientific Data Collection (2025.emnlp-demos)

Copied to clipboard

Challenge: Existing approaches for data collection are labor-intensive and dependent on domain expertise.
Approach: They propose a general-purpose multi-agent framework for automating scientific data collection workflows.
Outcome: The proposed framework improves data relevance, usability, and time efficiency over existing methods.
ReEx-SQL: Reasoning with Execution-Aware Reinforcement Learning for Text-to-SQL (2026.acl-long)

Copied to clipboard

Challenge: Current Text-to-SQL reasoning models lack integrated execution feedback during generation.
Approach: They propose a text-to-SQL framework that interacts with the SQL execution engine during decoding and dynamically adjusts reasoning based on execution feedback.
Outcome: The proposed framework achieves 89.1% accuracy on Spider and 65.3% on BIRD at the 7B scale.
A Token-level Reference-free Hallucination Detection Benchmark for Free-form Text Generation (2022.acl-long)

Copied to clipboard

Challenge: Existing work on pre-trained generative models often fails to detect non-existent or incorrect content . Existing studies have attempted to detect hallucinations based on oracle references .
Approach: They propose a token-level, reference-free hallucination detection task based on Wikipedia annotations to detect non-existent or incorrect content.
Outcome: The proposed task is token-level, reference-free hallucination detection task and dataset . authors argue that the proposed task can be used in real-time to detect hallucines .
Pointwise Mutual Information as a Performance Gauge for Retrieval-Augmented Generation (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods to improve language models' performance do not exploit this phenomenon .
Approach: They propose to use contextual information to select and construct prompts that improve model performance.
Outcome: The proposed methods show that the mutual information between a context and a question is an effective gauge for language model performance.
Efficiently Computing Susceptibility to Context in Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: a current language model is able to incorporate information from a user-input context when answering queries, but it is not equally sensitive to subtle changes to that context.
Approach: They propose a metric to quantify the degree to which contexts can influence a model’s response to a query at a distributional level.
Outcome: The proposed method is comparable to Monte Carlo's estimated susceptibility across a diverse set of query domains despite being 70 faster.
Manual Evaluation Matters: Reviewing Test Protocols of Distantly Supervised Relation Extraction (2021.findings-acl)

Copied to clipboard

Challenge: Distantly supervised relation extraction (RE) has attracted much attention in the past few years . previous methods to evaluate models manually or directly on autolabeled data have produced inaccurate evaluations .
Approach: They propose to use distant supervision to generate large-scale autolabeled data . they build manually-annotated test sets for two DS-RE datasets and evaluate models .
Outcome: The proposed method produces 53% wrong labels at the entity pair level in the popular NYT10 dataset.
BlonDe: An Automatic Evaluation Metric for Document-level Machine Translation (2022.naacl-main)

Copied to clipboard

Challenge: Standard evaluation metrics, e.g., BLEU, TER and METEOR, focus on the quality of translations at the sentence level and do not consider discourse-level features.
Approach: They propose to use a metric to take discourse coherence into consideration by categorizing discourse-related spans and calculating the similarity-based F1 measure of categorized spans.
Outcome: The proposed metric possesses better selectivity and interpretability at the document-level, and is more sensitive to document- level nuances.
A Structured Span Selector (2022.naacl-main)

Copied to clipboard

Challenge: a typical approach to natural language processing tasks involves selecting text spans and making decisions about them.
Approach: They propose a grammar-based structured span selection model which learns to make use of partial span annotations.
Outcome: The proposed model improves on two popular span prediction tasks.
COIG-P: A High-Quality and Large-Scale Chinese Preference Dataset for Alignment with Human Values (2026.findings-eacl)

Copied to clipboard

Challenge: Existing Chinese preference datasets suffer from limited scale, restricted domain coverage, and insufficiently rigorous data validation.
Approach: They propose an LLM-based data annotation pipeline with no human intervention to annotate Chinese preference datasets.
Outcome: The proposed pipeline outperforms existing Chinese preference datasets on AlignBench and Chinese Reward Benchmark.
Towards Improving Neural Named Entity Recognition with Gazetteers (P19-1)

Copied to clipboard

Challenge: Currently, neural models for named entity recognition are based on data-driven models, with a strong emphasis on getting rid of the efforts for collecting external resources or designing hand-crafted features.
Approach: They propose to use external gazetteers to efficiently access annotated data to generalize beyond the annotation of entities.
Outcome: The proposed model can access external gazetteers while avoiding the effort to design hand-crafted features.
ATP: AMRize Then Parse! Enhancing AMR Parsing with PseudoAMRs (2022.findings-naacl)

Copied to clipboard

Challenge: Abstract Meaning Representation (AMR) implicitly involves compound semantic annotations.
Approach: They propose to use auxiliary tasks which are semantically or formally related to enhance AMR parsing.
Outcome: The proposed method achieves state-of-the-art performance on benchmarks especially in topology-related scores.
Well Begun is Half Done: Low-resource Preference Alignment by Weak-to-Strong Decoding (2025.findings-acl)

Copied to clipboard

Challenge: Low-resource methods for LLM alignment have been popular, but still face challenges in obtaining high-quality and aligned content.
Approach: They propose a framework to enhance alignment ability of base models by the guidance of a small aligned model.
Outcome: The proposed framework outperforms baseline methods while avoiding degradation on downstream tasks.
PCA-Bench: Evaluating Multimodal Large Language Models in Perception-Cognition-Action Chain (2024.findings-acl)

Copied to clipboard

Challenge: a new multimodal decision-making benchmark evaluates the integrated capabilities of multimodal large language models.
Approach: They propose a multimodal decision-making benchmark for evaluating MLLMs . they propose an automatic evaluation protocol to assess 10 prevalent ML models .
Outcome: The proposed benchmark improves performance of multimodal large language models in three scenarios . the model is required to integrate multiple capabilities to make accurate decisions .
Qwen2.5-xCoder: Multi-Agent Collaboration for Multilingual Code Instruction Tuning (2025.acl-long)

Copied to clipboard

Challenge: Existing methods to train code LLMs view each programming language in isolation . experimental results show that Qwen2.5-xCoder can bridge the gap between different programming languages .
Approach: They propose a framework that allows agents to collaborate to enhance multilingual instruction tuning for code LLMs.
Outcome: Experimental results show that Qwen2.5-xCoder can transfer knowledge efficiently and effectively between languages.
An Enhanced Span-based Decomposition Method for Few-Shot Sequence Labeling (2022.naacl-main)

Copied to clipboard

Challenge: Existing approaches to tagging tasks are limited to predefined classes and require large-scale annotated data.
Approach: They propose an Enhanced Span-based Decomposition method for Few-Shot Sequence Labeling to generalize on emerging, resource-scare domains.
Outcome: The proposed method achieves state-of-the-art results on two popular FSSL benchmarks, FewNERD and SNIPS, and is more robust in noisy and nested tagging scenarios.
Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have a high inference latency stemming from autoregressive decoding.
Approach: They propose a novel decoding paradigm that drafts multiple tokens and verifies them in parallel . they aim to provide a catalyst for further research on Speculative Decoding .
Outcome: The proposed method drafts multiple tokens and verifies them in parallel . it can be used to accelerate inference in large language models.
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.
Learning to Control the Fine-grained Sentiment for Story Ending Generation (P19-1)

Copied to clipboard

Challenge: Existing studies focus on controlling the sentiment of story endings.
Approach: They propose a generic and novel framework which controls fine-grained sentiment intensity for automatic story ending generation without manually annotating sentiment labels.
Outcome: The proposed framework can generate story endings which meet the given sentiment intensity better.
MAAM: A Morphology-Aware Alignment Model for Unsupervised Bilingual Lexicon Induction (P19-1)

Copied to clipboard

Challenge: Existing work shows that morphological variation is an intractable challenge for the unsupervised bilingual lexicon induction task.
Approach: They propose a morphology-aware alignment model to alleviate the adverse effect of morphological variation by introducing grammatical information learned by the pre-trained denoising language model.
Outcome: The proposed model outperforms state-of-the-art unsupervised systems and achieves competitive performance compared to supervised methods.
Incentivizing Parametric Knowledge via Reinforcement Learning with Verifiable Rewards for Cross-Cultural Entity Translation (2026.acl-long)

Copied to clipboard

Challenge: Current systems often fall short of this goal in settings where translation hinges on culturally grounded entities such as books, films, places, songs and idioms.
Approach: They propose a framework that anchors supervision on a verifiable, entity-level reward signal and incorporates lightweight structural gates to stabilize optimization.
Outcome: The proposed framework improves on XC-Translate and shows that it can learn a robust reasoning process rather than imitating reference translations.
Faster and Better LLMs via Latency-Aware Test-Time Scaling (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing research has overlooked the efficiency of TTS from a latency-sensitive perspective.
Approach: They propose two approaches to achieve latency-optimal TTS by branch-wise parallelism and sequence-wise parallelism.
Outcome: The proposed approach achieves latency-optimal TTS for large models . branch-wise parallelism and sequence-wise parallelism are key approaches .
Continual Relation Learning via Episodic Memory Activation and Reconsolidation (2020.acl-main)

Copied to clipboard

Challenge: Existing methods to learn incessantly emerging novel relations are overfitting the few memorized examples of old relations, causing confusion among existing relations.
Approach: They introduce episodic memory activation and reconsolidation (EMAR) to continual relation learning.
Outcome: The proposed method outperforms state-of-the-art models in catastrophic forgetting old relations.
Towards A Better Initial Policy Model For Scalable Long-CoT Reinforcement Learning (2025.findings-acl)

Copied to clipboard

Challenge: Long-CoT reasoning and reinforcement learning are demonstrating remarkable performance and scalability, however, there is a lack of systematic guidelines for obtaining a better initial policy model.
Approach: They propose a systematic guideline and a novel Re-RFT method to obtain more efficient reasoning patterns from different initial models.
Outcome: The proposed method surpasses DeepSeek-R1-Distill-Qwen-14B model by 4.6%, demonstrating its effectiveness and superiority.
SARA: Unlocking Multilingual Knowledge in Mixture-of-Experts via Semantically Anchored Routing Alignment (2026.findings-acl)

Copied to clipboard

Challenge: Low-resource language tokens are often routed to different experts than those activated by high-resourced inputs, which hinders their efficacy in multilingual contexts.
Approach: They propose a framework to transfer specialized capabilities from high-resource languages as anchors to low-resourced languages by using a symmetric Jensen-Shannon constraint.
Outcome: The proposed framework outperforms standard instruction tuning on 5 low-resource languages and 3 benchmarks.
HSS-Synth: Humanities and Social Sciences Data Synthesis for LLMs (2026.findings-acl)

Copied to clipboard

Challenge: High-quality, diverse data are vital for large language models (LLMs) but remain scarce and costly.
Approach: They define the first HSS domain system covering 14 mainstream fields and introduce HSS-Synth.
Outcome: the proposed pipeline outperforms 14 leading baselines on 16 benchmarks.
Incorporating Glosses into Neural Word Sense Disambiguation (P18-1)

Copied to clipboard

Challenge: Existing neural networks for Word Sense Disambiguation rely on labeled data and lexical knowledge.
Approach: They propose a gloss-augmented WSD neural network which integrates context and glosses of the target word into a unified framework.
Outcome: The proposed model outperforms the state-of-the-art systems on several English all-words WSD datasets.
Phrase-level Self-Attention Networks for Universal Sentence Encoding (D18-1)

Copied to clipboard

Challenge: Phrase-level self-attention networks (PSAN) can capture context dependencies at the phrase level instead of the sentence level.
Approach: They propose to perform self-attention across words inside a phrase to capture context dependencies at the phrase level and use the gated memory updating mechanism to refine each word’s representation hierarchically with longer-term context dependency captured in a larger phrase.
Outcome: The proposed model can achieve state-of-the-art performance across a plethora of NLP tasks including binary and multi-class classification, natural language inference and sentence similarity.
COIG-CQIA: Quality is All You Need for Chinese Instruction Fine-tuning (2025.findings-naacl)

Copied to clipboard

Challenge: Existing datasets for Chinese instruction tuning are not well-aligned with Chinese users’ interaction patterns.
Approach: They propose to use Chinese instruction tuning datasets to improve instruction fine-tuning for Chinese users.
Outcome: The proposed dataset shows that Chinese models achieve competitive performance in diverse benchmarks.
CFinBench: A Comprehensive Chinese Financial Benchmark for Large Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have achieved remarkable performance on various NLP tasks, yet their potential in more challenging task like finance, has not been fully explored.
Approach: They propose a benchmark to assess the financial knowledge of large language models (LLMs) in China.
Outcome: The proposed benchmark is the most comprehensive evaluation benchmark to date for LLMs in finance.
FolkScope: Intention Knowledge Graph Construction for E-commerce Commonsense Discovery (2023.findings-acl)

Copied to clipboard

Challenge: Existing intention-based studies on recommendation tasks are limited and use models to implicitly model the intention memberships.
Approach: They propose a framework that leverages the generation power of large language models and human-in-the-loop annotation to semi-automatically construct the intention knowledge graph.
Outcome: The proposed framework can model e-commerce knowledge and have many potential applications.
CodeV: Issue Resolving with Visual Data (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have expanded to more complex repository-level tasks.
Approach: They propose a first approach to leveraging visual data to enhance the issue-resolving capabilities of Large Language Models (LLMs) they demonstrate the effectiveness of CodeV and provide valuable insights into leveraging visualization to resolve GitHub issues.
Outcome: The proposed approach improves the issue-resolving capabilities of Large Language Models (LLMs) by using visual data.
Decompose, Fuse and Generate: A Formation-Informed Method for Chinese Definition Generation (2021.naacl-main)

Copied to clipboard

Challenge: Existing definition generation methods take the source word as an indecomposable semantic unit, but in parataxis languages like Chinese, word meanings can be composed using the word formation process.
Approach: They propose to use word formation features to enhance Definition Generation (DG) in Chinese to generate an explanatory text.
Outcome: The proposed model enhances Definition Generation (DG) in Chinese by decomposing the word meaning into different semantic components.
LIME: Less Is More for MLLM Evaluation (2025.findings-acl)

Copied to clipboard

Challenge: Existing MLLM benchmarks and unified evaluation frameworks cannot accurately and efficiently reflect the ability of MLMLs.
Approach: They propose a semi-automated benchmark curated using a pipeline that filters out uninformative samples and eliminates answer leakage by focusing on tasks that require image-based understanding.
Outcome: The proposed benchmark reduces the number of samples by 76% and evaluation time by 77% while it can more effectively distinguish different models’ abilities.
Learning from Context or Names? An Empirical Study on Neural Relation Extraction (2020.emnlp-main)

Copied to clipboard

Challenge: Existing datasets may leak shallow heuristics via entity mentions, thus contributing to the high performance on RE benchmarks.
Approach: They propose an entity-masked contrastive framework for relation extraction to gain a deeper understanding on textual context and type information while avoiding rote memorization of entities.
Outcome: The proposed framework improves the effectiveness and robustness of neural models in different RE scenarios.
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.
Geneverse: A Collection of Open-source Multimodal Large Language Models for Genomic and Proteomic Research (2024.findings-emnlp)

Copied to clipboard

Challenge: generative Large Language Models (LLMs) are a promising tool for biomedical and healthcare research.
Approach: They propose to use finetuned LLMs and multimodal LLM for genomic and proteomics tasks.
Outcome: The proposed models outperform closed-source models in genomic and proteomics tasks and are highly accurate.
MMEvalPro: Calibrating Multimodal Benchmarks Towards Trustworthy and Efficient Evaluation (2025.naacl-long)

Copied to clipboard

Challenge: Large Multimodal Models (LMMs) exhibit impressive cross-modal understanding and reasoning abilities, but many benchmarks suffer from systematic biases.
Approach: They propose a benchmark to avoid Type-I errors by creating one perception question and one knowledge anchor question through a meticulous annotation process.
Outcome: The proposed benchmark avoids Type-I errors while maintaining reliability of MCQ evaluations.
DialogVCS: Robust Natural Language Understanding in Dialogue System Upgrade (2024.naacl-long)

Copied to clipboard

Challenge: Existing models for natural language understanding are based on a well-defined intent 1 ontology.
Approach: They propose to retrain the natural language understanding model as new data from real users are merged into existing data.
Outcome: The proposed model shows that the semantically entangled intents can be recognized with an automatic workflow.
ERA-CoT: Improving Chain-of-Thought through Entity Relationship Analysis (2024.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated remarkable in-context learning capabilities in various natural language processing tasks.
Approach: They propose a novel approach ERA-CoT which aids LLMs in understanding context by capturing relationships between entities and supports the reasoning of diverse tasks through Chain-of-Thoughts (CoT).
Outcome: The proposed method improves on GPT3.5 and previous SOTA prompting methods by an average of 5.1% compared to previous prompting approaches.
Leveraging Gloss Knowledge in Neural Word Sense Disambiguation by Hierarchical Co-Attention (D18-1)

Copied to clipboard

Challenge: Existing models for Word Sense Disambiguation use labeled data, but lack gloss knowledge.
Approach: They propose a co-attention mechanism to generate co-dependent representations for context and gloss . they propose to incorporate gloss knowledge into neural networks for Word Sense Disambiguation .
Outcome: The proposed model achieves state-of-the-art results on standard English all-words WSD datasets.
OpenCodeInterpreter: Integrating Code Generation with Execution and Refinement (2024.findings-acl)

Copied to clipboard

Challenge: OpenCodeInterpreter-33B provides a high level of performance for code generation, executing, and iterative refinement.
Approach: They propose a family of open-source code systems for generating, executing, and iteratively refining code.
Outcome: The OpenCodeInterpreter-33B performs well on humanEval, MBPP, and EvalPlus benchmarks.
MLAS-LoRA: Language-Aware Parameters Detection and LoRA-Based Knowledge Transfer for Multilingual Machine Translation (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated strong performance even with limited parallel data.
Approach: They propose a multiple language-aware LoRA knowledge transfer framework that selectively adapts LLMs to MT by transferring knowledge from a large teacher to a small student model.
Outcome: The proposed framework outperforms baseline models on multilingual language pairs by +1.7 BLEU on average.
LLaTiSA: Towards Difficulty-Stratified Time Series Reasoning from Visual Perception to Semantics (2026.findings-acl)

Copied to clipboard

Challenge: Current research hinders the development of unified Time Series Reasoning Models (TSRMs) time series data are a fundamental modality for capturing the temporal dynamics of complex systems.
Approach: They propose a time series reasoning model that integrates visualized patterns with precision-calibrated numerical tables to enhance the temporal perception of Vision-Language Models.
Outcome: The proposed model outperforms existing models and exhibits robust out-of-distribution generalization across diverse tasks and real-world scenarios.
Taking a Deep Breath: Enhancing Language Modeling of Large Language Models with Sentinel Tokens (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing studies have explored compression and accumulation methods to compress contexts, but these methods lose useful context information during the compression process, leading to performance degradation.
Approach: They propose a method that allows LLMs to take a deep breath and insert a special token at the end of each chunk.
Outcome: Experiments on language modeling and out-of-domain tasks validate the superiority of the proposed method.
LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation (2026.findings-acl)

Copied to clipboard

Challenge: Speculative decoding (SD) is a promising technique for LLM inference acceleration.
Approach: They propose a method to generate draft tokens in a retrieval-based manner to reduce drafting overhead and improve inference speed.
Outcome: Extensive tests show that *LogitSpec* can achieve 2.61 speedup and 3.28 mean accepted tokens per decoding step.

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