跳到正文
Jones Ray

ScholarPulse 日报 2026-06-19

2026-06-19 学术简报:2 篇。论文提出执行状态胶囊机制,实现低延迟、小批量设备端AI服务的完整状态高效恢复。

今日速览

序号标题来源日期主题推荐等级
1Execution-State Capsules: Graph-Bound Execution-State Checkpoint and Restore for Low-Latency, Small-Batch, On-Device Physical-AI ServingarXiv2026-06-18AI-Agent高
2Efficient and Sound Probabilistic Verification for AI AgentsarXiv2026-06-18AI-Agent中

重点论文与技术动态

1. Execution-State Capsules: Graph-Bound Execution-State Checkpoint and Restore for Low-Latency, Small-Batch, On-Device Physical-AI Serving

一句话结论

论文提出执行状态胶囊机制,实现低延迟、小批量设备端AI服务的完整状态高效恢复。

一段话:针对交互式LLM代理、语音系统和机器人策略等低延迟、小批量设备端服务场景,论文引入执行状态胶囊(execution-state capsules),一种图绑定的检查点和恢复机制。该机制通过FlashRT后端运行时在GPU上实现状态快照、恢复、分叉和回滚,涵盖KV缓存、循环状态、卷积状态等完整执行边界。在RTX 5090上,胶囊恢复亚毫秒级,TTFT速度提升达27倍(16k令牌),且在Jetson AGX Thor等设备验证有效。

核心内容

方法与数据

价值判断

摘要 Mainstream LLM serving systems reuse prefix work mainly through paged or radix key-value (KV) caches. This is highly effective for high-throughput, high-concurrency serving, but it manages only one positional fragment of execution state: the KV cache. We study the opposite regime: low-latency, small-batch, on-device physical-AI serving, where interactive LLM agents, speech systems, and robot policies repeatedly branch, reset, interrupt, and re-enter under tight responsiveness budgets. We introduce execution-state capsules, a graph-bound checkpoint and restore mechanism for the complete restorable state at a committed boundary. FlashRT is a white-box, backend-facing kernel runtime whose evaluated NVIDIA CUDA backend runs captured graph plans over contiguous static buffers with no block-table indirection. Because the live state is a closed set of named buffers, a capsule can snapshot, restore, fork, or roll back the whole execution boundary, including KV, recurrent state, convolution state, MTP state, and metadata. This moves reuse from token-addressed KV fragments to graph-bound execution-state boundaries. On an RTX 5090, capsule restore is byte-exact at the stored-state level and token-identical under greedy decode. A KV-only ablation diverges, showing that recurrent state is load-bearing. GPU-resident snapshot and restore are sub-millisecond, and TTFT speedup over cold prefill grows from 3.9x at 2k tokens to 27x at 16k tokens. On Jetson AGX Thor and DGX Spark, the same correctness and structural properties hold. Capsules are not a replacement for high-throughput KV-cache serving; they define a complementary latency-first serving point for explicit execution-state reuse.

2. Efficient and Sound Probabilistic Verification for AI Agents

一句话结论

该论文提出了一种高效且安全的概率验证框架,用于AI代理在不确定环境中的安全策略执行。

核心内容

方法与数据

价值判断

摘要 Securing AI agents that operate in complex digital environments has become a critical need, and runtime monitoring approaches that formulate and enforce policies expressed in a formal language like Datalog offer a promising solution. However, existing approaches are restricted to deterministic policies. In many practical applications of AI agents, there is a need to enforce security policies in the face of ambiguity, leading to probabilistic predicates or state transitions (for example, a declassifier or Personally Identifiable Information (PII) detector that has some failure probability on each invocation). Furthermore, in many such applications, one cannot easily make the independence assumptions necessary to invoke prior work on probabilistic inference in Datalog. We address this by introducing a sound and efficient framework for such verification based on distributionally robust optimization, computing sound upper bounds on the probability of policy violation regardless of possible correlations between predicates. On standard benchmarks for terminal and tool calling agents, we demonstrate that our approach outperforms prior art and improves the security-utility trade-off while ensuring rigorous bounds on the probability of policy violation.