Priced Guidance: Can Language Models Generate Future Research Ideas?
cs.LG
Submitted: 2026-10-04
Updated: 2026-10-04
Comments: 80 pages, 12 figures. Code available at https://github.com/WhenWen/priced-guidance
Code: https://github.com/WhenWen/priced-guidance
License: http://creativecommons.org/licenses/by/4.0/
The gist: We evaluate language models' capability to generate novel research ideas through the lens of compression.
Abstract
We evaluate language models' capability to generate novel research ideas through the lens of compression. We aim to lower-bound the potentially tiny probability that a language model generates the essence of a future research idea without any hints. Rather than estimate this probability through expensive repeated sampling, our Priced Guidance framework measures the compression cost: how many additional bits of information are needed to guide the model to recover the target idea. We prove that if the model can recover the target idea with at most K bits of guidance in expectation, then it can generate the idea without any guidance with probability at least 2-K. In our framework, the language model, called the generator, can pose a sequence of multiple-choice questions and specify a probability distribution over possible answers. A guide, which is a language model with access to the target idea, selects answers. If a selected answer has prior probability p, the generator pays - 2 p bits. The generator aims to produce an idea that matches the essence of the target idea with minimal cumulative cost. This cumulative cost equals, up to an additive constant, the number of bits of information sent by the guide. Using this methodology, we evaluate five generator LLMs (Opus 5, Fable 5.1, GPT-6 Astra, GPT-5.6 Sol, and GLM 5.3) on the core ideas in 87 recent high-quality deep learning papers and we use LLM as judge to determine whether the generated idea matches the target in terms of the central research object and defining mechanism. Fable 5.1 achieves the lowest median compression cost at 69.9 bits, substantially lower than gzip's median of 5,712 bits for losslessly compressing the summary of the target idea. A uniform ensemble of Fable 5.1, Opus 5, and Astra further reduces the median compression cost to 55.8 bits and improves the generation probability lower bound by 18,000 times.
Sources
- SkillNet: Create, Evaluate, and Connect AI Skills
- ResearchAgent: Iterative Research Idea Generation over Scientific Literature with Large Language Models
- Reconstruction: A Blind Benchmark for Recovering Research Ideas from Pre-Publication Bibliographies
- ScienceAgentBench: Toward Rigorous Assessment of Language Agents for Data-Driven Scientific Discovery
- Accelerating scientific discovery with Co-Scientist
- IdeaBench: Benchmarking Large Language Models for Research Idea Generation
- GIANTS: Generative Insight Anticipation from Scientific Literature
- MLAgentBench: Evaluating Language Agents on Machine Learning Experimentation
- HindSight: Evaluating LLM-Generated Research Ideas via Future Impact
- Kimi K3: Open Frontier Intelligence
- Predicting the Future of AI with AI: High-quality link prediction in an exponentially growing knowledge network
- Semantic Uncertainty: Linguistic Invariances for Uncertainty Estimation in Natural Language Generation
- Can Large Language Models Forecast What Researchers Study Next?
- Achieving Gold-Medal-Level Olympiad Reasoning via Simple and Unified Scaling
- ResearchBench: Benchmarking LLMs in Scientific Discovery via Inspiration-Based Task Decomposition
- The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery
- DiscoveryBench: Towards Data-Driven Discovery with Large Language Models
- AI Idea Bench 2025: AI Research Idea Generation Benchmark
- Evaluating LLMs' Divergent Thinking Capabilities for Scientific Idea Generation with Minimal Context
- Can LLMs Generate Novel Research Ideas? A Large-Scale Human Study with 100+ NLP Researchers
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks