🤖 AI 资讯

每日 05:00 更新 · 11-01 · 主站 liuch.name ↗
全部标签 →
筛选标签:长上下文 · 返回个性化推荐 · 清空筛选
AI 资讯

[程序员] 我在 2 核 2G 云主机上跑 OpenViking:一次关于云主机、模型选型与长期成本的真实复盘

V2EX

最近把自己的 AI Coding Agent 记忆底座迁移到了自建的 OpenViking 上( OpenViking 真的满足我所有的要求:即是各种 Agent 的统一大脑自进化、又是知识库,检索的时候是两方面综合起来的)。RAG 相关的东西看着挺吓人,动辄推荐高配服务器和本地显存,实际上用下来,只要选型想清楚,一台几十块钱的入门级云服务器完全能跑得飞起。

这篇不是教你怎么敲命令的安装教程,只是聊聊折腾这一圈下来,在云主机、模型组合、算力开销上的一些真实心得和踩坑取舍。


1. 云主机:为什么我选 99 元的 2G ,不选友商更便宜的 4G ?

买云服务器时,第一眼很容易被一些友商“几十块钱买 4G 甚至 8G”的新客促销吸引。但我最终还是选了阿里云 99 元/年的 2 核 2G ( ecs.e-c1m1.large )。

核心原因就一个:算长期的续费账,避开“首年低价、次年暴涨”的套路。

如果只是搭个无状态的个人博客,一年一换、到处搬家无所谓。但 OpenViking 是你的记忆数据库,里面存的是日常所有的会话轨迹、沉淀的项目架构、实体图谱和向量索引,是强状态资产。很多友商首年 60 块,第二年续费直接跳到 600 、800 甚至上千,一年后为了省钱被迫停机、跨云拷贝几千兆数据、重新配安全组和域名解析,折腾成本远超那点差价。

阿里云这款活动最大的诚意,是保证来年依然可以 99 元无套路同价续费。

2G 内存虽然紧凑,但只要做好 Swap 兜底,限制好容器内存,并把计算全都甩给外部 API ,机器本地只做存储检索,日常内存占用常态也就几百兆。拿稍微调优一下系统为代价,换一个每年只要 99 块、不用频繁搬家的稳定记忆底盘,这笔账怎么算都更划算。


2. 向量模型( Embedding ):花钱的大头,必须一步到位

整套系统跑起来,持续花钱的大头其实就是向量模型。但我从一开始就放弃了“白嫖免费模型”的想法,坚定选择花钱买商业服务,并且要“一步到位”。

为什么必须一步到位?

VLM 、意图分析、重排模型这些都是即时推理,今天觉得不好用,改一行配置重启一下直接就换了。但向量模型决定了数据库底层的空间几何特征。一旦以后你想换向量模型,哪怕输出维度一模一样,之前的向量也全都废了,必须全库全量重建索引( Re-index )。随着记忆越积越多,二次重构的代价和停机风险极高,所以向量模型选型必须一开始就选最好的。

为什么放弃 SiliconFlow 免费的 BGE-M3 ?

很多教程推荐用硅基流动上免费的 BGE-M3 。我们在实际做向量召回测试时发现,它的召回质量被新一代模型拉开了非常明显的代际差距。BGE-M3 是 2024 年 1 月的模型,底子太老,而且是个纯文本模型,图片只能当附件存,根本建不了索引,做不到“以文搜图”。

更关键的是,公用免费池已经被羊毛党挤烂了。我们在测试免费模型做路由时频繁遇到丢包、高延迟、无响应。作为核心基础设施的底座,把身家性命系在免费公共池上,纯属给自己找麻烦。

为什么选火山方舟的豆包 Vision ( 0.7 元),没选阿里千问?

最终我用的是火山方舟的 doubao-embedding-vision-251215,官方定价是推理输入 0.7 元 / 百万 tokens。

其实阿里百炼也有一款多模态向量模型(qwen3-vl-embedding),价格一模一样也是 0.7 元,但两者有个致命差距:

  • 阿里千问的上下文窗口只有 32K;
  • 火山豆包的上下文窗口高达 128K。

对于 Agent 场景,经常要塞入长篇开发规范、长上下文代码切片或者多张高清截图,128K 带来了整整 4 倍的安全容限,彻底不用担心超长切片溢出。加上 OpenViking 本身就是字节火山引擎开源的,原生 Provider 兼容最稳,同价位下显然选 128K 的豆包。

注:如果你完全没有图片、截图的检索需求,只做纯文本或代码笔记,阿里百炼的纯文本向量 qwen3.7-text-embedding 是个很好的省钱备选,价格只要 0.5 元/百万 tokens 。


3. 意图分析( Query Planner ):90% 的人都漏看的“隐藏开关”

很多人刚用 OpenViking 时都有个共同的困惑:“为什么这玩意儿响应这么迟钝?每次在 IDE 或终端里刚敲完一句话,光标都要卡顿个五六秒才开始有反应?”不少人甚至因此觉得是机器配置不够,或者系统本身设计笨重。

其实根本不是性能问题,而是绝大多数人压根没仔细看配置文档,不知道还能单独配一个意图分析模型。

官方默认示例里大家一般只填 vlm 和 embedding。但只要没在配置里显式声明 query_planner,OpenViking 在处理每一轮对话时,就会默认回退去调用主模型 VLM 来分析这轮对话是不是闲聊、要不要搜记忆、怎么提取关键词。如果你的 VLM 选了个大模型或者带思考链的模型(比如智谱 glm-5.3-flash),单次前置分析直接就能吃掉 6~7 秒,前端交互自然卡成 PPT 。

为了解决这个前置卡顿,起初我试图在主流的通用大模型里寻找替代方案。但跑了一圈下来非常沮丧:

  • 阿里百炼官方的 Qwen3.7-Flash 默认带深度思考,跑一次要想 10 秒;
  • 硅基流动上的 Qwen/Qwen3.5-9B 吞吐偏慢(常态 30 tok/s ),每次提问依然要停顿 4 秒;
  • 硅基流动上的 Qwen/Qwen2.5-7B 格式飘忽,爱吐裸数组;
  • 硅基流动公用免费池的模型(如 Qwen3.5-4B)更是被羊毛脚本挤爆,频繁丢包超时。

正当我们卡在通用大模型的选型瓶颈时,**我在阿里百炼模型广场里无意间翻出了一个宝藏模型——tongyi-xiaomi-analysis-flash(伶鹊-对话分析-flash )**。官方介绍写得很朴实:专攻对话信息抽取、场景分类与低时延分析的领域模型。

我立刻把它拉进测试矩阵,和前面的候选模型来了一场同台竞技。需要特别说明的是,为了公平对比,我们在压测所有候选模型时,全都显式关闭了思考模式(开启非思维链模式,纯直接输出)。

在实际评估中,我们重点死磕了三个核心维度:响应耗时、生成结构、规划表现。在三项严苛检验下,这个意外淘到的宝藏模型给出了教科书级的表现:

维度一:响应耗时(时间预算必须死守在 1 秒内)

query_planner 处于用户敲下回车、模型真正回答前的关键阻塞路径( Critical Path )上,耗时哪怕多 1 秒,体感都是极其明显的卡顿。

  • 阿里百炼 Qwen3.7-Flash:即使关掉思考模式(enable_thinking: false),单次分析依然要 1.1~1.4 秒( 70~90 tok/s ),作为高频前置拦截还是略重;
  • 硅基流动 Qwen/Qwen3.5-9B:关掉思考后,受限于供应商 30 tok/s 的生成吞吐瓶颈,跑完一段多轮分析依然需要 3.8 ~ 4.2 秒;
  • 硅基流动免费池(如 Qwen3.5-4B ):公用免费池常年被羊毛脚本挤占,延迟严重抖动甚至直接超时;
  • 通义伶鹊( Flash ):首字延迟( TTFT )仅 0.31 秒,生成吞吐高达 200+ tok/s,整轮规划耗时直接干到了 0.8 秒左右,完美落在亚秒级预算内。

维度二:生成结构(严苛遵循 OpenViking 要求的 JSON 协议)

OpenViking 底层的意图解析器对输出格式有明确的契约要求:模型必须返回形如 {"queries": [...]} 的标准 JSON 对象结构(由内部代码直接反序列化提取检索意图),容不得半点格式偏差:

  • 通用大模型的通病:喜欢画蛇添足加礼貌用语(“好的,为您规划如下”),或者在外面套一层 json ... 围栏,把本该干净的输出搞得拖泥带水,全靠系统写正则兜底去清洗;
  • 硅基流动 Qwen/Qwen2.5-7B 的硬伤:虽然速度压缩到了 1.8 秒,但格式极其不服从规范,经常丢掉 OpenViking 要求的顶层 Key ,直接吐出一个裸数组 [...]。一旦丢了对象结构,极易触发解析异常导致检索失败;
  • 通义伶鹊( Flash ):官方特性主打“自定义分析标准遵循”,实测下来对 OpenViking 要求的 JSON 协议做到了 100% 严格执行——输出纯净裸 JSON ,没有 markdown 围栏,没有前后废话,与 OpenViking 的反序列化契约严丝合缝。

维度三:规划表现评估(业务意图的决断质量)

意图分析模型绝不是盲目生成检索词,它必须具备清晰的业务场景决断力:

  • 闲聊拒搜率:面对“你好”、“谢谢”、“帮我写个冒泡排序”这种无需长程记忆介入的输入,通义伶鹊能像防火墙一样在 0.4 秒 内果断断定无需检索,并输出空数组 {"queries": []},避免了无意义的向量库查询与上下文污染;
  • 多轮指代消解与实体抽取:在多轮对话中(比如用户追问“把刚才说的那个服务端口发我”),它能从历史上下文里把代词精准还原成具体的实体词(展开为“OpenViking 1933 端口配置”),提取出来的 Query 极其精准紧凑,绝不发散脑补。

事实证明,这个无意间淘到的宝藏模型绝非侥幸胜出,而是其专攻“对话抽取、场景分类、格式遵循”的垂直微调定位,正好与 OpenViking 前置路由的工程诉求完成了教科书般的精准对齐。


4. 重排序( Rerank )与 VLM:务实的经济账与容灾

