跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

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

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 20:16 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-19 20:16最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

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

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

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

找到 7 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 20:10(北京时间)
新论文 · v1arXiv:2611.24079

APS: Adaptive Partitioning-Based Frame Selection for Long Video Understanding

Junxiang Wen, Yinxi Zhao, Jiawei Chen, Jingying Hu, Lijun Wang, Zhen Qin, Shuiguang Deng

原文摘要

Recent advances in large vision-language models (LVLMs) have significantly improved video understanding capabilities, yet processing long videos remains challenging due to the substantial computational cost of extensive visual inputs. Frame selection offers an efficient alternative, but many existing region-based methods rely on fixed or predefined temporal partitions, which may result in suboptimal temporal regions, compromising subsequent budget allocation and frame selection. In this work, we propose Adaptive Partitioning-Based Frame Selection (APS), a training-free framework that adapts temporal partitions to local variations in query-frame relevance. Specifically, APS formulates temporal partitioning as a complexity-regularized fitting problem, jointly optimizing partition boundaries and local models through dynamic programming. The resulting adaptive temporal partitions guide frame budget allocation based on query relevance and temporal extent, enabling informative frame selection under limited visual budgets. Extensive experiments on Video-MME, MLVU, and LongVideoBench demonstrate that APS consistently improves performance across diverse LVLM backbones, achieving the highest average gains over uniform sampling among competing methods. Further analyses validate the effectiveness of adaptive partitioning and demonstrate its generalizability across model scales, similarity encoders, and advanced LVLMs.

cs.CV · cs.AI

版本更新 · v2arXiv:2606.12563

Arbor: How Search Policy Shapes Agent Behavior in System Optimization

Neha Prakriya, Chaojun Hou, Zheng Gong, Huasha Zhao, Yanyuan Qin, Chris Cai, Xi Zhao, Zhenyu Gu 等 9 位作者

原文摘要

Achieving peak performance on modern accelerators requires coordinated optimization across kernels, operator fusion, KV-cache management, quantization, scheduling, and communication overlap, a process that demands weeks of expert effort per model and hardware platform. We present Arbor, a system that gives autonomous agents an explicit optimization tree to reason over, backtrack through, and deepen with experience, with pluggable search policies, scored bandit traversal, parallel agent swarms, and depth-first sweep, sharing a common harness of containerized isolation, automatic rollback, and end-to-end validation. Arbor generalizes across domains: +40% to +193% on six production inference models across two GPU generations, +42.8% on LLM training, and +41% on recommendation training, where agents autonomously wrote kernel-level and framework-level optimizations spanning thousands of lines of code. In controlled ablations where every search policy receives the same agent, tree, and tools, we find that search structure shapes both the magnitude and the nature of the optimizations. The bandit achieves +30.1% through targeted framework fixes, the sweep +26.4% through deep kernel rewrites, and the swarm +33.4% by compounding independent changes. An agent-driven loop that receives the same harness, tools, and information, but selects its own targets reaches +14%, writing 4x more code per percentage point of improvement than Arbor's structured search policies. We additionally introduce an evaluation framework for autonomous loop-based agents spanning efficiency, grounding, robustness, and depth, designed to characterize agent search behavior across long-running optimization campaigns.

cs.AI

新论文 · v1arXiv:2611.22418

CutAgent: Creative-Gene-Driven Planning and Experience-Guided Self-Refinement for High-CTR E-commerce Advertising Video Creation

Xuyue Huang, Guanbo Huang, Jiasong Feng, Run Ling, Ao Ma, Xi Zhao, Yaoyu Li, Jie Gao 等 13 位作者

原文摘要

