arXiv Machine Learning August 11, 2026 By Kezhao Lai, Yutao Lai, Hai-Lin Liu

Beyond the Node: Clade-level Selection for Efficient MCTS in Automatic Heuristic Design

Read the original on arXiv Machine Learning →

arXiv:2602. 00549v2 Announce Type: replace Abstract: While Monte Carlo Tree Search (MCTS) shows promise in Large Language Model (LLM) based Automatic Heuristic Design (AHD), it suffers from a critical over-exploitation tendency under the limited computational budgets required for heuristic evaluation.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Computation and Language

Sep 1

When LLM Meets Tree Search: A Systematic View of Inference as Search in Large Language Models

arXiv:2608.30395v1 Announce Type: new Abstract: As pretraining scaling laws approach saturation, Test-Time Scaling (TTS) has emerged as an important direction for improving reasoning by allocating in...

By Jiaqi Wei, Xiang Zhang, Yuejin Yang, Wenxuan Huang, Juntai Cao, Sheng Xu, Xiang Zhuang, Zhangyang Gao, Muhammad Abdul-Mageed, Laks VS Lakshmanan, Chenyu You, Wanli Ouyang, Siqi Sun

llms

arXiv Machine Learning

Sep 2

ES-AHD: An Evolution Strategy Framework for Automatic Heuristic Design

arXiv:2609.00023v1 Announce Type: cross Abstract: In this paper, we introduce ES-AHD, a novel framework that fundamentally integrates Evolution Strategy (ES) into Large Language Model (LLM)-driven Au...

By Yutao Lai, Kezhao Lai, Hai-Lin Liu, Yuping Wang, Ping Guo

llms rag

arXiv Machine Learning

Jun 5

Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs

arXiv:2602. 09574v2 Announce Type: replace-cross Abstract: Tree-search decoding is an effective form of test-time scaling for large language models (LLMs), but real-world deployment often imposes a fixed per-query token budget that varies across settings.

By Sora Miyamoto, Daisuke Oba, Naoaki Okazaki

llms benchmarks

arXiv Machine Learning

Jun 26

Target-Aware Bandit Allocation for Scalable Surrogate Optimization in Chemical Space

arXiv:2606. 26657v1 Announce Type: new Abstract: Identifying high-utility candidates from massive discrete spaces under expensive evaluations is a recurring challenge across the sciences, with structure-based drug discovery as a prominent example.

By Mohammad Haddadnia, Yuvan Chali, Abhilash Jayaraj, Constance Kraay, Joana Reis, Felix Strieth-Kalthoff, Haribabu Arthanari

reinforcement-learning

arXiv AI

Jul 7

Bootstrap Flow-Map Tree Sampling Enables Online Feedback Driven Search

arXiv:2607. 02915v1 Announce Type: cross Abstract: In many scientific and engineering domains, maximizing discovery within a limited sampling budget demands strategic, observation-guided exploration.

By Binglin Ji, Anindya Sarkar, Hengchang Lu, Jens Sj\"olund, Yevgeniy Vorobeychik

safety

arXiv AI

Jun 10

Towards Diverse Scientific Hypothesis Search with Large Language Models

arXiv:2606. 10587v1 Announce Type: cross Abstract: Large language models (LLMs) are on the rise for accelerating scientific discovery, most recently in advanced tasks such as generating valid scientific hypotheses.

By Haorui Wang, Parshin Shojaee, Kazem Meidani, Kunyang Sun, Jos\'e Miguel Hern\'andez-Lobato, Teresa Head-Gordon, Jiajun He, Chandan K. Reddy, Chao Zhang, Yuanqi Du

llms

One email a morning, machine-written

Related stories

When LLM Meets Tree Search: A Systematic View of Inference as Search in Large Language Models

ES-AHD: An Evolution Strategy Framework for Automatic Heuristic Design

Aligning Tree-Search Policies with Fixed Token Budgets in Test-Time Scaling of LLMs

Target-Aware Bandit Allocation for Scalable Surrogate Optimization in Chemical Space

Bootstrap Flow-Map Tree Sampling Enables Online Feedback Driven Search

Towards Diverse Scientific Hypothesis Search with Large Language Models