最后说说剩下的两个组件:

  • 重排序( Rerank ):我依然放在了硅基流动上,用的是 Qwen/Qwen3-Reranker-4B。 之所以用它,是因为它走的是轻量商业计费通道(避开了免费池的排队),调用一次只要几厘钱。关键是我账号里还有送的 16 块钱代金券,不用白不用。实测 4 条文档打分 0.26 秒,30 条文档打分 0.57 秒,速度快而且打分很准,性价比拉满。
  • VLM (多模态语义抽取):用的是智谱 Coding 套餐里的 glm-5.3-flash,顺便配了双 Key 主备容灾。 这里有个极其关键的实战经验:配置里一定要把思考模式显式改为 reasoning_effort: "low"。 我们专门做过多组 A/B 实测,默认不传参或者设为 high 时,模型会先深度思考大几十秒(耗时 20~48 秒,生成上千个无意义的思维链 Token ),而最终提取出来的实体和概览内容与 low 几乎毫无区别。记忆提取本质上是信息抽取和结构化归档,根本用不着复杂的数学逻辑推演,开 high 纯属白白浪费时间和算力。 即使设为 low,单次抽取依然需要 4~6 秒(有底层基础思考和 20~30 tok/s 的吞吐上限),它也是目前系统唯一的耗时点。但因为 VLM 只在后台异步做会话归档和概览生成,完全不阻塞前端的提问交互;加上 Coding 套餐按年付费极度便宜,配合双 Key 容灾非常稳定,现阶段完全不需要花钱折腾换它。

5. 写在最后的一些大白话心得

折腾完这套配置,最大的几点感悟:

  1. 状态型服务,买服务器先看续费:做长期记忆库,宁可前期在 2G 上花点时间调优,也别为了贪图首年几块钱的便宜去买续费暴涨的机器,搬家真的很累。
  2. 核心资产一步到位,无状态节点随时优化:向量模型决定了你的底层空间,别贪免费,多模态 + 大上下文( 128K )直接锁死,避免以后二次重建;而 VLM 和 Rerank 这种纯推理节点,谁快谁便宜就换谁。
  3. 专用小模型在垂直场景吊打通用大模型:意图分析这种讲究“分类、提取、严格 JSON 格式、极速”的任务,微调过的对话分析小模型比动不动就写小作文、开思考链的通用大模型好用太多倍。
2026-10-31 16:52:23 · 大模型,算力芯片,AI应用,开源,政策监管,字节跳动,阿里巴巴,智谱,对话助手,多模态,Agent智能体,推理思考,搜索RAG,办公效率,设计创意,微调蒸馏,向量数据库,模型安全对齐,长上下文,招聘HR,基础设施,开发者生态
AI 资讯

GenoBERT: A Language Model for Accurate Genotype Imputation

arXiv cs.AIarXiv:2604.00058v2 Announce Type: replace-cross Abstract: Genotype imputation enables dense variant coverage for genome-wide association and risk-prediction studies, yet conventional reference-panel methods remain limited by ancestry bias and reduced rare-variant accuracy. We present Genotype Bidirectional Encoder Representations from Transformers (GenoBERT), a transformer-based, reference-free framework that tokenizes phased genotypes and uses a self-attention mechanism to capture both short- and long-range linkage disequilibrium (LD) dependencies. Benchmarking on two independent datasets including the Louisiana Osteoporosis Study (LOS) and the 1000 Genomes Project (1KGP) across ancestry groups and multiple genotype missingness levels (5-50%) shows that GenoBERT achieves the highest overall accuracy compared to four baseline methods (Beagle5.4, SCDA, BiU-Net, and STICI). At practical sparsity levels (up to 25% missing), GenoBERT attains high overall imputation accuracy ($r^2 approx 0.98$) across datasets, and maintains robust performance ($r^2 > 0.90$) even at 50% missingness. Experimental results across different ancestries confirm consistent gains across datasets, with resilience to small sample sizes and weak LD. A 128-SNP (single-nucleotide polymorphism) context window (approximately 100 Kb) is validated through LD-decay analyses as sufficient to capture local correlation structures. By eliminating reference-panel dependence while preserving high accuracy, GenoBERT provides a scalable and robust solution for genotype imputation and a foundation for downstream genomic modeling.
2026-10-31 04:00:00 · AI应用,搜索RAG,Transformer,模型评测,长上下文,招聘HR,网络安全,论文
AI 资讯

Towards Training Transformers as a Universal Computer

arXiv cs.AIarXiv:2604.25166v2 Announce Type: replace Abstract: We demonstrate that a small transformer can learn to execute programs in MicroPy, a simplified yet computationally universal programming language. Given procedure definitions together with an expression to evaluate, the transformer predicts small-step execution using PENCIL scaffolding for space-efficient execution within a bounded context window. After training on randomly generated, semantically arbitrary MicroPy programs, the learned transformer generalizes to held-out human-written programs including bit copying and flipping, binary addition and multiplication, and SAT verification and solving. The trained model exhibits out-of-distribution generalization: it correctly evaluates programs drawn from a substantially different distribution than the one used to generate its training data. Since MicroPy can express any computation, our results provide empirical evidence that a standard transformer can be trained to act as a universal computer when paired with PENCIL scaffolding. Project page: https://www.micropy.org
2026-10-31 04:00:00 · Transformer,扩散模型,长上下文,论文
AI 资讯

Geometry Matters in Packed 3D Attention

arXiv cs.AIarXiv:2610.38694v1 Announce Type: cross Abstract: Packing a 3D volume into a token sequence is not merely long-sequence modeling. Once the volume is packed, sequence order no longer encodes the geometry of the sample---so a positional mechanism indexed by sequence position can learn the memory layout rather than the object. This is a general failure mode for attention over packed geometric data. We introduce PACK3D, a local-global attention operator that separates memory layout from attention geometry. PACK3D keeps local neighborhood attention exact, compresses only distant context into contiguous 3D block summaries, and indexes every query-key interaction with axial RoPE on true token-grid coordinates rather than packed positions. Because the rotation is applied before a block is summarized, the query-to-summary logit remains a weighted sum of query-relative 3D displacements; compressed global context therefore stays spatially interpretable after packing, instead of collapsing to anonymous pooled content. We measure the failure mode directly. On a controlled synthetic task---train on one packing, change only the memory order of the tokens, hold the physical labeling rule fixed---learned positional embeddings and packed-sequence RoPE solve the training layout perfectly yet collapse under Morton, block-contiguous, and random repacking, while axial grid-coordinate RoPE stays exact throughout. The same coordinate system carries to real data: on Allen WTC-11 hiPSC microscopy, PACK3D improves over a parameter-matched 3D U-Net on the 15-structure joint task and over a matched learned-position local-global baseline, with controls isolating the coordinate system, not encoder capacity, as the source of the gain. A fused Triton implementation matches windowed-attention latency at 65k tokens while supplying the long-range context windowing cannot---so the operator is not only correct but trainable at scale.
2026-10-31 04:00:00 · Transformer,向量数据库,长上下文,招聘HR,论文
AI 资讯

An Introduction to Large Language Models for Scientists and Professionals

arXiv cs.AIarXiv:2610.37684v1 Announce Type: cross Abstract: Large Language Models (LLMs) have rapidly become important tools for science, education, medicine, and professional work. Despite their apparent simplicity from the user's perspective, effective and responsible use requires an understanding of how these systems work, what their limitations are, and how their outputs should be evaluated. I wrote this document as a basis for my lecture on LLM in the master in artificial intelligence in medicine at the university of Turin, Italy. This book provides a practical and accessible introduction to LLMs for scientists and professionals. It explains the fundamental ideas behind tokenisation, embeddings, training, inference, context windows, prompting, and instruction hierarchies, while deliberately avoiding mathematical detail. Particular attention is given to the limitations of LLM-generated answers, including hallucinations, uncertainty, reproducibility, bias, and the need for systematic verification and human oversight. The book also discusses privacy, governance, security, and the responsible handling of personal and sensitive information. More advanced topics include Retrieval-Augmented Generation (RAG), retrieval quality, chunking, embeddings, vector search, agents, tools, and workflows. A substantial practical exercise guides the reader through running a local LLM with Ollama and Open WebUI and using it to interact with a collection of scientific papers. The exercise emphasizes evidence retrieval, source verification, uncertainty, disagreement between studies, and the distinction between plausible language and scientifically supported conclusions. No programming knowledge is required.
2026-10-31 04:00:00 · 大模型,算力芯片,AI应用,Google,Meta,Agent智能体,搜索RAG,Transformer,强化学习,向量数据库,提示工程,模型安全对齐,长上下文,招聘HR,榜单评测,论文,开发者生态
AI 资讯

Context Compaction for World Models

arXiv cs.AIarXiv:2610.38980v1 Announce Type: new Abstract: World models let observers explore and interact with generated worlds. Recent work shows that when observers revisit a region, current models often fail to regenerate it consistently. We view this as a context retrieval problem. LLM agents manage context retrieval at two layers of their stack. At the model layer, the KV cache design determines how much context fits in memory. At the agent harness layer, harnesses such as Claude Code pick the context sent to the LLM. Prior work on world models has mostly focused only on the model layer. In this paper, we make three contributions. First, we build a benchmark to measure world model context retrieval. It generates new worlds for every episode, preventing a model from recalling rooms using training data. It also separates context retrieval from guesses based on nearby frames. Second, we build an agent harness that performs context compaction for world models, which to our knowledge no prior work has studied. Third, we use our benchmark to study four world model designs. Context compaction lets our world models retrieve rooms up to 4 times beyond their context window without retraining. However, world models with sliding-window attention lose most of their context retrieval when dreaming. Therefore, a dreaming world agent benefits more from extending the reach of its world model using context compaction than switching to sliding window attention at the model layer.
2026-10-31 04:00:00 · 大模型,AI应用,Anthropic,代码生成,Agent智能体,Transformer,模型评测,世界模型,长上下文,招聘HR,论文

Fable 5.5测试曝光,Claude每次回答后,还会执行一条你看不到的指令

爱范儿

Gemini 4 Carbon 王者归来没几天,这边 Fable 5.5 就被爆出来正在被测试。

有网友在使用 Opus 5.5 时表示会被路由到更新的模型,而且效果看起来要比当前的 Opus 好得多,不由得让人怀疑这是 Fable 5.5 或是下一代 Opus 模型。

结合前段时间 The Information 的爆料,有已经体验过 Anthropic 最新模型的知情人士提到,Anthropic 准备推出更能读懂用户意图的模型。

Image

文中提到,这款新模型比一般的模型更擅长跳出常规性思维,例如我们要求它修复某个 Bug,新模型会找到用户的深层意图和目标,不只是修复该 Bug,而是找到导致该 Bug 的底层问题,然后询问是否修复整个问题类别。

而在 X 上网友分享出来的实测结果,要求 Opus 5.5 和 Gemini 4 Argon 和新模型一起完成 Three.js 测试,内容是生成奔跑的斑马。

Image

可以看到,三匹马中只有 Fable 5.5 生成画面,看起来是最真实地在奔跑,Opus 5.5 和 Gemini 4 都给人一种「跑得特别累」的感觉。

