Transactions of the Association for Computational Linguistics
type: channel
description: Welcome to the TACL submission site! Transactions of the Association for Computational Linguistics (TACL) is an ACL-sponsored journal published by MIT Press that publishes papers in all areas of computational linguistics and natural language processing. TACL has the following features: TACL publishes conference-length papers, but has a journal-style reviewing process (for example, the option for an action editor to recommend the “revise and resubmit” category for a paper). Papers appearing at TACL are eligible for a presentation at certain ACL-sponsored conferences. Thus the model combines the benefits of a journal, with the benefits of being able to present the work at a major conference. (Presentation is optional; authors do not have to present their papers at the conference). TACL accepts submissions all year (the 1st day of each month is a submission deadline). TACL is committed to fast-turnaround reviewing. Links: Information for authors, including submission instructions; review process; annual reports (includes journal statistics presented to the ACL); publication ethics statement.
publisher: The MIT Press
language: en-US
publication name: Transactions of the Association for Computational Linguistics
issn: 2307-387X
copyright: Copyright for TACL papers is held by the Association for Computational Linguistics, and articles are distributed under Creative Commons License CC-BY. However, for TACL papers published in volumes 1 or 2 or in volume 3 up to and including page 403, the original published pdfs may not include a note about licensing or may mention Creative Commons License CC-BY-NC-SA 4.0 instead.
items: Efficient Tuning of Large Language Models for Knowledge-Grounded Dialogue Generation
items: A Systematic Review of NLP for Dementia: Tasks, Datasets and Opportunities
items: TALE: Token-Adaptive Low-Rank KVCache Approximation with Reconstruction Elimination
items: Large Language Models Are Human-Like Internally
items: BenCzechMark : A Czech-centric Multitask and Multimetric Benchmark for Large Language Models with Duel Scoring Mechanism
items: Adding Chocolate to MINT: Mitigating Metric Interference in Machine Translation
items: Objectifying the Subjective: Cognitive Biases in Topic Interpretations
items: Elements of World Knowledge (EWoK)
items: End-to-End Long Document Summarization using Gradient Caching
items: MURI: High-Quality Instruction Tuning Datasets for Low-Resource Languages via Reverse Instructions
items: CRAFT Your Dataset: Task-Specific Synthetic Dataset Generation Through Corpus Retrieval and Augmentation
items: Human Choice Prediction in Language-Based Persuasion Games: Simulation-Based Off-Policy Evaluation
items: Adversarial Defence without Adversarial Defence: Enhancing Language Model Robustness via Instance-level Principal Component Removal
items: Exploring Practical Gaps in Using Cross Entropy to Implement Maximum Mutual Information Criterion for Rationalization
items: Benchmarking Linguistic Diversity of Large Language Models
items: Do Large Multimodal Models Solve Caption Generation for Scientific Figure? Lessons Learned from SciCap Challenge 2023
items: MTRAG: A Multi-Turn Conversational Benchmark for Evaluating Retrieval-Augmented Generation Systems
items: Culturally Aware and Adapted NLP: A Taxonomy and a Survey of the State of the Art
items: KEFT: Knowledge-Enhanced Fine-Tuning for Large Language Models in Domain-Specific Question Answering
items: Active Knowledge Structuring for Large Language Models in Materials Science Text Mining
items: How to Select Datapoints for Efficient Human Evaluation of NLG Models?
items: A Unifying Scheme for Extractive Content Selection Tasks
items: Early Detection and Reduction of Memorisation for Domain Adaptation and Instruction Tuning
items: Towards More Realistic Extraction Attacks: An Adversarial Perspective
items: The Frame Representation Hypothesis: Multi-Token LLM Interpretability and Concept-Guided Text Generation
items: Overcoming Source Object Grounding for Semantic Image Editing
items: Explanatory Summarization with Discourse-Driven Planning
items: On the Effect of Instruction Tuning Loss on Generalization
items: BharatBBQ: A Multilingual Bias Benchmark for Question Answering in the Indian Context
items: Are Triggers Needed for Document-Level Event Extraction?
items: Safe Pruning LoRA: Robust Distance-Guided Pruning for Safety Alignment in Adaptation of LLMs
items: Surveying the Landscape of Image Captioning Evaluation: A Comprehensive Taxonomy, Trends and Metrics Analysis
items: FoVer: First-Order Logic Verification for Natural Language Reasoning
items: DARE: Diverse Visual Question Answering with Robustness Evaluation
items: Continual Pre-training on Character-level Noisy Texts Makes Decoder-based Language Models Robust Few-shot Learners
items: CRVQ: Channel-Relaxed Vector Quantization for Extreme Compression of LLMs
items: Accurate and Efficient Fine-Tuning of Quantized Large Language Models Through Optimal Balance in Adaptation
items: MAKE: Memory-Associated Knowledge Editing
items: OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure
items: Know Your Limits: A Survey of Abstention in Large Language Models
items: DOLOMITES: Domain-Specific Long-Form Methodical Tasks
items: Investigating Adversarial Trigger Transfer in Large Language Models
items: Supervised Neural Topic Modeling with Label Alignment
items: The Thai Universal Dependency Treebank
items: DEAR: Disentangled Event-Agnostic Representation Learning for Early Fake News Detection
items: NLP Security and Ethics, in the Wild
items: Understanding Epistemic Language with a Language-augmented Bayesian Theory of Mind
items: Salute the Classic: Revisiting Challenges of Machine Translation in the Age of Large Language Models
items: Diverse AI Feedback for Large Language Model Alignment
items: LLM Reading Tea Leaves: Automatically Evaluating Topic Models with Large Language Models
items: Investigating Critical Period Effects in Language Acquisition through Neural Language Models
items: Benchmarking Uncertainty Quantification Methods for Large Language Models with LM-Polygraph
items: Analyzing and Adapting Large Language Models for Few-Shot Multilingual NLU: Are We There Yet?
items: From Robustness to Improved Generalization and Calibration in Pre-trained Language Models
items: Phonetic Reconstruction of the Consonant System of Middle Chinese via Mixed Integer Optimization
items: Learning Syntax Without Planting Trees: Understanding Hierarchical Generalization in Transformers
items: SPIRIT-LM: Interleaved Spoken and Written Language Model
items: A Comparative Approach for Auditing Multilingual Phonetic Transcript Archives
items: Navigating the Landscape of Hint Generation Research: From the Past to the Future
items: REAL Sampling: Boosting Factuality and Diversity of Open-Ended Generation by Extrapolating the Entropy of an Infinitely Large LM
items: Sense-Specific Historical Word Usage Generation
items: How much Semantic Information is Available in Large Language Model Tokens?
items: Prompt Contrastive Transformation: An Enhanced Strategy for Efficient Prompt Transfer in Natural Language Processing
items: Contextualized Evaluations: Taking the Guesswork Out of Language Model Evaluations
items: STPar: A Structure-Aware Triaffine Parser for Screenplay Character Coreference Resolution
items: TANQ: An open domain dataset of table answered questions
items: A Confidence-based Acquisition Model for Self-supervised Active Learning and Label Correction
items: Self-Rationalization in the Wild: A Large Scale Out-of-Distribution Evaluation on NLI-related tasks
items: Patchwise Cooperative Game-based Interpretability Method for Large Vision-Language Models
items: TaxoPro: A Plug-In LoRA-based Cross-Domain Method for Low-Resource Taxonomy Completion
items: Transformers as Transducers
items: How "Real" is Your Real-Time Simultaneous Speech-to-Text Translation System?

Efficient Tuning of Large Language Models for Knowledge-Grounded Dialogue Generation
type: item
description: Large language models (LLMs) demonstrate remarkable text comprehension and generation capabilities but often lack the ability to utilize up-to-date or domain-specific knowledge not included in their training data. To address this gap, we introduce KEDiT, an efficient method for fine-tuning LLMs for knowledge-grounded dialogue generation. KEDiT operates in two main phases: first, it employs an information bottleneck to compress retrieved knowledge into learnable parameters, retaining essential information while minimizing computational overhead. Second, a lightweight knowledge-aware adapter integrates these compressed knowledge vectors into the LLM during fine-tuning, updating less than 2% of the model parameters. The experimental results on the Wizard of Wikipedia and a newly constructed PubMed-Dialog dataset demonstrate that KEDiT excels in generating contextually relevant and informative responses, outperforming competitive baselines in automatic, LLM-based, and human evaluations. This approach effectively combines the strengths of pretrained LLMs with the adaptability needed for incorporating dynamic knowledge, presenting a scalable solution for fields such as medicine.
creator: Bo Zhang
creator: Hui Ma
creator: Dailin Li
creator: Jian Ding
creator: Jian Wang
creator: Bo Xu
creator: HongFei Lin
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

A Systematic Review of NLP for Dementia: Tasks, Datasets and Opportunities
type: item
description: The close link between cognitive decline and language has fostered long-standing collaboration between the NLP and medical communities in dementia research. To examine this, we reviewed over 240 papers applying NLP to dementia-related efforts, drawing from medical, technological, and NLP-focused literature. We identify key research areas, including dementia detection, linguistic biomarker extraction, caregiver support, and patient assistance, showing that half of all papers focus solely on dementia detection using clinical data. Yet, many directions remain unexplored- artificially degraded language models, synthetic data, digital twins, and more. We highlight gaps and opportunities around trust, scientific rigor, applicability and cross-community collaboration. We raise ethical dilemmas in the field, and highlight the diverse datasets encountered throughout our review- recorded, written, structured, spontaneous, synthetic, clinical, social media-based, and more. This review aims to inspire more creative, impactful, and rigorous research on NLP for dementia.
creator: Lotem Peled-Cohen
creator: Roi Reichart
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

TALE: Token-Adaptive Low-Rank KVCache Approximation with Reconstruction Elimination
type: item
description: KVCache, by storing key-value pairs for reuse, has been crucial for enhancing inference efficiency, for large language models (LLMs). However, the increasing memory demands of KVCache, especially with recent trends of longer input sequences, present a major challenge. In this work, we propose an innovative token-adaptive low-rank approximation strategy for KVCache compression. By applying varying ranks based on token significance, our method compresses KVCache efficiently while retaining critical information. Moreover, we introduce a lazy approximation technique, which approximates lazily only when needed, alongside a reconstruction-free design to bypass costly recalculations. Combined with multi-level quantization, this method reduces KVCache size by 9.1x on the Llama-3.1-8B model, with minimal performance degradation on complex tasks such as GSM8K. Moreover, our custom attention implementation shows up to 2x latency reduction compared to the conventional method in long context scenarios. The code is publicly available.
creator: Jaeseong Lee
creator: seung-won Hwang
creator: Aurick Qiao
creator: Daniel Campos
creator: Zhewei Yao
creator: Yuxiong He
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Large Language Models Are Human-Like Internally
type: item
description: Recent cognitive modeling studies have reported that larger language models (LMs) exhibit a poorer fit to human reading behavior (Oh and Schuler, 2023b; Shain et al., 2024; Kuribayashi et al., 2024), leading to claims of their cognitive implausibility. In this paper, we revisit this argument through the lens of mechanistic interpretability and argue that prior conclusions were skewed by an exclusive focus on the final layers of LMs. Our analysis reveals that next-word probabilities derived from internal layers of larger LMs align with human sentence processing data as well as, or better than, those from smaller LMs. This alignment holds consistently across behavioral (self-paced reading times, gaze durations, MAZE task processing times) and neurophysiological (N400 brain potentials) measures, challenging earlier mixed results and suggesting that the cognitive plausibility of larger LMs has been underestimated. Furthermore, we first identify an intriguing relationship between LM layers and human measures: earlier layers correspond more closely with fast gaze durations, while later layers better align with relatively slower signals such as N400 potentials and MAZE processing times. Our work opens new avenues for interdisciplinary research at the intersection of mechanistic interpretability and cognitive modeling.
creator: Tatsuki Kuribayashi
creator: Yohei Oseki
creator: Souhaib Ben Taieb
creator: Kentaro Inui
creator: Timothy Baldwin
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

