Skip to content

Neural MCTS with LLM Guidance for Effective Program Synthesis on Abstraction and Reasoning Corpus

Jul 2026 · Machine-mediated learning · Vol 115 · 0 citations · 21 references
Computer Science

TL;DR

This work introduces a neural MCTS algorithm customized for ARC-AGI, which amplifies exploration by directing the search toward promising solutions via learned neural guidance, yielding robust performance on demanding ARC tasks.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

Development of an Autonomous AI Coding Agent using Monte Carlo Tree Search (MCTS) and Gemini LLM Frameworks

This research presents an autonomous AI Coding Agent which establishes a connection between LLM-generated content and production-ready software through its organized methodology for decision making through its tailored Monte Carlo Tree Search method.

Pravin Game, V. Ramakrishnan, Prathamesh Wagh · 0 citations
Jul 2026

LLM-Guided Evolutionary Search for Constraint Model Reformulation to Improve Solver Efficiency

Combinatorial problems appear in numerous industrial applications. A common approach is to formulate these problems as declarative constraint models that can subsequently be compiled to and solved by a range of back-end solvers. Recent work shows that Large Language Models (LLMs) can produce correct models from natural language, but even a correct model can be expensive to solve because performance remains sensitive to modelling choices. In this work, we investigate whether LLMs can automate performance-oriented model reformulation. Inspired by Automatic Heuristic Design (AHD), we use an evolutionary framework in which an LLM proposes candidate reformulations that are verified and benchmarked against the user-defined baseline model. We compare AHD-adapted search strategies that control which prior attempts, instructions, and measured feedback enter each prompt. Existing retention strategies prioritize recency or performance, but do not explicitly diversify the context. To cover this gap, we introduce Profile-Diverse Retention (PDR), which applies Maximal Marginal Relevance (MMR) to instance-level runtime vectors to retain behaviourally diverse attempts. We systematically evaluate the strategies on eight CSPLib problems using validation-based final model selection. The results show that: (i) iterative reformulation can produce substantial held-out speedups; (ii) strategies that keep the retained context diverse outperform those that retain only recent or the fastest attempts; and (iii) validation-based selection improves the held-out speedup of every strategy.

Kostis Michailidis, Dimos Tsouros, Dang Nguyen et al. · 0 citations
#natural language process... Preprint Aug 2026

COGTRL: Training LLMs for Scientific Discovery Assistance using Cognitive Traces via Reinforcement Learning

COGTRL is proposed, a trajectory-level reinforcement learning framework that trains LLMs to emulate cognitively grounded reasoning by jointly optimizing cognitive traces and the scientific steps produced in an interleaved manner.

Shrinidhi Kumbhar, Santosh Mashetty, Divij Handa et al. · 1 citation
Jul 2026

PoTRE: Test-Time Reasoning inspired by Cognitive Heterogeneity

PoTRE (Poly-Topological Reasoning Ensembles), a heterogeneous framework that decouples inference into four agents that achieves improved reasoning performance using similar or fewer inference tokens compared to heavily scaled homogeneous baselines is introduced.

Anmol Kankariya, Sercan Ö. Arik · 0 citations
Jul 2026

Offline-Online Curriculum RL for Multimodal Reasoning

This work proposes $O^2-CritiCuRL, a novel curriculum reinforcement learning framework that introduces critical-step awareness through an iterative offline-online paradigm, and employs a progressive step-level reinforcement learning strategy, where truncated chains guide the model to infer missing steps and refine its reasoning.

Wendi Deng, Hang Du, Guoshun Nan et al. · 0 citations
Jul 2026

SkillSmith: Learning to Compose Parametric Skills and Textual Knowledge

This work instantiate parametric learning via prefix-tuning and augment an LLM to ingest both prefix weights and rich textual data which capture relationships to a target capability, and synthesizes these inputs to perform instruction-steered parametric synthesis, directly outputting new prefix weights that manifest the target skill.

Lucio M. Dery, Benedict Aaron Tjandra, Siavash Samiei et al. · 0 citations

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