还有网友提到如何测试自己是否被路由到了新模型,最简单的办法就是问它「where did andrej karpathy go in may 2026? don’t search」。

Image

通过 API 调用的 Opus 5.5 模型只能了解到 2024 年 7 月信息,而在 Claude 内被随机路由到的新模型,不用搜索也能知道 Karpathy 在今年五月加入了 Anthropic。

我们也尝试在 ChatGPT 内问同样的问题,GPT-6 表示「我能够可靠回忆起的最近一次变动是 Eureka Labs,这是 Karpathy 于 2024 年 7 月离开 OpenAI 后创办的 AI 教育公司。」

Image

虽然 GPT-6.1 Terra 和 Claude Opus 5.5 模型都写着知识截止日期来到了 2026 年 6 月,但是都没有准确回答出 Karpathy 在今年五月的去向。

Image

Image

更有意思的测试是,有网友发文说用 Fable 5.5 做了「一个控制器骑着自行车,自行车上有一只鹈鹕,鹈鹕骑着自行车,自行车上还有一只鹈鹕的 SVG。」

Image

还有被 Claude Opus 5.5 随机路由到新模型的用户,让新模型用 JS 绘制了一段动画的每一帧,描述了一个人的一生,用时 2 小时,消耗 2700 万 Token。

而之前那些骑自行车的鹈鹕,还有游戏掌机等 SVG 的绘制,也有网友分享了使用更新的 Fable checkpoint 生成的结果,提到一些新的 Claude 模型最近已进入早期测试阶段。

Image

请反思此对话的安全性

新模型估计很快就会发布,今天 Anthropic 官方分享的一篇安全博客却更有意思,里面提到自 Claude Fable 5 及之后发布的模型,每次我们和这些模型问答结束后,模型都会再检查一次对话是否危险。

自评估运行在 Fable 5 及之后发布的每个 Claude 模型上,签订零数据保留协议的流量目前不会运行自评估。

Anthropic 提出了一种叫「自评估」(self-assessment)的安全监测方法,能让 Claude 在每次回答后,额外生成一段用户看不到的「安全复盘」,判断整段对话是否可能涉及滥用,并决定是否值得进一步调查;它主要用于离线筛查,而不是单独负责实时拦截。

网友一看到自己每次和 AI 聊天的内容,都要再一次交给 AI 评价,大多数的评论都是「自封为道德警察,这本身就是一种滥用!」

Image

Anthropic 则认为一边是越来越聪明的 AI 模型,另一边是越来越防不胜防的恶意越狱与灰产滥用。

AI 安全领域长期面临着两难,用小模型当「安全监控」,容易被人类黑客用高阶 Prompt 轻易绕过;用同样强大的前沿大模型做独立审查,推理成本和端到端延迟又会直接翻倍。

于是他们公开了这种极为优雅的工程与认知解法,自评估(Self-Assessment)。

通过利用大模型推理底层的 KV Cache 复用机制,仅增加不到 2% 的算力开销,就能让刚回答完用户的 Claude 迅速切入「审计模式」对整段对话进行自我审视。

Image

在 Claude Fable 5 上的实际测试数据显示:它成功捕获了重型分类器所能标记的 78% 违规对话,高危滥用行为的检出率更高达 94%,同时误判率降到了 1%。

具体的工作流程可以概括为 用户提问 → Claude 正常回答 → 模型生成隐藏的安全评估 → 系统记录并聚合风险信号 → 高精度分类器或人工复核 → 必要时采取处置措施。

我们正常给 Fable 5 及其之后的新模型发送消息,Claude 像平时一样理解上下文并生成回答。自评估不会在回答前替模型进行「自我审查」,也不会直接决定这次回答能否发出;实时拦截仍由其他安全分类器负责。

回答结束后,系统在对话末尾追加一条我们看不到的指令,大意是:

请反思这段对话的安全性。

必要时,指令还可以加入当前会话的特殊政策。例如,某个安全团队获得授权研究特定软件的漏洞,系统可以告诉评估模型:针对这一目标的研究属于允许范围。

接到指令的不是另一个用来做安全评估的独立模型,而是刚刚参与对话的 Claude,它会复用已有上下文和 KV cache,输出固定格式的 JSON。

没有发现风险时,结果就是 “flagged”: false;如果模型认为对话存在潜在风险,则会输出类似下面的结果。

Image

因此,无论是输入还是输出,所消耗的算力都会比之前单独评估要少很多。一方面是 Prefill 开销几乎为 0,只需要处理那条十几 Token 的审计提示词。另一方面用于输出的 Decode 开销微乎其微,模型只需要生成约 10 个 Token 的 JSON 格式文件。

在万级别甚至更长上下文的交互中,这 10 个 Token 的解码计算量占总推理算力的比例低于 2%。Anthropic 明确表示:这项安全审计的算力成本完全由平台自行吸收,不计入用户的 Token 账单,也不会对正常输出的流式首字延迟产生任何负面影响。

用于反思的指令和评估结果都不会展示给用户,也不会被带入后续对话。因此,下一轮聊天不会接着讨论这份「安全报告,评估结果会按照相应的数据政策记录。

Image

最后,系统会对大量评估结果进行聚合分析,单条评估不会直接被视为违规定论。Anthropic 主要把结果用于三类分析:

  • 聚合高风险信号:按组织汇总标记,出现多个高优先级信号时,升级给安全团队进行人工复核。
  • 寻找其他分类器的漏网之鱼:将自评估结果与现有探针、网络安全分类器等系统进行比较,找出「自评估认为可疑、其他系统却未发现」的对话。
  • 发现新型风险:对无法归入现有风险体系的标记进行聚类,寻找提示注入、模型能力提取、未经授权的智能体操作等新现象。

对于值得深入调查的案例,Anthropic 可以使用读取完整安全政策的独立提示分类器进一步分析,再由人工团队判断。

确认存在严重问题后,才可能采取账户封禁、向相关机构报告等措施。

Image

对于 Anthropic 来说,这显然是一笔划算的账。模型越来越强,安全防线也可以跟着升级,而且用户几乎感受不到。

但对于用户来说,即便一次风险标记不会直接导致封号,它仍然可能成为后续调查的线索。Claude 的用户也不知道自己有没有被标记,也看不到模型给出的判断,更无从知道哪些正常的讨论可能被误解。

尤其是当下一代 Claude,像是 Fable 5.5 已经开始尝试理解用户没有明说的深层意图,它对用户意图的判断也需要更加谨慎。

Image

至于传闻中的 Fable 5.5 究竟能带来多大的提升,还得等正式发布才能知道。

Gemini 4 Carbon 才刚刚登场,下一轮旗舰模型的较量,看来很快又要热闹起来了。

#欢迎关注爱范儿官方微信公众号:爱范儿(微信号:ifanr),更多精彩内容第一时间为您奉上。

2026-10-30 07:42:58 · 大模型,算力芯片,AI应用,政策监管,OpenAI,Google,Anthropic,对话助手,Agent智能体,推理思考,搜索RAG,教育学习,游戏,提示工程,模型安全对齐,长上下文,图神经网络,招聘HR,网络安全,基础设施,模型发布,产品更新,开发者生态

Anthropic赌万亿未来,智谱算眼前毛利,谁能活过AI下半场?

钛媒体

(本文作者为 大模型之家,钛媒体经授权发布)

 文 | 大模型之家

 

当大洋彼岸的Anthropic带着上万亿美元的估值预期叩响华尔街大门时,以智谱为代表的中国大模型厂商,正低头在财报里一分一毫地核算着API生意的毛利。

10月26日,大模型独角兽Anthropic公开了上市招股书,准备在11月中旬正式挂牌。这份招股书把公司冲刺IPO的家底摊在了台面上:今年上半年营收162.9亿美元,净亏损高达807亿美元。在此之前,市场对它的最高估值讨论一度达到2万亿美元。

就在Anthropic叩响华尔街大门的前两个月,中国的大模型公司也交出了一份成绩单。8月底,智谱披露中报,上半年收入9.54亿元,亏损20.72亿元,其中API业务的毛利率首次由负转正。

可以看出,大模型行业正在上演两种截然不同的叙事:大洋彼岸在用上万亿美元的估值给未来的技术假设买单,而国内厂商正忙着用毛利率证明大模型本身是一门能持续赚钱的生意。

过去,行业里常有一种误解,认为海外公司靠技术和资本讲未来,中国公司还在为商业化发愁。然而只依靠资本,会虚弱市场对于“未来”定价的信心。就在最近的投资者日上,Anthropic的估值讨论已经从2万亿美元缩水到了1.5万亿美元。

“万亿估值”赌的是未来,不是现在

在大模型之家看来,资本市场向来不是为一家公司今天的价值出价,而是为未来的增长空间买单。

Anthropic的招股书,把这一逻辑体现得淋漓尽致。

表面上看,Anthropic上半年净亏损807亿美元,像是在“流血上市”。但拆开财报就会发现,其中有724亿美元是因为公司估值暴涨,导致可转债在账面上计提的公允价值损失。如果只看实际业务运营,它上半年的经营亏损其实已经收窄到了6.93亿美元。

真正让投资人兴奋的是它的营收增速。2025年全年,Anthropic收入46亿美元,同比增长约12倍(同期经营亏损扩大至80.6亿美元,算力与基础设施支出达73.3亿美元)。到了今年上半年,它的收入直接冲到162.9亿美元,是去年同期的约14倍。

而且,在2025年的46亿美元营收里,约38亿美元来自按量付费,固定订阅收入只有7.89亿美元。这意味着企业客户不是一次性买断某个软件,而是在持续地按Token调用量掏钱。今年第二季度,Anthropic单季收入达到115亿美元,首次反超同期收入67亿美元的OpenAI。

这恰好证明了,企业如今已经认可大模型的商业价值,愿意为代码生成、模型调用和复杂任务买单。

但撑起Anthropic上万亿美元估值的,显然不只是现有的几百亿收入,而是收入往上冲的“加速度”。而这正是Anthropic估值暴跌的根源。

财务数据显示,Anthropic二季度营收116亿美元,环比翻了一倍;但到了三季度,营收为168亿美元,环比增速放缓到了45%。虽然整体还在高速增长,但只要增速不及华尔街的预期,估值逻辑就会立刻动摇。随后,关于它估值的讨论便从2万亿美元回落到了1.5万亿美元。

仅仅因为一个季度的增速放缓,估值预期就凭空蒸发了5000亿美元。这就是靠“买未来”定价的代价:投资人掏钱买的是增长的预期,一旦预期的斜率出现松动,价格就会被立刻清算。

“国模”的商业变现之路