BenCzechMark : A Czech-centric Multitask and Multimetric Benchmark for Large Language Models with Duel Scoring Mechanism
type: item
description: We present BenCzechMark (BCM), the first comprehensive Czech language benchmark designed for large language models, offering diverse tasks, multiple task formats, and multiple evaluation metrics. Its duel scoring system is grounded in statistical significance theory and uses aggregation across tasks inspired by social preference theory. Our benchmark encompasses 50 challenging tasks, with corresponding test datasets, primarily in native Czech, with 14 newly collected ones. These tasks span 8 categories and cover diverse domains, including historical Czech news, essays from pupils or language learners, and spoken word. Furthermore, we collect and clean BUT-Large Czech Collection, the largest publicly available clean Czech language corpus, and use it for (i) contamination analysis and (ii) continuous pretraining of the first Czech-centric 7B language model with Czech-specific tokenization. We use our model as a baseline for comparison with publicly available multilingual models. Lastly, we release and maintain a leaderboard with existing 50 model submissions, where new model submissions can be made at https://huggingface.co/spaces/ CZLC/BenCzechMark.
creator: Martin Fajcik
creator: Martin Dočekal
creator: Jan Doležal
creator: Karel Ondřej
creator: Karel Beneš
creator: Michal Hradiš
creator: Pavel Smrž
creator: Alexander Polok
creator: Jan Kapsa
creator: Zuzana Nevěřilová
creator: Aleš Horák
creator: Radoslav Sabol
creator: Michal Štefánik
creator: Adam Jirkovský
creator: David Adamczyk
creator: Petr Hyner
creator: Jan Hůla
creator: Hynek Kydlíček
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Adding Chocolate to MINT: Mitigating Metric Interference in Machine Translation
type: item
description: As automatic metrics become increasingly stronger and widely adopted, the risk of unintentionally “gaming the metric” during model development rises. This issue is caused by metric interference (MINT), i.e., the use of the same or related metrics for both model tuning and evaluation. MINT can misguide practitioners into being overoptimistic about the performance of their systems: as system outputs become a function of the interfering metric, their estimated quality loses correlation with human judgments. In this work, we analyze two common cases of MINT in machine translation-related tasks: filtering of training data, and decoding with quality signals. Importantly, we find that MINT strongly distorts instance-level metric scores, even when metrics are not directly optimized for—questioning the common strategy of leveraging a different, yet related metric for evaluation that is not used for tuning. To address this problem, we propose MINTADJUST, a method for more reliable evaluation under MINT. On the WMT24 MT shared task test set, MINTADJUST ranks translations and systems more accurately than state-of-the-art-metrics across a majority of language pairs, especially for high-quality systems. Furthermore, MINTADJUST outperforms AUTORANK, the ensembling method used by the organizers.
creator: José Pombal
creator: Nuno Guerreiro
creator: Ricardo Rei
creator: André Martins
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Objectifying the Subjective: Cognitive Biases in Topic Interpretations
type: item
description: Interpretation of topics is crucial for their downstream applications. State-of-the-art evaluation measures of topic quality such as coherence and word intrusion do not measure how much a topic facilitates the exploration of a corpus. To design evaluation measures grounded on a task, and a population of users, we do user studies to understand how users interpret topics. We propose constructs of topic quality and ask users to assess them in the context of a topic and provide rationale behind evaluations. We use reflexive thematic analysis to identify themes of topic interpretations from rationales. Users interpret topics based on availability and representativeness heuristics rather than probability. We propose a theory of topic interpretation based on the anchoring-and-adjustment heuristic: users anchor on salient words and make semantic adjustments to arrive at an interpretation. Topic interpretation can be viewed as making a judgment under uncertainty by an ecologically rational user, and hence cognitive biases aware user models and evaluation frameworks are needed.
creator: Swapnil Hingmire
creator: Zane Li
creator: Vivienne Zeng
creator: Ahmed Musa Awon
creator: Luiz Franciscatto Guerra
creator: Neil Ernst
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Elements of World Knowledge (EWoK)
type: item
description: The ability to build and reason about models of the world is essential for situated language understanding. But evaluating world modeling capabilities in modern AI systems—especially those based on language models—has proven challenging, in large part because of the difficulty of disentangling conceptual knowledge about the world from knowledge of surface co-occurrence statistics. This paper presents Elements of World Knowledge (EWoK), a framework for evaluating language models’ understanding of the conceptual knowledge underlying world modeling. EWoK targets specific concepts from multiple knowledge domains known to be important for world modeling in humans, from social interactions (help, deceive) to spatial relations (left, right). Objects, agents, and locations in the items can be flexibly filled in, enabling easy generation of multiple controlled datasets. We then introduce EWoK-core-1.0, a dataset of 4,374 items covering 11 world knowledge domains. We evaluate 20 open-weight large language models (1.3B–70B parameters) and compare them with human performance (12,480 measurements). All tested models perform worse than humans, with results varying drastically across domains. Performance on social interactions and social properties was highest and performance on physical relations and spatial relations was lowest. Overall, this dataset highlights simple cases where even large models fail and present rich avenues for targeted research on LLM world modeling capabilities.
creator: Anna Ivanova
creator: Aalok Sathe
creator: Benjamin Lipkin
creator: Unnathi Kumar
creator: Setayesh Radkani
creator: Thomas Clark
creator: Carina Kauf
creator: Jennifer Hu
creator: RT Pramod
creator: Gabriel Grand
creator: Vivian Paulun
creator: Maria Ryskina
creator: Ekin Akyürek
creator: Ethan Wilcox
creator: Nafisa Rashid
creator: Leshem Chosen
creator: Roger Levy
creator: Evelina Fedorenko
creator: Joshua Tenenbaum
creator: Jacob Andreas
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

End-to-End Long Document Summarization using Gradient Caching
type: item
description: Training transformer-based encoder-decoder models for long document summarization poses a significant challenge due to the quadratic memory consumption during training. Several approaches have been proposed to extend the input length at test time, but training with these approaches is still difficult, requiring truncation of input documents and causing a mismatch between training and test conditions. In this work, we propose CachED (Gradient Caching for Encoder-Decoder models), an approach that enables end-to-end training of existing transformer-based encoder-decoder models, using the entire document without truncation. Specifically, we apply non-overlapping sliding windows to input documents, followed by fusion in decoder. During backpropagation, the gradients are cached at the decoder and are passed through the encoder in chunks by re-computing the hidden vectors, similar to gradient checkpointing. In the experiments on long document summarization, we extend BART to CachED BART, processing more than 500K tokens during training and achieving superior performance without using any additional parameters.
creator: Rohit Saxena
creator: Hao Tang
creator: Frank Keller
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

MURI: High-Quality Instruction Tuning Datasets for Low-Resource Languages via Reverse Instructions
type: item
description: Instruction tuning enhances large language models (LLMs) by aligning them with human preferences across diverse tasks. Traditional approaches to create instruction tuning datasets face serious challenges for low-resource languages due to their dependence on data annotation. This work introduces a novel method, Multilingual Reverse Instructions (MURI), which generates high-quality instruction tuning datasets for low-resource languages without requiring human annotators or pre-existing multilingual models. Utilizing reverse instructions and a translation pipeline, MURI produces instruction-output pairs from existing human-written texts in low-resource languages. This method ensures cultural relevance and diversity by sourcing texts from different native domains and applying filters to eliminate inappropriate content. Our dataset, MURI-IT, includes more than 2 million instruction-output pairs across 200 languages. Evaluation by native speakers and fine-tuning experiments with mT5 models demonstrate the approach's effectiveness for both NLU and open-ended generation. We publicly release datasets and models at https://github.com/akoksal/ muri.
creator: Abdullatif Köksal
creator: Marion Thaler
creator: Ayyoob Imani
creator: Ahmet Üstün
creator: Anna Korhonen
creator: Hinrich Schütze
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

CRAFT Your Dataset: Task-Specific Synthetic Dataset Generation Through Corpus Retrieval and Augmentation
type: item
description: Building high-quality datasets for specialized tasks is a time-consuming and resource-intensive process that often requires specialized domain knowledge. We propose Corpus Retrieval and Augmentation for Fine-Tuning (CRAFT), a method for generating synthetic datasets, given a small number of user-written few-shots that demonstrate the task to be performed. Given these examples, CRAFT uses large-scale public web-crawled corpora and similarity-based document retrieval to find other relevant human-written documents. Lastly, instruction-tuned large language models (LLMs) augment the retrieved documents into custom-formatted task samples, which then can be used for fine-tuning. We demonstrate that CRAFT can efficiently generate large-scale task-specific training datasets for four diverse tasks: biology, medicine, and commonsense question-answering (QA), as well as summarization. Our experiments show that CRAFT-based models outperform or match general LLMs on QA tasks, while exceeding models trained on human-curated summarization data by 46 preference points. CRAFT outperforms other synthetic dataset generation methods such as Self- and Evol-Instruct, and remains robust even when the quality of the initial few-shots varies.
creator: Ingo Ziegler
creator: Abdullatif Köksal
creator: Desmond Elliott
creator: Hinrich Schütze
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Human Choice Prediction in Language-Based Persuasion Games: Simulation-Based Off-Policy Evaluation
type: item
description: Recent advances in Large Language Models (LLMs) have spurred interest in designing LLM-based agents for tasks that involve interaction with human and artificial agents. This paper addresses a key aspect in the design of such agents: predicting human decisions in off-policy evaluation (OPE). We focus on language-based persuasion games, where an expert aims to influence the decision-maker through verbal messages. In our OPE framework, the prediction model is trained on human interaction data collected from encounters with one set of expert agents, and its performance is evaluated on interactions with a different set of experts. Using a dedicated application, we collected a dataset of 87K decisions from humans playing a repeated decision-making game with artificial agents. To enhance off-policy performance, we propose a simulation technique involving interactions across the entire agent space and simulated decision-makers. Our learning strategy yields significant OPE gains, e.g., improving prediction accuracy in the top 15\% challenging cases by 7.1%.
creator: Eilam Shapira
creator: Omer Madmon
creator: Reut Apel
creator: Moshe Tennenholtz
creator: Roi Reichart
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Adversarial Defence without Adversarial Defence: Enhancing Language Model Robustness via Instance-level Principal Component Removal
type: item
description: Pre-trained language models (PLMs) have driven substantial progress in natural language processing but remain vulnerable to adversarial attacks, raising concerns about their robustness in real-world applications. Previous studies have sought to mitigate the impact of adversarial attacks by introducing adversarial perturbations into the training process, either implicitly or explicitly. While both strategies enhance robustness, they often incur high computational costs. In this work, we introduce a simple yet effective add-on module based on a variant of Principal Component Analysis to improve the adversarial robustness of PLMs. Specifically, our approach transforms the embedding space to approximate Gaussian properties, thereby reducing its susceptibility to adversarial perturbations while preserving semantic relationships. This transformation aligns embedding distributions in a way that minimises the impact of adversarial noise on decision boundaries, enhancing robustness without requiring adversarial examples or costly training-time augmentation. Evaluations on eight benchmark datasets show that our approach improves adversarial robustness while maintaining comparable before-attack accuracy to baselines, achieving a balanced trade-off between robustness and generalisation.
creator: Yang Wang
creator: Chenghao Xiao
creator: Yizhi Li
creator: Stuart E. Middleton
creator: Noura Al Moubayed
creator: Chenghua Lin
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Exploring Practical Gaps in Using Cross Entropy to Implement Maximum Mutual Information Criterion for Rationalization
type: item
description: Rationalization is a framework that aims to build self-explanatory NLP models by extracting a subset of human-intelligible pieces of their inputting texts. It involves a cooperative game where a selector selects the most human-intelligible parts of the input as the rationale, followed by a predictor that makes predictions based on these selected rationales. Existing literature uses the cross-entropy between the model's predictions and the ground-truth labels to measure the informativeness of the selected rationales, guiding the selector to choose better ones. In this study, we first theoretically analyze the objective of rationalization by decomposing it into two parts: the model-agnostic informativeness of the rationale candidates and the predictor's degree of fit. We then provide various empirical evidence to support that, under this framework, the selector tends to sample from a limited small region, causing the predictor to overfit these localized areas. This results in a significant mismatch between the cross-entropy objective and the informativeness of the rationale candidates, leading to suboptimal solutions. To address this issue, we propose a simple yet effective method that introduces random vicinal perturbations to the selected rationale candidates. This approach broadens the predictor's assessment to a vicinity around the selected rationale candidate. Compared to recent competitive methods, our method significantly improves rationale quality (by up to $6.6\%$) across six widely used classification datasets. Further experiments show that it can also generalize to the reading comprehension task and the fact extraction and verification task.
creator: Wei Liu
creator: Zhiying Deng
creator: Zhongyu Niu
creator: Jun Wang
creator: Haozhao Wang
creator: Ruixuan Li
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Benchmarking Linguistic Diversity of Large Language Models
type: item
description: The development and evaluation of Large Language Models (LLMs) has primarily focused on their task-solving capabilities, with recent models even surpassing human performance in some areas. However, this focus often neglects whether machine-generated language matches the human level of diversity, in terms of vocabulary choice, syntactic construction, and expression of meaning, raising questions about whether the fundamentals of language generation have been fully addressed. This paper emphasizes the importance of examining the preservation of human linguistic richness by language models, given the concerning surge in online content produced or aided by LLMs. We propose a comprehensive framework for evaluating LLMs from various linguistic diversity perspectives including lexical, syntactic, and semantic dimensions. Using this framework, we benchmark several state-of-the-art LLMs across all diversity dimensions, and conduct an in-depth case study for syntactic diversity. Finally, we analyze how different development and deployment choices impact the linguistic diversity of LLM outputs.
creator: Yanzhu Guo
creator: Guokan Shang
creator: Chloé Clavel
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Do Large Multimodal Models Solve Caption Generation for Scientific Figure? Lessons Learned from SciCap Challenge 2023
type: item
description: Since the SCICAP dataset’s launch in 2021, the research community has made significant progress in generating captions for scientific figures in scholarly articles. In 2023, the first SCICAP Challenge took place, inviting global teams to use an expanded SCICAP dataset to develop models for captioning diverse figure types across various academic fields. At the same time, text generation models advanced quickly, with many powerful pre-trained large multimodal models (LMMs) emerging that showed impressive capabilities in various vision-and-language tasks. This paper presents an overview of the first SCICAP Challenge and details the performance of various models on its data, capturing a snapshot of the field’s state. We found that professional editors overwhelmingly preferred figure captions generated by GPT-4V over those from all other models and even the original captions written by authors. Following this key finding, we conducted detailed analyses to answer this question: Have advanced LMMs solved the task of generating captions for scientific figures?
creator: Ting-Yao (Edward) Hsu
creator: Yi-Li Hsu
creator: Shaurya Rohatgi
creator: Chieh-Yang Huang
creator: Ho Yin Ng
creator: Ryan Rossi
creator: Sungchul Kim
creator: Tong Yu
creator: Lun-Wei Ku
creator: Clyde Lee Giles
creator: Ting-Hao 'Kenneth' Huang
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

