论文

本工作开发了一个 SOTA 的 paged attention kernel，完全基于领域特定即时编译语言 Triton 构建，在 NVIDIA 与 AMD GPU 上均达到 SOTA 性能。This work develops a state-of-the-art paged attention kernel that builds exclusively on the domain-specific just-in-time compiled language Triton to achieve state-of-the-art performance on both NVIDIA and AMD GPUs.

本工作提出一种新颖的混合精度 PTQ 策略，直接最小化整个模型的全局误差传播，而非孤立地处理逐层误差，并开发了一种新颖的联合优化方法，在统一搜索空间中同时学习结构化剪枝决策与混合精度量化策略。This work proposes a novel mixed-precision PTQ strategy that directly minimizes global error propagation across the entire model, rather than isolating layer-wise errors, and develops a novel joint optimization approach that simultaneously learns structural pruning decisions and mixed-precision quantization policies within a unified search space.

本工作提出 QBugLM，一个多 Agent 框架，可自动化量子软件调试流水线，覆盖基于分类法的缺陷注入、基于 LLM 的检测与修复，直至基于仿真的验证，框架无关地支持 OpenQASM 3.0 程序。This work proposes QBugLM, a multi-agent framework that automates the quantum software debugging pipeline, from taxonomy-driven bug injection to LLM-based detection and repair, and finally to simulation-based validation, for framework-agnostic OpenQASM 3.0 programs.

PLENA 是一个软硬件协同设计的系统，采用三条核心优化路径，具备新颖的扁平化 systolic-array 架构以及支持非对称量化方案的高效计算与存储单元（路径 2）。PLENA is a hardware-software codesigned system that applies three core optimization pathways that features a novel flattened systolic-array architecture and efficient compute and memory units that support an asymmetric quantization scheme (Pathway 2).

本工作将 embedding 缩放作为正交于稀疏度缩放的强有力维度加以探索，并推出 LongCat-Flash-Lite，一个从零训练的 68.5B 参数、约 30 亿激活参数的模型，不仅超越参数等量级的 MoE 基线，还对同规模现有模型展现出卓越竞争力。This work explores embedding scaling as a potent, orthogonal dimension for scaling sparsity and introduces LongCat-Flash-Lite, a 68.5B parameter model with ~3B activated trained from scratch that not only surpasses parameter-equivalent MoE baselines but also exhibits exceptional competitiveness against existing models of comparable scale.

ViT-5 的设计与当代基础模型实践保持一致，可作为对 vanilla ViT 的直接替换升级方案，适用于 2020 年代中期的视觉骨干网络，并为生成建模提供更强大的骨干。With a design aligned with contemporary foundation-model practices, ViT-5 offers a simple drop-in upgrade over vanilla ViT for mid-2020s vision backbones and serves as a stronger backbone for generative modeling.

GLM-5 在真实编码任务中展现出前所未有的能力，在端到端软件工程挑战的处理上超越既有基线，并提出了新颖的异步 Agent RL 算法，进一步提升了 RL 质量。GLM-5 demonstrates unprecedented capability in real-world coding tasks, surpassing previous baselines in handling end-to-end software engineering challenges and proposing novel asynchronous agent RL algorithms that further improve RL quality.

本工作借鉴线性模型的 state space model（SSM）视角，提出三项核心方法改进并组合形成更具表达力的递推结构：源自 SSM 离散化的递推式、用于更丰富状态追踪的复数值状态更新规则，以及在不增加 decode 延迟前提下提升模型性能的多输入多输出（MIMO）建模。This work introduces three core methodological improvements inspired by the state space model (SSM) viewpoint of linear models that combine to form a more expressive recurrence derived from SSM discretization, a complex-valued state update rule that enables richer state tracking, and a multi-input, multi-output (MIMO) formulation for better model performance without increasing decode latency.

