Talk Session 1: Enterprise AI
Self Optimizing Agents
Ori Goshen — Co-Founder & CEO, AI21 Labs
Once agents reach production the binding constraint is operating economically at the frontier, and the configuration space — models, retrieval, scaling, model portfolios, execution strategies — is far too large to search by hand, so optimization has to be automated, observable, and robust to the next model release.
TL;DR
- The industry's framing has flipped: "token maxing is basically over — everybody's speaking about token efficiency." The real question is best real customer outcome per dollar invested.
- Customers all say the same thing: the agent's quality is fine, but running it on every PR, call, booking, or transaction would be prohibitively expensive.
- The configuration space has four layers, each capable of exposing a new Pareto frontier: model and retrieval strategy → scaling (vertical and horizontal) → model portfolios → execution strategy (chaining, escalation, early stopping).
- The portfolio layer is the counter-intuitive one: different models cover different regions of the space, so if you measure covariance and each model's contribution carefully, the sum of using all models beats using them separately — worth roughly 50% cost reduction at comparable quality in their experiments.
- Why it must be automated: the search space is too large to cover by hand, and it keeps moving — new models ship, prices change, and traffic and task distributions drift, so any hand-tuned configuration is already stale.
Key Points
The problem: economics becomes the binding constraint in production (~00:19–00:21)
Over the past few months he has watched AI systems move from experimentation into production and start deploying at scale, which introduces a new set of challenges — the most obvious being how to operate economically at the frontier.
What he hears from customers, repeatedly: we have this agent, we're satisfied with how it functions and its overall performance, but if we wanted to apply it to every PR, every call, every booking, or every transaction, it would be prohibitively expensive.
Hence the shift in focus. The question worth asking is how to get the best possible performance per token invested, or the best real customer outcome per dollar invested. His illustrating chart plots one company's token usage (Coinbase in the example) as a line against cost as bars broken down per model; the state enterprises want is for usage to keep climbing while the cost curve decouples from it.
The typical optimization flow: take an agent, try several configurations, experiment, discover the Pareto frontier of operating points, select an agent candidate, and evolve the system from there. Most teams have a target operating zone in cost and quality — getting there is easier said than done.
Four dimensions of the configuration space (~00:23–00:33)
He describes the space as a caricature of levers: the model itself and its weights, model selection in a world where models have very different capability and performance profiles, and then the harness — tool specifications, prompts, skills, code, and the surrounding scaffold. That's a lot of moving parts before you begin.
Dimension one: model × retrieval strategy. Using BrowseComp — a deep-research benchmark that is verifiable because the answer is contained in the given corpora — they mapped candidates across models and retrieval configurations (dense, sparse, and late-interaction retrieval). Empirically, the GPT-5 family with late-interaction retrieval and MiniMax formed the Pareto frontier; you'd choose between those two. He notes this is the basic step most teams already perform before going to production.
Dimension two: scaling and execution strategy. Vertically, you can vary thinking tokens, loop iterations, or fix-repair loops. Horizontally, you generate multiple candidates and select or merge — best-of-n rolls the same model out in parallel and picks the winner. On the same benchmark, MiniMax (the cheaper, lower-quality option) reaches the quality of the top single-shot candidate once horizontally scaled, and GPT-5 also improves on quality relative to cost. The point is that adding this dimension opens a whole extra layer of viable operating points.
Dimension three: model portfolios. Rather than generating candidates from one model, generate them from different models — potentially with adjusted prompts and tool definitions — and combine the outputs into the most optimal result. He frames this as the industry moving from token maxing to model maxing.
The underlying observation: different models cover different areas of the space, so being diligent about measuring covariance and each model's contribution buys a lot. "The sum of all using all models is greater than using them separately." Applying a portfolio strategy exposes a new Pareto frontier, and the mixing proportions can be learned per task rather than discovered manually. His headline number: about 50% less cost for roughly the same quality compared to the previous state-of-the-art setting. Swap cost for latency and the same principle holds.
Dimension four: execution strategy. How you chain the calls matters: escalation strategies, which model to prioritize, and stopping thresholds. Moving to a different benchmark for variety (heard as "three rebench" in the captions — see To Verify), he showed the impact on cost/latency trade-offs:
- Plain best-of-n: run all candidates, then pick the best.
- Cascading: start with the weakest model and work up, stopping once you're confident enough in the result — saves cost.
- Parallel with early stopping: doesn't save cost, but saves latency — optimizes for speed.
At the same quality level, you pick the execution strategy that matches whether you care more about speed or cost.
His closing example is a hierarchy analogy from legal work: many junior interns do the busy work, an associate synthesizes a thesis, and a partner makes the final call. The same shape applies to coding — have a weaker model generate many rollouts, a stronger model enrich those rollouts with more relevant information, and a very strong model (he said "a Fable level model") produce the final patch and decision. The result is better quality at roughly 3x cheaper than using a frontier model throughout.
Why this has to be automated (~00:33–00:35)
All of these strategies are learnable, but the search space is huge and manual tuning will miss many optimization opportunities. More importantly, the environment keeps moving: a new model arrives, pricing changes, traffic and task distribution shift over time. Manually searching this space isn't practical.
AI21's answer is an enterprise toolkit that takes an existing agent — whatever framework, runtime, or models it uses — and optimizes it in production, aligned to that customer's production traffic, so it can continuously evolve toward the best price-performance according to the customer's own preferences.
He closed with three properties automated optimization needs: efficient, observable (so people can see the trade-offs and select among them), and future-proof (easy to adjust when a new model lands or the distribution shifts). Their research on the topic is posted to the company blog every few weeks.
Quotes
"Token maxing is basically over now. Everybody's speaking about token efficiency." (~00:20:43)
The framing for the whole talk: efficiency, not scale, is now the frontier-deployment story.
"Moving from token maxing to model maxing." (~00:27:49)
Not squeezing a single model harder, but harvesting what several models are each good at.
"The sum of all using all models is greater than using them separately." (~00:28)
The justification for the portfolio layer — differentiated coverage is itself an exploitable resource.
提到的專案與資源 / Projects & Resources
| 名稱 Name | 說明 | Description | 備註 Notes |
|---|---|---|---|
| AI21 Labs | 總部位於 Tel Aviv 的 AI lab,講者為共同創辦人暨 CEO | AI lab based in Tel Aviv; the speaker is co-founder and CEO | |
| BrowseComp | Deep research benchmark;答案含於給定語料,因此可驗證 | Deep-research benchmark; verifiable because answers live in the given corpora | 演講中主要的實驗場 / main experimental testbed |
| Late-interaction retrieval | 與 dense / sparse 並列的第三種檢索策略,在 BrowseComp 上表現最好 | Third retrieval strategy alongside dense and sparse; best-performing on BrowseComp | 搭配 GPT-5 家族構成 Pareto frontier |
| MiniMax | 較便宜、單次品質較低的模型;水平 scaling 後可追上最高品質候選 | Cheaper, lower single-shot quality; matches the top candidate once horizontally scaled | 字幕誤植為 "miniax" |
| AI21 企業 agent 最佳化工具組 | 接管既有 agent,依生產流量持續最佳化性價比 | Enterprise toolkit that optimizes an existing agent against production traffic | 演講中未點名產品名稱 / not named in the talk(見待確認) |
逐字稿勘誤 / Transcript Corrections
| 字幕原文 Heard as | 應為 Should be |
|---|---|
| Ori Gosian / Ory Gosh / Orie | Ori Goshen |
| browse comp | BrowseComp |
| miniax | MiniMax |
| GP5 / GPT5 | GPT-5 |
| para frontier / parader frontier | Pareto frontier |
| prohibitly expensive | prohibitively expensive |
| co-variance | covariance |
| three rebench | 待確認(可能為 SWE-rebench)/ to verify (possibly SWE-rebench) |
待確認 / To Verify
- 第二個 benchmark(字幕作 "three rebench")的正確名稱。發音上最接近的公開 benchmark 是 SWE-rebench(arXiv:2505.20411,持續更新、去汙染的 SWE agent benchmark),但無法從逐字稿確認,需看投影片。/ The second benchmark, heard as "three rebench" — phonetically closest public benchmark is SWE-rebench (arXiv:2505.20411), but this needs slide confirmation.
- AI21 用來做 agent 最佳化的產品名稱:講者只說 "a suite / a toolkit",未點名。AI21 官網對外的 agent 最佳化產品為 Maestro,但無法確認演講中指的是否為同一個。/ AI21's optimization product was never named on stage; their public offering is Maestro, but the mapping is unconfirmed.
- 「約 50% 成本下降」與「約 3x 便宜」的實驗設定細節(基準設定、模型組合比例)只在投影片上,逐字稿未念出。/ Experimental details behind the ~50% cost reduction and ~3x cheaper figures were on slides only.
- Coinbase 用量/成本圖表的出處與時間區間未說明。/ Source and time window of the Coinbase usage-vs-cost chart were not stated.