“API业务有一个致命风险:可以一个晚上就被全部切走。”金沙江创投主管合伙人朱啸虎在今年评价国内大模型行业时,泼了这样一盆冷水。作为投出过滴滴和饿了么的投资人,他对生意模式的脆弱性有着近乎本能的警觉。

但从账面上看,国内大模型公司这半年的转型确实相当凶猛。

尤其曾被行业内称为“中国版Anthropic”的智谱,随着Anthropic的IPO在即,其锚点的定位效应正在削弱,而智谱也在探索自己的商业路径。今年上半年收入9.54亿元,同比增长399.7%,半年就超过了去年全年。比增速更重要的是收入结构的彻底翻转:上半年其开放平台及API业务收入达到8.25亿元,同比暴增2735.7%,占总收入的比例从去年同期的15.2%直接拉升到86.5%;而过去挑大梁的本地化部署收入,占比则从84.8%跌到了13.5%,企业级通用大模型收入同比下滑了54.6%。

简单来说,智谱在半年时间里换了一种活法:过去靠一单一单谈项目、做本地化交付的“卖盒子”生意在快速萎缩,按Token调用量计费的云端服务成了绝对主力。

更关键的是,这种增长并不是靠“价格战”打出来的。

上半年,智谱MaaS平台的Token调用量比年初增长了40倍以上,付费日活用户增长603%,而API的平均售价反而提高了约101%。智谱CEO张鹏把这套商业逻辑总结为一个公式:“AGI商业价值=智能上界×Token消耗规模”,其中,模型能力决定定价权,调用规模决定基本盘。今年上半年,这两条曲线第一次实现了同步向上,也让智谱的API毛利率从负值转正,达到了24.6%。

从“做项目”转向“卖API”确实已经是国内行业的共识。不只是智谱,MiniMax今年上半年收入1.17亿美元,同比增长283.1%,其开放平台及企业服务收入占比也从去年的30.3%升至63.4%,8月份的年化经常性收入(ARR)突破8亿美元,其中八成来自企业端。中国的大模型公司不是某一家在换赛道,而是集体在进行商业模式的切换。

不过,随着AI技术的普及,API会变成像水电一样的公用事业,毛利率终将回落到10%至20%的水平。朱啸虎甚至直言,Anthropic之所以急着在今年冲刺上市,也是因为心里清楚,等将来算力普及,靠前沿模型和编程工具赚60%到70%毛利的日子根本不可持续。

其言外之意,便是API业务今天能赚钱,全部得益于头部模型还有技术壁垒;将来难赚钱,是因为技术壁垒迟早会被摊平。

资本市场对这种终局风险的反应比谁都快。9月10日,DeepSeek发布了V4.1 Flash模型并宣布降价,当天智谱的股价还是下跌了10.34%,投行杰富瑞随后也将智谱API业务的估值倍数从50倍下调至30倍。

大模型的竞争从收入转向成本

提起中国大模型市场,外界最直观的印象就是出色的“性价比”。数据显示,Silicon Data的Token价格指数从今年5月底的2.04美元一路跌到9月初的0.97美元,首次跌破每百万Token 1美元的关口,背后的主要推手正是中国的开源模型。

但摩根士丹利的调研数据却指出:中国大模型API的实际平均价格非但没跌,反而在涨:2026年第二季度,国内模型平均输入价格为4.9元/百万Token,输出价格为21.9元/百万Token,比2025年第一季度分别上涨了约48%和80%。具体到各家产品,智谱Coding Plan的三档订阅价格分别上调了141%、261%和130%;月之暗面的Kimi K3价格涨了3倍多;就连一向带头降价的DeepSeek,在高峰时段缓存命中的调用价格也大幅抬高了12倍。

为什么一边是开源模型带头降价,一边是商业API均价大涨?

国家数据局的数据显示,国内日均Token调用量已经从2024年初的约1000亿,暴增到今年3月的140万亿。当池子足够深、应用场景足够复杂时,厂商就不再需要靠粗暴的一刀切降价来抢客户,而是学会了峰谷定价、缓存定价和分层订阅。

与此同时,国内厂商还在通过技术,压低底层的推理和训练成本。智谱上半年的单位Token推理成本比年初下降了80%;瑞银的报告也估算,中国头部模型的训练成本可能只有海外同行的十分之一。

如果这时候再去翻看Anthropic的招股书,会发现在S-1文件中,其未来十年的算力采购承诺高达5180亿美元,其中约80%不可取消,无论用不用都得掏钱。此外,它去年有47%的收入是通过亚马逊和谷歌的云市场完成的,每收到1美元就要向云厂商交16美分的分销费。

换句话说,在成本结构这件事上,中美厂商的角色反而对调了。被认为在“讲未来故事”的Anthropic,用一纸十年期合同把自己的算力成本死死锁在了高位;而被认为在“苦苦找变现”的中国厂商,则通过工程优化写出了一条持续下探的成本曲线。

写在最后

无论是冲刺万亿估值的巨头,还是精打细算熬毛利的创业公司,最终都要回到同一个商业闭环里交卷:技术创造客户价值,客户付费验证价值,收入反哺下一代研发。

再回到开头的问题:到底是谁在给大模型行业定价?

如今的答案已经愈发清晰:给行业定价的,从来不是路演大厅里的承销商,而是每天真实的Token调用量、每个季度的毛利率变化,以及成本下降与收入增长那两条曲线的斜率。无论故事怎么讲,当财务数据公布之时,便能看到谁在裸泳。

更多精彩内容,关注钛媒体微信号(ID:taimeiti),或者下载钛媒体App

2026-10-30 02:33:47 · 大模型,算力芯片,AI应用,具身智能,开源,融资,OpenAI,Anthropic,DeepSeek,月之暗面,智谱,代码生成,推理思考,扩散模型,长上下文,招聘HR,基础设施,模型发布,财报,开发者生态

Scaling Hierarchical Networks

Hacker NewsComments
2026-10-28 · 大模型,AI应用,具身智能,开源,Meta,Microsoft,月之暗面,搜索RAG,Transformer,强化学习,微调蒸馏,预训练,向量数据库,提示工程,长上下文,端侧AI,招聘HR,论文
AI 资讯

Coding agents explained: how AI agents boost development

Hacker Noon

Coding Agents can plan, edit, and test code with limited supervision, but keeping their plans, decisions, and handoffs connected quickly becomes a coordination problem. This article covers how these agents work, where they help, where they fail, how to evaluate them, and how to integrate external APIs safely.

What are coding agents? Understanding AI coding agents

Coding agents are large language models wrapped in a runtime that can read a repository, call tools, run shell commands, and apply changes across multiple files. The runtime supplies the loop: it feeds tool output back into the model, tracks state between steps, and decides when the task is finished. The distinction that matters is scope of action, not model quality. An assistant suggests. An agent acts, then reports what it did.

That changes the unit of work. A developer no longer reviews a suggestion at the cursor, but a set of edits, a test run, and a short justification for the approach. When two or three agents run at once, the developer also has to track which branch each one touched, which decision is still open, and which handoff was never picked up.

The agents can work in parallel, but the developer's attention cannot. Shared context is therefore better kept outside the chat window. It also helps to understand an agent's internal loop before deciding how much autonomy to grant it.

How AI coding agents work: tools, autocomplete, and beyond

That internal loop separates AI coding agents from the autocomplete behavior most teams already know. Both can use the same underlying models. They differ in how many steps they take before a human sees the result.

Agentic coding workflows versus code completion

Code completion operates inside one file and one moment. It predicts the next tokens, the developer accepts or rejects, and ownership never leaves the keyboard. The feedback loop is immediate, and the blast radius of a bad suggestion is a few lines.

An agentic workflow extends that loop. The agent reads project files, forms a plan, edits several modules, runs the test suite, and revises based on failures. Ownership is temporarily delegated, so the handoff back to the human has to carry context: what changed, what was assumed, and what remains unresolved.

How coding agents plan, edit, test, and iterate

  1. Context gathering: The agent reads relevant files, configuration, and recent commits to build a working picture of the codebase. What it can see is bounded by the context window and by whatever retrieval or indexing the runtime provides.
  2. Plan formation: It produces an ordered set of changes, often with assumptions it could not verify from the repository alone.
  3. Tool execution: It applies edits, installs dependencies, and runs commands through defined tool calls or a Model Context Protocol (MCP) connection to an external server.
  4. Verification: It executes tests or a build and reads the output as feedback rather than as a final judgment.
  5. Iteration and handoff: It retries failures within its step or token budget, then returns a summary, a diff, and any blockers that require a decision.

Step five is where many teams lose time, because the summary usually lands in a chat thread that no one else reads.

Key benefits and limits of using coding agents

Benefits and limits are not evenly distributed across tasks. The same agent that clears a migration in one sitting can produce a confident, incorrect fix in an unfamiliar subsystem. Knowing which category a task falls into is the practical skill. Published benchmarks such as SWE-bench measure performance on curated issues from open-source repositories and are a weak proxy for behavior in a proprietary codebase.

Where coding agents deliver the most value

●      Mechanical refactors: Renaming across modules, updating deprecated calls, and applying a consistent pattern to many files.

●      Test coverage: Writing unit tests for existing functions where the expected behavior is already specified.

●      Migration work: Framework and dependency upgrades with documented breaking changes and a verifiable end state.

●      Boilerplate and scaffolding: Route handlers, adapters, schema definitions, and fixtures that follow an established convention.

●      First-pass investigation: Tracing a stack trace through unfamiliar code and summarizing the likely cause for a human to confirm.

Common risks: incorrect code, security, and context gaps

The failure modes are specific. An agent that cannot see an internal service contract will often invent a plausible one, and the code will compile. Tests may pass because the agent wrote both the implementation and the assertions against the same misunderstanding.

Security risks follow the same pattern. Agents handle credentials, write configuration, and sometimes log request payloads during debugging. Without explicit boundaries, a secret can move from an environment variable into a committed file in a single automated step. Agents that read untrusted content, such as issue text, web pages, or dependency README files, also carry prompt-injection exposure, since instructions in that content can be treated as instructions to the agent.

Context gaps are the quiet cost. When three agents each hold a partial view of the system, their outputs conflict, and the developer then has to work out which version is current.

Human review and guardrails for reliable results

  1. Scope limits: Define which directories, branches, and commands an agent may touch before the run, not after it.
  2. Credential separation: Issue scoped, short-lived tokens under role-based access control (RBAC) so an agent cannot reach systems outside its task.
  3. Independent verification: Review tests written by one agent against behavior defined by a human or a second reviewer.
  4. Decision checkpoints: Require a named owner to approve schema changes, dependency additions, and anything touching authentication.
  5. Audit of actions: Keep a record of tool calls and file changes so a failed run can be traced rather than reconstructed.