Nemotron 3 Super 是 Nemotron 3 系列中首个采用 NVFP4 进行预训练的模型，借助 LatentMoE（一种同时优化精度 per FLOP 与精度 per parameter 的新型 Mixture-of-Experts 架构），并集成 MTP 层以通过原生 speculative decoding 加速推理。Nemotron 3 Super is the first model in the Nemotron 3 family to be pre-trained in NVFP4, leverage LatentMoE, a new Mixture-of-Experts architecture that optimizes for both accuracy per FLOP and accuracy per parameter, and include MTP layers for inference acceleration through native speculative decoding.

基于实证对 "Enhanced" 与 "Agentic" RAG 范式进行评估，为真实场景中选取最有效的 RAG 设计（兼顾性能与成本）提供指导。An empirically driven evaluation of the "Enhanced" and "Agentic" RAG paradigms is conducted, offering guidance on selecting the most effective RAG design for real-world applications, considering both performance and costs.

本教程综合了推动这些汇聚方向的算法、系统与设计原则，为数据科学与数据挖掘研究者提供统一视角，涵盖将 LLM、图数据管理、图挖掘、图 ML 与 agentic 计算融合到下一代 graph-native AI 系统中。This tutorial synthesizes the algorithms, systems, and design principles driving these converging directions, offering data science and data mining researchers a unified perspective on integrating LLMs, graph data management, graph mining, graph ML, and agentic computation into next-generation graph-native AI systems.

本文提出一种分层隔离架构，结合策略感知的 ingestion、retrieval-time gating 与共享推理，并通过服务端 agentic 编排加以执行，在为多租户隔离提供天然强制点的同时，允许客户端框架保留对 agent 组合与延迟敏感操作的控制权。A layered isolation architecture combining policy-aware ingestion, retrieval-time gating, and shared inference, enforced through server-side agentic orchestration is introduced, creating natural enforcement points for multitenant isolation while allowing client-side frameworks to retain control over agent composition and latency-sensitive operations.

Tangram 是一种 serving 框架，将先前系统动态处理的内容静态解析，可作为现有 non-uniform 压缩方法的即插即用底座，在匹配其精度的同时，端到端吞吐量较 full-KV 基线最高提升 2.6×。Tangram is a serving framework that statically resolves what prior systems handle dynamically, and serves as a drop-in substrate for existing non-uniform compression methods, matching their accuracy while improving end-to-end throughput by up to $2.6\times over the full-KV baseline.

本文认为，AI agent——即以大语言模型作为主要推理引擎、动态生成与丢弃代码作为工具性资源的系统——的出现构成了对"软件"本身的根本性重构，而非渐进式的工具改进。This paper argues that the emergence of AI agents -- systems where large language models serve as the primary reasoning engine, dynamically generating and discarding code as an instrumental resource -- constitutes a fundamental restructuring of what software is, not an incremental tool improvement.

本文提出 Memanto，一种面向 agentic 人工智能的通用记忆层，挑战了"必须依赖知识图谱复杂度才能实现高保真 agent 记忆"的普遍假设，并取得 SOTA 准确率。Memanto is introduced, a universal memory layer for agentic artificial intelligence that challenges the prevailing assumption that knowledge graph complexity is necessary to achieve high fidelity agent memory and achieves state of the art accuracy scores.

本文提出通过让 evaluator 与解决方案协同进化来自动化 evaluator 的设计，并证明突破 evaluation 瓶颈可释放 ADRS 的潜力，为下一代数据系统生成高度优化、可部署的代码。This work proposes automating the design of evaluators by co-evolving them with the solutions, demonstrating that addressing the evaluation bottleneck unlocks the potential of ADRS to generate highly optimized, deployable code for next-generation data systems.

本文为 LLM serving 中的 SD（投机解码）提出了一种简单且可解释的 latency 模型，能够准确刻画实际观测到的 latency，解释为何加速比常随服务器负载上升而下降，并系统刻画了 draft length、acceptance rate 以及 verifier 与 drafter 规模在不同 serving 条件下对 latency 的影响。A simple and interpretable latency model for SD in LLM serving is developed that accurately describes observed latency, explains why speedups often diminish as server load increases, and characterizes how draft length, acceptance rate, and verifier-drafter size shape latency across serving conditions are characterized.

