Papers · organized/paper_cards

论文

471 张论文卡片 · 方法 · OA 绿色

开放获取 全部 绿色 · 724
4. The End of Software Engineering(arXiv:2606.05608)
4. 软件工程的终结(arXiv:2606.05608)
arXiv:2606.05608 Agent 智能体 方法 OA · 绿色 被引 0 · S2 + OpenAlex

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

3️⃣ arXiv · Memanto: Typed Semantic Memory with Information-Theoretic Retrieval for Long-Horizon Agents(⭐⭐⭐⭐ 高优先级)
3️⃣ arXiv · Memanto:面向长程 Agent 的带类型语义记忆与信息论检索(⭐⭐⭐⭐ 高优先级)
arXiv:2604.22085 Agent 智能体 方法 OA · 绿色 被引 5 · S2

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

3️⃣ arXiv · MatryoshkaLoRA(⭐⭐⭐⭐ 值得关注)
3️⃣ arXiv · MatryoshkaLoRA(⭐⭐⭐⭐ 值得关注)
arXiv:2605.07850 工程化 方法 OA · 绿色 被引 0 · S2 + OpenAlex

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

3️⃣ Speculative Decoding 延迟可解释模型 — arXiv:2605.15051(⭐⭐⭐⭐ 调优必读)
arXiv:2605.15051 LLM 基础设施 方法 OA · 绿色 被引 0 · S2 + OpenAlex

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

3. Tutti:让 SSD 后备 KV Cache 成为长上下文生产方案
arXiv:2605.03375 LLM 基础设施 方法 OA · 绿色 被引 1 · S2

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.

3. Kubernetes for GenAI Inference(arXiv:2602.04900v2)
Kubernetes for GenAI Inference(arXiv:2602.04900v2)
arXiv:2602.04900 工程化 方法 Open MIND OA · 绿色 被引 1 · S2

这些结果表明,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.

3. Flow-Controlled Scheduling for LLM Inference(arXiv 2604.11001)
Flow-Controlled Scheduling for LLM Inference(arXiv 2604.11001)
arXiv:2604.11001 LLM 基础设施 方法 OA · 绿色 被引 0 · S2 + OpenAlex

本文提出了一种简单的 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.

2️⃣ Cats · 边缘推理的自投机级联验证 — arXiv:2605.11186(⭐⭐⭐⭐ 边缘推理重点)
arXiv:2605.11186 LLM 基础设施 方法 OA · 绿色 被引 0 · S2 + OpenAlex

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

2. 分布式向量数据库 Qdrant 在 HPC 上的性能(arXiv 2509.12384,2025-09,持续更新)
arXiv:2509.12384 数据与向量库 方法 OA · 绿色 被引 7 · S2

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

2. DualPath:打破 Agentic LLM 推理的存储带宽瓶颈
arXiv:2602.21548 LLM 基础设施 方法 Open MIND OA · 绿色 被引 13 · S2

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

1️⃣ arXiv · Learning Rate Matters: Vanilla LoRA May Suffice(⭐⭐⭐⭐⭐ 必读)
学习率至关重要:Vanilla LoRA 可能已足够
arXiv:2602.04998 评测基准 方法 Open MIND OA · 绿色 被引 8 · S2

本文通过大规模超参数搜索,系统地重新评估了 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.

13. TTKV:Temporal-Tiered KV Cache(HBM+DRAM 分层)
13. TTKV:Temporal-Tiered KV Cache(HBM+DRAM 分层)
arXiv:2604.19769 LLM 基础设施 方法 OA · 绿色 被引 1 · S2

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

12. KVP:RL 驱动 KV Cache 驱逐策略
arXiv:2602.10238 LLM 基础设施 方法 Open MIND OA · 绿色 被引 4 · S2

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

10. TritonForge: Automated Triton Kernel Optimization (arXiv 2512.09196)
10. TritonForge:自动化 Triton Kernel 优化(arXiv 2512.09196)
arXiv:2512.09196 LLM 基础设施 方法 OA · 绿色 被引 19 · S2

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.

