跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-08 15:33 · 全站最近入库:2026-11-08 06:02各信源进度 →

统计口径与数据新鲜度

统计 2026-11-07 15:33 — 2026-11-08 15:33(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-08 15:33最近发现新增版本:2026-11-08 06:02库内论文最新更新时间:2026-11-06 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

17,100 已收录论文14,661 AI 相关4,057 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-08 15:31(北京时间)
新论文 · v1arXiv:2611.07542

FlashOffloading: Low-Latency KV Cache Offloading for Long-Context LLM Serving

Xuan Wang, Zhuanhao Wu, Tingzhu Fang, Xushi Li, Sicheng Zhang, Zhenyu Yang, Feng Liu, Zhaohui Fan 等 20 位作者

原文摘要

In large language model (LLM) serving systems, the key-value (KV) cache grows linearly with sequence length and concurrency, so long-context inference easily hits the high-bandwidth memory (HBM) capacity wall and results in low concurrency. Offloading the KV cache to host dynamic random-access memory (DRAM) frees HBM space and raises concurrency, but the additional cache management and host-to-device (H2D) load overhead inflates inference latency, higher concurrency fails to translate into effective throughput. We present FlashOffloading, a host-DRAM-centric inference architecture that fully offloads the KV cache in both the prefill and decode phases. FlashOffloading builds rolling HBM cache for prefill, a hot cache for decode, a reverse sparse index with zero extra miss-lookup overhead, and a compute--load overlapped kernel, optimizing KV offloading latency across the entire pipeline and delivering throughput gains under a time-per-output-token (TPOT) service-level objective (SLO). In experiments deploying GLM-5.2 with multi-token prediction (MTP3) speculative decoding on an Ascend910C prefill--decode (PD)-disaggregated platform, FlashOffloading improves prefill throughput by up to 1.38\(\times\) and decode throughput by up to 1.91\(\times\) under a 30 ms TPOT constraint. FlashOffloading is integrated into an open-source serving framework: https://github.com/vllm-project/vllm-ascend/tree/releases/v0.30.0.

cs.AI

新论文 · v1arXiv:2611.06458

Generative Learning on Dynamic Text-Attributed Graphs

Zhenyu Yang, Yuhong Chen, Binli Luo, Xiaodong Li, Xiaolin Hu, Hui Li, Jintang Li

原文摘要

Dynamic text-attributed graphs capture evolving interactions among entities with rich textual information, but future-link prediction remains difficult when nodes have little interaction history or appear as new targets. We propose \method, a generative framework that represents nodes with compact semantic identifiers (SIDs) learned from text and autoregressively predicts a target SID conditioned on the source SID, recent interaction events, and relative time gaps. A lightweight structural calibration further incorporates repetition, co-occurrence, and popularity. At inference time, \method encodes each query context once and reuses SID likelihoods to rank prescribed candidates, providing a candidate-efficient prediction interface. Experiments on nine datasets show broadly competitive performance across domains and graph densities. Source-side inductive evaluations demonstrate that text-derived SIDs provide a useful representation when a test source has no observed interaction history, while two recommendation-oriented case studies evaluate controlled new-user adaptation and first-arrival ranking for inductive new items. Further analyses characterize SID uniqueness, capacity, and temporal stability. Overall, the results support combining text-derived SIDs with temporal histories for dynamic link prediction.

cs.SI

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.278ACL Anthology · ACL 2026

MobileWorld: Benchmarking Autonomous Mobile Agents in Agent-User Interactive and MCP-Augmented Environments

Quyu Kong Alibaba Group, Xu Zhang Alibaba Group, Zhenyu Yang The Hong Kong University of Science and Technology, Nolan Gao, Chen Liu The University of Queensland, Panrong Tong Alibaba Cloud, Chenglin Cai Alibaba Group, Hanzhang Zhou 等 13 位作者

原文摘要

While AndroidWorld has become the dominant mobile-use benchmark due to its reproducible environment and deterministic evaluation, recent agents achieving over 90% success rates indicate saturation and motivate the need for greater challenge. In addition, its environment lacks key application categories, such as e-commerce and enterprise communication, and does not reflect realistic mobile-use scenarios characterized by vague user instructions and hybrid tool usage. We introduce MobileWorld, a substantially more challenging benchmark with 201 tasks across 20 applications that reflects real-world usage through long-horizon, cross-application workflows requiring nearly twice as many steps (27.8 vs. 14.3) and featuring significantly more multi-app tasks (62.2% vs. 9.5%) than AndroidWorld. MobileWorld balances production-grade utility and reproducible evaluation using open-source alternatives to industry standards (e.g., Mattermost for Slack), enabling full observability through source code modification and direct database access. Beyond standard GUI manipulation, MobileWorld introduces novel task categories including agent-user interaction and Model Context Protocol (MCP)-augmented tasks for evaluating agents in user-aware, hybrid-tool scenarios. We develop a planner-executor framework with extended action spaces supporting user interactions and MCP calls. Results show a sharp performance drop from AndroidWorld, with the best agentic framework and end-to-end model achieving 51.7% and 20.9% success rates, respectively, highlighting substantial room for future research.

cs.CL · cs.AI

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表