Optimizing Prompt Sequences using Monte Carlo Tree Search for LLM-Based Optimization

arXiv:2508.05995 · cs.LG · Submitted 2025-08-08 · Read on arXiv

cs.LG

Submitted: 2025-08-08

Updated: 2026-10-18

Terminology

• LLMs with Monte Carlo Tree Search — 1× in this paper
• Large Language Models (LLMs) — 1× in this paper · explained in 8 episodes
• Monte Carlo Tree Search (MCTS) — 1× in this paper · explained in 3 episodes
• Structured Reasoning — 1× in this paper · explained in 3 episodes

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