Tagged articles
Monte Carlo Tree Search
16 articles · Page 1 of 1
VisInteract introduces a dynamic interactive Text-to-Vis paradigm with the VisInteract-Bench benchmark and Vis-MCTS method, using Monte Carlo Tree Search with progressive widening, cross-path memory, and dimension-aware reward decomposition to recover user intent from imperfect queries, achieving 51–57% Merge Task Score on 1,098 samples across 11 databases.
Imperfect QueriesMonte Carlo Tree SearchNeurIPS 2026
0 likes · 18 min read

This article reviews the PandaAI framework, a closed‑loop neural‑symbolic LLM agent that models market regimes, applies constrained Monte‑Carlo Tree Search for factor generation, and continuously adapts via back‑test feedback, achieving significantly higher Rank IC and lower drawdown on CSI‑300 data.
LLMMonte Carlo Tree SearchReinforcement Learning
0 likes · 17 min read

AlphaCFG introduces a grammar‑based framework that defines a controllable search space for discovering syntactically valid, financially interpretable alpha factors, using syntax‑aware Monte‑Carlo tree search guided by value and policy networks, and demonstrates superior search efficiency and profitability on Chinese and US stock datasets.
Grammar Guided SearchMonte Carlo Tree SearchQuantitative Finance
0 likes · 17 min read

The article analyzes why DeepSeek’s large‑model training struggles with Monte‑Carlo Tree Search, explains its use of Chain‑of‑Thought prompting, GRPO entropy‑boosting and rejection‑sampling fine‑tuning, compares these methods with Google’s OmegaPRM and PRM approaches, and proposes a concrete MCTS‑driven data‑generation pipeline to overcome the “chicken and liquor” trade‑off.
DeepSeekGRPOMonte Carlo Tree Search
0 likes · 14 min read

The article examines why DeepSeek’s large‑model training cannot yet leverage Monte‑Carlo Tree Search, detailing its reliance on SFT, GRPO‑driven CoT activation and rejection‑sampling, contrasting this with Google’s PRM‑based approaches, and proposing a MCTS‑powered data‑generation pipeline to overcome the “roast chicken and baijiu” training dilemma.
GRPOMonte Carlo Tree SearchRejection Sampling
0 likes · 14 min read


AntTechApr 22, 2026 · Artificial Intelligence
This article reviews two recent ICLR 2026 papers—M²‑Miner, a multi‑agent Monte‑Carlo Tree Search framework for low‑cost mobile GUI data mining, and IGPO, an information‑gain‑based reinforcement‑learning method that provides dense rewards for multi‑turn search agents—detailing their designs, experiments, and open‑source releases.
GUI Data MiningInformation GainLLM Agents
0 likes · 8 min read

The article introduces Marco‑o1, an open‑source LLM that enhances complex reasoning by fine‑tuning on Chain‑of‑Thought data, integrating Monte‑Carlo Tree Search, introducing mini‑step actions and a reflection mechanism, and evaluates its performance on multilingual math and translation benchmarks.
LLMMonte Carlo Tree Searchartificial intelligence
0 likes · 15 min read

Monte Carlo Tree Search (MCTS) is a statistical heuristic algorithm that builds decision trees through selection, expansion, simulation, and backpropagation, enabling breakthroughs like AlphaGo’s victory and finding applications in robotics, autonomous driving, finance, and bioinformatics.
AI applicationsAlphaGoMCTS
0 likes · 7 min read


ITPUBMar 13, 2024 · Artificial Intelligence
This article walks readers through the evolution of artificial intelligence—from early expert systems and machine learning basics to convolutional neural networks, the AlphaGo series, MuZero's rule‑free learning, and the generative power of large language models like ChatGPT—highlighting how deep learning, Monte Carlo tree search, and self‑play collaborate to achieve unprecedented performance across games, science, and language.
AIAlphaGoChatGPT
0 likes · 39 min read

Zheng Lin‑kai’s record‑breaking Tetris AI for the Tencent Geek Challenge combines a two‑layer breadth‑first search—stage‑level pruning in Python and fast round‑level BFS in C++—with a heuristic that rewards high score, low occupied cells, and smooth board transitions, enabling a 1,413,876‑point performance.
C++Monte Carlo Tree SearchPython
0 likes · 10 min read

This article reviews reinforcement‑learning‑driven neural architecture search, covering layer‑based, block‑based, and connection‑based strategies, as well as advanced techniques such as inverse reinforcement learning, graph hyper‑networks, Monte‑Carlo tree search, and knowledge‑distillation‑based model compression.
AutoMLMonte Carlo Tree Searchneural architecture search
0 likes · 23 min read

From Steve Jobs’s early work at Atari to modern DeepMind breakthroughs, the article traces how video games have grown into a multibillion‑dollar industry that serves as a testbed for AI research, while highlighting current AI techniques for smarter agents, procedural content generation, and the collaborative challenges shaping the future of game development.
Monte Carlo Tree SearchReinforcement Learningartificial intelligence
0 likes · 25 min read


21CTOMar 13, 2016 · Artificial Intelligence
This article breaks down AlphaGo’s four‑part system—policy network, fast rollout, value network, and Monte Carlo Tree Search—explaining their functions, training methods, and how they combine to achieve professional‑grade Go performance, while comparing them with the DarkForest implementation.
AlphaGoMonte Carlo Tree Searchdeep learning
0 likes · 13 min read


ArchitectMar 10, 2016 · Artificial Intelligence
This article explains Monte Carlo Tree Search (MCTS), covering its origin in AlphaGo, fundamental algorithm steps, node‑selection strategies such as UCB, strengths and weaknesses, enhancements, historical background, and recent research developments in artificial intelligence.
MCTSMonte Carlo Tree SearchReinforcement Learning
0 likes · 12 min read

This article breaks down AlphaGo’s breakthrough architecture—four specialized neural‑network modules, Monte‑Carlo Tree Search, and deep reinforcement learning—to explain how the system moved from imitation learning to self‑improvement and ultimately defeated top human Go players.
AlphaGoGo AIMonte Carlo Tree Search
0 likes · 15 min read

After decades of being deemed a 'century‑long' AI challenge, Baidu’s Bingo system achieved amateur‑to‑professional level Go play by introducing optimized Monte‑Carlo tree search, a weakened Alpha‑Beta hybrid, and massive supervised learning, demonstrating how breakthroughs in game AI can ripple into broader Baidu products.
BaiduGo AIMonte Carlo Tree Search
0 likes · 8 min read
