惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

酷 壳 – CoolShell
酷 壳 – CoolShell
D
Docker
Microsoft Security Blog
Microsoft Security Blog
Google DeepMind News
Google DeepMind News
M
MIT News - Artificial intelligence
P
Proofpoint News Feed
Engineering at Meta
Engineering at Meta
Y
Y Combinator Blog
Vercel News
Vercel News
F
Fortinet All Blogs
B
Blog
Recent Announcements
Recent Announcements
A
About on SuperTechFans
GbyAI
GbyAI
T
The Blog of Author Tim Ferriss
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - Franky
MongoDB | Blog
MongoDB | Blog
Stack Overflow Blog
Stack Overflow Blog
B
Blog RSS Feed
C
Check Point Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
V
Visual Studio Blog
月光博客
月光博客

MarkTechPost

A Coding Implementation of End-to-End Brain Decoding from MEG Signals Using NeuralSet and Deep Learning for Predicting Linguistic Features Meta Introduces Autodata: An Agentic Framework That Turns AI Models into Autonomous Data Scientists for High-Quality Training Data Creation Qwen AI Releases Qwen-Scope: An Open-Source Sparse AutoEncoders (SAE) Suite That Turns LLM Internal Features into Practical Development Tools A Coding Deep Dive into Agentic UI, Generative UI, State Synchronization, and Interrupt-Driven Approval Flows Moonshot AI Open-Sources FlashKDA: CUTLASS Kernels for Kimi Delta Attention with Variable-Length Batching and H20 Benchmarks Microsoft Research’s World-R1 Uses Flow-GRPO and 3D-Aware Rewards to Inject Geometric Consistency Into Wan 2.1 Without Architectural Changes A Coding Implementation on Pyright Type Checking Covering Generics, Protocols, Strict Mode, Type Narrowing, and Modern Python Typing IBM Releases Two Granite Speech 4.1 2B Models: Autoregressive ASR with Translation and Non-Autoregressive Editing for Fast Inference Top 10 KV Cache Compression Techniques for LLM Inference: Reducing Memory Overhead Across Eviction, Quantization, and Low-Rank Methods Qwen Team Releases FlashQLA: a High-Performance Linear Attention Kernel Library That Achieves Up to 3× Speedup on NVIDIA Hopper GPUs Step by Step Guide to Build a Complete PII Detection and Redaction Pipeline with OpenAI Privacy Filter Meta FAIR Releases NeuralSet: A Python Package for Neuro-AI That Supports fMRI, M/EEG, Spikes, and HuggingFace Embeddings smol-audio: A Colab-Friendly Notebook Collection for Fine-Tuning Whisper, Parakeet, Voxtral, Granite Speech, and Audio Flamingo 3 A Coding Implementation on Document Parsing Benchmarking with LlamaIndex ParseBench Using Python, Hugging Face, and Evaluation Metrics Poolside AI Introduces Laguna XS.2 and M.1: Agentic Coding Models Reaching 68.2% and 72.5% on SWE-bench Verified How to Build Traceable and Evaluated LLM Workflows Using Promptflow, Prompty, and OpenAI OpenAI Releases Privacy Filter: A 1.5B-Parameter Open-Source PII Redaction Model with 50M Active Parameters Top 10 Physical AI Models Powering Real-World Robots in 2026 How to Build a Lightweight Vision-Language-Action-Inspired Embodied Agent with Latent World Modeling and Model Predictive Control Meet Talkie-1930: A 13B Open-Weight LLM Trained on Pre-1931 English Text for Historical Reasoning and Generalization Research Build a Reinforcement Learning Powered Agent that Learns to Retrieve Relevant Long-Term Memories for Accurate LLM Question Answering OpenMOSS Releases MOSS-Audio: An Open-Source Foundation Model for Speech, Sound, Music, and Time-Aware Audio Reasoning Meta AI Releases Sapiens2: A High-Resolution Human-Centric Vision Model for Pose, Segmentation, Normals, Pointmap, and Albedo The LoRA Assumption That Breaks in Production How to Build a Fully Searchable AI Knowledge Base with OpenKB, OpenRouter, and Llama How to Build Smarter Multilingual Text Wrapping with BudouX Through Parsing, HTML Rendering, Model Introspection, and Toy Training Top 7 Benchmarks That Actually Matter for Agentic Reasoning in Large Language Models RAG Without Vectors: How PageIndex Retrieves by Reasoning A Coding Tutorial on Datashader on Rendering Massive Datasets with High-Performance Python Visual Analytics xAI Launches grok-voice-think-fast-1.0: Topping τ-voice Bench at 67.3%, Outperforming Gemini, GPT Realtime, and More
Sakana AI Commercializes AB-MCTS in Sakana Marlin, an Ent...
https://www.facebook.com/MarkTechPost/ · 2026-06-16 · via MarkTechPost

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.

