monte-carlo-tree-search-mcts--b2f6f124·3 events·first seen Aliases: Monte-Carlo Tree Search (MCTS), Monte Carlo Tree Search
Researchers introduce Graph Sparse Sampling (GSS), an online planning algorithm for continuous Markov Decision Processes that shares sampled futures across candidate decisions rather than branching separately per action, eliminating the tree structure of methods like MCTS. The approach exposes large GPU-friendly batches and uses heuristics to focus computation, with finite-sample performance guarantees showing polynomial (rather than exponential) dependence on planning horizon under suitable conditions. Empirical results on continuous-control tasks show GSS substantially outperforms tree-based planners at long horizons. The work formalizes when shared-future graph planning can avoid the curse of the horizon that afflicts sparse sampling trees.
SkillFuzz is a new testing framework that treats skill composition in LLM-based agent marketplaces as a fuzzing problem, using contract-guided Monte Carlo Tree Search to discover 'implicit intents' — unintended behaviors that emerge only when multiple individually-benign skills are co-activated. The approach is execution-free at audit time, relying on structured skill contracts and a skill-free planning baseline as a differential oracle. Across benchmark workloads, it discovers over 1,000 distinct implicit intents within a fixed query budget and confirms more than 80% of highest-risk flagged compositions during execution-time validation.
A BAIR blog post surveys recent progress in parallel reasoning for LLMs, covering methods from simple self-consistency and Best-of-N sampling through structured search (Tree of Thoughts, MCTS) to newer adaptive approaches including ParaThinker, GroupThink, and Hogwild! Inference. The core motivation is that sequential reasoning scales linearly with exploration depth, causing latency, context-rot, and compute inefficiency. Adaptive parallel reasoning aims to let models themselves decide when and how to decompose tasks into concurrent threads, rather than imposing fixed parallel structure externally. The post frames this as an emerging inference-time scaling paradigm with implications for agentic and complex reasoning workloads.