MTRAG: A Multi-Turn Conversational Benchmark for Evaluating Retrieval-Augmented Generation Systems
type: item
description: Retrieval-augmented generation (RAG) has recently become a very popular task for Large Language Models (LLMs). Evaluating them on multi-turn RAG conversations, where the system is asked to generate a response to a question in the context of a preceding conversation is an important and often overlooked task with several additional challenges. We present MTRAG: an end-to-end human-generated multi-turn RAG benchmark that reflects several real-world properties across diverse dimensions for evaluating the full RAG pipeline. MTRAG contains 110 conversations averaging 7.7 turns each across four domains for a total of 842 tasks. We also explore automation paths via synthetic data and LLM-as-a-Judge evaluation. Our human and automatic evaluations show that even state-of-the-art LLM RAG systems struggle on MTRAG. We demonstrate the need for strong retrieval and generation systems that can handle later turns, unanswerable questions, non-standalone questions, and multiple domains. MTRAG is available at https://github.com/ibm/mt- rag-benchmark.
creator: Yannis Katsis
creator: Sara Rosenthal
creator: Kshitij Fadnis
creator: Chulaka Gunasekara
creator: Young-Suk Lee
creator: Lucian Popa
creator: Vraj Shah
creator: Huaiyu Zhu
creator: Danish Contractor
creator: Marina Danilevsky
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Culturally Aware and Adapted NLP: A Taxonomy and a Survey of the State of the Art
type: item
description: The surge of interest in culture in NLP has inspired much recent research, but a shared understanding of "culture" remains unclear, making it difficult to evaluate progress in this emerging area. Drawing on prior research in NLP and related fields, we propose a fine-grained taxonomy of elements in culture that can provide a systematic framework for analyzing and understanding research progress. Using the taxonomy, we survey existing resources and methods for culturally aware and adapted NLP, providing an overview of the state of the art and the research gaps that still need to be filled.
creator: Chen Cecilia Liu
creator: Iryna Gurevych
creator: Anna Korhonen
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

KEFT: Knowledge-Enhanced Fine-Tuning for Large Language Models in Domain-Specific Question Answering
type: item
description: The rapid advancement of large language models (LLMs) has opened up promising opportunities for their downstream applications in question-answering (QA), such as ChatGPT, ChatGLM, etc. However, such LLMs do not perform very well in domain-specific QA tasks without fine-tuning. But directly fine-tuning LLMs on domain-specific corpus data may lead to catastrophic forgetting, causing the LLMs to lose their general language capability. To address this problem, we propose the Knowledge-Enhanced Fine-Tuning (KEFT) method, an unsupervised fine-tuning approach to enhance the knowledge capability of LLMs in domain-specific QA tasks while preserving their general language capability. KEFT leverages the inherent language comprehension of pre-trained LLMs to generate synthetic-QA datasets from domain-specific corpus data autonomously for fine-tuning, and adopts a Low-Rank Adaptation (LoRA) method to further alleviate over-fitting. Furthermore, to enhance the representation of domain-specific knowledge, we introduce a knowledge-enhanced fine-tuning loss function, which encourages the model to learn the knowledge-question connection, thereby generating natural and knowledgeable answers. Our evaluations across multiple domain-specific datasets demonstrate that KEFT surpasses state-of-the-art fine-tuning approaches, enhancing the performance of various LLMs in QA tasks in both English and Chinese languages.
creator: Haiyun Li
creator: Jixin Zhang
creator: Hua Shen
creator: Ke Cheng
creator: Xiaofeng Huang
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Active Knowledge Structuring for Large Language Models in Materials Science Text Mining
type: item
description: Large Language Models (LLMs) offer a promising alternative to traditional Materials Science Text Mining (MSTM) by reducing the need for extensive data labeling and fine-tuning. However, existing zero-/few-shot methods still face limitations in aligning with personalized needs in scientific discovery. To address this, we propose ClassMATe, an active knowledge structuring approach for MSTM. Specifically, we first propose a class definition stylization method to structure knowledge, enabling explicit clustering of the latent material knowledge in LLMs for enhanced inference. To align with the scientists' needs, we propose an active needs refining strategy that iteratively clarifies needs by learning from uncertainty-aware hard samples of LLMs, further refining the knowledge structuring. Extensive experiments on seven tasks and eight datasets show that ClassMATe, as a plug-and-play method, achieves performances comparable to supervised learning without requiring fine-tuning or extra knowledge base, highlighting the potential to bridge the gap between LLMs' latent knowledge and real-world scientific applications.
creator: Xin Zhang
creator: Jingling Yuan
creator: Peiliang Zhang
creator: Jia Liu
creator: Lin Li
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

How to Select Datapoints for Efficient Human Evaluation of NLG Models?
type: item
description: Human evaluation is the gold standard for evaluating text generation models. However, it is expensive. In order to fit budgetary constraints, a random subset of the test data is often chosen in practice for human evaluation. However, randomly selected data may not accurately represent test performance, making this approach economically inefficient for model comparison. Thus, in this work, we develop and analyze a suite of selectors to get the most informative datapoints for human evaluation, taking the evaluation costs into account. We show that selectors based on variance in automated metric scores, diversity in model outputs, or Item Response Theory outperform random selection. We further develop an approach to distill these selectors to the scenario where the model outputs are not yet available. In particular, we introduce source-based estimators, which predict item usefulness for human evaluation just based on the source texts. We demonstrate the efficacy of our selectors in two common NLG tasks, machine translation and summarization, and show that only ~70% of the test data is needed to produce the same evaluation result as the entire data.
creator: Vilém Zouhar
creator: Peng Cui
creator: Mrinmaya Sachan
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

A Unifying Scheme for Extractive Content Selection Tasks
type: item
description: A broad range of NLP tasks involve selecting relevant text spans from given source texts. Despite this shared objective, such content selection tasks have traditionally been studied in isolation, each with its own modeling approaches, datasets, and evaluation metrics. In this work, we propose instruction-guided content selection (IGCS) as a beneficial unified framework for such settings, where the task definition and any instance-specific request are encapsulated as instructions to a language model. To promote this framework, we introduce IGCSBench, the first unified benchmark covering diverse content selection tasks. Further, we create a large generic synthetic dataset that can be leveraged for diverse content selection tasks, and show that transfer learning with these datasets often boosts performance, whether dedicated training for the targeted task is available or not. Finally, we address generic inference time issues that arise in LLM-based modeling of content selection, assess a generic evaluation metric, and overall propose the utility of our resources and methods for future content selection models.
creator: Shmuel Amar
creator: Ori Shapira
creator: Aviv Slobodkin
creator: Ido Dagan
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Early Detection and Reduction of Memorisation for Domain Adaptation and Instruction Tuning
type: item
description: Although large language models excel across many tasks, they can memorise training data and thereby expose private or copyrighted text. Most defences target the pre-training stage, leaving memorisation during fine-tuning—especially for domain adaptation and instruction tuning—poorly understood. We fine-tune Pythia, Llama3, and Mistral models spanning 1.4B–70B parameters on common evaluation datasets and track verbatim memorisation throughout training. We find that memorisation increases dramatically in the first few epochs, often significantly before either validation perplexity or evaluation performance is optimised. We use a simple but effective n-gram memorisation score which reliably precedes verbatim memorisation; using it as an early-stopping criterion mitigates memorisation with minimal performance loss. Further, we introduce an n-gram–aware loss regulariser and show that it reduces memorisation across all model families tested by up to 40% while minimising evaluation performance trade-offs when compared to an existing memorisation mitigation strategy. These results yield practical, scalable insights into memorisation dynamics during language model fine-tuning.
creator: Dean Slack
creator: Noura Al Moubayed
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Towards More Realistic Extraction Attacks: An Adversarial Perspective
type: item
description: Language models are prone to memorizing their training data, making them vulnerable to extraction attacks. While existing research often examines isolated setups, such as a single model or a fixed prompt, real-world adversaries have a considerably larger attack surface due to access to models across various sizes and checkpoints, and repeated prompting. In this paper, we revisit extraction attacks from an adversarial perspective---with multi-faceted access to the underlying data. We find significant churn in extraction trends, i.e., even unintuitive changes to the prompt, or targeting smaller models and earlier checkpoints, can extract distinct information. By combining multiple attacks, our adversary doubles ($2 \times$) the extraction risks, persisting even under mitigation strategies like data deduplication. We conclude with four case studies, including detecting pre-training data, copyright violations, extracting personally identifiable information, and attacking closed-source models, showing how our more realistic adversary can outperform existing adversaries in the literature.
creator: Yash More
creator: Prakhar Ganesh
creator: Golnoosh Farnadi
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