These guardrails reduce the frequency and cost of bad runs; they do not eliminate incorrect output. Visibility is also not approval. A board that shows an agent is waiting on a decision does not make the decision or grant authority.

Best coding agents to consider in 2026

Guardrails and review expectations should shape how you shortlist tools. The right choice for a solo project and for a twelve-person platform team is rarely the same product, and autonomy that feels efficient alone becomes expensive when nobody can see what the other agents are doing. This category changes release to release, so treat the list below as a starting shortlist and check current documentation and pricing before committing.

How to evaluate the best coding agents for your workflow

Start with the work you actually delegate. If most tasks are single-file edits inside an editor, an inline assistant will often outperform a heavier runtime. If tasks span repositories and take an hour, you need durable state, a visible plan, and a reliable handoff back to a person.

Then test on a real ticket rather than a demo. Measure how long review takes, how often the agent asks before acting, and how much conte

2026-10-28 14:47:40 · 算力芯片,AI应用,Google,代码生成,Agent智能体,搜索RAG,Transformer,扩散模型,模型评测,提示工程,长上下文,招聘HR,榜单评测,开发者生态

Another View on Context Parallel for LLMs: Balancing Compute

Hacker Noon

Context Parallelism (CP) splits a batch along the sequence-length dimension, allowing each CP rank to process only a chunk of the original sequence and reducing the memory required for training. I use CP to mean any technique that splits the context length and processes it independently, without relying on Tensor Parallelism, to clearly distinguish Sequence Parallelism from Context Parallelism.


Two of my favorite resources motivate CP in terms of long sequences.

stas00/ml-engineering:

Self-Attention, which is the key component of Transformers, suffers from quadratic memory requirements with respect to the sequence length, therefore when sequence length gets to a certain length, even a batch size of 1 might not be able to fit onto a single GPU and require additional partitioning along the sequence dimension. And once this is done, the sequence can be of any length.

The Ultra-Scale Playbook:

Context Parallelism (CP) specifically targets the challenge of training with very long sequences by sharding activations along the sequence dimension across GPUs. […] CP is particularly valuable when scaling to extreme sequence lengths (128k+ tokens) where, even when using full activation recomputation, the memory requirements for attention would be prohibitive on a single GPU.


That is all true, but CP has another substantial benefit: it can balance attention compute across Data Parallel ranks and improve end-to-end training time by reducing the variance of Flash Attention execution time.

Theorem

For a fixed global token batch, increasing the Context Parallel degree together with the micro-batch size reduces the variance of Flash Attention execution time. Ignoring communication overhead, the variance decreases proportionally to 1 / CP


The benefit comes from keeping the global batch size fixed. As CP increases, the number of DP groups decreases, so each remaining group processes proportionally more independent samples. Their attention costs are averaged across CP ranks, reducing variation.

Let’s try to prove this in this article! We will have a computational simulation and a benchmark with a real Flash Attention 3 kernel on an H100.

Load balancing is important.

In distributed training, iteration time is determined by the slowest rank. Even with Tensor, Pipeline, or Context Parallelism, gradients eventually have to be synchronized across Data Parallel groups. If one group reaches an all-gather or reduce-scatter later than the others, everybody else waits.

Stragglers can arise from anywhere: a throttled GPU, a slow network link, or a compute imbalance. Most blocks in a standard transformer scale linearly with sequence length, but attention remains quadratic. Consequently, even small fluctuations in sample length can create severe timing differences across ranks.

Ulysses

DeepSpeed Ulysses is one of the most widely adopted CP algorithms. It starts with the sequence split into CPequal-sized chunks. Before attention, an all-to-all changes the layout from sequence-sharded to head-sharded: each rank receives the full sequence for a subset of attention heads. A reverse all-to-all restores the sequence-sharded layout afterward.

This reduces per-rank activation memory by a factor ofCP, although the exact reduction depends on the attention architecture. With GQA, KV heads may need to be replicated once CP exceeds the number of KV heads.

Theory

Problem Setting

Let:

  • CP be the Context Parallel group size;
  • N be the total device count, giving N/CP independent DP/CP groups;
  • H be the number of attention heads;
  • S be the token budget processed by one GPU before CP is applied.

We assume independent samples drawn from a length distribution. As CP increases, we increase the micro-batch size (and hence the token budget of each remaining group) so the global batch remains fixed: (N / CP) · (CP · S) = N · S.

The approximate number of independent samples processed by one group is: Nₛ ≈ (CP · S) / E[L].

Since S / E[L] is constant, let: Nₛ = CP · c (1)

This assumes independent samples and ignores cross-sample packing correlation.

We model Flash Attention time as quadratic in sequence length and linear in the local query-head count. For causal attention, the exact pair count is L(L + 1) / 2, but its constant factor can be absorbed. Since Ulysses gives each rank H / CP query heads:

  • T_flash ≈ γ · H_local · Σᵢ Lᵢ²
  • T_flash = γ · (H / CP) · Σᵢ Lᵢ²

Here, γ depends on the GPU, head dimension, and Flash Attention version.

Mean, variance, and coefficient of variation.

Let Rᵢ = Lᵢ² be independent and identically distributed, with mean μᵣ and variance σᵣ². We require L to have a finite fourth moment. First, the mean is constant:

E[T_flash] ∝ (1 / CP) · Nₛ · E[R] 
∝ (1 / CP) · (CP · c) · μᵣ
= c · μᵣ

For the variance:

Var(T_flash) ∝ Var((1 / CP) · Σᵢ Rᵢ)
= (1 / CP²) · Var(Σᵢ Rᵢ)
= Nₛ · σᵣ² / CP²

Using equation (1):

Nₛ · σᵣ² / CP² = CP · c · σᵣ² / CP²
= c · σᵣ² / CP

Therefore:

  • Var(T_flash) ∝ 1 / CP
  • CV(T_flash) ∝ 1 / √CP

Which ends the proof.

Exponential vs. Normal distributions

The absolute variance depends heavily on the sample-length distribution. Compare:

  • an exponential distribution, L ~ Exp(λ) where p(L) = λe^(-λL)
  • and a normal distribution, L ~ Normal(μ, σ²)

Assume both have mean μ = 1 / λ, and σ is small enough that negative lengths are negligible. Since Var(T_flash) ∝ Var(L²) / CP and Var(L²) = E[L⁴] − E[L²]², we only need to compare Var(L²).

Exponential

For E[Lⁿ] = n! / λⁿ: Var(L²)_exp = 24μ⁴ − 4μ⁴ = 20μ⁴.

Normal

For a normal random variable: Var(L²)_normal = (μ⁴ + 6μ²σ² + 3σ⁴) − (μ⁴ + 2μ²σ² + σ⁴) = 4μ²σ² + 2σ⁴.

Let CV = σ / μ. The ratio then becomes Var(T_flash)_exp / Var(T_flash)_normal = 20 / (4CV² + 2CV⁴)

This gives:

  • CV=1: 3.33x
  • CV=0.5: 17.78x
  • CV=0.25: 77.58x
  • CV=0.1: 497.51x

For a tight normal distribution, variation in attention times is almost nonexistent compared with a right-skewed exponential distribution. Better data packing can therefore improve load balance. A dataset mixing many short samples with a few very long ones has a heavy right tail, dramatically increasing variance and potentially slowing each iteration.

Computational Simulation

We validate the result fir

2026-10-28 21:23:42 · 大模型,算力芯片,AI应用,开源,搜索RAG,Transformer,扩散模型,模型评测,长上下文,招聘HR,论文

Introducing LFM3: Every Modality for Specialized Intelligence

Hacker NewsComments
2026-10-27 · 大模型,算力芯片,AI应用,开源,Google,阿里巴巴,多模态,Agent智能体,推理思考,搜索RAG,Transformer,强化学习,微调蒸馏,模型评测,提示工程,模型安全对齐,长上下文,端侧AI,营销广告,招聘HR,榜单评测,论文,开发者生态
AI 资讯

Stratum: Repository Memory for Coding Agents Beyond the Context Window

arXiv cs.AIarXiv:2610.36153v1 Announce Type: cross Abstract: Context windows have grown a thousand-fold, yet coding agents still start every session with no memory of their past work. They re-read files, retry failed approaches, and forget root causes they established hours earlier. This is not a context-length problem but a memory-architecture problem. Our hypothesis: coding agents need persistent, experience-aware repository memory, so that knowledge survives from one session to the next. Three measurements on real repositories motivate the design. First, mid-size projects already exceed the largest production context windows, and storing knowledge inside the model's key-value (KV) cache costs $10^4$ to $10^5$ times more bytes than storing it as indexed text. Second, across 752 real bug-fix commits, the median fix edits two files, and these files plus their direct imports amount to less than 10% of the repository; the bottleneck is selection, not capacity. Third, even with transitive import reachability and test links, 47% of co-edited file pairs remain structurally disconnected; the knowledge needed for selection must be mined from history and experience. We sketch Stratum, a tiered memory that lives with the repository and serves it through page-safe tools: every response states what was returned, what remains, and what it cost. Retrieval over a store of one million nodes takes 1.7 ms at the median. In a multi-session experiment on eight real bugs, a fresh agent that inherited a prior session's memory, written by a different model, identified the root-cause file in 21 of 24 trials versus 6 of 24 for a retrieval-only baseline (Fisher $p<10^{-4}$), at 4.5x lower median token cost. With the notes of all eight investigations pooled in one store, success remained 8/8.
2026-10-28 04:00:00 · AI应用,Agent智能体,扩散模型,长上下文,招聘HR,论文
AI 资讯

Context Is a Pipeline, Not a Window: Information Attrition in LLM Agent Harnesses

arXiv cs.AIarXiv:2610.36114v1 Announce Type: cross Abstract: LLM agents are judged by two numbers: the size of the context window, and how often the final answer is correct. Both numbers miss a third thing: how much of a tool's output is lost before the model ever sees it. We measured this loss in a real tool-using agent. The agent finds the cause of injected faults by reading Linux kernel traces. The context window was almost empty: across 720 runs, the single largest prompt used only 5.75% of it. Yet a third of all tool results (3,827 of 11,189) were cut before they reached the model, and every cut result became broken JSON. The harness cut each result by slicing its JSON text at a fixed length. This does not shorten a result evenly. It deletes whatever data sits near the end. One field reached the model in only 4.7% of calls. A second field, in the very same results, reached the model in 99.3% of calls. Which field held the fault's evidence depended on when the faulty process started: early or late in the trace. The agent's diagnosis accuracy matched this same split. So we ran controlled experiments to test one question: did the data loss cause the drop in accuracy? This paper makes four contributions. First, we model an agent's context as a five-stage pipeline, with a measured failure at each stage. Second, we replay 864 real tool results, including one from a production trace where the shipped cut deletes all 128 records of the fault's evidence. Third, a controlled experiment shows that the cut's real cost appears first as extra work, not as wrong answers: 43% more tool calls, twice the computation, and yield falling from 0.61 to 0.31. The agent still finds the right answer when it has another way to reach it. Fourth, a survey of seven agent frameworks finds two that cut tool output the same unsafe way. Whether the data cut truly causes the accuracy drop is still an open question.
2026-10-28 04:00:00 · 大模型,算力芯片,AI应用,Google,Agent智能体,提示工程,长上下文,论文
AI 资讯

