{
  "title": "2026-10-10 AI日更 | 企业智能体转入单位经济学竞争：OpenAI 案例提速 96%、成本降 76 倍",
  "url": "https://miaok.ong/ai-daily/ai-daily-2026-10-10/",
  "date": "2026-10-10T07:00:00+08:00",
  "lastmod": "2026-10-10T07:00:00+08:00",
  "type": "ai-daily",
  "kind": "page",
  "language": "zh",
  "description": "今日核心趋势是企业智能体从能力演示转向成本、可控与可解释。OpenAI 披露 Sophos 威胁调查时间压缩 96%、自动化 52% MDR；Asana 浏览器代理成本降低 76 倍、速度提升 5 倍。谷歌发布企业级 Gemini 智能体，专用小模型回潮，真实部署更看重够用与可控。",
  "keywords": null,
  "tags": [],
  "categories": [],
  "author": "孔淼",
  "image": "https://miaok.ong/images/avatar.jpg",
  "content": "\u003ch1 id=\"2026-10-10-ai日更--企业智能体转入单位经济学竞争openai-案例提速-96成本降-76-倍\"\u003e\n  2026-10-10 AI日更 | 企业智能体转入单位经济学竞争：OpenAI 案例提速 96%、成本降 76 倍\n  \u003ca class=\"heading-link\" href=\"#2026-10-10-ai%e6%97%a5%e6%9b%b4--%e4%bc%81%e4%b8%9a%e6%99%ba%e8%83%bd%e4%bd%93%e8%bd%ac%e5%85%a5%e5%8d%95%e4%bd%8d%e7%bb%8f%e6%b5%8e%e5%ad%a6%e7%ab%9e%e4%ba%89openai-%e6%a1%88%e4%be%8b%e6%8f%90%e9%80%9f-96%e6%88%90%e6%9c%ac%e9%99%8d-76-%e5%80%8d\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h1\u003e\n\u003cblockquote\u003e\n\u003cp\u003e今日核心趋势是企业智能体从能力演示转向成本、可控与可解释。OpenAI 披露 Sophos 威胁调查时间压缩 96%、自动化 52% MDR；Asana 浏览器代理成本降低 76 倍、速度提升 5 倍。谷歌发布企业级 Gemini 智能体，专用小模型回潮，真实部署更看重够用与可控。\u003c/p\u003e\n\u003c/blockquote\u003e\n\u003ch2 id=\"-本期-watch-list-深度导读\"\u003e\n  📖 本期 Watch List 深度导读\n  \u003ca class=\"heading-link\" href=\"#-%e6%9c%ac%e6%9c%9f-watch-list-%e6%b7%b1%e5%ba%a6%e5%af%bc%e8%af%bb\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h2\u003e\n\u003cp\u003e今天 OpenAI 官方博客的两篇企业案例值得工程团队精读：Sophos 借助 Daybreak 将威胁调查时间压缩 96%，并自动化 52% 的 MDR 案例；Asana 则在浏览器测试中把模型成本降低 76 倍、速度提升 5 倍。二者共同说明，智能体落地的竞争焦点已从能力演示转向成本与可控性。与此同时，arXiv 上关于 50M token 长期记忆、稀疏注意力即矩阵近似、有损压缩文本自编码器的论文形成一组底层线索，讨论长上下文如何摆脱算力堆叠。第三条值得关注的是专用小模型回潮——微调小模型在语法标注上超过提示的前沿模型，配合历史波兰语语料、交通规划等垂直研究，真实部署正更看重“够用、可控、可解释”。\u003c/p\u003e\n\u003ch2 id=\"-x-平台-ai-热点快讯\"\u003e\n  🌐 X 平台 AI 热点快讯\n  \u003ca class=\"heading-link\" href=\"#-x-%e5%b9%b3%e5%8f%b0-ai-%e7%83%ad%e7%82%b9%e5%bf%ab%e8%ae%af\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h2\u003e\n\u003ch3 id=\"话题-1x-prepares-unified-subscription-bundling-grok-and-cursor-ai-tools\"\u003e\n  话题 1:X Prepares Unified Subscription Bundling Grok and Cursor AI Tools\n  \u003ca class=\"heading-link\" href=\"#%e8%af%9d%e9%a2%98-1x-prepares-unified-subscription-bundling-grok-and-cursor-ai-tools\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e分类:AI · News\u003c/li\u003e\n\u003cli\u003e概况:热度时间:1 day ago,相关帖子数:20000\u003c/li\u003e\n\u003cli\u003e是什么事:X计划推出统一订阅服务，将Grok与Cursor AI工具打包提供给用户。\u003c/li\u003e\n\u003cli\u003e为什么重要:这显示X正从社交平台向AI生产力平台延伸，可能推动AI助手与编程工具的一体化订阅趋势，并加剧与OpenAI、微软Copilot等生态的竞争。\u003c/li\u003e\n\u003cli\u003e讨论概况:X上主要讨论套餐定价是否划算、Grok与Cursor整合后的实际体验，以及X能否借此成为AI超级应用；分歧集中在捆绑订阅的吸引力与数据隐私、厂商锁定风险。\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"话题-2grok-bot-gains-real-time-x-monitoring-and-custom-email-features\"\u003e\n  话题 2:Grok Bot Gains Real-Time X Monitoring and Custom Email Features\n  \u003ca class=\"heading-link\" href=\"#%e8%af%9d%e9%a2%98-2grok-bot-gains-real-time-x-monitoring-and-custom-email-features\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e分类:AI · News\u003c/li\u003e\n\u003cli\u003e概况:热度时间:2 days ago,相关帖子数:52000\u003c/li\u003e\n\u003cli\u003e是什么事:Grok Bot 新增对 X 平台的实时监测和自定义邮箱功能，可像常驻在线的 AI 助手一样处理订阅、回信与多智能体协调等任务。\u003c/li\u003e\n\u003cli\u003e为什么重要:这标志着 AI 智能体从一次性问答工具转向可长期自主运行、跨代理协作的持久型工作流节点，降低了自动化与智能体协作的门槛。\u003c/li\u003e\n\u003cli\u003e讨论概况:讨论焦点包括其作为“常驻 AI 队友”的实际用例、通过邮箱与其他代理（如 Hermes）协作的潜力，以及 iOS 端体验和功能扩展；部分用户对稳定性和可靠性仍持观望态度。\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"话题-3google-unveils-enterprise-gemini-agent-at-nasa-hangar-event\"\u003e\n  话题 3:Google Unveils Enterprise Gemini Agent at NASA Hangar Event\n  \u003ca class=\"heading-link\" href=\"#%e8%af%9d%e9%a2%98-3google-unveils-enterprise-gemini-agent-at-nasa-hangar-event\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e分类:AI · News\u003c/li\u003e\n\u003cli\u003e概况:热度时间:1 day ago,相关帖子数:6400\u003c/li\u003e\n\u003cli\u003e是什么事:10月8日，谷歌在NASA机库举办的Gemini at Work活动上发布企业级Gemini智能体，可处理问答、知识工作、媒体创作和代码，并连接公司系统、跨设备保持上下文。\u003c/li\u003e\n\u003cli\u003e为什么重要:这标志着谷歌将Gemini从消费级助手推向企业级自主代理，直接与微软Copilot和OpenAI等争夺企业AI市场，可能加速AI代理进入核心工作流。\u003c/li\u003e\n\u003cli\u003e讨论概况:X上主要讨论其与微软Copilot、OpenAI企业产品的能力对比，关注企业数据安全、权限控制及实际生产力提升，也有观点认为发布场地意在强化谷歌的企业级野心。\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"话题-4joma-tech-parodies-gpt-6-dishwashing-with-math-puzzle-twist\"\u003e\n  话题 4:Joma Tech Parodies GPT-6 Dishwashing with Math Puzzle Twist\n  \u003ca class=\"heading-link\" href=\"#%e8%af%9d%e9%a2%98-4joma-tech-parodies-gpt-6-dishwashing-with-math-puzzle-twist\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e分类:AI · News\u003c/li\u003e\n\u003cli\u003e概况:热度时间:19 hours ago,相关帖子数:2100\u003c/li\u003e\n\u003cli\u003e是什么事:Joma Tech 发布恶搞视频，戏仿 GPT-6 连洗碗都要求先解数学谜题，讽刺 AI 过度推理。\u003c/li\u003e\n\u003cli\u003e为什么重要:此事用喜剧方式点出当前大模型在简单任务上过度复杂化、推理能力与实用性失衡的问题，对 AI 产品设计具有警示意义。\u003c/li\u003e\n\u003cli\u003e讨论概况:X 上的讨论焦点是 AI 是否应在不必要场景消耗大量算力，以及该恶搞是否恰好反映了真实评测中被忽视的可用性缺陷；有人认为是夸张调侃，也有人认为点中了推理增强趋势的痛点。\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"话题-5austin-riders-embrace-tesla-cybercab-robotaxis-in-rain-and-night\"\u003e\n  话题 5:Austin Riders Embrace Tesla Cybercab Robotaxis in Rain and Night\n  \u003ca class=\"heading-link\" href=\"#%e8%af%9d%e9%a2%98-5austin-riders-embrace-tesla-cybercab-robotaxis-in-rain-and-night\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e分类:AI · Entertainment\u003c/li\u003e\n\u003cli\u003e概况:热度时间:1 day ago,相关帖子数:4700\u003c/li\u003e\n\u003cli\u003e是什么事:奥斯汀乘客在雨天和夜间使用特斯拉Cybercab无人驾驶出租车，反响积极。\u003c/li\u003e\n\u003cli\u003e为什么重要:雨天和夜间是自动驾驶的关键难点，该事件为纯视觉方案在真实复杂条件下的可靠性提供了验证，也推动Robotaxi商业化讨论。\u003c/li\u003e\n\u003cli\u003e讨论概况:X上的讨论聚焦于Cybercab在低能见度下的安全表现、特斯拉纯视觉方案与激光雷达路线之争，以及其是否具备规模化运营条件。\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch4 id=\"今日-x-上的-ai-舆情小结\"\u003e\n  今日 X 上的 AI 舆情小结\n  \u003ca class=\"heading-link\" href=\"#%e4%bb%8a%e6%97%a5-x-%e4%b8%8a%e7%9a%84-ai-%e8%88%86%e6%83%85%e5%b0%8f%e7%bb%93\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h4\u003e\n\u003cp\u003e今天舆论主线是AI正从一次性问答工具加速转向可长期运行、跨应用协作并嵌入实际工作流的智能体与生产力平台，X整合Grok与Cursor、Grok Bot常驻邮箱协作以及谷歌发布企业级Gemini都体现了这一趋势。共识在于行业普遍看重AI的实用性和规模化落地能力，但分歧也很明显：一方关注捆绑订阅是否划算、是否带来数据隐私与厂商锁定风险，另一方则争论企业级智能体能否真正提升生产力，以及特斯拉纯视觉方案在雨天夜间等复杂场景下是否足够可靠。潜在风险集中在数据安全与权限控制、智能体稳定性和算力消耗失衡，以及自动驾驶在低能见度条件下规模化运营的安全验证仍不充分，Joma Tech的恶搞也恰好点出过度推理可能牺牲简单任务可用性的隐患。\u003c/p\u003e\n\u003ch2 id=\"-大佬观点influencer-insights\"\u003e\n  💡 大佬观点(Influencer Insights)\n  \u003ca class=\"heading-link\" href=\"#-%e5%a4%a7%e4%bd%ac%e8%a7%82%e7%82%b9influencer-insights\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h2\u003e\n\u003cblockquote\u003e\n\u003cp\u003e今日大佬观点暂缺,推荐阅读 Watch List 深度内容。\u003c/p\u003e\n\u003c/blockquote\u003e\n\u003ch2 id=\"-附录今日-watch-list-更新源列表\"\u003e\n  📚 附录:今日 Watch List 更新源列表\n  \u003ca class=\"heading-link\" href=\"#-%e9%99%84%e5%bd%95%e4%bb%8a%e6%97%a5-watch-list-%e6%9b%b4%e6%96%b0%e6%ba%90%e5%88%97%e8%a1%a8\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h2\u003e\n\u003cblockquote\u003e\n\u003cp\u003e时间窗口:最近 3 天;覆盖 22 个源;共 33 条更新\u003c/p\u003e\n\u003c/blockquote\u003e\n\u003ch3 id=\"stratechery-by-ben-thompson-a_full\"\u003e\n  Stratechery by Ben Thompson (A_full)\n  \u003ca class=\"heading-link\" href=\"#stratechery-by-ben-thompson-a_full\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cstrong\u003e\u003ca href=\"https://stratechery.com/2026/its-not-you-its-me/\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003e2026.41: It’s Not You, It’s Me\u003c/a\u003e\u003c/strong\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-10 01:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- (Photo by Justin Sullivan/Getty Images).\n\u003cul\u003e\n\u003cli\u003eWelcome back to This Week in Stratechery!\u003c/li\u003e\n\u003cli\u003eAs a reminder, each week, every Friday, we’re sending out this overview of content in the Stratechery bundle; highlighted links are free for everyone.\u003c/li\u003e\n\u003cli\u003eAdditionally, you have complete control over what we send to you.\u003c/li\u003e\n\u003cli\u003eOn that note, here were a few of our favorites this week.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003e(Photo by Justin Sullivan/Getty Images)\u003c/li\u003e\n\u003cli\u003eWelcome back to This Week in Stratechery\u003c/li\u003e\n\u003cli\u003eAs a reminder, each week, every Friday, we’re sending out this overview of content in the Stratechery bundle; highlighted links are free for everyone\u003c/li\u003e\n\u003cli\u003eAdditionally, you have complete control over what we send to you\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"openai-blog-a_full\"\u003e\n  OpenAI Blog (A_full)\n  \u003ca class=\"heading-link\" href=\"#openai-blog-a_full\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://openai.com/index/sophos\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eSophos cuts threat investigation time by 96% with OpenAI Daybreak\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 15:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- Discover how Sophos uses OpenAI’s Daybreak to cut cyber-threat investigation time by 96% and automate 52% of MDR cases while preserving human oversight.\n\u003cul\u003e\n\u003cli\u003eThis piece from OpenAI Blog explains how Sophos cuts threat investigation time by 96% with OpenAI Daybreak shapes the broader AI and infrastructure landscape.\u003c/li\u003e\n\u003cli\u003eIt also surfaces practical implications for founders, operators, and investors following Sophos cuts threat investigation time by 96% with OpenAI Daybreak.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003eDiscover how Sophos uses OpenAI’s Daybreak to cut cyber-threat investigation time by 96% and automate 52% of MDR cases while preserving human oversight.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://openai.com/index/asana-browser-agent\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eAsana cuts model costs 76x in browser tests with GPT-6.1 Sol\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 15:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- Using GPT-6 Astra in Codex, Asana made its browser agent 76x cheaper and 5x faster in tests to offer customers more capable models.\n\u003cul\u003e\n\u003cli\u003eThis piece from OpenAI Blog explains how Asana cuts model costs 76x in browser tests with GPT-6.1 Sol shapes the broader AI and infrastructure landscape.\u003c/li\u003e\n\u003cli\u003eIt also surfaces practical implications for founders, operators, and investors following Asana cuts model costs 76x in browser tests with GPT-6.1 Sol.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003eUsing GPT-6 Astra in Codex, Asana made its browser agent 76x cheaper and 5x faster in tests to offer customers more capable models.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"arxiv-csai-b_introsearch\"\u003e\n  ArXiv cs.AI (B_intro+search)\n  \u003ca class=\"heading-link\" href=\"#arxiv-csai-b_introsearch\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10541\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eAn Explainable Header-Centric Framework for Large-Scale Semantic Table Interpretation and Data Quality Assessment\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10541v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Knowledge Graph (KG) quality depends not only on downstream graph validation, but also on the quality of tabular metadata used before integration.\u003c/li\u003e\n\u003cli\u003eIn metadata-only Semantic Table Interpretation (STI), where cell values are unavailable, noisy, or unsuitable, column headers become a critical source of semantic evidence for traceable KG preparation.\u003c/li\u003e\n\u003cli\u003eWe present an explainable, header-centric framework for metadata-only Column Type Annotation (CTA) and Data Quality Assessment (DQA).\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10541v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Knowledge Graph (KG) quality depends not only on downstream graph validation, but also on the quality of tabular metadata used before integration\u003c/li\u003e\n\u003cli\u003eIn metadata-only Semantic Table Interpretation (STI), where cell values are unavailable, noisy, or unsuitable, column headers become a critical source of semant…\u003c/li\u003e\n\u003cli\u003eWe present an explainable, header-centric framework for metadata-only Column Type Annotation (CTA) and Data Quality Assessment (DQA)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10549\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eSynthesis Through Simulation: Generating Coherent Enterprise Data via Scalable Agent-System Interaction\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10549v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Tool-calling agents have become central to enterprise AI, yet training and evaluating them at scale remains severely constrained due to business and legal restrictions on enterprise systems, data, and database schemas.\u003c/li\u003e\n\u003cli\u003eTabular data synthesis offers a natural alternative, but its effectiveness is fundamentally limited by structural validity and schema availability, while procedure-based approaches yield the opposite weakness, typically lacking distributional fidelity without per-domain authoring.\u003c/li\u003e\n\u003cli\u003eWe introduce \u003cstrong\u003eSynthesis Through Simulation\u003c/strong\u003e (STS), a \u003cstrong\u003eschema\u0026ndash;free\u003c/strong\u003e data synthesis paradigm in which an LLM agent generates data by executing operations against policy-enforcing APIs within simulated enterprise environments.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10549v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Tool-calling agents have become central to enterprise AI, yet training and evaluating them at scale remains severely constrained due to business and l…\u003c/li\u003e\n\u003cli\u003eTabular data synthesis offers a natural alternative, but its effectiveness is fundamentally limited by structural validity and schema availability, while proced…\u003c/li\u003e\n\u003cli\u003eWe introduce \u003cstrong\u003eSynthesis Through Simulation\u003c/strong\u003e (STS), a \u003cstrong\u003eschema\u0026ndash;free\u003c/strong\u003e data synthesis paradigm in which an LLM agent generates data by executing operations aga…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10590\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eAgent-Controlled Forgetting for Tool-Using Agents: Reversible Context Curation in Practice\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10590v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Tool-using agents repeatedly carry observations whose useful content can be much smaller than their original payload.\u003c/li\u003e\n\u003cli\u003eWe study agent-controlled forgetting: the acting model selects previously observed tool results, replaces each with a short note at its original position, and retains the exact original in a recoverable archive.\u003c/li\u003e\n\u003cli\u003eA Python harness exposes batch archival and explicit recovery without task-specific model training, while protecting user instructions and assistant messages from these operations.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10590v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Tool-using agents repeatedly carry observations whose useful content can be much smaller than their original payload\u003c/li\u003e\n\u003cli\u003eWe study agent-controlled forgetting: the acting model selects previously observed tool results, replaces each with a short note at its original position, and r…\u003c/li\u003e\n\u003cli\u003eA Python harness exposes batch archival and explicit recovery without task-specific model training, while protecting user instructions and assistant messages fr…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10611\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eVerification and Self-Improvement in Agentic AI: Foundations and Limits\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10611v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Agentic AI systems can improve by searching longer, receiving additional support, or modifying how they propose and verify outputs.\u003c/li\u003e\n\u003cli\u003eA performance score does not distinguish these mechanisms.\u003c/li\u003e\n\u003cli\u003eWe compare these changes through bounded verification with hidden terminal randomness.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10611v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Agentic AI systems can improve by searching longer, receiving additional support, or modifying how they propose and verify outputs\u003c/li\u003e\n\u003cli\u003eA performance score does not distinguish these mechanisms\u003c/li\u003e\n\u003cli\u003eWe compare these changes through bounded verification with hidden terminal randomness\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10629\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eThe Harness as the Only Mutable Surface: Compliance-Bounded Self-Evolution of LLM Agents in Credit Pipelines, with a Measured Admission Gate\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10629v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Self-improving LLM agents can adapt a credit pipeline to a changed rule, but an agent that rewrites itself destroys the artefact a supervisor reviews: a named change, a recorded test, an approval.\u003c/li\u003e\n\u003cli\u003eWe argue that self-evolution is reviewable only if it is confined to the runtime harness (instruction text, tool-call logic and primitive composition) while model weights stay fixed, so that every adaptation is a diff with a cause and a test attached.\u003c/li\u003e\n\u003cli\u003eWe give a dual-loop engine built on that bound, with one admission gate that writes a hash-chained record before deployment, and we measure the gate in simulation, with a simulated agent and a seeded-search proposer rather than language models.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10629v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Self-improving LLM agents can adapt a credit pipeline to a changed rule, but an agent that rewrites itself destroys the artefact a supervisor reviews:…\u003c/li\u003e\n\u003cli\u003eWe argue that self-evolution is reviewable only if it is confined to the runtime harness (instruction text, tool-call logic and primitive composition) while mod…\u003c/li\u003e\n\u003cli\u003eWe give a dual-loop engine built on that bound, with one admission gate that writes a hash-chained record before deployment, and we measure the gate in simulati…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10635\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eSpeaking the Navigator\u0026rsquo;s Language: Trajectory-Grounded Instruction Translation for Frozen Aerial VLN Agents\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10635v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Aerial vision-and-language navigation (VLN) agents are typically trained on detail-rich, trajectory-aligned commands, whereas users issue short, intent-driven instructions; on a frozen OpenFly navigator, this \\emph{instruction gap} drops success rate (SR) from $31.03%$ to $11.33%$.\u003c/li\u003e\n\u003cli\u003eTo scale translator training, we prompt a language model with human-written style examples to convert original commands into paired, intent-centered Weak commands, which yield $15.27%$ SR.\u003c/li\u003e\n\u003cli\u003eWe introduce the \\textbf{Trajectory-Grounded Instruction Translator (TGIT)}, a front-end that keeps the navigator frozen and translates Weak inputs into agent-executable commands by learning from its trajectory outcomes.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10635v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Aerial vision-and-language navigation (VLN) agents are typically trained on detail-rich, trajectory-aligned commands, whereas users issue short, inten…\u003c/li\u003e\n\u003cli\u003eTo scale translator training, we prompt a language model with human-written style examples to convert original commands into paired, intent-centered Weak comman…\u003c/li\u003e\n\u003cli\u003eWe introduce the \\textbf{Trajectory-Grounded Instruction Translator (TGIT)}, a front-end that keeps the navigator frozen and translates Weak inputs into agent-e…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10786\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003ePlan-and-Patch: Diffusion Language Models for Agentic Planning\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10786v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Planning is increasingly important for long-horizon agents, where successful execution requires coordinating subgoals, tool use, and intermediate outcomes over many steps.\u003c/li\u003e\n\u003cli\u003eYet assumptions made during planning may be invalidated by the environment, tools may return unexpected results, or actions may fail.\u003c/li\u003e\n\u003cli\u003eEffective agents must therefore not only generate plans, but also revise them.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10786v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Planning is increasingly important for long-horizon agents, where successful execution requires coordinating subgoals, tool use, and intermediate outc…\u003c/li\u003e\n\u003cli\u003eYet assumptions made during planning may be invalidated by the environment, tools may return unexpected results, or actions may fail\u003c/li\u003e\n\u003cli\u003eEffective agents must therefore not only generate plans, but also revise them\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10805\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eWhose Ground Truth? Embracing Ambiguity in Human-Centered AI\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10805v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: As AI systems increasingly interact with people and make decisions about them, understanding human interpretations becomes an important part of developing human-centered AI.\u003c/li\u003e\n\u003cli\u003eConventional machine learning and AI systems are largely developed under the assumption that a single definitive ground truth exists, with variability in human annotations often resolved through aggregation or treated as noise.\u003c/li\u003e\n\u003cli\u003eHowever, for many human-centered tasks, human interpretation is inherently ambiguous, and multiple interpretations of the same input may be simultaneously reasonable and valid.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10805v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: As AI systems increasingly interact with people and make decisions about them, understanding human interpretations becomes an important part of develo…\u003c/li\u003e\n\u003cli\u003eConventional machine learning and AI systems are largely developed under the assumption that a single definitive ground truth exists, with variability in human…\u003c/li\u003e\n\u003cli\u003eHowever, for many human-centered tasks, human interpretation is inherently ambiguous, and multiple interpretations of the same input may be simultaneously reaso…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10833\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eOn the Clock: Towards Punctual and Productive Time-Budgeted AI Agents\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10833v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: We study whether small LLM agents can operate effectively under explicit wall-clock time budgets by both respecting the allocated runtime and using available time productively.\u003c/li\u003e\n\u003cli\u003eWe evaluate Qwen3.6-27B on five competitions from MLE-Bench Lite and Qwen3-4B on Zork I (Jericho), two agentic benchmarks where additional computational time can meaningfully improve performance.\u003c/li\u003e\n\u003cli\u003eIn the simplest setting, where the budget is stated only in the prompt, agents fail to translate the stated budget into controlled use of time.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10833v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: We study whether small LLM agents can operate effectively under explicit wall-clock time budgets by both respecting the allocated runtime and using av…\u003c/li\u003e\n\u003cli\u003eWe evaluate Qwen3.6-27B on five competitions from MLE-Bench Lite and Qwen3-4B on Zork I (Jericho), two agentic benchmarks where additional computational time ca…\u003c/li\u003e\n\u003cli\u003eIn the simplest setting, where the budget is stated only in the prompt, agents fail to translate the stated budget into controlled use of time\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10857\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eSelf-Supervised Keyframe Discovery for Horizon-Invariant Behavior Cloning\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10857v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Behavior cloning (BC) in non-Markovian environments is a challenging problem because policies have to reason over contextual information over long horizons.\u003c/li\u003e\n\u003cli\u003eExisting policy architectures rely on recurrent or attention-based mechanisms to capture long-term dependencies.\u003c/li\u003e\n\u003cli\u003eHowever, recurrent models suffer from hidden-state collapse and gradient instability under backpropagation through time, while attention-based models are fundamentally limited by context length.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10857v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Behavior cloning (BC) in non-Markovian environments is a challenging problem because policies have to reason over contextual information over long hor…\u003c/li\u003e\n\u003cli\u003eExisting policy architectures rely on recurrent or attention-based mechanisms to capture long-term dependencies\u003c/li\u003e\n\u003cli\u003eHowever, recurrent models suffer from hidden-state collapse and gradient instability under backpropagation through time, while attention-based models are fundam…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"arxiv-cscl-b_introsearch\"\u003e\n  ArXiv cs.CL (B_intro+search)\n  \u003ca class=\"heading-link\" href=\"#arxiv-cscl-b_introsearch\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10550\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eDiffu-LoRA: A Novel Low-Rank Adaptation for Personalized Diffusion Models\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10550v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Personalizing text-to-image diffusion models from a few reference images requires preserving subject identity while following prompts that describe new contexts.\u003c/li\u003e\n\u003cli\u003eFull-model fine-tuning is parameter-intensive, whereas low-rank adaptation (LoRA) reduces the number of trainable parameters but leaves open how adaptation capacity should be distributed across layers.\u003c/li\u003e\n\u003cli\u003eWe introduce Diffu-LoRA, a parameter-efficient method that learns this allocation through gated low-rank adaptation.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10550v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Personalizing text-to-image diffusion models from a few reference images requires preserving subject identity while following prompts that describe ne…\u003c/li\u003e\n\u003cli\u003eFull-model fine-tuning is parameter-intensive, whereas low-rank adaptation (LoRA) reduces the number of trainable parameters but leaves open how adaptation capa…\u003c/li\u003e\n\u003cli\u003eWe introduce Diffu-LoRA, a parameter-efficient method that learns this allocation through gated low-rank adaptation\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10592\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eWieszcz-XIX: A 3.1-Billion-Word Corpus of Pre-1918 Polish and Temporally Bounded Language Models Trained From Scratch\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10592v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Historical Polish is well documented as a language but annotated in machine-readable form only to about a million words for the period this paper covers; the rest sits behind optical character recognition of variable quality.\u003c/li\u003e\n\u003cli\u003eWe present Wieszcz-XIX, a corpus of 6.75 billion tokens (about 3.1 billion words) in 294,369 documents, most of them periodical issues, of Polish published from 1800 to 1918, assembled from Wolne Lektury and the Internet Archive by a pipeline that filters, deduplicates, audits for post-1918 leakage and splits at the document level.\u003c/li\u003e\n\u003cli\u003eIt is over three orders of magnitude larger than the annotated corpus of the same period, and we quantify its defects: recognition corruption against a false-positive floor, near-identical duplication, which is removed, and post-1918 leakage, which is excluded from the training corpus itself down to a known residue of 0.04 to 0.38% of its bytes, found in the transcribed source, so the published corpus is the trained one document for document.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10592v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Historical Polish is well documented as a language but annotated in machine-readable form only to about a million words for the period this paper cove…\u003c/li\u003e\n\u003cli\u003eWe present Wieszcz-XIX, a corpus of 6.75 billion tokens (about 3.1 billion words) in 294,369 documents, most of them periodical issues, of Polish published from…\u003c/li\u003e\n\u003cli\u003eIt is over three orders of magnitude larger than the annotated corpus of the same period, and we quantify its defects: recognition corruption against a false-po…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10650\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eLarge Language Model-Assisted Preparation of Transportation Management Plans: A Case Study with WisDOT WisTMP System\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10650v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Work zones are critical yet hazardous components of transportation infrastructure, requiring carefully designed Transportation Management Plans (TMPs) to ensure safety and mobility.\u003c/li\u003e\n\u003cli\u003eHowever, TMP preparation remains labor-intensive and heavily dependent on practitioner expertise.\u003c/li\u003e\n\u003cli\u003eThis paper proposes a Large Language Model (LLM)-assisted framework to automate TMP content generation, leveraging the WisDOT WisTMP system as the application context.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10650v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Work zones are critical yet hazardous components of transportation infrastructure, requiring carefully designed Transportation Management Plans (TMPs)…\u003c/li\u003e\n\u003cli\u003eHowever, TMP preparation remains labor-intensive and heavily dependent on practitioner expertise\u003c/li\u003e\n\u003cli\u003eThis paper proposes a Large Language Model (LLM)-assisted framework to automate TMP content generation, leveraging the WisDOT WisTMP system as the application c…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10724\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eCognitive Thermometers: Machine Learning and Logical Complexity\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10724v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: How does the human mind represent semantic categories?\u003c/li\u003e\n\u003cli\u003eWhy do natural languages favor certain meanings over others?\u003c/li\u003e\n\u003cli\u003ePrior explanations have relied on logical definability and complexity, but these are highly sensitive to the choice of logical language, rendering some design choices unmotivated.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10724v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: How does the human mind represent semantic categories\u003c/li\u003e\n\u003cli\u003eWhy do natural languages favor certain meanings over others\u003c/li\u003e\n\u003cli\u003ePrior explanations have relied on logical definability and complexity, but these are highly sensitive to the choice of logical language, rendering some design c…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10738\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eLossy Compressive Text Autoencoders\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10738v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Our work explores learning a compressed latent representation of text, at the intersection of data compression and representation learning.\u003c/li\u003e\n\u003cli\u003eWe propose an autoencoder architecture that performs residual downscaling and upscaling of hidden representations along the time axis, with a residual low-dimension discrete bottleneck.\u003c/li\u003e\n\u003cli\u003eWe analyze our approach for different quantization methods, training objectives, and datasets.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10738v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Our work explores learning a compressed latent representation of text, at the intersection of data compression and representation learning\u003c/li\u003e\n\u003cli\u003eWe propose an autoencoder architecture that performs residual downscaling and upscaling of hidden representations along the time axis, with a residual low-dimen…\u003c/li\u003e\n\u003cli\u003eWe analyze our approach for different quantization methods, training objectives, and datasets\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10758\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eClarify, Then Focus: Statement Normalization for Conversation Analytics at Scale\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10758v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Enterprise conversation analytics asks many questions of millions of interactions.\u003c/li\u003e\n\u003cli\u003eEach question can require reconstructing what people mean and identifying which information matters, repeating costly interpretive work across the same transcripts.\u003c/li\u003e\n\u003cli\u003eWe propose a simple principle: clarify the text, then focus the reader.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10758v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Enterprise conversation analytics asks many questions of millions of interactions\u003c/li\u003e\n\u003cli\u003eEach question can require reconstructing what people mean and identifying which information matters, repeating costly interpretive work across the same transcri…\u003c/li\u003e\n\u003cli\u003eWe propose a simple principle: clarify the text, then focus the reader\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10827\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eGrammar Concept Annotation at Scale: Deployed Fine-Tuned Small Language Models Outperform Prompted Frontier Models\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10827v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Corrective feedback is among the best-evidenced drivers of second-language acquisition, yet corrections delivered during lessons rarely accumulate into an actionable view of grammar mastery.\u003c/li\u003e\n\u003cli\u003ePrompted frontier models can provide such a view from learner\u0026ndash;tutor lesson transcripts, but they are costly at scale.\u003c/li\u003e\n\u003cli\u003eWe close this gap by fine-tuning Qwen3.5 small language models (SLMs) on filtered and rebalanced teacher-generated supervision, then deploying an efficient 0.8B model in an end-to-end grammar mastery tracker for all English learners on our platform.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10827v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Corrective feedback is among the best-evidenced drivers of second-language acquisition, yet corrections delivered during lessons rarely accumulate int…\u003c/li\u003e\n\u003cli\u003ePrompted frontier models can provide such a view from learner\u0026ndash;tutor lesson transcripts, but they are costly at scale\u003c/li\u003e\n\u003cli\u003eWe close this gap by fine-tuning Qwen3.5 small language models (SLMs) on filtered and rebalanced teacher-generated supervision, then deploying an efficient 0.8B…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10845\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eReal Long-Term Memory for AI: A 50-Million-Token Window That Is Faster and Cheaper Than Recompute\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10845v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: A large language model can only use the text that fits in its context window, and it recomputes its internal key-value (KV) state for a prompt every time the prompt is sent.\u003c/li\u003e\n\u003cli\u003eWe test a memory layer, the public package galahad-kv, that saves the KV state of each block of about 16,000 tokens to encrypted local NVMe disk and loads it back later, byte-exact, without recomputing it.\u003c/li\u003e\n\u003cli\u003eWe ran it on 50,000,000 tokens of real public text, served through vLLM on one NVIDIA H100, with Gemma 4 12B and Gemma 4 31B.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10845v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: A large language model can only use the text that fits in its context window, and it recomputes its internal key-value (KV) state for a prompt every t…\u003c/li\u003e\n\u003cli\u003eWe test a memory layer, the public package galahad-kv, that saves the KV state of each block of about 16,000 tokens to encrypted local NVMe disk and loads it ba…\u003c/li\u003e\n\u003cli\u003eWe ran it on 50,000,000 tokens of real public text, served through vLLM on one NVIDIA H100, with Gemma 4 12B and Gemma 4 31B\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10865\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eDisentangling Linguistic and Paralinguistic Information with Routed Sparse Autoencoders\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10865v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Self-supervised speech encoders contain linguistic and paralinguistic information in a shared, entangled representation space.\u003c/li\u003e\n\u003cli\u003eWe combine a TopK sparse autoencoder with route-specific supervision and cross-factor adversaries.\u003c/li\u003e\n\u003cli\u003eAcross frozen SPEAR and WavLM encoders, independent probes show factor-specific retention and suppression: linguistic information remains stronger in the linguistic route, while paralinguistic factors, including speaker identity, emotion, and prosody, are retained in the paralinguistic route and substantially reduced in the linguistic route.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10865v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Self-supervised speech encoders contain linguistic and paralinguistic information in a shared, entangled representation space\u003c/li\u003e\n\u003cli\u003eWe combine a TopK sparse autoencoder with route-specific supervision and cross-factor adversaries\u003c/li\u003e\n\u003cli\u003eAcross frozen SPEAR and WavLM encoders, independent probes show factor-specific retention and suppression: linguistic information remains stronger in the lingui…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10871\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eSparse Attention Is Matrix Approximation, Not Choosing from a Bag of Values\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10871v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Large Language Models (LLMs) achieve strong performance across many domains, but their efficiency is limited by the quadratic cost of attention with respect to prompt length.\u003c/li\u003e\n\u003cli\u003eSparse attention reduces this cost by retaining only a small fraction of query-key interactions to approximate the full attention matrix.\u003c/li\u003e\n\u003cli\u003eHowever, existing methods are trapped in a mathematically wrong view: they simply keep large scalar entries or high-mass regions of the attention matrix.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10871v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Large Language Models (LLMs) achieve strong performance across many domains, but their efficiency is limited by the quadratic cost of attention with r…\u003c/li\u003e\n\u003cli\u003eSparse attention reduces this cost by retaining only a small fraction of query-key interactions to approximate the full attention matrix\u003c/li\u003e\n\u003cli\u003eHowever, existing methods are trapped in a mathematically wrong view: they simply keep large scalar entries or high-mass regions of the attention matrix\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"arxiv-cslg-b_introsearch\"\u003e\n  ArXiv cs.LG (B_intro+search)\n  \u003ca class=\"heading-link\" href=\"#arxiv-cslg-b_introsearch\"\u003e\n    \u003ci class=\"fa-solid fa-link\" aria-hidden=\"true\" title=\"链接到标题\"\u003e\u003c/i\u003e\n    \u003cspan class=\"sr-only\"\u003e链接到标题\u003c/span\u003e\n  \u003c/a\u003e\n\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10552\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eFreeze the Decoder, Heal the Encoder: Parameter-Efficient Adaptation for SVD-Based KV-Cache Compression\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10552v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Comparing parameter-efficient fine-tuning recipes under a single, shared learning rate is a common but flawed practice: when the arms being compared have very different trainable-parameter counts, a shared rate can simultaneously depress the larger arms\u0026rsquo; means and inflate their variance, manufacturing a large, seemingly multi-seed-significant advantage for the smallest arm that is not a real effect.\u003c/li\u003e\n\u003cli\u003eWe document this confound in a concrete setting: post-hoc SVD-based KV-cache compression, where an already-pretrained model is converted to a low-rank (multi-head-latent-attention-style) cache by factorizing its key/value weights into a down-projection (\u0026ldquo;encoder\u0026rdquo;) and an up-projection (\u0026ldquo;decoder\u0026rdquo;), after which a short fine-tune (\u0026ldquo;healing\u0026rdquo;) recovers the accuracy lost to truncation.\u003c/li\u003e\n\u003cli\u003eUnder a shared learning rate, freezing the decoder and healing only the encoder looks like a clear win over healing the decoder or both factors; once every arm is given its own tuned learning rate, that apparent advantage disappears, and encoder-only healing instead reaches parity with the alternatives, at a real, measured saving of 3x fewer trainable parameters and 3x less optimizer-state memory.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10552v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Comparing parameter-efficient fine-tuning recipes under a single, shared learning rate is a common but flawed practice: when the arms being compared h…\u003c/li\u003e\n\u003cli\u003eWe document this confound in a concrete setting: post-hoc SVD-based KV-cache compression, where an already-pretrained model is converted to a low-rank (multi-he…\u003c/li\u003e\n\u003cli\u003eUnder a shared learning rate, freezing the decoder and healing only the encoder looks like a clear win over healing the decoder or both factors; once every arm…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10571\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eSPERA: Spherical Prior EEG Foundation Model with Geometry- and Frequency-Aware Latent Prediction\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10571v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Electroencephalography (EEG) provides a non-invasive measure of ongoing neural activity, but building general-purpose EEG models remains challenging due to the heterogeneity of subjects, devices, and electrode montages.\u003c/li\u003e\n\u003cli\u003eExisting EEG foundation models predominantly rely on reconstruction-based objectives defined on the observed signal, which contains both neural and non-neural components.\u003c/li\u003e\n\u003cli\u003eWe introduce SPERA (Spherical Prior EEG Representation Architecture), an EEG foundation model that adopts the joint-embedding predictive architecture (JEPA) to predict in latent space.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10571v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Electroencephalography (EEG) provides a non-invasive measure of ongoing neural activity, but building general-purpose EEG models remains challenging d…\u003c/li\u003e\n\u003cli\u003eExisting EEG foundation models predominantly rely on reconstruction-based objectives defined on the observed signal, which contains both neural and non-neural c…\u003c/li\u003e\n\u003cli\u003eWe introduce SPERA (Spherical Prior EEG Representation Architecture), an EEG foundation model that adopts the joint-embedding predictive architecture (JEPA) to…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10594\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eCoverage, Not Difficulty, Sets How Much Synthetic Data an Activation Probe Needs\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10594v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Activation probes that monitor deployed language models are trained on synthetic conversations, and how many a probe needs is open.\u003c/li\u003e\n\u003cli\u003eWe trace learning curves over 10-590 synthetic samples for three monitoring concepts, high-stakes situations, replies harmful to a person, and replies that do not follow the user\u0026rsquo;s instruction, on fourteen held-out evaluation distributions and four probe models, varying the generator LLM and the prompt\u0026rsquo;s detail.\u003c/li\u003e\n\u003cli\u003eThe need is set by what is monitored: probes for high-stakes and harmful are within a few hundredths of their plateau from 80 samples on Gemma-3-27B-IT, instruction probes need several times as many, and the ordering holds on three smaller probe models and on real samples (from dev set).\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10594v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Activation probes that monitor deployed language models are trained on synthetic conversations, and how many a probe needs is open\u003c/li\u003e\n\u003cli\u003eWe trace learning curves over 10-590 synthetic samples for three monitoring concepts, high-stakes situations, replies harmful to a person, and replies that do n…\u003c/li\u003e\n\u003cli\u003eThe need is set by what is monitored: probes for high-stakes and harmful are within a few hundredths of their plateau from 80 samples on Gemma-3-27B-IT, instruc…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10613\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eTemporal transformer CAN encoder with federated lightweight heads for anomaly detection\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10613v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Modern vehicles rely on large numbers of Electronic Control Units (ECUs) that constantly exchange information over the Controller Area Network (CAN) bus.\u003c/li\u003e\n\u003cli\u003eDue to the rapidity, structure, and repetition of this communication, even slight variations in timing, payload values, or message patterns can point to unusual activity.\u003c/li\u003e\n\u003cli\u003eWhether due to errors, malfunctions, or deliberate interference, these anomalies are frequently subtle and challenging to identify with conventional methods that handle messages separately or rely on manually created rules.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10613v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Modern vehicles rely on large numbers of Electronic Control Units (ECUs) that constantly exchange information over the Controller Area Network (CAN) b…\u003c/li\u003e\n\u003cli\u003eDue to the rapidity, structure, and repetition of this communication, even slight variations in timing, payload values, or message patterns can point to unusual…\u003c/li\u003e\n\u003cli\u003eWhether due to errors, malfunctions, or deliberate interference, these anomalies are frequently subtle and challenging to identify with conventional methods tha…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10616\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eWhen Routing Reveals Membership: Privacy Leakage from MoE Router Telemetry\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10616v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Mixture-of-Experts (MoE) language models produce routing information during inference that may be logged or exposed for monitoring, debugging, load analysis, and safety auditing.\u003c/li\u003e\n\u003cli\u003eUnlike ordinary model outputs, this telemetry reveals a view of the model\u0026rsquo;s internal computation, raising a privacy question: can it reveal whether an example was used to fine-tune the deployed model?\u003c/li\u003e\n\u003cli\u003eWe introduce a router-augmented membership inference attack that combines conventional output-side signals with aggregated routing features and applies a membership classifier learned from independently fine-tuned shadow models to the target model.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10616v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Mixture-of-Experts (MoE) language models produce routing information during inference that may be logged or exposed for monitoring, debugging, load an…\u003c/li\u003e\n\u003cli\u003eUnlike ordinary model outputs, this telemetry reveals a view of the model\u0026rsquo;s internal computation, raising a privacy question: can it reveal whether an example w…\u003c/li\u003e\n\u003cli\u003eWe introduce a router-augmented membership inference attack that combines conventional output-side signals with aggregated routing features and applies a member…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10621\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eSelf-Organization from Constrained Geometric Radiation\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10621v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: How does dynamic order emerge spontaneously in closed systems without external driving?\u003c/li\u003e\n\u003cli\u003eExisting paradigms all require external energy flows, temperature quenching, or slow driving.\u003c/li\u003e\n\u003cli\u003eHere we report constraint-induced self-organization via geometric radiation in coupled metric evolution systems.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10621v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: How does dynamic order emerge spontaneously in closed systems without external driving\u003c/li\u003e\n\u003cli\u003eExisting paradigms all require external energy flows, temperature quenching, or slow driving\u003c/li\u003e\n\u003cli\u003eHere we report constraint-induced self-organization via geometric radiation in coupled metric evolution systems\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10623\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eRecurrent Self-Improvement: Dynamic Cross-Loop On-Policy Distillation for Looped Language Models\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10623v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Looped Language Models (LoopLMs) offer a parameter efficient approach to scaling reasoning by reusing shared parameters across recurrent computation steps.\u003c/li\u003e\n\u003cli\u003eDespite their promise, effective post-training of LoopLMs remains challenging.\u003c/li\u003e\n\u003cli\u003eExisting approaches either provide reward based supervision that is sparse or costly to extend across loops, or rely on external teachers or privileged information, leading to limited teacher availability or teacher-student context mismatch.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10623v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Looped Language Models (LoopLMs) offer a parameter efficient approach to scaling reasoning by reusing shared parameters across recurrent computation s…\u003c/li\u003e\n\u003cli\u003eDespite their promise, effective post-training of LoopLMs remains challenging\u003c/li\u003e\n\u003cli\u003eExisting approaches either provide reward based supervision that is sparse or costly to extend across loops, or rely on external teachers or privileged informat…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10626\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eExact SO(3)-Equivariant Isotropic Kernels for Rotation-Robust Neural Dynamics\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10626v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Neural surrogates for vector-valued partial differential equations can fit training data yet change their predictions when the same physical state is expressed in a rotated coordinate frame.\u003c/li\u003e\n\u003cli\u003eWe study this failure on three-dimensional Navier\u0026ndash;Stokes dynamics observed at irregularly placed points.\u003c/li\u003e\n\u003cli\u003eWe introduce the Invariant-Conditioned Isotropic Kernel Neural Operator (IKNO), a compact graph model that builds local interactions from scalar quantities unchanged by rotation and vector directions that rotate with the data.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10626v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Neural surrogates for vector-valued partial differential equations can fit training data yet change their predictions when the same physical state is…\u003c/li\u003e\n\u003cli\u003eWe study this failure on three-dimensional Navier\u0026ndash;Stokes dynamics observed at irregularly placed points\u003c/li\u003e\n\u003cli\u003eWe introduce the Invariant-Conditioned Isotropic Kernel Neural Operator (IKNO), a compact graph model that builds local interactions from scalar quantities unch…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10627\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003eSample-Efficiency of Kolmogorov-Arnold Networks\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10627v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Deep reinforcement learning has achieved substantial performance gains over classical control approaches.\u003c/li\u003e\n\u003cli\u003eYet, a central challenge to learning in real-world applications is acquiring costly samples.\u003c/li\u003e\n\u003cli\u003eKolmogorov-Arnold Networks are a recently proposed architecture that can learn physical relationships in control problems effectively, with significantly higher parameter efficiency and interpretability when compared to Multi-Layer-Perceptron architectures.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10627v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Deep reinforcement learning has achieved substantial performance gains over classical control approaches\u003c/li\u003e\n\u003cli\u003eYet, a central challenge to learning in real-world applications is acquiring costly samples\u003c/li\u003e\n\u003cli\u003eKolmogorov-Arnold Networks are a recently proposed architecture that can learn physical relationships in control problems effectively, with significantly higher…\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp\u003e\u003cstrong\u003e\u003ca href=\"https://arxiv.org/abs/2610.10630\"  class=\"external-link\" target=\"_blank\" rel=\"noopener\"\u003ePhase-HDC: Replacing Optimizer History with Gradient Thresholds in Discrete Phase Learning\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e发布时间:2026-10-09 12:00 北京时间\u003c/li\u003e\n\u003cli\u003e摘要:【待翻译】- arXiv:2610.10630v1 Announce Type: new.\n\u003cul\u003e\n\u003cli\u003eAbstract: Training a compact model often needs far more memory than storing it, because the optimizer keeps its own records of past gradients.\u003c/li\u003e\n\u003cli\u003eFor a hyperdimensional classifier whose learned parameters are low-bit angles, which we call a \\emph{phase memory}, these records take several times more memory than the model itself.\u003c/li\u003e\n\u003cli\u003eWe ask whether such a model can be trained while storing nothing but the model.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eEN 要点:\n\u003cul\u003e\n\u003cli\u003earXiv:2610.10630v1 Announce Type: new\u003c/li\u003e\n\u003cli\u003eAbstract: Training a compact model often needs far more memory than storing it, because the optimizer keeps its own records of past gradients\u003c/li\u003e\n\u003cli\u003eFor a hyperdimensional classifier whose learned parameters are low-bit angles, which we call a \\emph{phase memory}, these records take several times more memory…\u003c/li\u003e\n\u003cli\u003eWe ask whether such a model can be trained while storing nothing but the model\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n",
  "wordCount": 5368,
  "readingTime": 26,
  "tableOfContents": "\u003cnav id=\"TableOfContents\"\u003e\n  \u003cul\u003e\n    \u003cli\u003e\u003ca href=\"#-本期-watch-list-深度导读\"\u003e📖 本期 Watch List 深度导读\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#-x-平台-ai-热点快讯\"\u003e🌐 X 平台 AI 热点快讯\u003c/a\u003e\n      \u003cul\u003e\n        \u003cli\u003e\u003ca href=\"#话题-1x-prepares-unified-subscription-bundling-grok-and-cursor-ai-tools\"\u003e话题 1:X Prepares Unified Subscription Bundling Grok and Cursor AI Tools\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#话题-2grok-bot-gains-real-time-x-monitoring-and-custom-email-features\"\u003e话题 2:Grok Bot Gains Real-Time X Monitoring and Custom Email Features\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#话题-3google-unveils-enterprise-gemini-agent-at-nasa-hangar-event\"\u003e话题 3:Google Unveils Enterprise Gemini Agent at NASA Hangar Event\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#话题-4joma-tech-parodies-gpt-6-dishwashing-with-math-puzzle-twist\"\u003e话题 4:Joma Tech Parodies GPT-6 Dishwashing with Math Puzzle Twist\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#话题-5austin-riders-embrace-tesla-cybercab-robotaxis-in-rain-and-night\"\u003e话题 5:Austin Riders Embrace Tesla Cybercab Robotaxis in Rain and Night\u003c/a\u003e\u003c/li\u003e\n      \u003c/ul\u003e\n    \u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#-大佬观点influencer-insights\"\u003e💡 大佬观点(Influencer Insights)\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"#-附录今日-watch-list-更新源列表\"\u003e📚 附录:今日 Watch List 更新源列表\u003c/a\u003e\n      \u003cul\u003e\n        \u003cli\u003e\u003ca href=\"#stratechery-by-ben-thompson-a_full\"\u003eStratechery by Ben Thompson (A_full)\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#openai-blog-a_full\"\u003eOpenAI Blog (A_full)\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#arxiv-csai-b_introsearch\"\u003eArXiv cs.AI (B_intro+search)\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#arxiv-cscl-b_introsearch\"\u003eArXiv cs.CL (B_intro+search)\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"#arxiv-cslg-b_introsearch\"\u003eArXiv cs.LG (B_intro+search)\u003c/a\u003e\u003c/li\u003e\n      \u003c/ul\u003e\n    \u003c/li\u003e\n  \u003c/ul\u003e\n\u003c/nav\u003e",
  "isDraft": false
}