E-commerce advertising video creation requires both high-level creative planning and reliable multi-modal production. However, existing methods often map product attributes directly to scripts or editing decisions without explicitly modeling advertising strategies, narrative structures, and production styles. They also have limited ability to reuse past production failures. To address these limitations, we propose $\textbf{CutAgent}$, a dual-agent framework that formulates advertising video creation as a Plan--Execute--Self-Evolve process. CutAgent comprises two collaborative agents, $\textbf{GeneAgent}$ and $\textbf{VideoAgent}$, connected by a structured creative gene that bridges product understanding and video production. GeneAgent maps multi-modal product inputs---textual attributes together with product images---to creative genes that specify narrative units and production rules. To train GeneAgent, we construct $\textbf{CutAgent-70K}$ with approximately 70K samples of product attributes/images, reverse-extracted creative genes, cleaned clip pools, and real-world CTR, and apply high-CTR supervised fine-tuning followed by CTR-guided GRPO. Guided by the generated gene, VideoAgent retrieves category-then-gene failure--correction experiences from a long-term memory as constraints for shot-script planning, then coordinates material retrieval, narration, subtitles, music, and timeline rendering. Independently, a reflection loop diagnoses quality defects, revises deficient production decisions, and writes verified corrections back to memory for later retrieval. Experiments on $\textbf{CutAgent-Eval}$ show that CutAgent outperforms representative baselines in e-commerce advertising video creation, achieving the highest online CTR of $\textbf{2.21\%}$.

cs.CV

版本更新 · v2arXiv:2611.13626

FlashMotion: Ultra-Fast Long-Term 3D Motion Generation

Kaixing Yang, Xulong Tang, Ronghui Li, Xiangyue Zhang, Ziqiao Peng, Mingshuang Luo, Chenxi Zhao, Haoyu Wu 等 13 位作者

原文摘要

3D human motion generation plays a crucial role in game development, extended reality (XR), digital humans, and embodied simulation. Beyond motion generation, practical pipelines include rigging, retargeting, and rendering, making ultra-fast long-term 3D motion generation without compromising quality valuable for real-time interactive applications. Despite promising progress, high-quality long-horizon motion generation under tight inference budgets remains challenging, owing to 2 coupled bottlenecks: (1) generative strategies that require many sampling steps for high-quality 3D motion generation and (2) model architectures with substantial per-step computational and memory costs for long sequences. We present FlashMotion, a co-designed framework for high-quality long-horizon 3D motion generation under a strict inference budget, covering text-to-motion, music-to-dance, and speech-to-gesture tasks. To enhance trajectory-level efficiency, we introduce a 3D motion-space MeanFlow formulation with kinematic and dynamic consistency constraints for few-step generation, together with an Adaptive Soft masking mechanism for temporally coherent motion editing. To improve per-step efficiency, we design a lightweight non-autoregressive BiMamba architecture with condition-guided state selection and AdaIN-based condition fusion mechanism, enhancing cross-modal alignment and generalization to longer motion sequences. Extensive experiments demonstrate that FlashMotion achieves overall state-of-the-art performance in both quality and efficiency across text-to-motion, speech-to-gesture, and music-to-dance generation. The project page is available at https://sun-happy-ykx.github.io/FlashMotion-Project/

cs.CV

新论文 · v1arXiv:2611.14257

Elastic-WAM:面向高效机器人控制的自适应时空想象

Elastic-WAM: Adaptive Spatiotemporal Imagination for Efficient Robot Control

Haitian Li, Tianfu Li, Xuxi Zhao, Zizheng Liu, Yangcheng Yu, Yiwen Hou, Zeyu Xiao, Mutian Xu 等 11 位作者

AI 速读 基于摘要

提出 Elastic-WAM,用统一时空细化需求场自适应分配世界模型的计算,在降低推理开销的同时提升机器人控制表现。

cs.RO · cs.CV

查看原文摘要