Tutti 是一种高效的 SSD-backed KV caching 方案，将 CPU 从 HBM 与 SSD 之间的关键数据与 I/O 控制路径中彻底移除，在提供近乎无限容量的同时，实现了与 DRAM-backed LMCache 几乎相当的 inference 性能。Tutti is an efficient SSD-backed KV caching solution that eliminates CPU intervention from the critical data and I/O control paths between HBM and SSDs, and achieves nearly the same inference performance as DRAM-backed LMCache, while providing almost infinite capacity.

这些结果表明，Kueue、DAS 与 GAIE 等互补组件构成了一个高性能的协同平台，证明了 Kubernetes 能够作为承载高要求 GenAI 工作负载的统一底座。These findings illustrate that these complementary components (Kueue, DAS, and GAIE) form a cohesive, high-performance platform, proving Kubernetes' capability to serve as a unified foundation for demanding GenAI workloads.

本文提出了一种简单的 flow-control 框架，通过控制 prompt 加入 LLM 活跃集合的速率，实现更高的 token 与 request 吞吐量、更低的平均与尾部 latency，以及更稳定的 KV cache 利用率。A simple flow-control framework is proposed that controls the rate at which prompts join the active set in large language models and achieves higher token and request throughput, lower average and tail latency, and more stable KV cache utilization.

本文提出了 SeedRG，一个用于缓解 knowledge leakage 并应对 benchmark aging 问题的半合成 benchmark 生成 pipeline。SeedRG is introduced, a semi-synthetic benchmark generation pipeline that mitigates knowledge leakage and addresses the issue of benchmark aging.

本文聚焦 LLM 驱动的 kernel generation 领域，给出现有方法的结构化综述，涵盖 LLM-based 方法与 agentic optimization workflow，并系统梳理了支撑该领域学习与评测的数据集与 benchmark。This survey addresses the gap in LLM-driven kernel generation by providing a structured overview of existing approaches, spanning LLM-based approaches and agentic optimization workflows, and systematically organizing the datasets and benchmarks that underpin learning and evaluation in this domain.

本文提出 CATS，一种 self-speculative decoding 框架，在内存受限设备上结合 memory budget 与 parameter offloading pattern 进行级联式 verify 与 correction，在设备峰值显存与单独运行 target model 相当的前提下，最大化 token acceptance rate 与端到端加速比。CATS, a self-speculative decoding framework that conducts cascaded verification and correction based on the memory budget and parameter offloading patterns on memory-limited devices, is proposed, which maximizes token acceptance rate and end-to-end speedup while keeping the peak memory footprint on the device equal to that of the target model alone.

本文探讨 multi-agent system，并指出当前尚未被充分解决的问题，同时探索了 multi-agent system 在区块链系统中的潜在应用，为其在真实分布式系统中的未来发展与落地提供启示。This paper explores multi-agent systems and identifies challenges that remain inadequately addressed, and explores potential applications of multi-agent systems in blockchain systems to shed light on their future development and application in real-world distributed systems.

本文在 Argonne Leadership Computing Facility 的 Polaris 超级计算机上对分布式向量数据库性能进行了实证研究，选取 Qdrant 评估在最多 32 个 worker 下的插入、索引构建与 query latency。This work presents an empirical study of distributed vector database performance on the Polaris supercomputer in the Argonne Leadership Computing Facility, and selects Qdrant to evaluate insertion, index construction, and query latency with up to 32 workers.

本文提出一个无偏的多进程 evaluation 框架，能够有效分散 client 端负载，从而在每秒数千次 query 以上的生产规模下实现对 LLM 的精确、可复现 profiling。This work proposes an unbiased, multi-process evaluation framework that effectively distributes client-side load, enabling accurate, reproducible profiling of LLMs at production scales exceeding thousands of queries per second.