The Frame Representation Hypothesis: Multi-Token LLM Interpretability and Concept-Guided Text Generation
type: item
description: Interpretability is a key challenge in fostering trust for Large Language Models (LLMs), which stems from the complexity of extracting reasoning from model's parameters. We present the Frame Representation Hypothesis, a theoretically robust framework grounded in the Linear Representation Hypothesis (LRH) to interpret and control LLMs by modeling multi-token words. Prior research explored LRH to connect LLM representations with linguistic concepts, but was limited to single token analysis. As most words are composed of several tokens, we extend LRH to multi-token words, thereby enabling usage on any textual data with thousands of concepts. To this end, we propose words can be interpreted as frames, ordered sequences of vectors that better capture token-word relationships. Then, concepts can be represented as the average of word frames sharing a common concept. We showcase these tools through Top-k Concept-Guided Decoding, which can intuitively steer text generation using concepts of choice. We verify said ideas on Llama 3, Gemma 2, Phi 3 and Qwen-2-VL families, demonstrating gender and language biases, exposing harmful content, but also potential to remediate them, leading to safer and more transparent LLMs. Code is available at https://github.com/phvv-me/ frame-representation- hypothesis.git
creator: Pedro Henrique Vaz Valois
creator: Lincon Sales de Souza
creator: Erica Kido Shimomoto
creator: Kazuhiro Fukui
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Overcoming Source Object Grounding for Semantic Image Editing
type: item
description: Recent diffusion models have demonstrated remarkable capabilities in text-to-image generation. However, their stochastic denoising process often causes semantic image editing (SIE) models to misapply textual instructions. That is, models often leave the source object unchanged or erroneously alter the background. We refer to this challenge as source object grounding. To address this challenge, we introduce R-SIE, a region-wise SIE framework. During the inference, R-SIE models noise separately for distinct image regions, enabling precise control over the transformed areas. To reinforce the inference, we devise an automatic pipeline leveraging bounding boxes to generate unambiguous training data. Additionally, we propose two region-focused metrics, CLIP-Region Class (CLIP-RC) and CLIP-Global Context (CLIP-GC), to independently assess how well the source object is edited and the background is preserved, respectively. Experimental results demonstrate that region-wise diffusion improves existing baselines, and our data generation pipeline further enhances these improvements.
creator: yeonjoon jung
creator: Seungtaek Choi
creator: Seung-won Hwang
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Explanatory Summarization with Discourse-Driven Planning
type: item
description: Lay summaries for scientific documents typically include explanations to help readers grasp sophisticated concepts or arguments. However, current automatic summarization methods do not explicitly model explanations, which makes it difficult to align the proportion of explanatory content with human-written summaries. In this paper, we present a plan-based approach that leverages discourse frameworks to organize summary generation and guide explanatory sentences by prompting responses to the plan. Specifically, we propose two discourse-driven planning strategies, where the plan is conditioned as part of the input or part of the output prefix, respectively. Empirical experiments on three lay summarization datasets show that our approach outperforms existing state-of-the-art methods in terms of summary quality, and it enhances model robustness, controllability, and mitigates hallucination.
creator: Dongqi Liu
creator: Xi Yu
creator: Vera Demberg
creator: Mirella Lapata
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

On the Effect of Instruction Tuning Loss on Generalization
type: item
description: Instruction Tuning has emerged as a pivotal post-training paradigm that enables pre-trained language models to better follow user instructions. Despite its significance, little attention has been given to optimizing the loss function used. A fundamental, yet often overlooked, question is whether the conventional auto-regressive objective – where loss is computed only on response tokens, excluding prompt tokens – is truly optimal for instruction tuning. In this work, we systematically investigate the impact of differentially weighting prompt and response tokens in instruction tuning loss, and propose Weighted Instruction Tuning (WIT) as a better alternative to conventional instruction tuning. Through extensive experiments on five language models of different families and scale, three finetuning datasets of different sizes, and five diverse evaluation benchmarks, we show that the standard instruction tuning loss often yields suboptimal performance and limited robustness to input prompt variations. We find that a low-to-moderate weight for prompt tokens coupled with a moderate-to-high weight for response tokens yields the best-performing models across settings and also serve as better starting points for the subsequent preference alignment training. These findings highlight the need to reconsider instruction-tuning loss and offer actionable insights for developing more robust and generalizable models. Our code is open-sourced at https://github.com/kowndinya- renduchintala/WIT.
creator: Anwoy Chatterjee
creator: H S V N S Kowndinya Renduchintala
creator: Sumit Bhatia
creator: Tanmoy Chakraborty
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

BharatBBQ: A Multilingual Bias Benchmark for Question Answering in the Indian Context
type: item
description: Evaluating social biases in language models (LMs) is crucial for ensuring fairness and minimizing the reinforcement of harmful stereotypes in AI systems. Existing benchmarks, such as the Bias Benchmark for Question Answering (BBQ), primarily focus on Western contexts, limiting their applicability to the Indian context. To address this gap, we introduce BharatBBQ, a culturally adapted benchmark designed to assess biases in Hindi, English, Marathi, Bengali, Tamil, Telugu, Odia, and Assamese. BharatBBQ covers 13 social categories, including 3 intersectional groups, reflecting prevalent biases in the Indian sociocultural landscape. Our dataset contains 49,108 examples in one language that are expanded using translation and verification to 392,864 examples in eight different languages. We evaluate five multilingual LM families across zero- and few-shot settings, analyzing their bias and stereotypical bias scores. Our findings highlight persistent biases across languages and social categories and often amplified biases in Indian languages compared to English, demonstrating the necessity of linguistically and culturally grounded benchmarks for bias evaluation.
creator: Aditya Tomar
creator: Nihar Ranjan Sahoo
creator: Pushpak Bhattacharyya
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Are Triggers Needed for Document-Level Event Extraction?
type: item
description: Most existing work on event extraction has focused on sentence-level texts and presumes the identification of a \trigger-span --- a word or phrase in the input that evokes the occurrence of an event of interest. Event arguments are then extracted with respect to the trigger. Indeed, triggers are treated as integral to, and trigger detection as an essential component of, event extraction. In this paper, we provide the first investigation of the role of triggers for the more difficult and much less studied task of document-level event extraction. We analyze their usefulness in multiple end-to-end and pipelined transformer-based event extraction models for three document-level event extraction datasets, measuring performance using triggers of varying quality (human-annotated, LLM-generated, keyword-based, and random). We find that whether or not systems benefit from explicitly extracting triggers depends both on dataset characteristics (i.e. the typical number of events per document) and task-specific information available during extraction (i.e. natural language event schemas). Perhaps surprisingly, we also observe that the mere existence of triggers in the input, even random ones, is important for prompt-based in-context learning approaches to the task.
creator: Shaden Shaar
creator: Wayne Chen
creator: Maitreyi Chatterjee
creator: Barry Wang
creator: Wenting Zhao
creator: Claire Cardie
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Safe Pruning LoRA: Robust Distance-Guided Pruning for Safety Alignment in Adaptation of LLMs
type: item
description: Fine-tuning Large Language Models (LLMs) with Low-Rank Adaptation (LoRA) enhances adaptability while reducing computational costs. However, fine-tuning can compromise safety alignment, even with benign data, increasing susceptibility to harmful outputs. Existing safety alignment methods struggle to capture complex parameter shifts, leading to suboptimal safety-utility trade-offs. To address this issue, we propose Safe Pruning LoRA (SPLoRA), a novel pruning-based approach that selectively removes LoRA layers that weaken safety alignment, improving safety while preserving performance. At its core, we introduce Empirical-DIEM (E-DIEM), a dimension-insensitive similarity metric that effectively detects safety misalignment in LoRA-adapted models. We conduct extensive experiments on LLMs fine-tuned with both mixed of benign and malicious data, and purely benign datasets, evaluating SPLoRA across utility, safety, and reliability metrics. Results demonstrate that SPLoRA outperforms state-of-the-art safety alignment techniques, significantly reducing safety risks while maintaining or improving model performance and reliability. Additionally, SPLoRA reduces inference overhead, making it a scalable and efficient solution for deploying safer and more reliable LLMs. The code is available at GitHub https://github.com/AoShuang92/SPLoRA.
creator: Shuang Ao
creator: Yi Dong
creator: Jinwei Hu
creator: Sarvapali Ramchurn
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Surveying the Landscape of Image Captioning Evaluation: A Comprehensive Taxonomy, Trends and Metrics Analysis
type: item
description: The task of image captioning has recently been gaining popularity, and with it the complex task of evaluating the quality of image captioning models. In this work, we present the first survey and taxonomy of over 70 different image captioning metrics and their usage in hundreds of papers, specifically designed to help users select the most suitable metric for their needs. We find that despite the diversity of proposed metrics, the vast majority of studies rely on only five popular metrics, which we show to be weakly correlated with human ratings. We hypothesize that combining a diverse set of metrics can enhance correlation with human ratings. As an initial step, we demonstrate that a linear regression-based ensemble method, which we call EnsembEval, trained on one human ratings dataset, achieves improved correlation across five additional datasets, showing there is a lot of room for improvement by leveraging a diverse set of metrics.
creator: Uri Berger
creator: Gabriel Stanovsky
creator: Omri Abend
creator: Lea Frermann
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

FoVer: First-Order Logic Verification for Natural Language Reasoning
type: item
description: Large Language Models (LLMs) have shown remarkable capabilities in various tasks, including logical reasoning. However, their propensity for generating incorrect or inconsistent responses remains a significant concern. To address this issue, we propose FoVer (First-order logic Verification), an automated pipeline that verifies the logical correctness of reasoning texts using first-order logic. The pipeline operates in two main steps: (1) LLM-driven translation of natural language into executable logical expressions, and (2) automated logical verification using the Z3 theorem prover. We evaluate FoVer on specialized logical datasets (ProofWriter and FOLIO) and real-world LLM outputs (REVEAL). The results demonstrate that FoVer significantly outperforms existing methods in logical verification, showing notable improvements in reliability and accuracy across both ideal and practical scenarios. The pipeline also demonstrates its potential in identifying annotation errors in existing datasets, and it could be utilized for constructing new logical reasoning datasets. This work presents a significant step forward in enhancing the reliability and trustworthiness of LLM outputs, particularly in tasks requiring logical integrity.
creator: Yu Pei
creator: Yongping Du
creator: Xingnan Jin
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

DARE: Diverse Visual Question Answering with Robustness Evaluation
type: item
description: Vision Language Models (VLMs) extend remarkable capabilities of text-only large language models and vision-only models, being able to learn from and process multi-modal vision-text input. While modern VLMs perform well on a number of standard image classification and image-text matching tasks, they still struggle with a number of crucial vision-language (VL) reasoning abilities such as counting and spatial reasoning. Moreover, while they might be very brittle to small variations in instructions and/or evaluation protocols, existing benchmarks fail to evaluate their robustness (or rather the lack of it). In order to couple challenging VL scenarios with comprehensive robustness evaluation, we introduce DARE, Diverse Visual Question Answering with Robustness Evaluation, a carefully created and curated multiple-choice VQA benchmark. DARE evaluates VLM performance on five diverse categories and includes four robustness-oriented evaluations based on the variations of: prompts, the subsets of answer options, the output format and the number of correct answers. Among a spectrum of other findings, we report that state-of-the-art VLMs still struggle with questions in most categories and are unable to consistently deliver their peak performance across the tested robustness evaluations. Consequently, our work calls for the systematic addition of robustness evaluations in future VLM research.
creator: Hannah Sterz
creator: Jonas Pfeiffer
creator: Ivan Vuli´c
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Continual Pre-training on Character-level Noisy Texts Makes Decoder-based Language Models Robust Few-shot Learners
type: item
description: Recent decoder-based pre-trained language models (PLMs) generally use subword tokenizers. However, adding character-level perturbations drastically changes the delimitation of texts by the tokenizers, leading to the vulnerability of PLMs. This study proposes a method of continual pre-training to convert decoder-based PLMs with subword tokenizers into perturbation-robust few-shot in-context learners. Our method continually trains decoder-based PLMs to predict the next tokens conditioning on artificially created character-level noisy texts. Since decoder-based language models are auto-regressive, we skip noised words from the target optimization. In addition, to maintain the same word prediction performance under noisy text as clean text, our method employs word distribution matching between the original PLMs and training models. We conducted experiments on various subword-based PLMs, including GPT2, Pythia, Mistral, Gemma2, and Llama3, ranging from 1B to 8B parameters. The results demonstrate that our method consistently improves the performance of few-shot in-context learning on downstream tasks which contain actual typos or misspellings as well as artificial noise.
creator: Takeshi Kojima
creator: Yutaka Matsuo
creator: Yusuke Iwasawa
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

