CURIO: Curiosity-Driven Test-Time Learning for Open-Ended Discovery
cs.LG, cs.CL
Submitted: 2026-10-04
Updated: 2026-10-04
Code: https://github.com/algorithmicsuperintelligence/openevolve
License: http://creativecommons.org/licenses/by/4.0/
The gist: Open-ended discovery requires learning from repeated attempts while continuing to explore directions whose value is not yet apparent.
Abstract
Open-ended discovery requires learning from repeated attempts while continuing to explore directions whose value is not yet apparent. Search with a frozen large language model (LLM) can reuse previous solutions in context, but cannot update the model from its successes and failures on the test problem. Reinforcement learning (RL) enables such adaptation; however, strongly favoring high-reward trajectories may suppress low-reward yet potentially promising directions too early. We introduce CURIO, a curiosity-driven test-time learning framework that complements task feedback with an Intrinsic Curiosity World Model (ICWM). The ICWM learns transitions in the policy's hidden-state representation and supplies prediction-error bonuses at sampled tokens outside the policy's top-k choices. Epoch normalization and an annealed weight regulate their contribution to the policy update. On six mathematical discovery tasks and single-cell denoising with Qwen3 backbones from 8B to 235B, three-run means improve over a matched task-only RL control on five mathematical objectives, match the best reported performance on Circle Packing, and improve denoising Score and mean squared error (MSE) on both held-out corpora at every tested scale. Relative gains reach 18.3% on Hadamard and 10.8% on denoising Score. Code-diversity measurements show greater structural variation among generated programs, supporting curiosity as a complementary exploration signal for learning in open-ended discovery.
Sources
- A Survey of Exploration Methods in Reinforcement Learning
- CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization
- Online Preference Alignment for Language Models via Count-based Exploration
- Exploration by Random Network Distillation
- The Entropy Mechanism of Reinforcement Learning for Reasoning Language Models
- Navigate the Unknown: Enhancing LLM Reasoning with Intrinsic Motivation Guided Exploration
- Continuous control with deep reinforcement learning
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- KernelBench: Can LLMs Write Efficient GPU Kernels?
- PostTrainBench: Can LLM Agents Automate LLM Post-Training?
- On Entropy Control in LLM-RL Algorithms
- ThetaEvolve: Test-time Learning on Open Problems
- NatureBench: Can Coding Agents Match the Published SOTA of Nature-Family Papers?
- Qwen3 Technical Report
- Structured Scaling of AI Discovery Across Diverse Scientific Domains
- Flow of Reasoning: Training LLMs for Divergent Reasoning with Minimal Examples
- Weak-to-Strong On-Policy Distillation
- Learning to Discover at Test Time
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