World-Action Models improve robot control by predicting future visual dynamics, but iterative video denoising incurs substantial inference overhead. Recent approaches reduce this cost through partial future denoising, yet typically rely on fixed refinement budgets. Our empirical observations reveal that preferred refinement depths vary across tasks and states, while different future regions exhibit varying relevance to action generation. Motivated by these findings, we propose Elastic-WAM, which adaptively allocates world refinement computation across temporal denoising time and spatial future space. A unified spatiotemporal refinement demand field governs when to stop world refinement, how far to advance each denoising step, and which regions to refresh. We parameterize this field with a shared temporal basis and spatial amplitudes, and learn it through a three-stage action-grounded supervised procedure. At inference, the learned field guides recurrent sparse world refinement to improve task success while reducing inference overhead. Evaluations across diverse simulation benchmarks and real-world long-horizon manipulation demonstrate state-of-the-art control performance with reduced inference latency.

版本更新 · v2arXiv:2605.09481

TSNBench: Benchmarking LLM Proficiency in Time-Sensitive Networking

Rubi Debnath, Daniel Bujosa Mateu, Luxi Zhao, Silviu S. Craciunas, Paul Pop, Sebastian Steinhorst

原文摘要

We present TSNBench, the first benchmark for evaluating large language model (LLM) proficiency in Time-Sensitive Networking (TSN), a suite of IEEE 802.1 standards for deterministic communication with bounded latency in safety-critical domains such as autonomous vehicles, aviation, defense, and industrial automation. While LLMs have been extensively evaluated on general knowledge tasks, their capabilities in safety-critical networking domains remain largely unexplored. TSNBench comprises 939 expert-validated multiple-choice questions (MCQs) covering diverse TSN mechanisms, along with 100 open-ended Worst-Case Delay (WCD) computation tasks for each of Credit-Based Shaper (CBS) and Cyclic Queuing and Forwarding (CQF), across varying topologies and traffic flows. The ground-truth (GT) WCD values are computed using a verified Network Calculus (NC) solver for CBS and closed-form upper bounds for CQF. We evaluate 16 LLMs and find that although models achieve 67 to 95% accuracy on MCQs, they fail substantially on open-ended WCD computation. For CBS, the best-performing model, GPT-5, deviates from the GT by 150.2 $μ$s on average (mean absolute error, MAE), and its predicted WCD is within 50 $μ$s of the GT for only 39.4% of flows, while all other models exceed an MAE of 250 $μ$s. Providing the WCD equations in the prompt lowers the error for 9 of 10 models on CQF but only 2 of 9 on CBS. Such errors are large relative to TSN latency budgets and can lead to violations of real-time constraints and unsafe configurations. TSNBench demonstrates that MCQ benchmarks may overestimate LLM capabilities in safety-critical networking.

cs.NI

版本更新 · v2arXiv:2606.06474

面向扩散语言模型的自增强检索

Self-Augmenting Retrieval for Diffusion Language Models

Paul Jünger, Justin Lovelace, Linxi Zhao, Dongyoung Go, Kilian Q. Weinberger

AI 速读 基于摘要

作者提出 SARDI,一种无需训练的扩散语言模型动态 RAG 框架,利用去噪过程中的推测性 token 预测引导检索,以提升多跳问答表现与吞吐效率。

cs.CL · cs.AI · cs.LG

查看原文摘要

Diffusion language models generate text by iteratively denoising an entire response in parallel, holding a noisy draft of the answer at every step. We show that these intermediate states surface salient entities early in the denoising trajectory, making them a useful lookahead signal for retrieval-augmented generation (RAG). We further demonstrate that grounding generation in retrieved evidence sharply reduces inter-token dependence, making RAG particularly well suited to parallel decoding. We exploit both through Self-Augmenting Retrieval for Diffusion Language Models (SARDI), a dynamic RAG framework that uses speculative token predictions to guide retrieval during denoising. SARDI is training-free, retriever-agnostic, and applicable to any reasoning-capable discrete diffusion language model. Across five multi-hop QA benchmarks, SARDI outperforms training-free diffusion and autoregressive retrieval baselines at up to 4x higher throughput.