CRVQ: Channel-Relaxed Vector Quantization for Extreme Compression of LLMs
type: item
description: Powerful large language models (LLMs) are increasingly expected to be deployed with lower computational costs, enabling their capabilities on resource-constrained devices. Post-training quantization (PTQ) has emerged as a star approach to achieve this ambition, with best methods compressing weights to less than 2 bit on average. In this paper, we propose Channel-Relaxed Vector Quantization (CRVQ), a novel technique that significantly improves the performance of PTQ baselines at the cost of only minimal additional bits. This state-of-the-art extreme compression method achieves its results through two key innovations: (1) carefully selecting and reordering a very small subset of critical weight channels, and (2) leveraging extended codebooks to relax the constraint of critical channels. With our method, we demonstrate a 38.9% improvement over the current strongest sub-2-bit PTQ baseline, enabling nearer lossless 1-bit compression. Furthermore, our approach offers flexible customization of quantization bit-width and performance, providing a wider range of deployment options for diverse hardware platforms. Code and checkpoints are available at https://github.com/ xuyuzhuang11/CRVQ.
creator: Yuzhuang Xu
creator: Shiyu Ji
creator: Qingfu Zhu
creator: Wanxiang Che
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Accurate and Efficient Fine-Tuning of Quantized Large Language Models Through Optimal Balance in Adaptation
type: item
description: Large Language Models (LLMs) have demonstrated impressive performance across various domains. However, the enormous number of model parameters makes fine-tuning challenging, significantly limiting their application and deployment. Existing solutions combine parameter quantization with Low-Rank Adaptation (LoRA), reducing memory usage but causing performance degradation. Additionally, converting fine-tuned models to low-precision representations further degrades performance. In this paper, we identify an imbalance in fine-tuning quantized LLMs with LoRA: overly complex adapter inputs and outputs versus low effective trainability of the adapter, leading to underfitting during fine-tuning. Thus, we propose Quantized LLMs fine-tuning with Balanced Low-Rank Adaptation (Q-BLoRA), which simplifies the adapter’s inputs and outputs while increasing the adapter’s rank to alleviate underfitting during fine-tuning. For low-precision deployment, we propose Quantization-Aware fine-tuning with Balanced Low-Rank Adaptation (QA-BLoRA), which aligns with the block-wise quantization and facilitates quantization-aware fine-tuning of low-rank adaptation based on the parameter merging of Q-BLoRA. Both Q-BLoRA and QA-BLoRA are easily implemented and offer the following optimizations: (i) Q-BLoRA consistently achieves state-of-the-art accuracy compared to baselines and other variants; (ii) QA-BLoRA enables the direct generation of low-precision inference models, which exhibit significant performance improvements over other low-precision models. We validate the effectiveness of Q-BLoRA and QA-BLoRA across various models and scenarios. Code will be made available at https://github.com/xiaocaigou/qbaraqahira.
creator: Ao Shen
creator: Qiang Wang
creator: Xionglve Li
creator: Lizhi Zhang
creator: Zhiquan Lai
creator: Dongsheng Li
creator: Jiaxin Li
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

MAKE: Memory-Associated Knowledge Editing
type: item
description: Since their emergence, large language models (LLMs) have rapidly advanced, exerting substantial influence across various domains. Consequently, the importance of model editing techniques, aimed at locally correcting outdated or incorrect knowledge within language models, has grown significantly. However, traditional model editing methods face limitations: they cannot guarantee that highly related knowledge will transfer to the post-edited model, and they often rely on external knowledge bases to address this issue. In this paper, we propose a novel approach that leverages the internal knowledge of the language model to overcome the shortcomings of existing methods. First, we explore how to recall indirect associated knowledge from the model itself, which can be utilized in the editing process. Building on this, we propose MAKE (Memory-Associated Knowledge Editing), an editing method that takes into account the transfer of associated knowledge. As a result, MAKE successfully updates associated knowledge and achieves state-of-the-art performance in experiments conducted on the zsRE+, CounterFact+ and MQuAKE datasets.
creator: Seongsik Park
creator: Harksoo Kim
creator: Sangmin Park
creator: Jaieun Kim
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure
type: item
description: Autoregressive language models demonstrate excellent performance in various scenarios. However, the inference efficiency is limited by its one-step-one-word generation mode, which has become a pressing problem recently as the models become increasingly larger. Speculative decoding employs a "draft and then verify" mechanism to allow multiple tokens to be generated in one step, realizing lossless acceleration. Existing methods mainly adopt fixed heuristic draft structures, which do not adapt to different situations to maximize the acceptance length during verification. To alleviate this dilemma, we proposed OPT-Tree, an algorithm to construct adaptive and scalable draft trees, which can be applied to any autoregressive draft model. It searches the optimal tree structure that maximizes the mathematical expectation of the acceptance length in each decoding step. Experimental results reveal that OPT-Tree outperforms the existing draft structures and achieves a speed-up ratio of up to 3.2 compared with autoregressive decoding. If the draft model is powerful enough and the node budget is sufficient, it can generate more than ten tokens in a single step. Our code is available at https://github.com/Jikai0Wang/ OPT-Tree.
creator: Jikai Wang
creator: Yi Su
creator: Juntao Li
creator: Qinrong Xia
creator: Zi Ye
creator: Xinyu Duan
creator: Zhefeng Wang
creator: Min Zhang
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Know Your Limits: A Survey of Abstention in Large Language Models
type: item
description: Abstention, the refusal of large language models (LLMs) to provide an answer, is increasingly recognized for its potential to mitigate hallucinations and enhance safety in LLM systems. In this survey, we introduce a framework to examine abstention from three perspectives: the query, the model, and human values. We organize the literature on abstention methods, benchmarks, and evaluation metrics using this framework, and discuss merits and limitations of prior work. We further identify and motivate areas for future work, centered around whether abstention can be achieved as a meta-capability that transcends specific tasks or domains, while still providing opportunities to optimize abstention abilities based on context.
creator: Bingbing Wen
creator: Jihan Yao
creator: Shangbin Feng
creator: Chenjun Xu
creator: Yulia Tsvetkov
creator: Bill Howe
creator: Lucy Lu Wang
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

DOLOMITES: Domain-Specific Long-Form Methodical Tasks
type: item
description: Experts in various fields routinely perform methodical writing tasks to plan, organize,and report their work. From a clinician writing a differential diagnosis for a patient, to a teacher writing a lesson plan for students, these tasks are pervasive, requiring to methodically generate structured long-form output for a given input. We develop a typology of methodical tasks structured in the form of a task objective, procedure, input, and output, and introduce DoLoMiTes, a novel benchmark with specifications for 519 such tasks elicited from hundreds of experts from across 25 fields. Our benchmark further contains specific instantiations of methodical tasks with concrete input and output examples (1,857 in total) which we obtain by collecting expert revisions of up to 10 model-generated examples of each task. We use these examples to evaluate contemporary language models, highlighting that automating methodical tasks is a challenging long-form generation problem, as it requires performing complex inferences, while drawing upon the given context as well as domain knowledge. Our dataset is available at https://dolomites-benchmark.github.io.
creator: Chaitanya Malaviya
creator: Priyanka Agrawal
creator: Kuzman Ganchev
creator: Pranesh Srinivasan
creator: Fantine Huot
creator: Jonathan Berant
creator: Mark Yatskar
creator: Dipanjan Das
creator: Mirella Lapata
creator: Chris Alberti
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Investigating Adversarial Trigger Transfer in Large Language Models
type: item
description: Recent work has developed optimization procedures to find token sequences, called adversarial triggers, which can elicit unsafe responses from aligned language models. These triggers are believed to be highly transferable, i.e., a trigger optimized on one model can jailbreak other models. In this paper, we concretely show that such adversarial triggers are not consistently transferable. We extensively investigate trigger transfer amongst 13 open models and observe poor and inconsistent transfer. Our experiments further reveal a significant difference in robustness to adversarial triggers between models Aligned by Preference Optimization (APO) and models Aligned by Fine-Tuning (AFT). We find that APO models are extremely hard to jailbreak even when the trigger is optimized directly on the model. On the other hand, while AFT models may appear safe on the surface, exhibiting refusals to a range of unsafe instructions, we show that they are highly susceptible to adversarial triggers. Lastly, we observe that most triggers optimized on AFT models also generalize to new unsafe instructions from five diverse domains, further emphasizing their vulnerability. Overall, our work highlights the need for more comprehensive safety evaluations for aligned language models.
creator: Nicholas Carl Meade
creator: Arkil Patel
creator: Siva Reddy
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Supervised Neural Topic Modeling with Label Alignment
type: item
description: Neural topic modeling is a scalable automated technique for text data mining. In various downstream tasks of topic modeling, it is prefered that the discovered topics well align with labels. However, due to the lack of guidance from labels, unsupervised neural topic models are less powerful in this situation. Existing supervised neural topic models often adopt a label-free prior to generate the latent document-topic distributions and use them to predict the labels and thus achieve label-topic alignment indirectly. Such a mechanism faces the following issues: 1) The label-free prior leads to topics blending the latent patterns of multiple labels; 2) One is unable to intuitively identify the explicit relationships between labels and the discovered topics. To tackle these problems, we develop a novel supervised neural topic model which utilizes a chain-structured graphical model that emphasizes direct constraints of labels on topics. Soft indicators are introduced to explicitly construct the label-topic relationships. To obtain well-organized label-topic relationships, we formalize an entropy-regularized optimal transport problem on the embedding space and model them as the transport plan. Moreover, our proposed method can be seamlessly integrated with most existing unsupervised neural topic models in a flexible manner. Experiment results on multiple datasets demonstrate that our model can greatly enhance the alignment between labels and topics while maintaining good topic quality.
creator: Ruihao Chen
creator: Hegang Chen
creator: Yuyin Lu
creator: Yanghui Rao
creator: Chunjiang Zhu
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

The Thai Universal Dependency Treebank
type: item
description: Automatic dependency parsing of Thai sentences has been underexplored, as evidenced by the lack of large Thai dependency treebanks with complete dependency structures and the lack of a published evaluation of state-of-the-art models, especially transformer-based parsers. In this work, we addressed these gaps by introducing the Thai Universal Dependency Treebank (TUD), a new Thai treebank consisting of 3,627 trees annotated according to the Universal Dependencies (UD) framework. We then benchmarked 92 dependency parsing models that incorporate pretrained transformers on Thai-PUD and our TUD, achieving state-of-the-art results and shedding light on the optimal model components for Thai dependency parsing. Our error analysis of the models also reveals that polyfunctional words, serial verb construction, and lack of rich morphosyntactic features present main challenges for Thai dependency parsing.
creator: Panyut Sriwirote
creator: Wei Qi Leong
creator: Charin Polpanumas
creator: Santhawat Thanyawong
creator: William Tjhi
creator: Wirote Aroonmanakun
creator: Attapol T Rutherford
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