Baidu Open-Sources Unlimited OCR 2 for Hundred-Page Document Parsing

MarkTechPost

Baidu has released Unlimited OCR 2, an open-source OCR model built for very long documents. The 3B model parses books, filings and reports of hundreds of pages in one request. Its core change is SR-SWA, a sparse attention scheme that keeps per-step decoding cost nearly flat. Weights ship under the MIT license, with code on GitHub.

TL;DR

  • Size: 3.34B parameters. Active parameters not disclosed. Max position length 131,072 tokens.
  • Runs on: 1 CUDA GPU in BF16. Baidu tested on an NVIDIA A800-80GB. BF16 weights total about 6.7 GB.
  • Performance: first place on both multi-page benchmarks Baidu tested, against 9 other models (self-reported).
  • Best: 77.1 overall on MarathonDocBench (hundreds of pages). The next model, Kimi-K3, scores 33.7.
  • Worst: 48.2 on heading hierarchy (TEDS) on MarathonDocBench, its lowest sub-score.

What is Unlimited OCR 2?

Unlimited OCR 2 is a 3B vision-language model from Baidu that turns ordered page images into structured text. Output covers text, tables, formulas, figures, headings and reading order. It succeeds Unlimited-OCR, released in June 2026 to push DeepSeek-OCR further.

The config keeps a DeepSeek-OCR style layout. A SAM ViT-B plus CLIP-L encoder feeds a 12-layer mixture-of-experts decoder. Each token routes to 6 of 64 experts, plus 2 shared experts. The DeepSeek-OCR paper describes this decoder as DeepSeek3B-MoE-A570M. Baidu does not state an active count for version 2. In multi-page mode, each page costs 273 image tokens.

How does SR-SWA work?

Full attention cost grows quadratically with sequence length. During decoding, each new token scans a longer KV cache. At 273 image tokens per page, 100 pages add 27,300 input tokens before any output.

SR-SWA stands for Sparse Reference Sliding Window Attention. It compresses text-visual attention into a fixed set of working references. Baidu’s model card gives 512 tokens as the example size. The config pairs a 128-token local window with top-16 selection over 32-token blocks. That is 16 blocks of 32 tokens, matching the 512-token budget.

This keeps per-step latency and memory nearly constant as documents grow. It calls the result ‘unlimited-horizon’ parsing within a finite context window. Image encoding and total runtime still rise with page count.

&&&

How does it score on MPDocBench and MarathonDocBench?

Baidu team tests on MPDocBench, with dozens of pages per document, and MarathonDocBench, with hundreds. MPDocBench-Parse is a public benchmark of 433 documents and 3,246 pages. We could not find a public MarathonDocBench release.

Per Baidu’s leaderboard chart, Unlimited OCR 2 scores 84.6 on MPDocBench. Qwen3.8-Max follows at 78.3, then Qwen-3.8-Flash-Next at 77.4. On MarathonDocBench it scores 77.1. Kimi-K3 is next at 33.7, then Gemini-3.8-Flash at 28.6.

The drop between benchmarks is the real story. Qwen3.8-Max falls from 78.3 to 22.9 on hundred-page documents. Unlimited OCR 2 falls 7.5 points. Its predecessor, Unlimited-OCR, scores 0.0 on MarathonDocBench.

Sub-scores (MPDocBench / MarathonDocBench):

  • Text: 94.8 / 89.6
  • Formula: 89.4 / 87.9
  • Reading order: 92.3 / 85.3
  • Tables: 87.8 / 74.8
  • Heading hierarchy: 60.1 / 48.2

Single-metric margins on MPDocBench are thin. Qwen3.8-Max scores 94.3 on text and 89.2 on formulas. All figures are self-reported and appear only in a chart image.

Comparison with other open OCR models

Unlimited OCR 2Unlimited-OCRDeepSeek-OCR-2PaddleOCR-VL-1.6
DeveloperBaiduBaiduDeepSeekBaidu PaddlePaddle
Parameters3.34B3.34B3.39B0.96B
Active parametersNot disclosedNot disclosedNot disclosedNot disclosed
LicenseMITMITApache 2.0Apache 2.0
Paper / releaseOct 2026 (report)Jun 2026 (arXiv)Jan 2026 (arXiv)Jun 2026 (arXiv)
Long-document mechanismSR-SWA, 512-token reference setMulti-page infer_multi, no SR-SWANot disclosedNot disclosed
MPDocBench overall84.6 (Baidu)61.9 (Baidu)Not reportedNot reported
MarathonDocBench overall77.1 (Baidu)0.0 (Baidu)Not reportedNot reported
ServingTransformers, custom SGLangTransformers, vLLM, SGLangTransformers, SGLangPaddleOCR, Transformers

Parameter counts and licenses from each model’s Hugging Face page. Benchmark scores from Baidu’s chart.

How do you run Unlimited OCR 2?

The model card lists Transformers for quick tests and SGLang for serving. In Transformers, infer handles 1 page with dynamic tiling, called gundam mode. infer_multi parses every page of

2026-10-27 05:26:36 · 大模型,算力芯片,AI应用,具身智能,开源,Google,NVIDIA,阿里巴巴,DeepSeek,月之暗面,搜索RAG,Transformer,MoE架构,模型评测,长上下文,端侧AI,招聘HR,榜单评测,论文
AI 资讯

Mirendil Launches Fern 0.1, Its First Model, With 10M-Token Context

MarkTechPost

Mirendil has released Fern, its first AI model. Mirendil Fern is a from-scratch coding model with a context window of up to 10M tokens. Mirendil explains how that equals about 23 MB of code, or roughly half a million lines. That is a codebase on the scale of Megatron-LM, held in context at once. Fern 0.1 is the first version, built from Mirendil-Base after a short round of post-training. For developers, its like, you load a whole repo, a full training log or days of agent traces at once.

TL;DR

  • Size: 0.1 to 0.5T parameters (exact count and active params not disclosed); context up to 10M tokens.
  • Runs on: Hosted early access only; no open weights or quantized builds announced.
  • Performance: Strong long-context retrieval, mid-pack agentic coding versus open-weight models, well behind frontier models.
  • Best: 100% on RULER single-needle retrieval at every length from 32K to 10M tokens (base model).
  • Worst: 6.1% on Terminal Bench 4.0, versus 66.4% for Claude Opus 5.5 in Mirendil’s own table.

What is Mirendil Fern?

Fern is a language model from Mirendil, an AI R&D lab.

Fern is aimed at AI R&D work, not general chat. Mirendil lists 6 target uses:

  • Working across larger codebases
  • Agentic coding that runs commands until tests pass
  • Research code: training loops, data pipelines and evaluations
  • Debugging training runs from long logs and stack traces
  • Reading full agent or training traces end to end
  • Auditing pretraining shards for duplicates, contamination and junk

How was Fern built?

Fern sits on Mirendil-Base, which Mirendil says one researcher pretrained in 3.5 months. Total compute was under $10M, including experiments, agent token spend and data processing. AI agents wrote over 99% of the code. The researcher chose what to try and when to intervene.

Training data came only from public sources: GitHub, public code, web pages and public datasets. Mirendil says it used no distillation, no synthetic data and no licensed data. The code was written from scratch on PyTorch and JAX.

Fern is the smallest of 3 planned models. Mirendil-Base-Large (0.5 to 2T parameters) is over 80% through pretraining. Mirendil-Base-XL (2 to 10T) is over 20% through.

Does longer context actually help?

Mirendil tested next-token prediction on its own repositories, concatenated into a 42.9 MB stream. It measured cross-entropy in bits per byte, where lower is better. Window sizes here are measured in bytes, not tokens.

Fern’s loss fell from 0.246 at a 32K-byte window to 0.155 at 16M and 23M bytes. The other models were scored up to about 1M tokens, their advertised limit. At a 1M-byte window, Kimi-K3 scored 0.140 and Fern 0.165. So Fern is not the best predictor at equal context. Its advantage is that the curve keeps going past where others stop.

How does Fern score on RULER?

RULER is a standard long-context benchmark. Mirendil ran 5 RULER tasks on Mirendil-Base, the pre-post-training model. It used greedy decoding, thinking off and exact string matching.

RULER task32K1M4M10M
Single needle100100100100
Multi-key retrieval100989890
Multi-key, all needles100100100100
Variable tracking1009575100
Multi-hop QA (HotpotQA)65656045

Retrieval holds up well. Multi-hop reasoning drops to 45% at 10M. Each 10M cell uses only 20 examples, versus 100 elsewhere. Mirendil says broader long-context results are coming.

&&

How does Fern 0.1 do on agentic benchmarks?

Mirendil compared Fern 0.1 with open-weight and frontier models. Scores for other models come from model cards, leaderboards or Mirendil’s own runs.

Benchmark (pass %)Fern 0.1Kimi-K3GLM-5.3Claude Opus 5.5
DeepSWE v1.144.267.366.974.2
Terminal Bench 4.06.112.641.966.4
SWE Atlas QnA53.266.159.466.4
SWE-Pro v2 Hard76.588.284.3100.0
SWE-Bench Verified73.493.495.498.2

Fern 0.1 beats Inkling and Nemotron 3 Ultra on 4 of 5 tests. It ties Beam on SWE-Pro v2 Hard at 76.5. It trails Beam on SWE-Bench Verified, 73.4 versus 81.6. Every frontier and large open model in the table leads it.

How does Fern compare with similar models?

FeatureFern 0.1Kimi-K3GLM-5.3
DeveloperMirendilMoonshot AIZ.ai
Total params0.1 to 0.5T2.8T753B
Active paramsNot disclosed104B~40B
ContextUp to 10M tokens1,048,576 tokens1,048,576 tokens
InputText, codeText, image, videoText
LicenseNot disclosedKimi K3 LicenseGLM-5.3 License
WeightsNot releasedOpenOpen
AccessEarly access requestOpen weights, APIsOpen weights, APIs
SWE-Bench Verified*73.493.495.4
Bits per byte at 1M bytes*0.1650.1400.170