10. Cloud Native System for LLM Inference Serving(arXiv 2507.18007)
10. 面向 LLM 推理服务的 Cloud Native 系统(arXiv 2507.18007)
arXiv:2507.18007 LLM 基础设施 方法 OA · 绿色 被引 7 · S2

本文探讨容器化、微服务、动态调度等 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.

1. vLLM Startup Latency: Six-Step Systematic Characterization
1. vLLM 启动延迟:六步式系统化表征
arXiv:2606.07362 LLM 基础设施 方法 OA · 绿色 被引 1 · S2

本文首次对 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.

1. Data Flow Control(DFC):AI Agent 数据安全策略的内核级执行框架
arXiv:2606.05679 安全与风险 方法 OA · 绿色 被引 0 · S2 + OpenAlex

本文将数据安全形式化为 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.

Systems 补充候选
arXiv:2511.02230 Agent 智能体 方法 Open MIND OA · 绿色 被引 38 · S2

Continuum,一个通过为 KV cache 保留引入 TTL 机制来优化多轮 Agent 工作负载任务完成时间的服务系统,能保持多轮连续性,并降低 Agent 工作流的延迟。Continuum, a serving system to optimize job completion time for multi-turn agent workloads by introducing time-to-live mechanism for KV cache retention, preserves multi-turn continuity, and reduces delay for agentic workflows.

Systems 补充候选
arXiv:2606.01751 RAG 检索增强 方法 OA · 绿色 被引 0 · S2 + OpenAlex

SarseX 模型无关、无需训练,并与 Prefix Cache 兼容,可为多轮对话、检索增强生成 (RAG) 和 Agent 工作流等常见在线服务场景提供统一支持。SarseX is model-agnostic, training-free, and compatible with Prefix Cache, and it provides unified support for common online serving scenarios including multi-round chat, retrieval-augmented generation (RAG), and agent workflows.

Systems 补充候选
arXiv:2606.03910 LLM 基础设施 方法 OA · 绿色 被引 1 · S2

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.

Systems 补充候选
arXiv:2510.09665 LLM 基础设施 方法 OA · 绿色 被引 124 · S2

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

Multimodal 补充候选
arXiv:2606.13578 多模态 方法 OA · 绿色 被引 1 · S2

构建了 RoboGenesis,一个基于仿真的工作流与数据引擎,可从原子技能组合配置好的实验工作流,对 rollout 进行验证与过滤,并跨支持的机器人配置导出结构化演示数据。RoboGenesis is built, a simulation-based workflow and data engine that composes configured laboratory workflows from atomic skills, validates and filters rollouts, and exports structured demonstrations across supported robot profiles.

4.2 Reliability 不等于成功率:12 指标拆出 consistency / robustness / predictability / safety
4.2 Reliability 不等于成功率:12 指标拆出 consistency / robustness / predictability / safety(⭐⭐⭐⭐⭐)
arXiv:2602.16666 安全与风险 方法 Open MIND OA · 绿色 被引 45 · S2

本工作提出 12 个具体指标,从一致性、鲁棒性、可预测性和安全性四个关键维度分解 Agent 可靠性,可与传统评估互补,并提供用于分析 Agent 表现、退化与失败方式的工具。This work proposes twelve concrete metrics that decompose agent reliability along four key dimensions: consistency, robustness, predictability, and safety, which complement traditional evaluations while offering tools for reasoning about how agents perform, degrade, and fail.

4.1 LogicalRAG:把 Agentic RAG 的重点从“更重 backend”转向“更强 retrieval control”
arXiv:2605.27123 RAG 检索增强 方法 OA · 绿色 被引 3 · S2

