English
Related papers

Related papers: Teaching Large Language Models When Not to Know: L…

200 papers

Large language models (LLMs) face significant challenges in ex-ante reasoning, where analysis, inference, or predictions must be made without access to information from future events. Even with explicit prompts enforcing temporal cutoffs,…

Machine Learning · Computer Science 2025-05-27 Yachuan Liu , Xiaochun Wei , Lin Shi , Xinnuo Li , Bohan Zhang , Paramveer Dhillon , Qiaozhu Mei

Backtesting large language models on historical events requires reasoning exclusively from information available before a specified cutoff date. Yet models routinely leak post-cutoff knowledge from pre-training into their reasoning,…

Machine Learning · Computer Science 2026-05-20 Zeyu Zhang , Bradly C. Stadie

Large Language Models (LLMs) are widely used for temporal prediction, but their reliance on pretraining data raises contamination concerns, as accurate predictions on pre-cutoff test data may reflect memorization rather than reasoning,…

Computation and Language · Computer Science 2025-10-16 Xin Gao , Ruiyi Zhang , Daniel Du , Saurabh Mahindre , Sai Ashish Somayajula , Pengtao Xie

Large language models (LLMs) primarily rely on supervised fine-tuning (SFT) as a key method to adapt pre-trained models to domain-specific tasks such as mathematical reasoning. However, standard SFT uniformly penalizes all tokens,…

Computation and Language · Computer Science 2025-10-14 Zhiwen Ruan , Yixia Li , He Zhu , Yun Chen , Peng Li , Yang Liu , Guanhua Chen

Despite the advanced capabilities of large language models (LLMs), their temporal reasoning ability remains underdeveloped. Prior works have highlighted this limitation, particularly in maintaining temporal consistency when understanding…

Computation and Language · Computer Science 2025-06-18 Jongho Kim , Seung-won Hwang

Released Large Language Models (LLMs) are often paired with a claimed knowledge cutoff date, or the dates at which training data was gathered. Such information is crucial for applications where the LLM must provide up to date information.…

Computation and Language · Computer Science 2024-09-18 Jeffrey Cheng , Marc Marone , Orion Weller , Dawn Lawrie , Daniel Khashabi , Benjamin Van Durme

Large language models (LLMs) have recently gained significant attention due to their unparalleled ability to perform various natural language processing tasks. These models, benefiting from their advanced natural language understanding…

Computation and Language · Computer Science 2024-01-23 Jonas Wallat , Adam Jatowt , Avishek Anand

Large language models (LLMs) have led to a series of breakthroughs in natural language processing (NLP), owing to their excellent understanding and generation abilities. Remarkably, what further sets these models apart is the massive…

Computation and Language · Computer Science 2022-11-10 Daliang Li , Ankit Singh Rawat , Manzil Zaheer , Xin Wang , Michal Lukasik , Andreas Veit , Felix Yu , Sanjiv Kumar

Supervised Fine-Tuning (SFT) is commonly used to train language models to imitate annotated responses for given instructions. In this paper, we propose Critique Fine-Tuning (CFT), a method more effective than SFT for reasoning tasks.…

Computation and Language · Computer Science 2025-04-01 Yubo Wang , Xiang Yue , Wenhu Chen

Reasoning in Large Language Models (LLMs) often suffers from inefficient long chain-of-thought traces with redundant self-exploration and validation, which inflate computational costs and even degrade performance. Inspired by human…

Artificial Intelligence · Computer Science 2026-02-17 Qianyue Wang , Jinwu Hu , Huanxiang Lin , Bolin Chen , Zhiquan Wen , Yaofo Chen , Yu Rong , Mingkui Tan

Factual knowledge extraction aims to explicitly extract knowledge parameterized in pre-trained language models for application in downstream tasks. While prior work has been investigating the impact of supervised fine-tuning data on the…

Computation and Language · Computer Science 2025-05-30 Xuan Gong , Hanbo Huang , Shiyu Liang

Long chain-of-thought (CoT) significantly enhances the reasoning capabilities of large language models (LLMs). However, extensive reasoning traces lead to inefficiencies and increased time-to-first-token (TTFT). We propose a training…

Computation and Language · Computer Science 2026-01-08 Roy Xie , David Qiu , Deepak Gopinath , Dong Lin , Yanchao Sun , Chong Wang , Saloni Potdar , Bhuwan Dhingra

A common challenge towards the adaptability of Large Language Models (LLMs) is their ability to learn new languages over time without hampering the model's performance on languages in which the model is already proficient (usually English).…

Computation and Language · Computer Science 2026-04-24 Divyanshu Aggarwal , Sankarshan Damle , Navin Goyal , Satya Lokam , Sunayana Sitaram

Widely used language models (LMs) are typically built by scaling up a two-stage training pipeline: a pre-training stage that uses a very large, diverse dataset of text and a fine-tuning (sometimes, 'alignment') stage that uses targeted…

Computation and Language · Computer Science 2023-10-20 Eric Mitchell , Rafael Rafailov , Archit Sharma , Chelsea Finn , Christopher D. Manning

Large language models (LLMs) encode parametric knowledge about world facts and have shown remarkable performance in knowledge-driven NLP tasks. However, their reliance on parametric knowledge may cause them to overlook contextual cues,…

Computation and Language · Computer Science 2023-10-24 Wenxuan Zhou , Sheng Zhang , Hoifung Poon , Muhao Chen

The two-stage fine-tuning (FT) method, linear probing (LP) then fine-tuning (LP-FT), outperforms linear probing and FT alone. This holds true for both in-distribution (ID) and out-of-distribution (OOD) data. One key reason for its success…

Machine Learning · Computer Science 2024-10-23 Akiyoshi Tomihari , Issei Sato

Latent reasoning represents a new development in Transformer language models that has shown potential in compressing reasoning lengths compared to chain-of-thought reasoning. By directly passing the information-rich previous final latent…

Machine Learning · Computer Science 2025-11-27 Alex Ning , Yen-Ling Kuo , Gabe Gomes

Large language models (LLMs) rarely admit uncertainty, often producing fluent but misleading answers, rather than abstaining (i.e., refusing to answer). This weakness is even evident in temporal question answering, where models frequently…

Computation and Language · Computer Science 2026-03-05 Xinyu Zhou , Chang Jin , Carsten Eickhoff , Zhijiang Guo , Seyed Ali Bahrainian

Large language models (LLMs) are typically trained on shuffled corpora, yielding models whose knowledge is frozen at train time and whose temporal grounding remains poorly understood. In this work, we study the impact of pre-training…

Computation and Language · Computer Science 2026-05-26 Hippolyte Pilchen , Romain Fabre , Franck Signe Talla , Patrick Perez , Edouard Grave

This paper investigates the reliability of explanations generated by large language models (LLMs) when prompted to explain their previous output. We evaluate two kinds of such self-explanations - extractive and counterfactual - using three…

Computation and Language · Computer Science 2025-02-03 Korbinian Randl , John Pavlopoulos , Aron Henriksson , Tony Lindgren
‹ Prev 1 2 3 10 Next ›