本文提出 DualPath，一种 inference 系统，通过引入 dual-path KV-Cache loading 打破瓶颈，并实现一条新的 storage-to-decode 路径：KV-Cache 先加载到 decode engine，再通过 compute network 上的 RDMA 高效转发至 prefill engine。DualPath is presented, an inference system that breaks this bottleneck by introducing dual-path KV-Cache loading and enables a novel storage-to-decode path, in which the KV-Cache is loaded into decoding engines and then efficiently transferred to prefill engines via RDMA over the compute network.

本文探讨了 cloud platform 与 distributed system 在支撑 LLM 可扩展性、效率与优化方面的作用，涵盖数据管理、资源优化，以及对 microservices、autoscaling 与 hybrid cloud-edge 方案的需求。The role of cloud platforms and distributed systems in supporting the scalability, efficiency, and optimization of LLMs is explored, including data management, resource optimization, and the need for microservices, autoscaling, and hybrid cloud-edge solutions.

本文提出 RAGCap-Bench，一个面向能力的 benchmark，用于对 agentic RAG workflow 中的中间任务进行细粒度评测，并构建了典型 LLM 错误的分类体系以设计针对性评测问题。This work proposes RAGCap-Bench, a capability-oriented benchmark for fine-grained evaluation of intermediate tasks in agentic RAG workflows, and constructs a taxonomy of typical LLM errors to design targeted evaluation questions.

本文系统梳理了基于 LLM 的现代智能体中记忆的设计、实现与评估方法，覆盖 2022 年至 2026 年初的相关工作，并将 Agent 记忆形式化为一个涵盖时间范围、表示基底与控制策略的三维分类体系。This survey offers a structured account of how memory is designed, implemented, and evaluated in modern LLM-based agents, covering work from 2022 through early 2026, and formalizes agent memory as a three-dimensional taxonomy spanning temporal scope, representational substrate, and control policy.

本文探讨 Paxos 与 Raft 何者更优地解决分布式共识问题，通过以 Raft 的术语与实用抽象描述一个简化的 Paxos 算法，精确揭示两者的差异。This paper considers the question of which algorithm, Paxos or Raft, is the better solution to distributed consensus to determine exactly how they differ by describing a simplified Paxos algorithm using Raft's terminology and pragmatic abstractions.

本文提出 TTKV，一种 KV cache 管理框架，将人类记忆系统映射到具备异构容量与精度的 KV cache 上，在 128K 上下文任务上将跨层流量降低 5.94 倍。TTKV is proposed, a KV cache management framework that maps the human memory system onto the KV cache with heterogeneous capacity and precision, and reduces cross-tier traffic by 5.94x on 128K-context tasks.

本文将 Agentic 检索-生成循环形式化为有限时域部分可观测马尔可夫决策过程，显式建模其控制策略与状态转移，并构建了全面的分类体系与模块化架构分解，按规划机制、检索编排、记忆范式与工具调用行为对系统进行分类。This paper formalizes agentic retrieval-generation loops as finite-horizon partially observable Markov decision processes, explicitly modeling their control policies and state transitions, and develops a comprehensive taxonomy and modular architectural decomposition that categorizes systems by their planning mechanisms, retrieval orchestration, memory paradigms, and tool-invocation behaviors.

本文提出 KV Policy (KVP)，一种仅基于 key 与 value 向量、在预计算生成轨迹上训练的轻量级 per-head RL Agent 框架，证明学习预测未来 token 效用是自适应 KV cache 管理中强大且可扩展的范式。KV Policy (KVP), a framework of lightweight per-head RL agents trained on pre-computed generation traces using only key and value vectors, is introduced, demonstrating that learning to predict future token utility is a powerful and scalable paradigm for adaptive KV cache management.

本文提出 AgenticRAGTracer，这是首个主要由大语言模型自动构建、专为支持逐步验证而设计的 Agentic RAG 基准。AgenticRAGTracer is introduced, the first Agentic RAG benchmark that is primarily constructed automatically by large language models and designed to support step-by-step validation, and is primarily constructed automatically by large language models and designed to support step-by-step validation.