DEAR: Disentangled Event-Agnostic Representation Learning for Early Fake News Detection
type: item
description: Detecting fake news early is challenging due to the absence of labeled articles for emerging events in training data. To address this, we propose a Disentangled Event-Agnostic Representation (DEAR) learning approach. Our method begins with a BERT-based adaptive multi-grained semantic encoder that captures hierarchical and comprehensive textual representations of the input news content. To effectively separate latent authenticity-related and event-specific knowledge within the news content, we employ a disentanglement architecture. To further enhance the decoupling effect, we introduce a cross-perturbation mechanism that perturbs authenticity-related representation with the event-specific one, and vice versa, deriving a robust and discerning authenticity-related signal. Additionally, we implement a refinement learning scheme to minimize potential interactions between two decoupled representations, ensuring that the authenticity signal remains strong and unaffected by event-specific details. Experimental results demonstrate that our approach effectively mitigates the impact of event-specific influence, outperforming state-of-the-art methods. Particularly, it achieves a 6.0% improvement in accuracy on the PHEME dataset over MDDA, a similar approach that decouples latent content and style knowledge, in scenarios involving articles from unseen events different from the topics of the training set.
creator: Xiao Pu
creator: Hao Wu
creator: Xiuli Bi
creator: Yu Wu
creator: Xinbo Gao
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

NLP Security and Ethics, in the Wild
type: item
description: As NLP models are used by a growing number of end-users, an area of increasing importance is NLP Security (NLPSec): assessing the vulnerability of models to malicious attacks and developing comprehensive countermeasures against them. While work at the intersection of NLP and cybersecurity has the potential to create safer NLP for all, accidental oversights can result in tangible harm (e.g., breaches of privacy or proliferation of malicious models). In this emerging field, however, the research ethics of NLP have not yet faced many of the long-standing conundrums pertinent to cybersecurity, until now. We thus examine contemporary works across NLPSec, and explore their engagement with cybersecurity's ethical norms. We identify trends across the literature, ultimately finding alarming gaps on topics like harm minimization and responsible disclosure. To alleviate these concerns, we provide concrete recommendations to help NLP researchers navigate this space more ethically, bridging the gap between traditional cybersecurity and NLP ethics, which we frame as ``white hat NLP''. The goal of this work is to help cultivate an intentional culture of ethical research for those working in NLP Security.
creator: Heather Lent
creator: Erick Galinkin
creator: Yiyi Chen
creator: Jens Myrup Pedersen
creator: Leon Derczynski
creator: Johannes Bjerva
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Understanding Epistemic Language with a Language-augmented Bayesian Theory of Mind
type: item
description: How do people understand and evaluate claims about others' beliefs, even though these beliefs cannot be directly observed? In this paper, we introduce a cognitive model of epistemic language interpretation, grounded in Bayesian inferences about other agents' goals, beliefs, and intentions: a language-augmented Bayesian theory-of-mind (LaBToM). By translating natural language into an epistemic "language-of-thought" with grammar-constrained LLM decoding, then evaluating these translations against the inferences produced by inverting a generative model of rational action and perception, LaBToM captures graded plausibility judgments of epistemic claims. We validate our model in an experiment where participants watch an agent navigate a maze to find keys hidden in boxes needed to reach their goal, then rate sentences about the agent's beliefs. In contrast with multimodal LLMs (GPT-4o, Gemini Pro) and ablated models, our model correlates highly with human judgments for a wide range of expressions, including modal language, uncertainty expressions, knowledge claims, likelihood comparisons, and attributions of false belief.
creator: Lance Ying
creator: Tan Zhi-Xuan
creator: Lionel Wong
creator: Vikash Mansinghka
creator: Joshua Tenenbaum
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Salute the Classic: Revisiting Challenges of Machine Translation in the Age of Large Language Models
type: item
description: The evolution of Neural Machine Translation (NMT) has been significantly influenced by six core challenges, which have acted as benchmarks for progress in this field. This study revisits these challenges, offering insights into their ongoing relevance in the context of advanced Large Language Models (LLMs): domain mismatch, amount of parallel data, rare word prediction, translation of long sentences, attention model as word alignment}, and sub-optimal beam search}. Our empirical findings show that LLMs effectively reduce reliance on parallel data for major languages during pretraining and significantly improve translation of long sentences containing approximately 80 words, even translating documents up to 512 words. Despite these improvements, challenges in domain mismatch and rare word prediction persist. While word alignment and beam search challenges, specific to NMT, may not apply to LLMs, we identify three new challenges for LLM translation tasks: inference efficiency, translation of low-resource languages during pretraining, and human-aligned evaluation.
creator: Jianhui Pang
creator: Fanghua Ye
creator: Derek Fai Wong
creator: Dian Yu
creator: Shuming Shi
creator: Zhaopeng Tu
creator: Longyue Wang
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Diverse AI Feedback for Large Language Model Alignment
type: item
description: Recent advances in large language models (LLMs) focus on aligning models with human values to minimize harmful content. However, existing methods often rely on a single type of feedback, such as preferences, annotated labels, or critiques, which can lead to overfitting and suboptimal performance. In this paper, we propose Diverse AI Feedback (DAIF), a novel approach that integrates three types of feedback, critique, refinement, and preference, tailored to tasks of varying uncertainty levels. Through an analysis of information gain, we show that critique feedback is most effective for low-uncertainty tasks, refinement feedback for medium-uncertainty tasks, and preference feedback for high-uncertainty tasks. Training with this diversified feedback reduces overfitting and improves alignment. Experimental results across three tasks, question answering, dialog generation, and text summarization, demonstrate that DAIF outperforms traditional methods relying on a single feedback type.
creator: Tianshu Yu
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

LLM Reading Tea Leaves: Automatically Evaluating Topic Models with Large Language Models
type: item
description: Topic modeling has been a widely used tool for unsupervised text analysis. However, comprehensive evaluations of a topic model remain challenging. Existing evaluation methods are either less comparable across different models (e.g., perplexity) or focus on only one specific aspect of a model (e.g., topic quality or document representation quality) at a time, which is insufficient to reflect the overall model performance. In this paper, we propose WALM (Word Agreement with Language Model), a new evaluation method for topic modeling that considers the semantic quality of document representations and topics in a joint manner, leveraging the power of Large Language Models (LLMs). With extensive experiments involving different types of topic models, WALM is shown to align with human judgment and can serve as a complementary evaluation method to the existing ones, bringing a new perspective to topic modeling. Our software package is available at https://github.com/Xiaohao- Yang/Topic_Model_Evaluation.
creator: Xiaohao Yang
creator: He Zhao
creator: Dinh Phung
creator: Wray Buntine
creator: Lan Du
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Investigating Critical Period Effects in Language Acquisition through Neural Language Models
type: item
description: Humans appear to have a critical period (CP) for language acquisition: Second language (L2) acquisition becomes harder after early childhood, and ceasing exposure to a first language (L1) after this period (but not before) typically does not lead to substantial loss of L1 proficiency. It is unknown whether these CP effects result from innately determined brain maturation or as a stabilization of neural connections naturally induced by experience. In this study, we use language models (LMs) to test the extent to which these phenomena are peculiar to humans, or shared by a broader class of language learners. We vary the age of exposure by training LMs on language pairs in various experimental conditions, and find that LMs, which lack any direct analog to innate maturational stages, do not show CP effects when the age of exposure of L2 is delayed. Our results contradict the claim that CP effects are an inevitable result of statistical learning, and they are consistent with an innate mechanism for CP effects. We show that we can reverse-engineer the CP by introducing a regularizer partway through training to simulate a maturational decrease in plasticity. All in all, our results suggest that L1 learning on its own may not be enough to induce a CP, and additional engineering is necessary to make language models more cognitively plausible.
creator: Alex Warstadt
creator: Ionut Constantinescu
creator: Tiago Pimentel
creator: Ryan Cotterell
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Benchmarking Uncertainty Quantification Methods for Large Language Models with LM-Polygraph
type: item
description: The rapid proliferation of large language models (LLMs) has stimulated researchers to seek effective and efficient approaches to deal with LLM hallucinations and low-quality outputs. Uncertainty quantification (UQ) is a key element of machine learning applications in dealing with such challenges. However, research to date on UQ for LLMs has been fragmented in terms of techniques and evaluation methodologies. In this work, we address this issue by introducing a novel benchmark that implements a collection of state-of-the-art UQ baselines and offers an environment for controllable and consistent evaluation of novel UQ techniques over various text generation tasks. Our benchmark also supports the assessment of confidence normalization methods in terms of their ability to provide interpretable scores. Using our benchmark, we conduct a large-scale empirical investigation of UQ and normalization techniques across eleven tasks, identifying the most effective approaches.
creator: Roman Vashurin
creator: Ekaterina Fadeeva
creator: Artem Vazhentsev
creator: Lyudmila Rvanova
creator: Akim Tsvigun
creator: Daniil Vasilev
creator: Rui Xing
creator: Abdelrahman “Boda” Sadallah
creator: Kirill Grishchenkov
creator: Sergey Petrakov
creator: Alexander Panchenko
creator: Timothy Baldwin
creator: Preslav Nakov
creator: Maxim Panov
creator: Artem Shelmanov
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Analyzing and Adapting Large Language Models for Few-Shot Multilingual NLU: Are We There Yet?
type: item
description: Supervised fine-tuning (SFT), supervised instruction tuning (SIT) and in-context learning (ICL) are three alternative, de facto standard approaches to few-shot learning. ICL has gained popularity recently with the advent of LLMs due to its versatile simplicity and sample efficiency. Prior research has conducted only limited investigation into how these approaches work for multilingual few-shot learning, and the focus so far has been mostly on their performance. In this work, we present an extensive and systematic comparison of the three approaches, testing them on a variety of high- and low-resource languages over five different NLU tasks, and a myriad of language and domain setups. Importantly, performance is only one aspect of the comparison, where we also analyze and discuss the approaches through the optics of their computational, inference and financial costs. Some of the highlighted findings concern an excellent trade-off between performance and resource requirements/cost for SIT. We further analyze the impact of target language adaptation of pretrained LLMs and find that the standard adaptation approaches can (superficially) improve target language generation capabilities, but language understanding elicited through ICL does not improve accordingly and remains limited, especially for low-resource languages
creator: Evgeniia Razumovskaia
creator: Ivan Vulić
creator: Anna Korhonen
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