本文提出一个 Agentic RAG 框架,使 LLM 能够使用逻辑表达式构建检索意图,同时将检索后端简化为基于倒排索引的系统,并表明将检索过程锚定在逻辑查询上可显著降低生成响应中的幻觉。This paper proposes an agentic RAG framework that enables LLMs to formulate retrieval intents using logical expressions while simplifying the retrieval backend to an inverted-index-based system, and shows that anchoring the retrieval process in logical queries substantially reduces hallucinations in generated responses.

2.3 本轮补充公开检索
arXiv:2606.14589 Agent 智能体 方法 OA · 绿色 被引 0 · S2 + OpenAlex

本文对一个自 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.

2.3 本轮补充公开检索
arXiv:2606.14061 Agent 智能体 方法 OA · 绿色 被引 3 · S2

结果表明,纯视觉设置会降低准确率并增加 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.

MMAgent-R$^2$: Learning to Rerank and Reject for Agentic mRAG
MMAgent-R$^2$:面向 Agentic mRAG 的重排序与拒答学习
arXiv:2607.07383 RAG 检索增强 方法 OA · 绿色 被引 0 · S2 + OpenAlex

提出 MMAgent-R$^2$,一种将视觉重排序与主动拒答作为内部验证机制的 Agentic mRAG 框架,并通过 GRPO 训练实现外部检索、内部验证与答案生成的联合优化。MMAgent-R$^2$, an agentic mRAG framework that integrates visual reranking and active rejection as its internal verification mechanism, is proposed and achieves joint optimization of external retrieval, internal verification, and answer generation via GRPO training.

Interpretable Uncertainty for Adaptive Retrieval and Reasoning in Question Answering
问答中面向自适应检索与推理的可解释不确定性
arXiv:2607.07380 RAG 检索增强 方法 OA · 绿色 被引 0 · S2 + OpenAlex

提出一种基于不确定性感知框架的自适应问答方法,通过 LLM 内部表征中区分知识不足与知识歧义/冲突的显式信号,在单次前向传播中即可由隐状态高效估计。This work proposes an uncertainty-aware framework for adaptive QA based on explicit signals derived from LLM internal representations that distinguish between knowledge insufficiency and knowledge ambiguity or conflict, and efficiently estimate these from hidden states in a single forward pass.

Scaling Mixture-of-Experts Video Pretraining for Embodied Intelligence
面向具身智能的 Mixture-of-Experts 视频预训练规模化
arXiv:2607.07675 多模态 方法 OA · 绿色 被引 4 · S2

提出 LingBot-Video,一种专为具身智能设计的基于 DiT 的视频预训练范式,并将其作为首个大规模开源 MoE 视频基础模型贡献给社区,致力于在数字创意与物理执行之间搭建桥梁。LingBot-Video is presented, a DiT-based video pretraining paradigm specifically tailored for embodied intelligence, and is contributed as the inaugural large-scale, open-source MoE video foundation model to the community, in a pioneering effort to bridge digital creativity and physical actuation.

Infinite Worlds with Versatile Interactions
支持多样化交互的无限世界
arXiv:2607.07534 多模态 方法 OA · 绿色 被引 9 · S2

首次在 World Modeling 领域引入 Agentic Harness 框架:由 pilot agent 负责规划并执行角色行为,director agent 负责随着场景推进合成新的环境要素。The integration of an agentic harness within the domain of world modeling is pioneered, wherein a pilot agent is tasked with planning and executing character behaviors, while a director agent is responsible for synthesizing novel environmental elements as the scene progresses.

Dual Latent Memory in Vision-Language-Action Models for Robotic Manipulation
面向机器人操作的视觉-语言-动作模型中的双潜在记忆
arXiv:2607.07608 多模态 方法 OA · 绿色 被引 1 · S2

提出 LaMem-VLA,一种以潜在记忆为核心框架的方法,将历史经验重建为潜在记忆 token,并直接与 VLA 推理交织,使记忆能够在有界上下文下直接参与 VLA 推理并引导动作生成。LaMem-VLA is introduced, a latent-memory-native framework that reconstructs historical experience into latent memory tokens and directly interweaves them with VLA reasoning, and enables memory to directly participate in VLA reasoning and guide action generation under a bounded context.

