Skip to content
Conference Open access

FormulaSPIN: Self-Play Fine-Tuning for Natural Language to Spreadsheet Formula Generation

May 2026 · Annual Meeting of the Association for Computational Linguistics · pp. 14457-14471 · 0 citations · 34 references
Computer Science

TL;DR

This paper introduces FORMULASPIN, a self-play framework that breaks the ceiling of supervised fine-tuning by enabling iterative self-improvement without any additional data, and underscores self-play's potential to tackle scarce data tasks and open the door to extending it beyond executable domains.

Abstract

Spreadsheet applications are used by hundreds of millions worldwide, yet writing formulas remains a significant barrier. Existing approaches rely on static supervised data, which quickly saturates on limited annotations. In this paper, we introduce FORMULASPIN, a self-play framework that breaks the ceiling of supervised fine-tuning by enabling iterative self-improvement without any additional data. Vanilla SPIN fails on this task: it uniformly penalizes every non-matching output, so execution-equivalent alternatives are punished as negatives in one example while serving as ground truth in another, producing contradictory gradients. Our framework resolves this by exploiting formula generation's unique advantage: binary executability provides implicit supervision that separates semantic errors from valid stylistic variants. We frame training as a two-player game in which the main player learns to prefer ground-truth formulas over those from its previous version, while execution feedback sorts outputs into distinct granularities-enabling an adaptive curriculum that shifts from semantic correctness to stylistic refinement. To further increase accuracy, we incorporate ExecVote, a semantic-level voting mechanism that naturally handles multiple valid formulations. Experiments on multiple benchmarks demonstrate that FORMULASPIN achieves state-of-the-art performance, with 74.9% exact match and 87.1% execution accuracy on NL2FORMULA, matching models trained with additional preference annotations while outperforming both traditional SFT and frontier proprietary models. These findings underscore self-play's potential to tackle scarce data tasks and open the door to extending it beyond executable domains.

Read PDF

Similar papers

Jul 2026

Think Through a Bottleneck: Hourglass Reasoning for Rigorous Induction

Hourglass reasoning is introduced, which enforces strict context isolation between reasoning stages, and raises best-of-5 accuracy over an iterative-refinement baseline with GPT-5.5 and Gemini 3.1 Pro.

Huan Zhu · 0 citations
Preprint Aug 2026

Graph-Guided Selective Unlearning for Language Models: Controlling Support Routes Beyond Forget Seeds

GRAPHSU is proposed, a graph-guided controller that expands the deletion scope beyond forget seeds by constructing a weighted support-route graph, propagating deletion pressure through it, and applying graded forgetting strengths to high-risk neighbors, demonstrating that effective enterprise unlearning requires contro...

Waqas Khan, Tabinda Sarwar, Jingyue Cong et al. · 0 citations
Preprint Jul 2026

Selective Left-Shift: Turning Test-Time Compute and Difficulty-based Curation into Training Data for Low-Resource Code Generation

This work proposes a three-phase pipeline that resolves this trilemma by decoupling syntax acquisition from algorithmic reasoning and applies Reinforcement Learning with Verifiable Reward~(RLVR) grounded by language-agnostic Input/Output tests.

D. Samaraweera, Anjana Supun, Srinath Perera · 0 citations
#artificial intelligence Preprint Aug 2026

Evaluating Tiny Recursive Models Across Training for Code Generation

This work compares a ~28M-parameter autoregressive Tiny Recursive Model (TRM-AR) on natural-language-to-Python code generation against parameter-matched and depth-matched controls, tracking fit and generation across 40 epochs and three seeds.

Anjani Sirivella, Aanisha Newaz, Glaucia Melo · 0 citations
Book Open access Jul 2026

Tokens to Types: Context Editing with Selective Entity Abstraction for Grounded Generation

This framework proposes a context-editing framework that performs selective abstraction over entities that appear in both the context and the question, establishing symbolic abstraction as a highly cost-efficient solution for ensuring context fidelity in LLMs.

Rounak Sharma, Debabrata Mahapatra, S. Saini · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.