From Robustness to Improved Generalization and Calibration in Pre-trained Language Models
type: item
description: Enforcing representation smoothness in pre-trained language models (PLMs) through Jacobian and Hessian regularization provides an effective approach for enhancing both robustness and generalization. Although such regularization methods have proven effective in computer vision, their application in natural language processing, where PLM inputs are derived from a discrete domain, poses unique challenges. We introduce JacHess, a regularization approach for PLMs that minimizes the norms of the Jacobian and Hessian matrices in intermediate representations, using embeddings as substitutes for discrete token inputs. JacHess supports dual-mode regularization, alternating between fine-tuning with labeled data and regularization with unlabeled data. We evaluate JacHess on the GLUE benchmark and demonstrate that it consistently and significantly improves in-distribution generalization and enhances performance under domain shift. Across diverse PLMs, JacHess outperforms comparable representation-based regularization methods and unregularized fine-tuning, while also improving model calibration. Our findings, coupled with a computationally efficient estimator for the Jacobian and Hessian norms, position JacHess as a robust and widely applicable solution for enhancing PLM performance.
creator: Josip Jukić
creator: Jan Šnajder
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Phonetic Reconstruction of the Consonant System of Middle Chinese via Mixed Integer Optimization
type: item
description: This paper is concerned with phonetic reconstruction of the consonant system of Middle Chinese. We propose to cast the problem as a Mixed Integer Programming problem, which is able to automatically explore homophonic information from ancient rhyme dictionaries and phonetic information from modern Chinese dialects, the descendants of Middle Chinese. Numerical evaluation on a wide range of synthetic and real data demonstrates the effectiveness and robustness of the new method. We apply the method to information from Gu\v angy\`un (Author's note: The Gu\v angy\`un here is Chinese Pinyin in Latex, for HTML code, it should be Gu&#462;ngy&ugrave;n) and 20 modern Chinese dialects to obtain a new phonetic reconstruction result. A linguistically-motivated discussion of this result is also provided.
creator: Xiaoxi Luo
creator: Weiwei Sun
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Learning Syntax Without Planting Trees: Understanding Hierarchical Generalization in Transformers
type: item
description: Transformers trained on natural language data have been shown to exhibit hierarchical generalization without explicitly encoding any structural bias. In this work, we investigate sources of inductive bias in transformer models and their training that could cause such preference for hierarchical generalization. We extensively experiment with transformers trained on five synthetic, controlled datasets using several training objectives and show that while objectives such as sequence-to-sequence modeling, classification, etc., often failed to lead to hierarchical generalization, language modeling objective consistently led to transformers generalizing hierarchically. We then study how different generalization behaviors emerge during the training by conducting pruning experiments that reveal joint existence of subnetworks within the model implementing different generalizations. Finally, we take a Bayesian perspective to understand transformers' preference for hierarchical generalization: We establish a correlation between whether transformers generalize hierarchically on a dataset and if the simplest explanation of that dataset is provided by a hierarchical grammar compared to regular grammars exhibiting linear generalization. Overall, our work presents new insights on the origins of hierarchical generalization in transformers and provides a theoretical framework for studying generalization in language models.
creator: Kabir Ahuja
creator: Vidhisha Balachandran
creator: Madhur Panwar
creator: Tianxing He
creator: Noah A. Smith
creator: Navin Goyal
creator: Yulia Tsvetkov
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

SPIRIT-LM: Interleaved Spoken and Written Language Model
type: item
description: We introduce SPIRIT-LM, a foundation multimodal language model that freely mixes text and speech. Our model is based on a 7B pretrained text language model that we extend to the speech modality by continuously training it on text and speech units. Speech and text sequences are concatenated as a single stream of tokens, and trained with a word-level interleaving method using a small automatically-curated speech-text parallel corpus. SPIRIT-LM comes in two versions: a BASE version that uses speech semantic units and an EXPRESSIVE version that models expressivity using pitch and style units in addition to the semantic units. For both versions, the text is encoded with subword BPE tokens. The resulting model displays both the semantic abilities of text models and the expressive abilities of speech models. Additionally, we demonstrate that SPIRIT-LM is able to learn new tasks in a few-shot fashion across modalities (i.e. ASR, TTS, Speech Classification).
creator: Tu Anh Nguyen
creator: Benjamin Muller
creator: Bokai Yu
creator: Marta Ruiz Costa-jussà
creator: Maha Elbayadb
creator: Sravya Popuri
creator: Paul-Ambroise Duquenne
creator: Robin Algayres
creator: Ruslan Mavlyutov
creator: Itai Gat
creator: Gabriel Synnaeve
creator: Juan Pino
creator: Benoît Sagot
creator: Emmanuel Dupoux
creator: Christophe Ropers
creator: Mary Williamson
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

A Comparative Approach for Auditing Multilingual Phonetic Transcript Archives
type: item
description: Curating datasets that span multiple languages is challenging. To make the collection more scalable, researchers often incorporate one or more imperfect classifiers in the process, like language identification models. These models, however, are prone to failure, resulting in some language partitions being unreliable for downstream tasks. We introduce a statistical test, the Preference Proportion Test, for identifying such unreliable partitions. By annotating only 20 samples for a language partition, we're able to identify systematic transcription errors for 10 language partitions in a recent large multilingual transcribed audio archive, X-IPAPACK (Zhu et al., 2024). We find that filtering these low-quality partitions out when training models for the downstream task of phonetic transcription brings substantial benefits, most notably a 25.7% relative improvement on transcribing recordings in out-of-distribution languages. Our work contributes an effective method for auditing multilingual audio archives.
creator: Farhan Samir
creator: Emily P Ahn
creator: Shreya Prakash
creator: Márton Sóskuthy
creator: Vered Shwartz
creator: Jian Zhu
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Navigating the Landscape of Hint Generation Research: From the Past to the Future
type: item
description: Digital education has gained popularity in the last decade, especially after the COVID-19 pandemic. With the improving capabilities of large language models to reason and communicate with users, envisioning intelligent tutoring systems (ITSs) that can facilitate self-learning is not very far-fetched. One integral component to fulfill this vision is the ability to give accurate and effective feedback via hints to scaffold the learning process. In this survey article, we present a comprehensive review of prior research on hint generation, aiming to bridge the gap between research in education and cognitive science, and research in AI and Natural Language Processing. Informed by our findings, we propose a formal definition of the hint generation task, and discuss the roadmap of building an effective hint generation system aligned with the formal definition, including open challenges, future directions and ethical considerations.
creator: Anubhav Jangra
creator: Jamshid Mozafari
creator: Adam Jatowt
creator: Smaranda Muresan
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

REAL Sampling: Boosting Factuality and Diversity of Open-Ended Generation by Extrapolating the Entropy of an Infinitely Large LM
type: item
description: Decoding methods for large language models (LLMs) usually struggle with the tradeoff between ensuring factuality and maintaining diversity. In this paper, we propose REAL (Residual Entropy from Asymptotic Line) sampling, which predicts the step-wise hallucination likelihood of an LLM. When an LLM is likely to hallucinate, REAL lowers the p threshold in nucleus sampling. Otherwise, REAL sampling increases the p threshold to boost the diversity. To predict the step-wise hallucination likelihood without supervision, we construct a THF (Token-level Hallucination Forecasting) model, which predicts the asymptotic entropy (i.e., inherent uncertainty) of the next token by extrapolating the next-token entropies of an infinitely large language model from a series of LLMs with different sizes. If an LLM's entropy is higher than the asymptotic entropy (i.e., the LLM is more uncertain than it should be), the THF model predicts a high hallucination hazard, which leads to a lower p threshold in REAL sampling. In the FactualityPrompts benchmark, we demonstrate that REAL sampling based on a 70M THF model can substantially improve the factuality and diversity of 7B LLMs simultaneously. After combined with contrastive decoding, REAL sampling outperforms 13 sampling methods, and generates texts that are more factual than the greedy sampling and more diverse than the nucleus sampling with p=0.5.
creator: Haw-Shiuan Chang
creator: Nanyun Peng
creator: Mohit Bansal
creator: Anil Ramakrishna
creator: Tagyoung Chung
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Sense-Specific Historical Word Usage Generation
type: item
description: Large-scale sense-annotated corpora are important for a range of tasks but are hard to come by. Dictionaries that record and describe the vocabulary of a language often offer a small set of real-world example sentences for each sense of a word. However, on their own, these sentences are too few to be used as diachronic sense-annotated corpora. We propose a targeted strategy for training and evaluating generative models producing historically and semantically accurate word usages given any word, sense definition, and year triple. Our results demonstrate that the fine-tuned models can generate usages with the same properties as real-world example sentences from a reference dictionary. Thus the generated usages will be suitable for training and testing computational models where large-scale sense-annotated corpora are needed but currently unavailable.
creator: Pierluigi Cassotti
creator: Nina Tahmasebi
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

How much Semantic Information is Available in Large Language Model Tokens?
type: item
description: Large language models segment many words into multiple tokens, and companies that make those models claim that meaningful subword tokens are essential. To investigate whether subword tokens bear meaning, we segmented tens of thousands of words from each of 41 languages according to three generations of GPT tokenizers. We found that words which share tokens are more semantically similar than expected by chance or expected from length alone, that tokens capture morphological information even when they don’t look like morphemes, and that tokens capture more information than is explained by morphology. In languages that use a script other than the Latin alphabet, GPT-4 tokens are uninformative, but GPT-4o has improved this situation. These results suggest that comparing tokens to morphemes overlooks the wider variety of semantic information available in word form and that standard tokenization methods successfully capture much of that information.
creator: David Haslett
creator: Zhenguang G. Cai
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Prompt Contrastive Transformation: An Enhanced Strategy for Efficient Prompt Transfer in Natural Language Processing
type: item
description: Prompt transfer is a transfer learning method based on prompt tuning, which enhances the parameter performance of prompts in target tasks by transferring source prompt embeddings. Among existing methods, weighted aggregation is effective and possesses the advantages of being lightweight and modular. However, these methods may transfer redundant or irrelevant information from the source prompts to the target prompt, leading to negative impacts. To alleviate this problem, we propose Prompt Contrastive Transformation (PCT), which achieves efficient prompt transfer through prompt contrastive transformation and attentional fusion. PCT transforms the source prompt into task-agnostic embedding and task-specific embeddings through singular value decomposition and contrastive learning, reducing information redundancy among source prompts. The attention module in PCT selects more effective task-specific embeddings and fuses them with task-agnostic embedding into the target prompt. Experimental results show that, despite tuning only 0.035% of task-specific parameters, PCT achieves improvements in prompt transfer for single target task adaptation across various NLP tasks.
creator: Shu Zhao
creator: Shiji Yang
creator: Shicheng Tan
creator: Zhen Yang
creator: Congyao Mei
creator: Zhen Duan
creator: Yanping Zhang
creator: Jie Chen
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Contextualized Evaluations: Taking the Guesswork Out of Language Model Evaluations
type: item
description: Language model users often issue queries that lack specification, where the context under which a query was issued---such as the user's identity, the query's intent, and the criteria for a response to be useful---is not explicit. For instance, a good response to a subjective query like “What book should I read next?” would depend on the user’s preferences, and a good response to an open-ended query like “How do antibiotics work against bacteria?” would depend on the user's expertise. This makes evaluation of responses to such queries an ill-posed task, as evaluators may make arbitrary judgments about the response quality. To remedy this, we present contextualized evaluations, a protocol that synthetically constructs context surrounding an underspecified query and provides it during evaluation. We find that the presence of context can 1) alter conclusions drawn from evaluation, even flipping benchmark rankings between model pairs, 2) nudge evaluators to make fewer judgments based on surface-level criteria, like style, and 3) provide new insights about model behavior across diverse contexts. Specifically, our procedure suggests a potential bias towards WEIRD (Western, Educated, Industrialized, Rich and Democratic) contexts in models' "default'' responses and we find that models are not equally sensitive to following different contexts, even when they are provided in prompts
creator: Chaitanya Malaviya
creator: Joseph Chee Chang
creator: Dan Roth
creator: Mohit Iyyer
creator: Mark Yatskar
creator: Kyle Lo
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

STPar: A Structure-Aware Triaffine Parser for Screenplay Character Coreference Resolution
type: item
description: Character Coreference Resolution in Movie Screenplays (MovieCoref) is a newly emerging task for understanding complex movie plots and character relationships. This task poses greater challenges than traditional coreference resolution, due to the intricate narrative structures and character interactions unique to screenplays. In light of these challenges, we introduce a novel approach: a Structure-aware Triaffine Parser (STPar) for the MovieCoref task. STPar combines discourse and syntactic structures in the feature encoding process, enabling comprehensive analysis of ternary relationships and complex interactions. During the pairing process, STPar utilizes a triaffine scorer to consider high-order relations between candidate mention pairs, thus enhancing its ability to capture detailed narrative structures. In addition, STPar incorporates multi-task learning, encompassing singleton and span detection tasks, to further improve coreference resolution performance. Our evaluations on the MovieCoref dataset demonstrate that STPar significantly outperforms the best baseline by 7.4%, 21.5%, 7.1% and 10.2% in F1 scores of B^3, CEAF_e, LEA and CoNLL. Further analysis highlights the benefits of integrating structural discourse and syntactic information as well as the combined approaches of triaffine and multi-task learning.
creator: Li Zheng
creator: Hao Fei
creator: Lei Chen
creator: Bobo Li
creator: Fei Li
creator: Chong Teng
creator: Liang Zhao
creator: Donghong Ji
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

TANQ: An open domain dataset of table answered questions
type: item
description: Language models, potentially augmented with tool usage such as retrieval are becoming the go-to means of answering questions. Understanding and answering questions in real-world settings often requires re-trieving information from different sources, processing and aggregating data to extract insights, and presenting complex findings in form of structured artifacts such as novel tables, charts, or infographics. In this paper, we introduce TANQ, the first open domain question answering dataset where the answers require building tables from information across multiple sources. We release the full source attribution for every cell in the resulting table and benchmark state-of-the-art language models in open, oracle, and closed book setups. Our best-performing baseline, Gemini Flash reaches an overall F1 score of 60.7, lagging behind human performance by 12.3 points. We analyse baselines’ performance across different dataset attributes such as different skills required for this task, including multi-hop reasoning, math operations, and unit conversions. We further discuss common failures in model-generated answers, suggesting that TANQ is a complex task with many challenges ahead.
creator: Mubashara Akhtar
creator: Chenxi Pang
creator: Andreea Marzoca
creator: Yasemin Altun
creator: Julian Eisenschlos
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

A Confidence-based Acquisition Model for Self-supervised Active Learning and Label Correction
type: item
description: Supervised neural approaches are hindered by their dependence on large, meticulously annotated datasets, a requirement that is particularly cumbersome for sequential tasks. The quality of annotations tends to deteriorate with the transition from expert-based to crowd-sourced labelling. To address these challenges, we present CAMELL (Confidence-based Acquisition Model for Efficient self-supervised active Learning with Label validation), a pool-based active learning framework tailored for sequential multi-output problems. CAMELL possesses three core features: (1) it requires expert annotators to label only a fraction of a chosen sequence, (2) it facilitates self-supervision for the remainder of the sequence, and (3) it employs a label validation mechanism to prevent erroneous labels from contaminating the dataset and harming model performance. We evaluate CAMELL on two sequential tasks, with a special emphasis on dialogue belief tracking, a task plagued by the constraints of limited and noisy datasets. Our experiments demonstrate that CAMELL outperforms the baselines in terms of efficiency. Furthermore, the data corrections suggested by our method contribute to an overall improvement in the quality of the resulting datasets.
creator: Carel van Niekerk
creator: Christian Geishauser
creator: Michael Heck
creator: Shutong Feng
creator: Hsien-Chin Lin
creator: Nurul Lubis
creator: Benjamin Ruppik
creator: Renato Vukovic
creator: Milica Gašić
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Self-Rationalization in the Wild: A Large Scale Out-of-Distribution Evaluation on NLI-related tasks
type: item
description: Free-text explanations are expressive and easy to understand, but many datasets lack annotated explanation data, making it challenging to train models for explainable predictions. To address this, we investigate how to use existing explanation datasets for self-rationalization and evaluate models' out-of-distribution (OOD) performance. We fine-tune T5-Large and OLMo-7B models and assess the impact of fine-tuning data quality, the number of fine-tuning samples, and few-shot selection methods. The models are evaluated on 19 diverse OOD datasets across three tasks: natural language inference, fact-checking, and hallucination detection in abstractive summarization. For the generated explanation evaluation, we conduct a human study on 13 selected models and study its correlation with the Acceptability score (T5-11B) and three other LLM-based reference-free metrics. Human evaluation shows that the Acceptability score correlates most strongly with human judgments, demonstrating its effectiveness in evaluating free-text explanations. Our findings reveal: 1) few annotated examples effectively adapt models for OOD explanation generation; 2) compared to sample selection strategies, fine-tuning data source has a larger impact on OOD performance; and 3) models with higher label prediction accuracy tend to produce better explanations, as reflected by higher Acceptability scores.
creator: Jing Yang
creator: Max Glockner
creator: Anderson Rocha
creator: Iryna Gurevych
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Patchwise Cooperative Game-based Interpretability Method for Large Vision-Language Models
type: item
description: Amidst the rapid advancement of artificial intelligence, research on large vision-language models (LVLMs) has emerged as a pivotal area. However, understanding their internal mechanisms remains challenging due to the limitations of existing interpretability methods, especially regarding faithfulness and plausibility. To address this, we first construct a human response interpretability dataset that evaluates the plausibility of model explanations by comparing the attention regions between the model and humans when answering the same questions. We then propose a patchwise cooperative game-based interpretability method for LVLMs, which employs Shapley values to quantify the impact of individual image patches on generation likelihood and enhances computational efficiency through a single input approximation approach. Experimental results demonstrate our method's faithfulness, plausibility, and robustness. Our method provides researchers with deeper insights into model behavior, allowing for an examination of the specific image regions each layer relies on during response generation, ultimately enhancing model reliability. Our codes are available at https://github.com/ZY123-GOOD/ Patchwise_Cooperative.
creator: Yao Zhu
creator: Yunjian Zhang
creator: Zizhe Wang
creator: Xiu Yan
creator: Peng Sun
creator: Xiangyang Ji
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

TaxoPro: A Plug-In LoRA-based Cross-Domain Method for Low-Resource Taxonomy Completion
type: item
description: Low-resource taxonomy completion aims to automatically insert new concepts into the existing taxonomy, in which only a few in-domain training samples are available. Recent studies have achieved considerable progress by incorporating prior knowledge from pre-trained language models (PLMs). However, these studies tend to overly rely on such knowledge and neglect the shareable knowledge across different taxonomies. In this paper, we propose TaxoPro, a plug-in LoRA-based cross-domain method, that captures shareable knowledge from the high-resource taxonomy to improve PLM-based low-resource taxonomy completion techniques. To prevent negative interference between domain-specific and domain-shared knowledge, TaxoPro decomposes cross-domain knowledge into domain-shared and domain-specific components, storing them using low-rank matrices (LoRA). Additionally, TaxoPro employs two auxiliary losses to regulate the flow of shareable knowledge. Experimental results demonstrate that TaxoPro improves PLM-based techniques, achieving state-of-the-art performance in completing low-resource taxonomies. Codes are available at https://github.com/cyclexu/ TaxoPro.
creator: Hongyuan Xu
creator: Yuhang Niu
creator: Ciyi Liu
creator: Yanlong Wen
creator: Xiaojie Yuan
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Transformers as Transducers
type: item
description: We study the sequence-to-sequence mapping capacity of transformers by relating them to finite transducers, and find that they can express surprisingly large classes of (total functional) transductions. We do so using variants of RASP, a programming language designed to help people "think like transformers,'' as an intermediate representation. We extend the existing Boolean variant B-RASP to sequence-to-sequence transductions and show that it computes exactly the first-order rational transductions (such as string rotation). Then, we introduce two new extensions. B-RASP[pos] enables calculations on positions (such as copying the first half of a string) and contains all first-order regular transductions. S-RASP adds prefix sum, which enables additional arithmetic operations (such as squaring a string) and contains all first-order polyregular transductions. Finally, we show that masked average-hard attention transformers can simulate S-RASP.
creator: Lena Strobl
creator: Dana Angluin
creator: David Chiang
creator: Jonathan Rawski
creator: Ashish Sabharwal
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

How "Real" is Your Real-Time Simultaneous Speech-to-Text Translation System?
type: item
description: Simultaneous speech-to-text translation (SimulST) translates source-language speech into target-language text concurrently with the speaker's speech, ensuring low latency for better user comprehension. Despite its intended application to unbounded speech, most research has focused on human pre-segmented speech, simplifying the task and overlooking significant challenges. This narrow focus, coupled with widespread terminological inconsistencies affecting the task, is limiting the applicability of research outcomes to real-world applications, ultimately hindering progress in the field. Our extensive literature review of 110 papers not only reveals these critical issues in current research but also serves as the foundation for our key contributions, we: 1) define the steps and core components of a SimulST system, proposing a standardized terminology and taxonomy, 2) conduct a thorough analysis of community trends, and 3) offer concrete recommendations and future directions to bridge the gaps in existing literature, from evaluation frameworks to system architectures, for advancing the field towards more realistic and effective SimulST solutions.
creator: Sara Papi
creator: Peter Polak
creator: Dominik Macháček
creator: Ondřej Bojar
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Anchored Preference Optimization and Contrastive Revisions: Addressing Underspecification in Alignment
type: item
description: Large Language Models (LLMs) are often aligned using contrastive alignment objectives and preference pair datasets. The interaction between model, paired data, and objective makes alignment a complicated procedure, sometimes producing subpar results. We study this and find that (i) preference data gives a better learning signal when the underlying responses are contrastive, and (ii) alignment objectives lead to better performance when they specify more control over the model during training. Based on these insights, we introduce Contrastive Learning from AI Revisions (CLAIR), a data-creation method which leads to more contrastive preference pairs, and Anchored Preference Optimization (APO), a controllable and more stable alignment objective. We align Llama-3-8B-Instruct using various comparable datasets and alignment objectives and measure MixEval-Hard scores, which correlate highly with human judgments. The CLAIR preferences lead to the strongest performance out of all datasets, and APO consistently outperforms less controllable objectives. Our best model, trained on 32K CLAIR preferences with APO, improves Llama-3-8B-Instruct by 7.65%, closing the gap with GPT-4 Turbo by 45%. Our code and datasets are available.
creator: Karel Doosterlinck
creator: Winnie Xu
creator: Chris Develder
creator: Thomas Demeester
creator: Amanpreet Singh
creator: Christopher Potts
creator: Douwe Kiela
creator: Shikib Mehri
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Navigating Cultural Chasms: Exploring and Unlocking the Cultural POV of Text-To-Image Models
type: item
description: Text-To-Image (TTI) models, such as DALL-E and StableDiffusion, have demonstrated remarkable prompt-based image generation capabilities. Multilingual encoders may have a substantial impact on the cultural agency of these models, as language is a conduit of culture. In this study, we explore the cultural perception embedded in TTI models by characterizing culture across three hierarchical tiers: cultural dimensions, cultural domains, and cultural concepts. Based on this ontology, we derive prompt templates to unlock the cultural knowledge in TTI models, and propose a comprehensive suite of evaluation techniques, including intrinsic evaluations using the CLIP space, extrinsic evaluations with a Visual-Question-Answer (VQA) model and human assessments, to evaluate the cultural content of TTI-generated images. To bolster our research, we introduce the CulText2I dataset, derived from six diverse TTI models and spanning ten languages. Our experiments provide insights regarding Do, What, Which and How research questions about the nature of cultural encoding in TTI models, paving the way for cross-cultural applications of these models.
creator: Mor Ventura
creator: Eyal Ben-David
creator: Anna Korhonen
creator: Roi Reichart
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13

Few-shot Multilingual Open-domain QA from 5 Examples
type: item
description: Recent approaches to multilingual open-domain question answering (MLODQA) have achieved promising results given abundant language-specific training data. However, the considerable annotation cost limits the probability of these methods for underrepresented languages. We introduce a \emph{few-shot} learning approach that generates large-scale multilingual data from large language models (LLMs) with minimal supervision for MLODQA. Our method begins with large-scale self-supervised pre-training by exploiting WikiData, followed by training on high-quality synthetic multilingual data generated by prompting LLMs with few-shot examples. The resulting model, FsModQA, significantly outperforms existing few-shot and supervised baselines in MLODQA and cross-lingual and monolingual retrieval. We further show our method can be extended for effective zero-shot adaptation to new languages through a \emph{cross-lingual prompting} strategy with only English-supervised data, making it a general and applicable solution for MLODQA tasks without costly large-scale annotation.
creator: Fan Jiang
creator: Tom Drummond
creator: Trevor Cohn
rights: Copyright (c) 2025 Association for Computational Linguistics http://creativecommons.org/licenses/by/4.0
license: http://creativecommons.org/licenses/by/4.0
date: 2025-12-25
publication date: 2025-12-25
volume: 13