DynaKRAG: A Unified Framework for Learnable Evidence Control in Multi-Hop Retrieval-Augmented Generation
DynaKRAG:面向多跳检索增强生成的可学习证据控制统一框架
arXiv:2607.06507 RAG 检索增强 方法 OA · 绿色 被引 0 · S2 + OpenAlex

提出 DynaKRAG,将多跳证据获取建模为针对原子证据操作的状态条件控制,并展示了在演化证据状态下协同检索、诊断与缺口定向获取的优势。DynaKRAG is introduced, which formulates multi-hop evidence acquisition as state-conditioned control over atomic evidence operations, and demonstrates the benefit of coordinating retrieval, diagnosis, and gap-directed acquisition under an evolving evidence state.

Code-Level Cost Function Generation for Spatial Image Steganography Using RAG-Enhanced Large Language Models
基于 RAG 增强 LLM 的空域图像隐写术代码级代价函数生成
arXiv:2607.05868 RAG 检索增强 方法 OA · 绿色 被引 0 · S2 + OpenAlex

提出一种新颖的进化系统,专注于利用 RAG 增强的 LLM 自动生成空域隐写的代码级代价函数;该方法在隐写安全性上一致优于现有自动设计方法,同时提高了平均代码执行率并降低了搜索成本。A novel evolutionary system focused on exploiting Retrieval-Augmented Generation enhanced LLMs for the automatic code-level generation of spatial steganography cost functions, which consistently achieves higher steganographic security than existing automatically designed methods and increases the average code execution rate while reducing the search cost.

WildCity: A Real-World City-Scale Testbed for Rendering, Simulation, and Spatial Intelligence
WildCity:面向渲染、仿真与空间智能的真实城市规模测试平台
arXiv:2607.06838 多模态 方法 OA · 绿色 被引 0 · S2 + OpenAlex

WildCity 是一个由自动驾驶车队在复杂城市环境中采集的真实多模态数据集,旨在推动城市级渲染的进展,并更广泛地推动 AI 在空间感知、记忆与推理方面达到与人类认知相当规模的能力。WildCity, a real-world multimodal dataset collected by autonomous fleets traversing complex urban environments, aims to catalyze progress not only in city-scale rendering, but more broadly in the pursuit of AI that can perceive, remember, and reason across space at a scale comparable to human cognition.

CanvasAgent: Enabling Complex Image Creation and Editing via Visual Tool Orchestration
CanvasAgent:通过视觉工具编排实现复杂图像创建与编辑
arXiv:2607.05465 Agent 智能体 方法 OA · 绿色 被引 0 · S2 + OpenAlex

提出了用于复杂图像创建与编辑的大规模多模态工具调用数据集 CanvasCraft,以及通过多轮交互学习编排异构视觉工具的工具增强多模态 Agent CanvasAgent。CanvasCraft, a large-scale multimodal tool-use dataset for complex image creation and editing, and CanvasAgent, a tool-augmented multimodal agent that learns to orchestrate heterogeneous visual tools through multi-turn interaction are introduced.

KVpop -- Key-Value Cache Compression with Predictive Online Pruning
KVpop——基于预测性在线剪枝的键值缓存压缩
arXiv:2607.05061 LLM 基础设施 方法 OA · 绿色 被引 0 · S2 + OpenAlex

提出 KVpop,通过直接监督保留或丢弃决策来学习固定预算的 KV 淘汰策略,并引入基于延迟记忆的打分器,在已学习的淘汰方法中独有地延迟固定步数的打分,以利用近期上下文。KVpop is introduced, which learns a fixed-budget KV eviction policy by directly supervising the keep-or-drop decision, and introduces a delayed memory-based scorer that, uniquely among learned eviction methods, defers scoring for a fixed number of steps to exploit near-future context.