论文

本文提出FROAV（Framework for RAG Observation and Agent Verification），一个通过提供即插即用架构——结合可视化工作流编排、综合性评估框架与可扩展Python集成——来降低LLM Agent研究门槛的开源研究平台。FROAV (Framework for RAG Observation and Agent Verification), an open-source research platform that democratizes LLM agent research by providing a plug-and-play architecture combining visual workflow orchestration, a comprehensive evaluation framework, and extensible Python integration, is presented.

本文分析了六个公共注册表中共计67,057个服务器，识别出可导致服务器劫持与调用操控的普遍隐患，并实现了MCPInspect——一款集成前分析工具，可检测误导性的工具元数据与可利用的代码漏洞。This paper analyzes 67,057 servers across six public registries and identifies widespread conditions enabling server hijacking and invocation manipulation, and implements MCPInspect, a pre-integration analysis tool that detects misleading tool metadata and exploitable code vulnerabilities.

性能评估显示，新训练的深度 CNN 模型 SentiBank 2.0（即 DeepSentiBank）在标注准确率与检索性能上较此前主要采用二分类 SVM 的版本有显著提升。Performance evaluation shows the newly trained deep CNNs model SentiBank 2.0 (or called DeepSentiBank) is significantly improved in both annotation accuracy and retrieval performance, compared to its predecessors which mainly use binary SVM classification models.

本文提出TSseek，一个面向分布式时间序列数据集的正则表达式驱动搜索框架，并论证传统近似技术及其索引结构因无法作用于正则表达式查询构造而不适用于此类查询。This work proposes TSseek, a regular-expression-powered search framework for distributed time series datasets, and shows that conventional approximation techniques and their index structures are ill-suited for such queries because they cannot operate on regular-expression query constructs.

本文提出Larch，一个用于优化AI SQL查询中语义过滤器执行的框架，并给出其两种变体：Larch-A2C与Larch-Sel，二者在token使用量上均始终优于现有语义过滤器优化技术。This paper introduces Larch, a framework for optimizing the execution of semantic filters in AI SQL queries and presents two Larch variants: Larch-A2C and Larch-Sel, which always outperform existing semantic filter optimization techniques in terms of token usage.

实验表明，DataEvolver 显著提升了数据质量，相比在原始数据上训练，下游 LLM 性能平均提升 10%，凸显了 LLM 与数据迭代协同演化的新机遇。Experiments show that DataEvolver substantially improves data quality and achieves an average 10\% gain in downstream LLM performance compared with training on original data, highlighting new opportunities for the iterative co-evolution of LLMs and data.

Bespoke-Card 在传统通用估计器与学习型估计器架构之外开辟了一条新的基数估计路径，它是一个 Agent 驱动的系统，将面向特定工作负载的基数估计器合成为可执行代码。Bespoke-Card is opening a new avenue for cardinality estimation next to classical generic estimators and learned estimator architectures, an agent-driven system that synthesizes workload-specific cardinality estimators as executable code.

提出 TRUSTMARGIN，一种免训练、即插即用的仲裁层，利用模型自身的似然对两个候选进行打分，在不微调、无需外部评判或额外生成的情况下，在直接回答与 RAG 之间进行选择。TRUSTMARGIN is proposed, a training-free, plug-and-play arbitration layer that scores the two existing candidates with the model's own likelihoods and selects between Direct and RAG without fine-tuning, external judges, or additional generation.

本工作开发了一个 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).

本教程综合了推动这些汇聚方向的算法、系统与设计原则，为数据科学与数据挖掘研究者提供统一视角，涵盖将 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.

本文提出 LoRAFusion，一种面向 LLM 的高效 LoRA 微调系统，可消除不必要的内存访问，在不付出重算或同步代价的前提下保持 compute-bound GEMM 的性能，并引入面向多任务微调的自适应批处理算法。LoRAFusion is introduced, an efficient LoRA fine-tuning system for LLMs that eliminates unnecessary memory accesses and preserves the performance of compute-bound GEMMs without incurring the cost of recomputation or synchronization and introduces an adaptive batching algorithm for multi-job fine-tuning.

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

本文提出 MatryoshkaLoRA，一种受 Matryoshka 启发、面向 LoRA 的通用训练框架，通过在已有 LoRA adapter 之间插入一个固定的、经精心设计的对角矩阵来按比例缩放其子秩，从而学习到准确的层次化低秩表示。MatryoshkaLoRA is proposed, a general, Matryoshka-inspired training framework for LoRA that learns accurate hierarchical low-rank representations by inserting a fixed, carefully crafted diagonal matrix between the existing LoRA adapters to scale their sub-ranks accordingly.

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.

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

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

本文通过大规模超参数搜索，系统地重新评估了 Vanilla LoRA 以及九个代表性 LoRA 变体，发现不同 LoRA 方法偏好的学习率区间各异，并将最优学习率区间的差异归因于最大 Hessian 特征值的变化，与经典学习理论相吻合。This work systematically re-evaluate nine representative LoRA variants alongside vanilla LoRA through extensive hyperparameter searches, finding that different LoRA methods favor distinct learning rate ranges and attributes the differing optimal learning rate ranges to variations in the largest Hessian eigenvalue, aligning with classical learning theories.

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

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

