AI Coding Live News

Perplexity Cuts Agent API Effort-Level Costs and Adds Ultra: Medium Nearly 90% Cheaper; Ultra ~85.9% WANDR

On November 5 Perplexity Developers (@perplexitydevs) said every Agent API effort level now costs less per query with equal or better research quality, and added an ultra tier for broad long-running research. Vendor figures: medium rose from ~55% to ~77% on BrowseComp/DSQA with nearly 90% lower cost; xhigh held ~76.5% WANDR at ~25% of August 2026 cost; ultra runs three parallel researchers plus a consolidator at ~85.9% WANDR and about $21.71/task.

Perplexity Cuts Agent API Effort-Level Costs and Adds Ultra: Medium Nearly 90% Cheaper; Ultra ~85.9% WANDR

Key Takeaways

  • Official (@perplexitydevs + blog): every effort level cheaper with equal/better quality; new ultra
  • Vendor: medium BrowseComp/DSQA ~55%→~77% with nearly 90% lower cost
  • Vendor: xhigh WANDR ~76.5% at ~25% of August 2026 cost
  • ultra: 3 parallel research agents + consolidator; WANDR ~85.9% at ~$21.71/task on Claude Opus 5.5
  • Use effort="ultra" or pin [email protected]; background mode for long runs
Read full story

Meituan ships LongCat-2.5, a 1.6T-parameter (about 48B active) native multimodal agentic model, with API pricing of $0.30/$1.20 per 1M tokens

On Nov 2 Meituan's LongCat team listed LongCat-2.5 in its API platform change log as the full release of September 25's LongCat-2.5-Preview. The official technical blog says it has 1.6 trillion total parameters with about 48 billion activated per token, builds on LongCat-2.0 with stronger native visual understanding and agentic coding, and was trained and served with W4A4 inference on domestic AI accelerators. Vendor-reported scores include 88.4 on Terminal Bench v2.1, 38.5 on Terminal Bench v4.0, 91.9 on BrowseComp and 83.1 on MCP Atlas. The API speaks both OpenAI and Anthropic formats with a 1M-token context and up to 128K output tokens, at a limited-time price of $0.30 per 1M uncached input tokens, $0.006 cached input and $1.20 output.

Meituan ships LongCat-2.5, a 1.6T-parameter (about 48B active) native multimodal agentic model, with API pricing of $0.30/$1.20 per 1M tokens

Key Takeaways

  • Scale: a 1.6-trillion-parameter MoE with about 48B active per token, a 1M-token context and up to 128K output tokens (official blog, API docs)
  • Code agents (vendor-reported): Terminal Bench v2.1 88.4 (Claude Opus 5 89.1, GPT-5.6-Sol 88.8), Terminal Bench v4.0 38.5 (GPT-5.6-Sol 37.3, Claude Opus 5 53.9), DeepSWE v1.1 64.6
  • General agents (vendor-reported): BrowseComp 91.9, MCP Atlas 83.1, AutomationBench v1.0.6 51.8, HLE with tools 63.1; AutomationBench jumps from 15.8 on LongCat-2.0
  • Pricing: limited-time $0.30 per 1M uncached input tokens, $0.006 cached input and $1.20 output (pricing page)
  • Engineering: W4A4 inference raises prefill throughput 43.3% and decode throughput 42.77% over a W8A8 baseline; FSDP gives 86% higher per-device throughput than DDP in long-sequence SFT
Read full story

Artificial Analysis Benchmarks DeepSeek Search API: $0.75/1K Searches Delivers +36 Point Score Lift

Independent AI evaluation platform Artificial Analysis (@ArtificialAnlys) officially benchmarked DeepSeek's web search API (DeepSeek Search). Augmenting the base model with DeepSeek Search boosted its Search Index score from 33 to 69—an impressive +36 point leap (ranking 17th among 27 tested search APIs). DeepSeek Search established a market-leading price-performance ratio, priced at just $0.75 per 1,000 searches (~$0.032 per completed task), making it the most cost-effective paid search API evaluated. It recorded 70% accuracy on AA-Omniscience and 63% on BrowseComp, highlighting an optimal balance between factual grounding and operational economics.

Artificial Analysis Benchmarks DeepSeek Search API: $0.75/1K Searches Delivers +36 Point Score Lift

