AIBullisharXiv – CS AI · Apr 207/10
🧠Researchers propose a bilevel optimization framework using Monte Carlo Tree Search to systematically improve LLM agent skills—structured collections of instructions, tools, and resources. The framework optimizes both skill structure and component content simultaneously, demonstrating performance improvements on Operations Research tasks and addressing a previously unsolved challenge in agent design optimization.
AIBullisharXiv – CS AI · Apr 147/10
🧠Researchers introduce Inverse-RPO, a methodology for deriving prior-based tree policies in Monte Carlo Tree Search from first principles, and apply it to create variance-aware UCT algorithms that outperform PUCT without additional computational overhead. This advances the theoretical foundation of MCTS used in reinforcement learning systems like AlphaZero.
AINeutralarXiv – CS AI · 3d ago6/10
🧠Researchers introduce AlphaTransit, an AI framework combining Monte Carlo Tree Search with neural networks to optimize city-scale bus network design. The system achieves 9.9-11.4% performance improvements over reinforcement learning alone by coupling learned guidance with tree search, demonstrating that hybrid approaches outperform single-method solutions for complex infrastructure planning problems.
AINeutralarXiv – CS AI · 3d ago6/10
🧠Researchers introduce McDiffuSE, an MCTS-based framework that optimizes slot-filling order in Masked Diffusion Models to improve performance on mathematical and code reasoning tasks. The approach achieves 3.2% improvement over autoregressive baselines and up to 19.5% gains on specific benchmarks by strategically exploring generation orderings rather than following sequential patterns.
AINeutralarXiv – CS AI · 4d ago5/10
🧠Researchers propose Monte Carlo Permutation Search (MCPS), an improved Monte Carlo Tree Search algorithm that enhances the GRAVE algorithm for game-playing AI. MCPS leverages statistics from all playouts containing moves along the path from root to node, demonstrating superior performance across multiple games while eliminating GRAVE's bias hyperparameter.
AINeutralarXiv – CS AI · May 126/10
🧠Arcane is a new assertion reduction framework that uses semantic clustering and Monte Carlo Tree Search to eliminate redundant assertions in hardware verification, achieving up to 76.2% reduction in assertion count while maintaining full formal coverage and enabling 2.6x to 6.1x simulation speedups.
AIBullisharXiv – CS AI · Mar 166/10
🧠Researchers have developed ToolTree, a new Monte Carlo tree search-based planning system for LLM agents that improves tool selection and usage through dual-feedback evaluation and bidirectional pruning. The system achieves approximately 10% performance gains over existing methods while maintaining high efficiency across multiple benchmarks.
AIBullisharXiv – CS AI · Mar 126/10
🧠Researchers developed a lightweight AI framework for the Game of the Amazons that combines graph attention networks with large language models, achieving 15-56% improvement in decision accuracy while using minimal computational resources. The hybrid approach demonstrates weak-to-strong generalization by leveraging GPT-4o-mini for synthetic training data and graph-based learning for structural reasoning.
🧠 GPT-4
AIBullisharXiv – CS AI · Mar 26/1013
🧠Researchers introduce RF-Agent, a framework that uses Large Language Models as agents to automatically design reward functions for control tasks through Monte Carlo Tree Search. The method improves upon existing approaches by better utilizing historical feedback and enhancing search efficiency across 17 diverse low-level control tasks.
AINeutralarXiv – CS AI · Mar 34/104
🧠Researchers introduce Coordinated Boltzmann MCTS (CB-MCTS), a new approach for multi-agent AI planning that uses stochastic exploration instead of deterministic methods. The technique addresses challenges in sparse reward environments where traditional decentralized Monte Carlo Tree Search struggles, showing superior performance in deceptive scenarios while remaining competitive on standard benchmarks.
AINeutralarXiv – CS AI · Feb 274/108
🧠Researchers introduce GRAVE2, GRAVER and GRAVER2 algorithms that extend Generalized Rapid Action Value Estimation (GRAVE) for game playing AI. These new variants dramatically reduce memory requirements while maintaining the same playing strength as the original GRAVE algorithm.