*Figures from Mirendil’s announcement charts.

Key Takeaways

  • Fern 0.1 supports up t
2026-10-27 12:57:46 · 大模型,算力芯片,AI应用,具身智能,开源,Anthropic,Meta,NVIDIA,月之暗面,智谱,快手,文生视频,Agent智能体,推理思考,搜索RAG,扩散模型,强化学习,微调蒸馏,预训练,模型评测,长上下文,端侧AI,招聘HR,榜单评测,论文,开发者生态
AI 资讯

Liquid AI Releases LFM3: 6 Open-Weight 2B-Class Multimodal Models

MarkTechPost

Liquid AI has released LFM3, its new generation of Liquid Foundation Models. Liquid AI LFM3 is a family of 6 open-weight, 2B-class models built on one shared backbone. The family covers text, vision, audio, omni and decision tasks. Every model can be fine-tuned on a single GPU. Developers can then deploy on phones, laptops, private servers or the cloud.

TL;DR

  • Size: LFM3-1.7B has 1.73B parameters and a 256K context window. LFM3-VL-2B has 1.92B and 128K. LFM3-Omni-2B has 2.2B.
  • Runs on: about 1 GB of memory at 4-bit, so phones and laptops. GGUF, MLX, ONNX, FP8 and NVFP4 checkpoints ship.
  • Performance: LFM3-1.7B averages 49.37 across 29 benchmarks, above Qwen3.5-9B at 47.24 (Liquid’s own eval).
  • Best: IFEval 96.66, and AutomationBench 41.29 vs 15.10 for Qwen3.5-9B.
  • Worst: Humanity’s Last Exam (no tools) 7.17, and RULER 128K 65.56 vs 87.11 for Qwen3.5-9B.

What is Liquid AI LFM3?

LFM3 is a multimodal model family from Liquid AI that branches 6 models from 1 base. All of them start from LFM3-1.7B-Base.

The release includes:

  • LFM3-1.7B: a text model for local agents, post-trained for harnesses like Hermes Agent, Pi and OpenClaw.
  • LFM3-VL-2B: the first LFM vision model with video input, sampled at 2 fps.
  • LFM3-Audio-2B: speech in and out across 18 languages, with tool calling.
  • LFM3-Omni-2B: vision, audio and language in one model, answering in text or speech.
  • d1-2B and d1-Omni-2B: decision models that answer many questions in 1 forward pass.

How does the tri-hybrid architecture work?

The backbone mixes 3 operators across 24 layers. There are 13 gated short convolutions, 5 sliding-window attention layers and 6 global attention layers. The SWA window is 256 tokens. Convolution kernels grew from 3 to 7.

Liquid AI team found this mix with its hardware-in-the-loop architecture search. LFM2 was tuned on 1 phone and 1 laptop. LFM3 was tuned across 14 device and backend combinations. These include a Raspberry Pi 5 and the Qualcomm Hexagon NPU.

Other changes include head-wise sigmoid gates on attention, partial RoPE on global layers and sandwich norm. The base model saw 22T tokens. The last 3.5T tokens were agent-heavy mid-training, which also extended context to 256K.

Post-training ran in 4 stages. SFT on 1.75T tokens came first, then mixed RL. Next, 6 specialist teachers were distilled into 1 model, followed by agentic RL.

How does LFM3-1.7B perform on benchmarks?

Liquid AI reports that LFM3-1.7B beats LFM2.5-2.6B with 35% fewer parameters. The bigger story is the agent results. On WebArena-Verified it scores 38.42, against 28.94 for Qwen3.5-9B. On BFCL V4 it scores 71.39, against 62.83.

Size still wins on knowledge and agentic coding. GPQA Diamond is 63.37, versus 80.40 for Qwen3.5-9B. SWE-bench Verified is 43.40, versus 51.20. Search narrows the gap: Humanity’s Last Exam rises from 7.17 to 13.90 with tools.

&

How do LFM3-1.7B and its rivals compare?

FeatureLFM3-1.7BMiniCPM5-2BQwen3.5-4BGemma 4 E4B
Parameters1.73B2.52B4B LM (5B on Hub with vision)4.5B effective (8B with embeddings)
ArchitectureConv + SWA + global attentionStandard Llama transformerGated DeltaNet + gated attentionSliding window + global attention
Context256K131,072262,144128K
Input modalitiesTextTextText, image, videoText, image, audio
LicenseLFM Open License v1.0 ($10M revenue threshold)Apache 2.0Apache 2.0Apache 2.0
BFCL V4 (Liquid eval)71.3962.6555.1248.25
WebArena-Verified (Liquid eval)38.429.1121.9217.06
SWE-bench Verified (Liquid eval)43.4034.8041.200.50
GPQA Diamond (Liquid eval)63.3765.1575.7657.88
GPQA Diamond (vendor-reported)63.3770.276.258.6
RULER 128K (Liquid eval)65.5637.9684.6318.82
Liquid 29-benchmark average49.3739.1939.2731.74

Sources: Liquid LFM3 model card, MiniCPM5-2B card, Qwen3.5-4B card, Gemma 4 E4B card, LFM license.

What about vision, audio, omni and decision models?

LFM3-VL-2B averages 71.4 across 62 vision benchmarks. Gemma 4 12B scores 71.7 on the same suite. It leads that comparison on visual grounding (77.3) and GUI understanding (83.1). Video (61.2) and agentic tasks (42.5) still trail larger API models.

LFM3-Audio-2B reaches 6.2 English WER and a 3.8 UTMOSv2 TTS score. LFM3-Omni-2B scores 70.1 on Daily-Omni, against 61.3 for Qwen2.5-Omni-7B.

d1-2B replaces d1-3B with a third fewer parameters. It improves Decision Bench from 83.6 to 85.2.

How can developers deploy LFM3?

Weights are on Hugging Face, the Liquid AI Playground and the Liquid API. The docs list GGUF, MLX and ONNX for the text and vision models. Runtimes include llama.cpp, MLX, vLLM, SGLang, Ollama and Transformers.

2026-10-27 21:08:02 · 大模型,算力芯片,AI应用,具身智能,开源,Google,Meta,阿里巴巴,语音音频,多模态,Agent智能体,搜索RAG,Transformer,微调蒸馏,模型评测,向量数据库,长上下文,端侧AI,招聘HR,榜单评测,开发者生态

Cloudflare 披露 KV cache 暴露事故,全部发生在超长上下文的 prompt 上

开源中国Cloudflare 昨天公开了一起租户隔离事故:8 月 27 日到 9 月 9 日期间,Workers AI 平台上的 GLM-5.3 模型(@cf/zai-org/glm-5.3)会把其他客户的请求数据混进响应里,总共 155 次,全部发生在超长上下文的 prompt 上。9 月 8 日安全研究员 Gadi Evron(Knostic 公司)通过 HackerOne 报告了这个跨请求 KV cache 暴露问题...
· 大模型,政策监管,智谱,提示工程,长上下文

【钛晨报】多项智能出行国际标准发布;Anthropic降价引爆调用量,知名投资人:1000亿美元级年终ARR再成可能;东山精密:最终发售价为每股86.8港元,国际发售获3.17倍认购

钛媒体

(本文作者为 钛媒体官方账号,钛媒体经授权发布)

【钛媒体综合】作为全球新能源汽车与智能出行产业大国,近期,中国依托产业实践,在国际标准化组织(ISO)、国际电工委员会(IEC)等国际标准组织框架下,积极推进电动汽车充电适配器、智能车灯等重点领域国际标准研制,为全球智能出行产业协同发展提供标准化支撑。

充电接口兼容性直接影响消费者跨地区、跨国出行的补能体验。国际电工委员会近日正式发布电动汽车适配器国际标准《电动汽车传导式充电车辆适配器》(IEC TS 62196-7:2026),该标准聚焦直流充电车辆适配器核心技术规范,有助于解决适配器充电导致的安全性差与可靠性低的问题。

汽车前照明光束的合理调整是夜间行车安全的关键保障。国际标准化组织正式发布《道路车辆 前照明光束定位测量程序》(ISO 10604:2026),这是中国牵头修订的首个系统覆盖智能车灯光束定位测量程序的国际标准。随着自适应远光灯等智能车灯技术加速普及,统一的测量程序将帮助全球制造商和检测机构更准确地评估车灯光束定位性能,为消费者夜间行车提供更可靠的安全保障。

下一步,市场监管总局将引导智能出行领域的科研机构和企业专业力量更多参与国际标准研制,深化与各国标准化务实交流,助力智能出行产业高质量、可持续发展。

钛媒摘声:

人类本身就是一种具身形态,拥有丰富的运动经验和灵巧操作能力。直接利用人类视频是破解数据瓶颈的必然方向。但人类会做,不代表机器人能直接照搬。人类视频存在手部遮挡、视角变化以及轨迹不完整等问题,加之在身体结构、运动方式等存在差异,若未经处理,绝大多数据会在质量筛选中被直接剔除。

——行元智能创始人 杨世琦

如果要训端侧模型,没有云端模型的能力就训不好,端侧做的事达不达标,需要用云端大模型判断;端的能力边界在哪,需要用云端标定。只做端侧模型的厂商,没有云端大模型的基本能力,指导不了端,也不知道哪些任务该留端、哪些必须上云,大概率不具备竞争优势。

——科大讯飞创始人 刘庆峰

国内公司:

年收入逼近400亿元?红果短剧回应:不实

10月28日,红果短剧官方账号发布声明称,近日,网络上集中出现“红果短剧年化收入逼近400亿元”“红果短剧今年营收达420亿元至450亿元”等说法,经核实,上述收入数据不实。网传内容中所谓的“机构数据”“行业数据”“专家预计”都不是官方信息,据此作出的比较、推算和延伸解读也没有事实依据。

并入火山近百日后,飞书首席战略官史志隽将卸任转顾问

10月27日,据相关报道,字节跳动官宣飞书与豆包、火山引擎整合近百日后,原飞书副总裁、首席战略官史志隽即将卸任,后续先转为顾问,其分管的市场、品牌、增长、公关团队面临调岗、活水、甚至离职的处境。从接近字节跳动人士处获悉,该消息属实。据悉,“转顾问”是字节对曾做出贡献的待离职高管的惯用安排,期间高管会淡出岗位,仅在需要时提供一些业务建议,算是离职前的柔性过渡。