Key Takeaways

  • Artificial Analysis independently benchmarked DeepSeek Search API, lifting Search Index score to 69 (+36 pts over base model)
  • Industry-leading cost efficiency: priced at $0.75 per 1,000 searches (~$0.032 per task), the cheapest paid search API on the market
  • Scores 70% accuracy on cross-domain factual QA benchmark AA-Omniscience (ranking 10th out of 27 configurations)
  • Achieves 63% accuracy on long-horizon web navigation benchmark BrowseComp, offering high-ROI grounding for agent developers
Read full story

Stanford & UC Berkeley Introduce Librarian Agents: Training LLMs to Proactively Curate Workspaces, Cutting Navigation Costs by 33.8%

Researchers from Stanford University and UC Berkeley introduced Librarian Agents (arXiv:2610.22273). To overcome the bottleneck of reactive RAG methods struggling with complex cross-document reasoning at query time, the framework uses reinforcement learning to train LLMs to perform anticipatory directed curation on messy long-context workspaces into structured synthetic filesystems. On BrowseComp+, it hits 55.86% accuracy while reducing navigation token consumption by 33.8% to 51%.

Stanford & UC Berkeley Introduce Librarian Agents: Training LLMs to Proactively Curate Workspaces, Cutting Navigation Costs by 33.8%

Key Takeaways

  • Stanford and UC Berkeley introduced Librarian Agents (arXiv:2610.22273), replacing reactive RAG with anticipatory directed workspace curation
  • Uses reinforcement learning to train builder agents to restructure raw documents into modular synthetic filesystems via CreateFile and MergeFiles
  • Achieves 55.86% accuracy on BrowseComp+ with only 3,635 navigation tokens, cutting navigation token costs by 51% compared to flattened workspaces
  • Reduces tokens per correct answer by 33.8% at 10 queries per corpus, establishing an amortized curation paradigm for repeatedly queried knowledge bases
Read full story
Linked Models & Agents:
ADSponsored

Zhejiang University & Tencent Open-Source KnowGPO for Deep Search Agents: Knowledge-Grouped RL Outperforms 32B Models, Scoring 40.2 on GAIA

Deep search agents struggle with credit assignment across long, noisy retrieved contexts. Zhejiang University and Tencent open-sourced KnowGPO (arXiv:2610.22331, GitHub: ZJU-REAL/KnowGPO), an RL framework that groups search trajectories by atomic knowledge conditions rather than surface observations. Qwen3-8B fine-tuned with KnowGPO achieves 38.8% on BrowseComp-ZH and 40.2% on GAIA, outperforming GRPO/GiGPO baselines and rivaling 32B open-source search systems.

Zhejiang University & Tencent Open-Source KnowGPO for Deep Search Agents: Knowledge-Grouped RL Outperforms 32B Models, Scoring 40.2 on GAIA

Key Takeaways

  • Zhejiang University and Tencent open-sourced KnowGPO (arXiv:2610.22331) for credit assignment in deep search agents
  • Replaces surface observation matching with atomic knowledge condition states and within-group incremental knowledge rewards
  • Qwen3-8B + KnowGPO scores 38.8% on BrowseComp-ZH and 40.2% on GAIA, outperforming standard GRPO by +5.9 and +5.2 points
  • Allows an 8B model to rival and outperform 32B open-source search systems including WebSailor-32B and ASearcher-Web-32B
Read full story
Linked Models & Agents:

Mosaic: Multi-Session Agentic Reinforcement Learning for Context Compaction and Subagent Forking

Standard agentic reinforcement learning assumes single-session trajectories with continuously accumulated context, clashing with production agent techniques like context compaction and subagent forking. Researchers introduce Mosaic (arXiv:2610.22174), a critic-free hierarchical optimization framework for Multi-Session Agentic RL. By incorporating session-usage signals at the trajectory level and shaping per-session advantages by marginal contribution, Mosaic outperforms trajectory-level broadcasting on BrowseComp across both compaction and subagent scenarios while using fewer sessions.

Mosaic: Multi-Session Agentic Reinforcement Learning for Context Compaction and Subagent Forking

Key Takeaways

  • Bridges single-session RL and multi-session inference: formalizes Multi-Session Agentic RL for context compaction and subagent forking workflows
  • Critic-free hierarchical advantage shaping: combines trajectory-level session-usage signals with session-level marginal contribution estimation
  • Higher accuracy with fewer sessions: outperforms trajectory-level broadcasting on BrowseComp across both compaction and subagent scenarios
Read full story

REMORY: HKUST and Alibaba Introduce Residual Memory for Agent Context Compaction, Matching Full Context with Only 5.2% Token Overhead

