论文

本文综述了 Islamic LLMs 与可信 Islamic AI 这一新兴领域，并论证了仅具备阿拉伯语流利度不足以支撑 Islamic AI，进而提出面向抗幻觉 Islamic AI 系统的研究议程。This survey reviews the emerging field of Islamic LLMs and trustworthy Islamic AI, and argues that fluency in Arabic is not sufficient for Islamic AI, with a research agenda for hallucination-resistant Islamic AI systems.

AsymCache 是一个面向 LLM 推理的计算-延迟感知 KV cache 管理系统，将 cache 驻留决策与 GPU attention kernel 性能显式对齐，包含三个关键组件：用于高效处理非连续 KV 上下文的多段注意力（MSA）、联合优化命中率与位置感知重计算代价的 cache 淘汰策略，以及面向高硬件利用率的自适应分片调度器。AsymCache is proposed, a computation-latency-aware KV cache management system for LLM inference that explicitly aligns cache residency decisions with GPU attention kernel performance, including three key components: Multi-Segment Attention (MSA) for efficient non-contiguous KV context processing, a cache eviction policy that jointly optimizes hit rate and position-aware recomputation cost, and an adaptive chunking scheduler for high hardware utilization.

RTP-LLM 是一个面向工业级 LLM 部署的高性能推理引擎，已在 Alibaba Group 成功部署，服务超过 1 亿用户，通过集成设计解决根本性瓶颈。RTP-LLM is presented, a high-performance inference engine for industrial-scale LLM deployment, successfully deployed across Alibaba Group serving over 100 million users, and addresses fundamental bottlenecks through integrated design.

这篇立场论文认为，LLM 推理 serving 已超越通用启发式方法，如今需要数学优化与算法基础，并呼吁社区将 LLM serving 的算法设计视为一个新的研究前沿。This position paper argues that LLM inference serving has outgrown generic heuristics and now demands mathematical optimization and algorithmic foundations, and calls on the community to recognize algorithmic design for LLM serving as a research frontier.

SwiftCache 是一个协同推理系统，使异构模型可在同一服务器内共享未充分利用的 GPU 内存与 NVLink 带宽，支持跨模型通过 NVLink 共享 KV cache，避免使用慢速 PCIe 传输。SwiftCache is a collaborative inference system that enables heterogeneous models to share underutilized GPU memory and NVLink bandwidth within a server, allowing cross-model KV cache sharing over NVLink and avoiding slow PCIe transfers.

提出 OScaR（Omni-Scaled Canalized Rotation），一个面向 X-LLMs 的精确且轻量的 KV cache 压缩框架，作为一个鲁棒、低复杂度、通用的框架确立了新的 Pareto 前沿。OScaR (Omni-Scaled Canalized Rotation), an accurate and lightweight KV cache compression framework for X-LLMs, is proposed, establishing it as a robust, low-complexity, and universal framework that defines a new Pareto front.

WAIT (Waiting for Accumulated Inference Threshold) 是一种基于阈值的准入规则，适用于已知输出长度；Nested WAIT 通过调控请求在 decode 阶段各分段间的推进方式，将该规则扩展到未知输出长度场景。WAIT (Waiting for Accumulated Inference Threshold), a threshold-based admission rule for known output lengths, and Nested WAIT, which extends the rule to unknown output lengths by regulating how requests advance across decode-stage segments are designed.

本文对近期 KV cache 优化技术进行系统综述，将其归纳为五大方向：cache eviction、cache compression、混合内存方案、新型 attention 机制与组合策略，并指出自适应多阶段优化流水线是未来研究的重要方向。This paper provides a systematic review of recent KV cache optimization techniques, organizing them into five principal directions: cache eviction, cache compression, hybrid memory solutions, novel attention mechanisms, and combination strategies, and pointing toward adaptive, multi-stage optimization pipelines as a promising direction for future research.

本文提出 AIConfigurator，一个统一的性能建模系统，能够在不依赖 GPU profiling 的前提下进行快速、与框架无关的推理配置搜索；并提供一个抽象层，自动为目标后端解析最优启动参数，无缝集成到生产级编排系统中。AIConfigurator is presented, a unified performance-modeling system that enables rapid, framework-agnostic inference configuration search without requiring GPU-based profiling, and an abstraction layer that automatically resolves optimal launch parameters for the target backend, seamlessly integrating into production-grade orchestration systems.

本文在 KV cache 约束下对 LLM 推理进行理论建模，提出一种新型批处理与调度算法，在有效管理 KV cache 内存的同时最小化推理延迟，并通过在合成数据集上与后视最优的对比展示其强劲的实证性能。This work model LLM inference with KV cache constraints theoretically and proposes a novel batching and scheduling algorithm that minimizes inference latency while effectively managing the KV cache's memory, and demonstrates the algorithm's strong empirical performance by comparing it to the hindsight optimal in a synthetic dataset.

本工作提出一种新颖的混合精度 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.

本工作借鉴线性模型的 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.

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.

本文为 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.

本文提出 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.

本文探讨了 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.

NetKV，一种使用该 oracle 信息的 O(|D|) 每请求贪心策略，其层级排序被证明对过时遥测数据具有鲁棒性；并证明随着上下文长度增长，忽略网络项会使仅缓存感知的调度任意次优。NetKV, the O(|D|) per-request greedy that consumes this oracle, has tier rankings that are provably robust to stale telemetry, and it is proved that ignoring the network term renders cache-aware-only scheduling arbitrarily suboptimal as context length grows.

本工作提出 LMCACHE，首个也是目前最高效的开源 KV 缓存方案，可将现代 LLM 引擎生成的 KV 缓存从 GPU 显存中提取并存储，并跨引擎和查询共享。This work presents LMCACHE, the first and so far the most efficient open-source KV caching solution, which extracts and stores KV caches generated by modern LLM engines out of the GPU memory and shares them across engines and queries.

描述了一种无监督学习通用分布式句子编码器的方法，利用书籍文本的连续性，训练编码器-解码器模型以重建编码段落的周围句子。The approach for unsupervised learning of a generic, distributed sentence encoder is described, using the continuity of text from books to train an encoder-decoder model that tries to reconstruct the surrounding sentences of an encoded passage.