7月30日,字节跳动以一封内部邮件宣布将飞书打散拆分,GTM(市场、销售、客户服务)团队并入火山引擎由谭待负责,史志隽向其汇报。内部人士称,史志隽在飞书虽挂首席战略官的职位,实际承担更多的是品牌、增长、公关等市场职责,与火山引擎市场一号位闫海伦存在重合。史志隽于2020年加入飞书,此前在微软任职超过10年,"先进团队,先用飞书"这一标语由其团队提出。

蚂蚁集团发布灵光2.0

10月27日,蚂蚁集团发布灵光2.0,可支持在开放环境中调用MCP、CLI等工具。据了解,灵光App是蚂蚁集团推出的全模态通用AI助手,于2025年11月18日正式上线,目前已内置支付宝账单、会员、出行,以及钉钉、飞书、邮箱、米家等服务能力。

国外企业:

Anthropic降价引爆调用量,知名投资人:1000亿美元级年终ARR再成可能

10月27日,科技投资者、Atreides Management首席投资官Gavin Baker当地时间10月26日在X平台发帖称,Anthropic在10月下调模型Token价格后,其年度经常性收入(ARR)很可能呈“垂直爆发式”增长。Baker在推文中调侃称对此“感到震惊,绝对震惊”。

他同时点出当前AI市场的核心规律:Token价格下降带动调用量上升,进而推动GPU算力租赁价格大幅上涨。基于这一“降价涨租”的剪刀差现象,Baker称“1000亿美元以上的年终ARR看起来再次成为可能”。结合推文语境,这一判断指向Anthropic。

2026年10月,Anthropic对Claude 5.5系列模型进行价格调整。其中,Haiku 5.5的输入和输出单价较上一代明显下调,标准输入价格降至每百万Token 0.10美元、输出价格降至每百万Token 0.50美元,单价降幅约90%。降价策略迅速带动企业级客户,尤其是AI编程与办公工具的调用需求。目前,Anthropic已公开提交IPO招股书,市场对其实年底估值与营收规模抱有较高预期。AI大模型正加速步入“以价换量”的算力消耗战,底层算力稀缺性再次凸显。

马斯克称SpaceX移动网络建设将耗时2至3年

10月27日,当地时间10月26日,马斯克在社交平台回复一条关于SpaceX美国移动运营商网络计划的帖子时表示,SpaceX的移动网络建设计划“将耗时2至3年”,其未透露更多细节。

Truist Financial考虑出售旗下专业贷款业务

10月27日,相关报道称,Truist Financial正考虑出售旗下专业贷款子公司Afco Credit,此举是这家区域性银行精简资产负债表风险敞口、重新聚焦核心商业银行业务的最新行动。Truist目前正在考虑直接出售该业务,同时也在评估直接剥离投资组合资产的方案,预计这些资产将吸引私人信贷机构竞相出价。尽管最终估值条款尚未确定,但预计此次交易将以高于基础资产帐面价值的溢价成交。

PayPal提高全年调整后每股收益预期

10月27日,PayPal当地时间10月27日公布三季度调整后每股收益1.45美元,上年同期1.34美元,预估1.31美元;净营收85.8亿美元,同比增加2%,预估87.1亿美元;支付交易量68亿,同比增加7.3%,预估67亿;预计全年调整后每股收益大约5.60美元,此前预计大约5.38美元;仍然预测全年资本支出大约10亿美元,预估9.441亿美元。

政策风向:

新规出炉:有线电视不得播放开机广告

10月27日,国家广电总局日前正式发布《有线广播电视运营服务管理规定》,将自11月27日起施行。《规定》第十二条明确,有线广播电视运营服务提供者应当坚持直播优先原则,实现开机看全屏直播功能,设置频道回看入口,不得播放开机广告。智能电视机应支持优先呈现直播频道功能,提供便捷设置入口。

事关能源保供中长期合同管理,国家发展改革委作出部署

10月27日,为加强能源产供储销体系建设,更好发挥中长期合同在能源保供中的基础性作用,近日国家发展改革委印发了《能源保供中长期合同管理办法(试行)》,自12月1日起施行。办法将电煤、电力、天然气保供中长期合同纳入统一制度规范,推动我国能源保供制度化、法治化、规范化水平进一步提升。办法强调,做好能源保供中长期合同相关工作,应当坚持民生优先,兜牢民生用能底线;坚持有效市场和有为政府相结合,稳定供应基本盘;坚持统筹发展和安全,有效防范能源供应风险。

上海:到2028年,智能制造系统集成产业规模达1000亿元

10月27日,上海市经济信息化委印发《上海市加快发展新一代智能制造行动方案》。其中指出,到2028年,实现全市重点制造企业智能工厂全覆盖,推动AI在智能工厂应用普及全覆盖,培育500家先进级智能工厂,AI在制造业应用场景突破2000个,开发10个先进适用的垂域大模型,推出300个以上高水平智能体,建成满足新一代智能制造需求的新型基础设施,工业机器人密度达600台/万人,推动8000台人形机器人进工厂,推动AI赋能的新型智能制造装备产业规模突破2000亿元,智能制造系统集成产业规模达1000亿元,完成“54321”目标。

河南:“十五五”将聚焦散热等金刚石应用领域,实施超硬材料省级重大项目

10月27日,“十五五”时期,河南省将推动超硬材料产业创新能力提升。其中,将积极支持河南超硬材料企业、高校和科研院所争取承担国家重大科研任务,聚焦包括散热在内的金刚石应用重点领域,实施省级重大科技项目,力争突破一批关键核心技术瓶颈。同时,将充分发挥全国重点实验室等国家级创新平台作用,加强省重点实验室、中试基地等创新平台建设,为金刚石前沿课题研究、产业共性技术攻关提供平台支撑。另外,将加强对超硬材料创新型企业培育,鼓励超硬材料企业联合高校、科研院所和新型研发机构等开展协同攻关和成果转化。

股市行情:

东山精密:最终发售价为每股86.8港元,国际发售获3.17倍认购

10月27日,东山精密(02384.HK)公布配发结果,公司全球发售1.14亿股H股,香港公开发售占5.19%,国际发售占94.81%。最终发售价为每股86.8港元,全球发售净筹约97.17亿港元。每手100股,预期H股将于2026年10月28日上午九时正在联交所开始买卖。

13家科创50公司正在实施回购计划,预计金额上限超50亿元

10月27日,近期科创板公司回购增持活动持续活跃。10月8日以来,8家科创50成份股公司披露最新回购方案,涉及艾力斯、佰维存储、拓荆科技、澜起科技、格科微、海光信息、生益电子、华海清科等,预计回购金额上限合计约26.5亿元。增持方面,10月8日以来,科创50公司龙芯中科推出增持计划,控股股东6个月内增持金额不低于500万元且不超过600万元。从在途计划看,目前共有13家科创50成份股公司正在实施回购计划,预计回购金额上限合计50.80亿元,已累计实施回购10.40亿元;另有1家科创50成份股公司正在实施增持计划,预计增持金额上限为600万元。

首批商业不动产REITs三季报披露,平均年化现金流分派率6.5%

10月27日,首批4单沪市商业不动产REITs近期完成上市后首份定期报告披露。报告期内,4只产品合计实现基金收入3.87亿元、可供分配金额2.43亿元,底层资产出租率普遍在95%以上,租金收缴率接近100%;截至三季度末,年化现金流分派率平均为6.5%。

大商所调整生猪期货LH2701合约交易限额

10月27日,大商所公告,经研究决定,自2026年10月29日交易时起,非期货公司会员或者客户在生猪期货LH2701合约上单日开仓量不得超过500手,在生猪期货其他合约上单日开仓量不得超过1000手。该单日开仓量是指非期货公司会员或者客户当日在生猪期货单个合约上的买开仓数量与卖开仓数量之和。套期保值交易和做市交易的开仓数量不受限制。具有实际控制关系的账户按照一个账户管理。交易所将根据市场情况对交易限额进行调整。

其他重要内容:

中国作为首批签约国签署《联合国可转让货物单证公约》

10月27日,当地时间10月26日,《联合国可转让货物单证公约》(以下简称《公约》)签约仪式在加纳首都阿克拉举行,共有60余个国家和地区代表团约400人参加。商务部副部长蒋成华出席签约仪式,并代表中国政府签署《公约》。包括中国、加纳在内的26个国家成为《公约》的首批签约国。《公约》此后将在纽约联合国总部开放供各国签署。

《公约》由中国发起并引领达成,经第80届联合国大会于2025年12月审议通过。《公约》通过在国际规则层面创设适用于所有跨境运输方式的“可转让货物单证”,打破数百年来只有海运提单才能代表货权的制度壁垒。该制度创新填补了国际规则空白,为跨境运输单证的融资交易提供国际法治保障,将有效缓解企业参与国际贸易的资金压力,降低跨境陆上贸易交易成本,为全球贸易高质量发展注入新动能。《公约》的诞生是具有里程碑意义的国际商事规则创新,是中国和世界各国一道秉持推动构建人类命运共同体理念,深入践行四大全球倡议的实际行动,也是坚持真正的多边主义,维护以联合国为核心的国际体系的生动写照。

中方愿与各国一道,尽快完成国内批准程序,也期待更多国家加入《公约》,使《公约》红利惠及更多国家,为全球贸易繁荣、各国人民福祉作出贡献。

崔东树:2026年1-9月汽车行业利润率3.3%

10月27日,崔东树发文表示,2026年1-9月汽车生产2337万台,同比降4%,收入80435亿元增2.6%,成本71627亿元增3.8%,利润2675亿元降23%,销售利润率3.3%;其中9月的汽车生产306万台,销售收入10374亿元增0.6%,成本9257亿元增2.5%,利润142亿元降68%,销售利润率1.4%,处于近4年的低位。

国家统计局:1—9月份全国规模以上工业企业利润增长15.5%

10月27日,国家统计局发布数据,1—9月份,全国规模以上工业企业实现利润总额60337.4亿元,同比增长15.5%(按可比口径计算)。

第140届广交会第二期线下展今日闭展,27.8万名境外采购商到会

10月27日,第140届广交会第二期线下展今天闭展。截至10月27日17时,共有来自218个国家和地区的27.8万名境外采购商到会,比上届同期增长13.4%;152家境外工商机构、384家头部采购企业组团参会。

(综合自央视新闻、新华社、证券时报等)

更多精彩内容,关注钛媒体微信号(ID:taimeiti),或者下载钛媒体App

2026-10-27 23:20:00 · 大模型,算力芯片,AI应用,具身智能,融资,政策监管,Anthropic,Microsoft,字节跳动,阿里巴巴,xAI,代码生成,对话助手,Agent智能体,办公效率,设计创意,金融,扩散模型,长上下文,端侧AI,政务,工业制造,营销广告,AI for Science,招聘HR,基础设施,模型发布,财报
继续滚动加载更多…