As autonomous agents execute complex multi-step workflows across terminal consoles and web browsers, context window expansion and escalating token costs impose severe operational bottlenecks. Conventional compaction methods rely on text summarization or token pruning, both of which discard crucial state variables and induce semantic drift over extended sessions. Researchers from HKUST and Alibaba present REMORY (arXiv:2610.11287), introducing a residual memory paradigm designed for sequence-level context compaction. REMORY combines lossy natural language summaries with bounded sets of learned soft memory tokens, effectively forming a residual connection in the sequence dimension. While text summaries convey high-level narrative continuity, the soft memory tokens reconstruct lost fine-grained execution artifacts, API arguments, and intermediate environment states. On challenging benchmarks including BrowseComp and Terminal-Bench 2.1, REMORY retains 97% of full-context task performance while occupying only 5.2% of the original input token footprint, slashing redundant tool retries and loops by more than 40%.

Key Takeaways

  • HKUST and Alibaba propose REMORY, establishing sequence-dimension residual memory connections to resolve agent context bloat
  • Matches 97.2% of full-context capability using only 5.2% of token positions, slashing repetitive tool errors by 41.5% on Terminal-Bench
  • Non-invasive plug-and-play architecture reduces TTFT latency by 73.8%, setting a new benchmark for long-horizon agent efficiency
Read full story
Linked Models & Agents:

AREX-2 Advances Self-Improving Agents via Long-Horizon Reflective Tasks: Scoring 81.8 on MLE-bench and 92.2 on GAIA

Test-time self-improvement—the ability of an agent to iteratively refine solutions during inference—relies on high-fidelity reflection to surpass current proposals and long-horizon execution to maintain coherent multi-round exploration. Researchers from Renmin University of China, Microsoft Research, and USTC introduce AREX-2, establishing that these capabilities are domain-agnostic and learnable from verifiable environments. Synthesizing long-horizon reflective trajectories across machine learning and algorithmic programming, an AREX-2 agent built on Qwen3.8-27B achieves 81.8 on MLE-bench Lite and 70.7 on Frontier-CS, transferring seamlessly to deep research with 84.0 on BrowseComp, 92.2 on GAIA, and 93.8 on DeepSearchQA while monotonically scaling with compute budget.

AREX-2 Advances Self-Improving Agents via Long-Horizon Reflective Tasks: Scoring 81.8 on MLE-bench and 92.2 on GAIA

Key Takeaways

  • Identifies reflection and long-horizon execution as domain-agnostic foundations for test-time self-improving agents
  • Achieves 81.8 on MLE-bench Lite and 70.7 on Frontier-CS using an AREX-2 Qwen3.8-27B model
  • Transfers zero-shot to deep research benchmarks, scoring 92.2 on GAIA, 93.8 on DeepSearchQA, and 84.0 on BrowseComp
Read full story

Tencent and ZJU Open-Source IterSynth: Decoupled Deep-Search Agent Architecture Outperforms Existing 8B Baselines

Tencent and Zhejiang University's REAL Lab have open-sourced IterSynth (arXiv: 2609.29444, GitHub: Tencent/IterSynth), a groundbreaking paradigm for deep-search AI agents. Breaking free from the rigid single-agent ReAct framework where planning, evidence retrieval, and synthesis are tightly coupled—which typically causes severe context saturation and attention degradation—IterSynth alternates between a specialized Planner and a Synthesizer governed by an evolving summary state. Powered by Role-Decoupled Policy Optimization (RDPO), IterSynth-8B hits an average score of 50.7 across long-horizon benchmarks like BrowseComp and Xbench-DS, outperforming all prior <=8B search agents by +4.2%.

Tencent and ZJU Open-Source IterSynth: Decoupled Deep-Search Agent Architecture Outperforms Existing 8B Baselines

Key Takeaways

  • Decouples single-policy ReAct agent architectures into specialized Planner and Synthesizer roles.
  • Maintains an evolving summary state that slashes token context noise from multi-hop web scraping by 70%.
  • Introduces Role-Decoupled Policy Optimization (RDPO) combining terminal rewards with fine-grained rubric evaluations.
  • IterSynth-8B achieves a record 50.7 score on BrowseComp and Xbench-DS, lifting zero-shot reasoning on proprietary models.
  • Complete PyTorch training harness, benchmarks, and checkpoints open-sourced on GitHub under Tencent.
Read full story