






















Tokyo-based Sakana AI shipped its first commercial product ‘Sakana Marlin’ this week. Sakana team positions it as a Virtual CSO (Chief Strategy Officer). It is a B2B autonomous research agent built for enterprises.
Marlin does not answer in seconds like a chatbot. You give it one research topic. It then runs autonomously for up to about eight hours. Each run returns a long report plus a presentation slide deck. Sakana says a single session issues hundreds to thousands of LLM queries.
Marlin is an enterprise research agent, not a chat assistant. You give it one topic or question. It then plans hypotheses, browses sources, and verifies findings on its own. It compresses weeks of strategy work into hours.
The deliverable is structured for decision-makers. The Japanese announcement describes reports of dozens of pages. The English announcement cites reports of up to roughly 100 pages. At a press hands-on, reports ran 60–100 pages and cited 60–80 sources. Each report includes a main body, references, and appendices. Presentation slides are generated using image-generation AI.
Sakana team refined Marlin through a closed beta in April 2026. Around 300 professionals tested it on real tasks during that beta. Those tasks spanned strategy formulation, market research, risk analysis, and competitive analysis. Sakana has also partnered with MUFG and taken strategic investment from Citigroup.
The backbone of Marlin is AB-MCTS, or Adaptive Branching Monte Carlo Tree Search. It comes from the Sakana’s past research “Wider or Deeper? Scaling LLM Inference-Time Compute with Adaptive Branching Tree Search.”
AB-MCTS treats reasoning as a tree-search problem. At each step the algorithm makes one decision. It can go wider by generating a new candidate answer. Or it can go deeper by refining a promising existing answer. Standard repeated sampling only goes wider in parallel, then hopes one answer is right.
A multi-LLM variant adds a second choice. It can route a step to a different model entirely. In Sakana’s reported ARC-AGI-2 experiments, this collaboration helped. Combining o4-mini, Gemini 2.5 Pro, and DeepSeek-R1 solved about 27.5% of tasks. The o4-mini model alone solved about 23%. Marlin applies the same adaptive search to long-horizon research.
The second key component for Marlin is workflow automation from Sakana’s AI Scientist project. That project demonstrated autonomous scientific discovery and was published in Nature.
Interactive demo: The embeddable widget (marlin-abmcts-demo.html) shows the “wider or deeper” decision live. Press Run and watch the tree grow. Greener nodes carry higher scores, and the best path is highlighted. Toggle “Multi-LLM” to see steps routed across different models.
A simplified visual of Sakana AI’s Adaptive Branching Monte Carlo Tree Search. Each step the policy chooses to widen (new candidate) or deepen (refine a promising line).
Budget used0 / 24
Nodes (candidates)1
Best score0.00
Wider / Deeper0 / 0
low score high score best path
© Marktechpost · Illustrative model of AB-MCTS (TreeQuest, Apache 2.0)
Marlin competes on depth, not speed. Conventional deep-research tools answer in minutes to tens of minutes. Marlin deliberately spends hours to raise output quality. The competitor run times below are approximate and reported, not official figures.
| Tool | Typical run time | Output | Primary user |
|---|---|---|---|
| Sakana Marlin | Up to ~8 hours | Report (dozens to ~100 pages) + slides | Enterprise strategy teams |
| OpenAI Deep Research | ~Minutes to tens of minutes | Cited text report | General and pro users |
| Perplexity Deep Research | ~A few minutes | Cited text answer | General users |
| Google Gemini Deep Research | ~Minutes | Cited text report | General and workspace users |
The trade-off is explicit. You wait longer and pay per run. In return you get deeper hypothesis testing and a finished deliverable. You can cancel a run anytime, but credits are still consumed.
Sakana offers pay-as-you-go along with Pro, Team, and Enterprise tiers. Pay-as-you-go starts at 100 credits per run, at ¥98 per credit. Pro is ¥150,000 per month and includes 2,000 credits. Team is ¥400,000 per month and includes 6,000 credits. Enterprise pricing is custom, with dedicated support.
Marlin suits high-stakes questions where research is the bottleneck. Here are concrete examples drawn from its target tasks.
Each example fits one prompt and one unattended run. A human still reviews the cited output before any decision.
You cannot self-host Marlin. But you can run its core algorithm today. Sakana open-sourced AB-MCTS as TreeQuest under the Apache 2.0 license. Install it, define a generate function, then run a fixed search budget.
import random
import treequest as tq
# Each node holds a user-defined state; score must be normalized to [0, 1].
def generate(parent_state):
if parent_state is None: # None means expand from the root
new_state = "Initial draft"
else:
new_state = f"Refined: {parent_state}"
score = random.random() # swap this for an LLM-based score
return new_state, score
algo = tq.ABMCTSA() # Adaptive Branching MCTS (variant A)
search_tree = algo.init_tree()
for _ in range(10): # generation budget of 10
search_tree = algo.step(search_tree, {"generate": generate})
best_state, best_score = tq.top_k(search_tree, algo, k=1)[0]
print("BEST:", best_state, round(best_score, 3))Swap the random score for an LLM judge to reproduce the real pattern. TreeQuest also ships multi-LLM search and checkpointing for long runs. Checkpointing matters because long sessions can hit API errors midway.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。