Instruction Tuning Chronologically Consistent Language Models

Songrun He, Linying Lv, Asaf Manela, Jimmy Wu
10/13/2025
cs.LGq-fin.GN

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We introduce a family of chronologically consistent, instruction-tuned large language models to eliminate lookahead bias. Each model is trained only on data available before a clearly defined knowledge-cutoff date, ensuring strict temporal separation from any post-cutoff data. The resulting framework offers (i) a simple, conversational chat interface, (ii) fully open, fixed model weights that guarantee replicability, and (iii) a conservative lower bound on forecast accuracy, isolating the share of predictability that survives once training leakage is removed. Together, these features provide researchers with an easy-to-use generative AI tool useful for a wide range of prediction tasks that is free of lookahead bias.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{he2025instruction,
  title  = {Instruction Tuning Chronologically Consistent Language Models},
  author = {Songrun He and Linying Lv and Asaf Manela and Jimmy Wu},
  year   = {2025},
  eprint = {2510.11677},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.11677v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.11677.svg)](https://codeofpaper.com/paper/2510.11677)

Discussion