TritonForge 是一个面向自动化 Triton kernel 优化的 profiling 引导框架，融合 kernel 分析、运行时 profiling 与迭代式代码转换以简化优化流程，并为自动化 GPU 性能优化领域的未来研究奠定基础。TritonForge, a profiling-guided framework for automated Triton kernel optimization that integrates kernel analysis, runtime profiling, and iterative code transformation to streamline the optimization process and provides a foundation for future research in automated GPU performance optimization.

本文探讨容器化、微服务、动态调度等 Cloud Native 技术如何从根本上提升 LLM 推理服务，并展示 Cloud Native 系统在高需求场景下实现更高效资源分配、降低延迟与提升吞吐的能力。This article explores how Cloud Native technologies, such as containerization, microservices, and dynamic scheduling, can fundamentally improve LLM inference serving and demonstrates how a Cloud Native system enables more efficient resource allocation, reduces latency, and enhances throughput in high-demand scenarios.

本文首次对 vLLM 启动延迟进行了详细的性能表征，并构建了一个轻量级分析模型，能够针对给定硬件配置准确预测 vLLM 的启动延迟，为大规模推理环境中的资源规划提供了可操作的指导。This paper presents the first detailed performance characterization of vLLM startup latency and develops a lightweight analytical model that accurately predicts vLLM's startup latency for a given hardware configuration, providing actionable guidance for resource planning in large-scale inference environments.

本文将数据安全形式化为 provenance monomials 上的聚合谓词，并提出 Passant——一个无需物化 provenance 即可强制执行 DFC 策略的可移植查询重写层。This paper formalizes data safety as aggregate predicates over provenance monomials and presents Passant, a portable query rewriting layer that enforces DFC policies without materializing provenance.

本文对一个自 2026 年 3 月起持续运行的个人助理 Agent 运行时中的静默失败进行纵向研究，该系统包含约 40 个定时任务、8 个 LLM 提供商、一个工具治理代理以及一个知识库记忆层，由 4,286 个单元测试和 827 项治理检查守护。A longitudinal study of silent failures in a personal-assistant agent runtime in continuous production since March 2026, with roughly 40 scheduled jobs, 8 LLM providers, a tool-governance proxy, and a knowledge-base memory plane, defended by 4,286 unit tests and 827 governance checks is presented.

结果表明，纯视觉设置会降低准确率并增加 token 成本，因为 Agent 缺乏足够的符号化细节，需通过重复的视觉查询进行补偿；研究指向一种面向下一代编码 Agent 的实用文本与视觉混合设计。The results show that a strictly vision-only setup degrades accuracy and increases token cost, because agents lack sufficient symbolic detail and compensate with repeated visual queries, and point to a practical hybrid text-and-vision design for next-generation coding agents.

本文在使用 SOTA CNN 的情况下，实现了 16–24 倍的网络压缩，仅带来 1% 的分类准确率损失，并发现针对存储开销最大的全连接层进行压缩时，向量量化方法相比现有矩阵分解方法具有明显优势。This paper is able to achieve 16-24 times compression of the network with only 1% loss of classification accuracy using the state-of-the-art CNN, and finds in terms of compressing the most storage demanding dense connected layers, vector quantization methods have a clear gain over existing matrix factorization methods.

本文提出通过熵正则化对 Wasserstein 距离进行平滑处理，由此得到一个严格凸的目标函数，其梯度可借助矩阵缩放算法以显著更低的计算代价求得。The Wasserstein distance is proposed to be smoothed with an entropic regularizer and recover in doing so a strictly convex objective whose gradients can be computed for a considerably cheaper computational cost using matrix scaling algorithms.

所提出的通用度量空间搜索索引显著优于此前开源的 SOTA 纯向量方法，且该算法与 skip list 结构的相似性便于直接实现均衡的分布式部署。The proposed general metric space search index is able to strongly outperform previous opensource state-of-the-art vector-only approaches and similarity of the algorithm to the skip list structure allows straightforward balanced distributed implementation.

提出一个模型，基于图像区域上的 CNN、句子上的双向 RNN 以及通过多模态嵌入对齐两种模态的结构化目标，生成图像及其区域的自然语言描述。A model that generates natural language descriptions of images and their regions based on a novel combination of Convolutional Neural Networks over image regions, bidirectional Recurrent Neural Networks over sentences, and a structured objective that aligns the two modalities through a multimodal embedding is presented.

提出 Manhattan NMF（MahNMF），通过最小化 $X$ 与 $W^T H$ 之间的 Manhattan 距离建模重尾 Laplacian 噪声，并以迭代方式提升 MahNMF 及其扩展的近似精度。Manhattan NMF (MahNMF) is presented which minimizes the Manhattan distance between $X and $W^T H$ for modeling the heavy tailed Laplacian noise and improves the approximation accuracy iteratively for both MahNMF and its extensions.