What is Sakana Marlin

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.

Inside AB-MCTS: Wider or Deeper

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.

AB-MCTS: “Wider or Deeper?” — interactive search

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).

Search state

Budget used0 / 24

Nodes (candidates)1

Best score0.00

Wider / Deeper0 / 0

Decision log

low score high score best path

© Marktechpost · Illustrative model of AB-MCTS (TreeQuest, Apache 2.0)

How Marlin Compares

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.

ToolTypical run timeOutputPrimary user
Sakana MarlinUp to ~8 hoursReport (dozens to ~100 pages) + slidesEnterprise strategy teams
OpenAI Deep Research~Minutes to tens of minutesCited text reportGeneral and pro users
Perplexity Deep Research~A few minutesCited text answerGeneral users
Google Gemini Deep Research~MinutesCited text reportGeneral 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.

Pricing

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.

Use Cases, With Examples

Marlin suits high-stakes questions where research is the bottleneck. Here are concrete examples drawn from its target tasks.

  • Market entry: 'Assess Japan's stablecoin and tokenized-payments market after regulatory change.' Marlin maps drivers, risks, and structured options into a report.
  • Risk analysis: 'Model resolution scenarios for a Strait of Hormuz blockade.' It compares hypotheses, not just summaries, before drawing conclusions.
  • Competitive analysis: Profile three rivals and rank our positioning gaps. It returns slides ready for a strategy review.

Each example fits one prompt and one unattended run. A human still reviews the cited output before any decision.

Try the Engine Yourself: TreeQuest

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.

Strengths and Weaknesses

Strengths

  • Peer-reviewed foundations: AB-MCTS at NeurIPS and AI Scientist in Nature.
  • Finished deliverables, including references, appendices, and slides.
  • Adaptive compute spends effort on the most promising branches.
  • The open-source core (TreeQuest) lets AI researchers study the method.

Weaknesses

  • Long runtimes make iteration slow versus minute-scale research tools.
  • Automated reports can contain hard-to-spot errors that need human review.
  • Pricing and design target enterprises, not individual developers.
  • Marlin itself is closed; only the underlying algorithm is open.

Key Takeaways

  • Sakana Marlin runs autonomous research for up to about eight hours per task.
  • One run produces a report of dozens of pages, plus slides.
  • It builds on AB-MCTS (NeurIPS 2025 Spotlight) and AI Scientist workflows (Nature).
  • Entry pricing is pay-as-you-go: 100 credits per run at ¥98 per credit.
  • It targets finance, corporate strategy, consulting, and think-tank teams.

Sources

  • Sakana AI — Sakana Marlin release: https://sakana.ai/marlin-release/
  • Sakana AI — Sakana Marlin product page: https://sakana.ai/marlin/
  • Sakana AI — AB-MCTS research and TreeQuest: https://sakana.ai/ab-mcts/
  • SakanaAI/treequest (GitHub, Apache 2.0): https://github.com/SakanaAI/treequest