跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

找到 4,245 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-23 01:05(北京时间)
新论文 · v1arXiv:2611.26358

Beam 模型技术报告

Beam Model Technical Report

Reflection Team, Adam Abdulhamid, Osama Abuelsorour, Yasmin Alameddine, Carlo Alfano, Duarte Alves, Brandon Amos, Selvaraj Anandaraj 等 230 位作者

AI 速读 基于摘要

Beam 是一个面向编码、推理与智能体工作负载的稀疏 MoE 模型,总参数 501.3B、激活参数 23.4B,作者报告其推理算力需求比同类模型低 3–4 倍。

cs.CL · cs.AI

查看原文摘要

Beam is a sparse Mixture-of-Experts (MoE) model with 501.3B total parameters and 23.4B active parameters, specifically built and optimized for coding, reasoning, and agentic workloads. Beam delivers frontier level reasoning, while requiring 3-4x less inference compute than many models of its class. Pretrained on 23.8T diverse, curated, high-quality tokens, Beam features a 1M-token context window achieved through a novel two-stage midtraining phase, built on verifiable, correctness-anchored data. Post-training leveraged a large-scale, fully asynchronous reinforcement learning (RL) campaign across 10.5K GB300 GPUs, generating over 100M rollouts over 4 weeks of training. We believe this is one of the largest scale RL runs conducted by any open lab to date. Across our evaluation suite, capabilities continued to improve as we increased RL compute, with no sign of a plateau. Supported by deep hardware-model co-design, FP8/NVFP4 quantization, and a 1.93B-parameter speculative decoding drafter (DFlash 2), Beam maximizes serving throughput with efficient, flexible deployment. Averaged across conversation turns and harm categories, Beam refuses or pivots on 88.9% of harmful requests while complying with 81.5% of harmless requests, achieving the highest refusal/pivot rate on harmful requests among open-weight models on the Pareto frontier.

新论文 · v1arXiv:2611.26349

Perfumer:基于大语言模型的智能体框架加速第一性原理计算中的结构弛豫与电子能带预测

Perfumer: A Large Language Model-based Agentic Framework Accelerating Structural Relaxation and Electronic Band Prediction for First-Principle Calculation

Zhiwei Li, Yuhao Zhou, Yikai Yang, Haonan Wang, Qing Ye, Jiancheng Lv, Kazunari Matsuda

AI 速读 基于摘要

Perfumer 是一个基于大语言模型的智能体框架,耦合 Quantum ESPRESSO 与两个预测模型,加速结构弛豫和电子能带预测。

cond-mat.mtrl-sci · cs.LG

查看原文摘要

First-principles structural relaxation and band calculations require substantial computation and expertise. Here we present Perfumer, a large language model-based agentic framework that couples Quantum ESPRESSO with two predictive models. Across tested structures, pre-relaxation with Perfumer-relax model followed by QE refinement yielded a 2.75-fold overall speedup over QE alone. Perfumer-band model combines a periodic graph neural network with a latent Hermitian spectral head returns 12 band energies at any requested wavevector, preserving reciprocal lattice periodicity and time-reversal symmetry without constructing Hamiltonian. Trained on 125,153 self-curated band structures, Perfumer-band model reaches a median per-material mean absolute error of 0.157 eV on 2,607 test materials, including lanthanide, actinide and magnetic compounds, from held-out composition families spanning 85 elements, taking about 97 ms per material on two consumer CPU cores. The agent turns natural-language requests into relaxation-to-band workflows, from a single uploaded structure to automatically constructed new candidates and returns predicted properties.

版本更新 · v2arXiv:2611.00172

From Fragmentation to Fusion: A Survey and Roadmap for Omnimodal Embeddings

Ziyin Zhang, Yuyu Guo, Ying Zhang, Siqiao Xue, Zihan Liao, Jin Qin, Wenjie Yang, Siyuan Yang 等 18 位作者

原文摘要

Embedding models underpin virtually every modern AI system, from search engines to recommendation systems. Despite shared mathematical foundations, research on embedding models remains fragmented by modality: the communities develop largely in isolation, seldom exchanging insights. We argue that this fragmentation obscures a deeper convergence. Driven by contrastive learning, Transformer architectures, and a granularity shift, embedding research across modalities is converging toward a common set of principles, even as modality-specific challenges remain underexplored. To reason across this convergence without conflating it, we propose a framework of three progressively harder capabilities: coverage, comparability, and compositionality. Three paths toward unification satisfy these in turn: transformation broadens coverage, alignment enables comparability, and joint embedding, the terminus we advocate, aims at compositionality. This position paper traces the resulting evolution, providing the first unified, cross-cutting treatment of omnimodal embedding research.

cs.CL · cs.AI

版本更新 · v3arXiv:2604.10547

Agent^2 RL-Bench:LLM 智能体能否自主完成智能体式强化学习后训练?

Agent^2 RL-Bench: Can LLM Agents Engineer Agentic RL Post-Training?

Wanyi Chen, Xiao Yang, Xu Yang, Tianming Sha, Qizheng Li, Zhuo Wang, Bowen Xian, Fang Kong 等 10 位作者

AI 速读 基于摘要

作者提出一个面向智能体式强化学习后训练的紧凑诊断基准,考察 LLM 智能体能否在固定预算内自主设计、实现、调试并执行后训练流程来提升基础模型。

cs.AI

查看原文摘要

We introduce Agent^2 RL-Bench, a compact diagnostic benchmark for evaluating agentic RL post-training, which tests whether LLM agents can autonomously design, implement, debug, and execute post-training pipelines that improve foundation models. RL post-training increasingly drives model alignment and specialization, yet existing benchmarks are largely static, rewarding supervised fine-tuning or script generation without assessing an agent's ability to close an interactive RL loop. Agent^2 RL-Bench provides a unified agent-facing interface: each run starts from an isolated workspace containing a base model, task data, instructions, and a grading API, and agents must iterate within a fixed budget by training models and submitting artifacts for evaluation. The benchmark spans six tasks across three levels, from static rule-based training to judge-based optimization and closed-loop online RL with trajectory collection. Two diagnostic skills, namely runtime recording and post-hoc summarization, enable structured analysis of agent behavior, facilitating smooth and effective iteration of the benchmark's evaluation framework. Across five agent systems and six driver LLMs, agents show intelligent behavior but clear limitations: one RL-oriented run improves ALFWorld from 4.85 to 93.28 via SFT warm-up and GRPO with online rollouts, yet DeepSearchQA remains difficult, most successful routes rely on supervised pipelines, and interactive outcomes show large differences across agent stacks. Overall, Agent2 RL-Bench shows that current agents can sometimes engineer online RL, but stable agent-driven RL post-training remains rare under fixed budgets. It also demonstrates that our benchmark provides a strong and effective evaluation framework for future research in this direction. Code is available at https://github.com/microsoft/RD-Agent.

新论文 · v1arXiv:2611.26249

Beyond Covers and Titles: Evidence-First Ranking for Robust Cold-Start Recommendation

Fuyi Wang, Yuxin Cao, Yifan Liao, Renyang Liu, Lin Li, Wei Song

原文摘要

Short-video platforms rank new uploads before anyone has watched them, using content towers that read a video's cover, title and frames. Existing attacks on content-aware recommenders perturb pixels or features and ignore platform re-encoding, and existing defenses train against norm-bounded perturbations that neither match real edits nor preserve recommendation quality. We show with REAP, a realizable attack through {a simulated platform channel (H.264 transcoding, rescaling, cropping and JPEG)}, that packaging edits raise a cold video by 32.0 rank-percentile points in unrelated audiences. We then observe that cold-start ranking does not need the packaging at all: a tower that sees only the video body ranks cold items best. Building on this, we propose Evidence-First Ranking (EFR), which scores cold videos from their body, admits packaging only through a support-gated residual bounded by $γ$, and merges cold and warm rankings by rank percentile, yielding an exact certificate against any packaging edit. On MicroLens-100K, EFR cuts the attack gain by 81% and raises cold-start Recall@100 from 0.1133 to 0.170, while keeping the merged NDCG@10 within 4% of the undefended system.

cs.CV

新论文 · v1arXiv:2611.26248

TwinLab-Bench:在真实实验室的智能体孪生中评估AI科学家

TwinLab-Bench: Evaluating AI Scientists in Agentic Twins of Real Labs

Yang Wan, Linchao Zhu

AI 速读 基于摘要

提出TwinLab-Bench,用真实实验室记录构建的TwinLab智能体环境,评估AI科学家自主设计实验的能力,覆盖52个任务、100多种实验动作类型。

cs.AI · cs.CL · cs.LG

查看原文摘要

AI agents are increasingly expected to act as AI scientists, which requires three increasingly open abilities: carrying out a given computational workflow correctly, choosing the next measurements from a given design space, and designing their own experiments. Existing benchmarks mainly evaluate the first two abilities, in a terminal or in a closed loop that selects from predefined candidates. Evaluating the third ability requires reliably executing an experiment that an agent designs, with readings grounded in a real laboratory. We introduce TwinLab-Bench, which evaluates AI scientists on self-designed experiments in 52 tasks from laboratories in the physical sciences, the life sciences, and engineering. The benchmark supports more than 100 experimental action types, and the agent's report is scored by comparison with a hidden answer taken from real laboratory records. Each task has its own TwinLab agent, an agent that serves as the environment and executes the experiments that the tested agent designs, reading the raw materials of the laboratory and calling calculators that are built from its records. Compared with a language model that sees only the task description, the TwinLab agent almost eliminates readings that deviate from the real records and inconsistent answers to a repeated request, and closed-book probes control for answers recalled from memory. We find that these tasks remain hard for frontier models: the strongest, Claude Fable 5.2, averages a score of only 45.0, and we conduct an empirical study of where it fails.

版本更新 · v2arXiv:2611.23010

PhysScope:基于具身视觉记忆的智能体多模态物理推理

PhysScope: Agentic Multimodal Physics Reasoning with Grounded Visual Memory

Haoyang Liu, Kecheng Liang, Xinyu Li, Weixing Chen, Yang Liu

AI 速读 基于摘要

PhysScope 是一种不更新模型权重的推理时视觉框架,通过将物理适用范围与视觉观察绑定并维护依赖关系,帮助视觉语言模型纠正前提性范围错配。

cs.AI

查看原文摘要

Vision-language models (VLMs) can correctly interpret physics diagrams yet apply constraints outside the states or conditions in which they hold, causing premise errors to propagate through subsequent calculations. We introduce PhysScope, an inference-time visual harness that supports self-correction of these scope mismatches without updating model weights. PhysScope enables the model to link physical scopes directly to its visual observations and explicitly constructs derived views to support reasoning. The harness imposes explicit constraints on state distinctions, conditions, and physical scopes during model reasoning, and checks agent-proposed revisions against sources and scopes. Accepted revisions invalidate registered dependents, thereby maintaining scope-aware working memory. On PhysAlign, PhysScope achieves higher solving scores than direct solving across all six evaluated VLMs. With Gemini-3.8-flash, it outperforms Canvas-CoT by 9.34 percentage points and substantially improves solving accuracy on the out-of-distribution (OOD) PhysUniBench benchmark. Ablation studies support explicit scope management and dependency maintenance as design principles for multimodal physics reasoning agents.

版本更新 · v2arXiv:2610.41373

可查询高斯视图索引:文本检索与选择性相机定位

Queryable Gaussian View Index: Text Retrieval and Selective Camera Localization

Tianyu Xiong, Rui Li, Jiaqi Yang

AI 速读 基于摘要

提出 QGVI,在已有高斯场景资产上实现文本到视图的检索与选择性 RGB 相机定位,并直接返回资产坐标系下的位姿。

cs.CV

查看原文摘要

We present Queryable Gaussian View Index (QGVI) for querying existing Gaussian scene assets and their associated calibrated reference data. Text-view retrieval and selective RGB camera localization return poses in the asset's coordinate frame. QGVI-T turns Gaussian-rendered views into a language-searchable index of scene locations, binding structured captions to known camera poses and place identifiers. Semantic and lexical retrieval select views from distinct places without online rendering, VLM calls, or a scene-specific pose network. The image route, QGVI-I, filters LoGS-based geometric estimates using distinct inlier query keypoints. It omits photometric refinement and preserves accepted pose coordinates. On nine development scenes, QGVI-T achieves 58.3% Top-1 and 78.3% Top-5 joint relevance-and-validity success, compared with 26.1% and 34.6% for our CityLoC reimplementation with refinement. QGVI-I achieves 97.3% scene-mean pose success at 1 m/2 degrees, with pooled false-acceptance and false-rejection rates of 0.707% and 1.142%. A paired cached evaluation retains all 1,775 initializer poses correct at this threshold. Recorded median text query latency is 0.020 s. Matched controls show competitive BM25 retrieval and slightly lower false acceptance for thresholded full LoGS; grid augmentation suggests modest gains on novel-view-derived descriptions. We report model-judged semantic success separately from source-camera recovery, with source-verified or estimated scales for geometric evaluation.

版本更新 · v3arXiv:2511.22613

行列式簇的变分分析

Variational analysis of determinantal varieties

Yan Yang, Bin Gao, Ya-xiang Yuan

AI 速读 基于摘要

本文为低秩矩阵与张量等行列式簇建立一阶和二阶切集统一框架,并应用于低秩优化最优性条件与双层规划。

math.OC · cs.AI · cs.LG

查看原文摘要

Determinantal varieties---the sets of bounded-rank matrices or tensors---have attracted growing interest in low-rank optimization. The tangent cone to low-rank sets is widely studied and underpins a range of geometric methods. The second-order geometry, which encodes curvature information, is more intricate. In this work, we develop a unified framework to derive explicit formulas for both first- and second-order tangent sets to various low-rank sets, including low-rank matrices, tensors, symmetric matrices, and positive semidefinite matrices. The framework also accommodates the intersection of a low-rank set and another set satisfying some assumptions, thereby yielding a tangent intersection rule. Through the lens of tangent sets, we establish a necessary and sufficient condition under which a nonsmooth problem and its smooth parameterization share equivalent second-order stationary points. As applications, we exploit tangent sets to characterize optimality conditions for low-rank optimization and prove that verifying second-order optimality is NP-hard. Moreover, for low-rank semidefinite programs, the Burer--Monteiro parameterization maps fourth-order stationary points of the parameterized problem to second-order stationary points of the original problem. In a separate line of analysis, we investigate variational geometry of the graph of the normal cone to matrix varieties, deriving the explicit Bouligand tangent cone, Fréchet and Mordukhovich normal cones to the graph. These results are further applied to develop optimality conditions for low-rank bilevel programs.

版本更新 · v2arXiv:2608.16367

深度主导的自然场景骨架检测

Depth-Dominant Skeleton Detection for Natural Scenes

Chengkun Rao, Xinrong Hu, Min Li, Yangjun Ou, Ziwei Luo, Ye Li, Zhaojing Wang, Junwei Tang 等 10 位作者

AI 速读 基于摘要

作者提出以深度表示主导、RGB 辅助的骨架检测新范式,并设计 DDSkel 模型,在四个主流基准上以更少参数取得最高 F-measure。

cs.CV

查看原文摘要

Existing natural-scene skeleton detectors follow an RGB-representation-based feature encoding paradigm: they locate skeletons within the RGB appearance space, in which the skeleton's shape and topology can only be inferred implicitly from entangled color and texture cues. Despite notable progress, this encoding paradigm degrades markedly on complex scenes such as cluttered or occluded ones, where appearance distractors overwhelm the weak structural signal. We observe that depth images are inherently insensitive to color and texture and provide clear regional contours and inter-region spatial relationships, which naturally eases the difficulty of skeleton detection in complex scenes. Motivated by this, we propose for the first time a novel skeleton detection paradigm built on depth-representation-dominant feature encoding, in which depth dominates and RGB serves as the auxiliary, and present a model, DDSkel, under this paradigm. DDSkel adopts an asymmetric encoder design that fuses the feature representation of RGB images into that of depth images, with the RGB branch containing only 23% of the parameters of the depth branch. DDSkel has a simple structure without intricate designs. Nevertheless, with only about 19% of the trainable parameters of the largest state-of-the-art methods, DDSkel attains the highest F-measure scores on four mainstream benchmarks, namely SK506, SK-LARGE, WH-SYMMAX, and SymPASCAL. Extensive experiments suggest that for natural-image skeleton detection, the depth-dominant paradigm is a more suitable choice than the RGB-based paradigm, achieving better performance with substantially fewer parameters.

新论文 · v1arXiv:2611.26220

面向大规模MIMO的圆形阵列球面镶嵌:有利传播条件与频谱设计

Spherical Tessellation of Circular Arrays for Massive MIMO: Favourable Propagation Conditions and Spectral Design

Geili T A El Sanousi, Tuan Anh Le, Raed A A Abd-Alhameed, Xin-She Yang, Huan X Nguyen

AI 速读 基于摘要

作者提出一种球面镶嵌的同心圆阵列,证明在固定归一化弦距和理想面可见性下用户信道渐近正交,并通过仿真验证干扰衰减与SINR收敛。

cs.IT

查看原文摘要

Upper-mid-band XL-MIMO can exploit line-of-sight propagation, but periodic uniform cylindrical arrays may produce grating ridges. We analyse a spherically tessellated concentric circular antenna array with non-separable facet orientations. Under fixed normalised chord spacing and ideal facet visibility, we prove that user channels become asymptotically orthogonal and matched-filter SINR approaches the single-user SNR. Simulations confirm interference decay and SINR convergence. A spectral comparison shows that facet-normal diversity prevents the full-amplitude grating ridges of the cylindrical baseline, with the inter-facet residual decaying with array size.

新论文 · v1arXiv:2611.26211

SpecWM:将验证转化为精炼的流式世界模型

SpecWM: Turning Verification into Refinement for Streaming World Models

Jiaming Li, Lingzhen Li, Xiaze Yang, Chenyu Zhu, Kaiqi Liu, Xiaotong Zhao, Songlian Li, Toyota Li 等 12 位作者

AI 速读 基于摘要

SpecWM 提出一种免训练推理框架,利用目标模型的潜在速度场验证草稿块并生成可复用修正,通过阈值选择接受、精炼或拒绝,从而在流式世界模型中实现质量、速度与控制的最佳权衡。

cs.CV

查看原文摘要

Recently, video world models have advanced interactive generation, with large models offering higher quality and smaller models enabling faster inference. Existing speculative methods combine their strengths through fast draft generation and selective target regeneration guided by rewards on decoded frames. However, verification covers only the external scorer's evaluation dimensions and adds decoding and scoring costs. Moreover, these scores provide no correction, requiring costly target regeneration for rejected drafts. To address these limitations, we propose Speculative World Model (SpecWM), a unified, training-free inference framework for streaming world models. It verifies draft chunks using the target's latent velocity field. Verification also yields a reusable correction; two thresholds select Accept, Refine, or Reject. Specifically, one-step refinement reuses it to improve perceptual quality, while three-step refinement strengthens camera following and trajectory consistency. These findings motivate transition-aware refinement. On WBench Navigation, SpecWM improves visual quality at 1.63$\times$ speedup over the target and raises NavScore from the draft's 75.99 to 85.63, achieving the best quality-speed-control trade-off. Additionally, our LongSpecBench shows sustained quality and control over long, multi-turn rollouts, while experiments on Hy-Nomas validate SpecWM across backbones and denoising budgets.

版本更新 · v2arXiv:2611.24157

GenRF:生成式免配准图像融合

GenRF: Generative Registration-free Image Fusion

Linfeng Tang, Zhijun Fan, Yang Chen, Zizhuo Li, Hao Zhang, Jiayi Ma

AI 速读 基于摘要

GenRF 利用预训练生成基础模型 FLUX 的跨注意力与生成先验,在无需显式配准的情况下直接融合未对齐且退化的多模态图像。

cs.CV

查看原文摘要

Multi-modal image fusion combines complementary observations to improve scene visibility and perception. However, in real-world acquisition, differences in sensing principles and configurations introduce geometric discrepancies, while degradations further compromise source quality. Existing methods typically rely on explicit registration, yet large parallax complicates correspondence estimation, while mismatched fields of view leave some regions without cross-modal counterparts. Meanwhile, independent restoration underuses cross-modal information, whereas restoration-fusion methods assuming alignment remain vulnerable to misregistration. This study revisits misaligned and degraded image fusion in the era of generative foundation models, in which cross-attention enables position-agnostic complementary information aggregation, while generative priors support degradation recovery and inference in missing regions. Building on this perspective, we propose GenRF, which adapts pretrained FLUX through LoRA to jointly enhance degraded observations, infer missing cross-modal context, and fuse complementary information without explicitly estimating deformation fields. Extensive experiments on real-world infrared and visible captures show that GenRF delivers high-quality fusion directly from unregistered, degraded images without preprocessing, while improving downstream task performance under misalignment. Additional experiments demonstrate that GenRF can generalize to misaligned multi-exposure and multi-focus image fusion without task-specific fine-tuning.

新论文 · v1arXiv:2611.26165

StreamEgo: Streaming Exocentric-to-Egocentric Video Generation

Tianyi Xu, Boyang Lyu, Yunkai Tang, Kairan Ding, Jiahang Li, Weiyu Guo, Yandong Guo, Shuchen Weng 等 9 位作者

原文摘要

Exocentric-to-egocentric (Exo2Ego) video generation transforms third-person recordings into first-person viewpoints, unlocking immersive AR/VR experiences and scalable demonstration synthesis for embodied robotics. Extending it to a streaming setting is expected to further enable live applications. However, existing methods suffer from degraded manipulation regions, overfitting and confinement to fixed-length clips with prohibitive latency. To address these limitations, we present StreamEgo, a real-time framework for unbounded, generalizable Exo2Ego video generation. To resolve intricate manipulation dynamics while supporting the streaming pipeline, a streaming dual-branch prior provides pixel-aligned guidance for translating appearance and skeletal kinematics. We also introduce a region-aware loss curriculum to improve generalization and stabilize multi-objective diffusion training. Furthermore, we distill the model into a chunk-wise autoregressive model, augmented with a region-aware corruption mechanism and a first-chunk curriculum, enabling high-quality, generalizable real-time streaming Exo2Ego generation at 24.3 FPS on a single H100 GPU.

cs.CV

新论文 · v1arXiv:2611.26156

Towards Scale-Up Networking: Challenges and Open Questions

Tingting Xu, Zixun Su, Xinyang Huang, Bowen Liu, Kun Tan, Dong Lin, Hao Wang, Yinben Xia 等 12 位作者

原文摘要

The rapid growth of AI models and the widespread use of distributed training and inference have made inter-accelerator communication a critical system bottleneck. Scale-up fabrics address this bottleneck by combining high per-accelerator bandwidth with low and predictable latency over tightly coupled accelerator domains. However, the appropriate topology, protocol mechanisms, communication semantics, and system integration remain actively debated. We analyze the critical-path communication generated by parallelism strategies and derive the resulting requirements for domain scale, per-accelerator bandwidth, and collective completion latency. We then use these requirements as a framework to examine representative proprietary and open scale-up fabrics, revealing how their physical interconnects, topologies, protocols, and semantics make different trade-offs among performance, scalability, compatibility, and implementation cost. Moreover, based on this analysis and discussions with industry experts, we identify challenges and open problems in physical interconnects and switching, efficient communication, semantics, resource sharing and heterogeneous device interconnection. This paper provides a requirement-driven foundation for analyzing current scale-up fabrics and guiding the design of future systems.

cs.NI · cs.DC

新论文 · v1arXiv:2611.26153

Live Migration of Gated DeltaNet Requests: Exact Catch-Up and the Cost of Log Backlog

Hanqing Yu, Jiaqi Yang, Si Wu, Feng Li, Xiuzhen Cheng, Pengfei Hu, Yongbo Yu

原文摘要

Live migration of a streaming Gated DeltaNet (GDN) request requires recovering recurrent state at the correct token boundary on a worker with the same model weights. We adapt snapshots, batched replay, and token catch-up, and design a compact update-log migration path. Exact catch-up preserves native single-token decode and matches the applicable bitwise reference on the tested inputs. We use both a prior-based and a probe-calibrated selector to choose a path for user interruption, source release, or output rate. In 1,350 scheduled pure-GDN trials on two GPU deployments, compact logs achieved the shortest exact handoff gap in all 90 configurations, including 10 winners determined using a replay timeout bound. In the 80 complete configurations, exact catch-up always released the source earliest, while 32-step replay provided the highest output rate when arithmetic differences were allowed. At 10 MB/s, 32-step replay also reduced the median handoff gap from 445--464 ms for logs to about 81 ms across the two deployments. On 40 historical KV-aligned Qwen configurations, retrospective selection reduced the mean gap by 13.9% against the strongest scored simple rule under either numerical contract. We report initial whole-request hybrid results and specify how the joint KV and GDN policy will be evaluated.

cs.DC

版本更新 · v2arXiv:2611.18729

SCALE: Towards Whole-Slide Counterfactual Explanations in Cancer Histopathology

Weiyi Qin, Yingci Liu-Swetz, Shiwei Tan, Yi Wang, Mohammad Alexanderani, Dimitrios Korentzelos, Peizi Li, Soo Yeon Sohn 等 14 位作者

原文摘要

Accurate cancer diagnosis depends on histopathological evaluation, in which tumor morphology drives disease classification and therapeutic decision-making. While deep learning models have demonstrated strong performance in predicting diagnostic and prognostic properties from histopathology images, their clinical adoption remains limited by a lack of interpretability. Unlike conventional medical images where diagnostic findings are spatially localized, histopathological images are characterized by complex textural patterns distributed across the entire whole slide image (WSI), making it difficult to explain model predictions through region-based localization alone. Counterfactual explanations offer a promising alternative by asking "what changes in the image could have altered the model prediction." To achieve this, we propose SCALE, a framework for generating such counterfactual explanations for histopathological DL models. Across nine counterfactual directions spanning multiple cancer types, SCALE generates counterfactual explanations that consistently shift model predictions toward the intended diagnostic target while maintaining biological feasibility. In a blinded review by pathologists, SCALE demonstrated superior morphological plausibility compared to baseline methods (win rate of 91.7%) and robust counterfactual effectiveness (target consistency of 96.7%). These results suggest that SCALE generates morphologically plausible and effective counterfactual explanations that can be applied to improve the interpretability of deep learning models for histopathology.

cs.CV

新论文 · v1arXiv:2611.26105

PhysVAM: Physics-oriented Future Value Action Model for Dynamic Object Manipulation

Yuxiang Yang, Jingbo Zhang, Jiaru Zhong, Junliang Chen, Yirui Zhou, Guangming Wang, Haitao Lin, Huaiyuan Xu 等 10 位作者

原文摘要

Predicting future scene or object states does not necessarily reveal how robot-object interactions will advance or hinder a task. This challenge is particularly pronounced in dynamic robotic manipulation, where objects continue moving during perception and execution. Effective action generation therefore requires not only modeling object dynamics but also anticipating how future interactions will shape task progress. To this end, we propose \textbf{PhysVAM}, a Physics-oriented Future Value Action Model that represents anticipated interactions through their effects on future task progress. This value-based formulation provides task-directed foresight without reconstructing future visual states. Conditioned on current observations and historical object and robot motion, PhysVAM jointly learns action generation and multi-horizon future-value prediction. The value branch learns horizon-specific latent representations through future task-value prediction from successful and failed trajectories. These future-value representations are integrated into the action policy through gated cross-attention, guiding action generation toward interactions that facilitate task success. Extensive simulation and real-world experiments demonstrate superior task success, with absolute success-rate improvements of 27.0 and 27.5 percentage points over the strongest baselines in simulation and real-world tasks, respectively. Project page: https://metarobo.github.io/physvam.github.io/.

cs.RO

新论文 · v1arXiv:2611.26103

UniVEP: Unifying Velocity and Endpoint Prediction for Robot Manipulation

Zhengtu Liang, Qiwei Liang, Tao Lin, Shihang Weng, Boyang Cai, Xiangyu Chen, Yikeng Chen, Jiaming Liang 等 11 位作者

原文摘要

Flow-matching robot policies usually use one prediction target throughout action generation, even though recovering actions from noise and polishing nearly clean actions bring different challenges. We systematically compare velocity prediction (V), endpoint prediction (X), and velocity-weighted endpoint prediction (X--V) across multiple robot policies, benchmarks, and inference budgets. On StarVLA and LiLa-WAM, X--V works best for few-step generation, while V gains more from iterative refinement. We further uncover their complementary strengths across noise levels: clean actions have concentrated covariance spectra, endpoint predictions stay more stable under high noise, and velocity predictions offer more accurate corrections near clean actions. Inspired by these findings, we introduce UniVEP, which learns both prediction targets together with consistency supervision and switches from endpoint recovery to velocity refinement as noise drops. Each step only needs one network run, and joint training also boosts single-step endpoint generation. Tests on simulated and real-world manipulation show better success rates and efficiency. On RoboTwin, UniVEP hits 61.36% success with one StarVLA run, beating the best single-target baseline at sixteen runs (59.96%). With LiLa-WAM, two runs outperform the best sixteen-step single-target baseline and cut inference latency by 77.1%.

cs.RO · cs.CV

新论文 · v1arXiv:2611.26098

Frequency-Synchronized Boundary Coupling for Training-Free Multi-Prompt Long Video Generation

Yipan Xu, Shuyong Gao, Jiyuan Fu, Keliang Yin, Jiayu Chen, Qianyu Guo, Yang Liu, Wenqiang Zhang

原文摘要

Text-to-video generation has made remarkable progress with diffusion models and transformer-based video architectures, yet generating coherent long videos from evolving textual descriptions remains challenging. Training long-video models from scratch requires substantial computation and large-scale multi-event data, while training-free multi-prompt generation must activate new prompt semantics without breaking temporal continuity. We identify a frequency-agnostic boundary coupling problem in existing transition strategies: weak coupling causes abrupt changes, flicker, and background jumps, whereas overly strong or coarse coupling may over-preserve source semantics and produce ghosting or duplicated subjects around prompt boundaries. To address this problem, we propose FreqSync, a training-free framework that formulates prompt transitions as frequency-selective boundary coupling. FreqSync combines Frequency-Synchronized Source-Conditioned Attention (FS-SCA) with Residual-Clipped Spectral Stitching (RCSS), enabling adjacent segments to share stable low- and mid-frequency structure and motion cues while keeping high-frequency prompt-specific details target-dominant under explicit residual constraints. Extensive experiments show that FreqSync achieves state-of-the-art transition smoothness and prompt alignment while maintaining strong perceptual video quality, demonstrating its effectiveness for coherent multi-prompt long video generation.

cs.CV

版本更新 · v4arXiv:2606.08918

GeoMetric: Injecting Metric Geographic Structure into Worldwide Image Geo-Localization

Junchao Cui, Wenqi Shi, Xiangyang Luo, Biru Zhu, Xuanzi Ma, Nan Wu

原文摘要

Worldwide image geo-localization estimates where a photograph was taken on Earth. Existing methods infer location from visual appearance alone, an unreliable cue for geography: near-identical scenes occur on different continents. We present GeoMetric, a three-phase retrieval framework that encodes geographic distance directly in the representation. Phase I trains image, text, and location encoders into a unit hypersphere. The location encoder combines ScaleFusion and GeoAnchorAttention. ScaleFusion projects a coordinate onto an equal-area chart and encodes it with three Fourier bands, fusing them by attention into one multi-scale embedding. GeoAnchorAttention adds a global prior from fixed spherical anchors without mixing samples, so each coordinate embedding is batch-independent. A trimodal contrastive objective aligns images, reverse-geocoded texts, and coordinates, masking semantic and geographic false negatives. Phase II retrieves candidates, each carrying a GPS coordinate and granularity-aware geographic text. Phase III lets a frozen open-source 8B-parameter large multimodal model (LMM) choose the coordinate from those candidates. On four benchmarks, GeoMetric is best in 15 of 20 threshold cells, and ablations show that the components act at different scales: the text encoder carries coarse geographic context, while the location encoder resolves fine-grained distinctions.

cs.CV

新论文 · v1arXiv:2611.26083

Reference-Twist-Based Velocity-Domain Spatiotemporal Calibration for mmWave Radar, Event Camera, and IMU

Zhenghao Zou, Yang Lyu, Xiaohu Guo, Chunhui Zhao, Quan Pan

原文摘要

Multi-sensor navigation requires a common spatial and temporal basis, but geometric calibration relies on targets, features, point clouds, or pose associations that are difficult to establish across mmWave radars, event cameras, and inertial measurement units (IMUs). These sensors nevertheless share rigid-body motion. This paper formulates reference-conditioned velocity-domain spatiotemporal calibration for a rigid suite of two mmWave radars, one event camera, and two IMUs. Given a trusted reference body twist, radar Doppler, event normal flow, and inertial measurements are regressed against the same motion to estimate relative rotations, lever arms, time offsets, and sensor-specific bias and scale without artificial targets, structure from motion, or cross-modal point-cloud registration. The reference is treated as a conditioning input rather than a sensor to be calibrated. We compare joint and reference- conditioned estimation, derive conditional identifiability and CRLB-level covariance and bias bounds, and state the operating conditions under which conditioning is informative. Indoor and forest recordings with axis-separated motion evaluate initial- ization, temporal alignment, motion degeneracy, reference-input sensitivity, and residual consistency. Because the reference does not add physical observability, the estimates remain conditional on reference accuracy, synchronization, motion excitation, and projection diversity.

cs.RO

新论文 · v1arXiv:2611.26068

Physics-Informed Deep Learning for Channel Prediction in Satellite-Mounted Metasurface Reflection Communication Networks

Aolin Sun, Ruihong Jiang, Jincong Mo, Yangbo Guo, Zhuangzhuang Cui

原文摘要

Satellite-mounted metasurfaces (MS) provide a low-power programmable paradigm for 6G satellite-terrestrial networks, effectively compensating for severe free-space path loss under stringent payload constraints. However, accurate channel prediction for such systems remains fundamentally challenging due to the coupling of dynamic orbital topology, stochastic user geometry, and hardware-imposed phase quantization. This paper proposes a physics-informed deep learning (PIDL) framework that embeds the physics of wireless communication, including monotonicity constraints and asymptotic decay properties, into a deep neural network for outage probability (OP)-aware channel prediction. We construct a realistic system model incorporating spherical user distribution, Spherical Poisson Point Process-based satellite constellation, and practical metasurface quantization. Simulation results demonstrate that the proposed framework achieves over 0.99 prediction accuracy with physically consistent outage trends under varying geometric configurations, constellation densities, and quantization resolutions.

cs.IT

版本更新 · v2arXiv:2611.14183

An Augmented Lagrangian Approach to Lifted Bellman Linear Programming

Jongchan Park, Hyukjun Yang, Narim Jeong, Donghwan Lee

原文摘要

Temporal-difference critics regress onto a bootstrapped target and usually need a target network. Lifted Bellman Linear Programming (LBLP) instead expresses the in-sample optimal values of offline RL as the solution to a linear program over the dataset. Its neural solver ALBUM relaxes the constraints into hinge penalties with fixed coefficients, and its guarantees are conditions on coefficients chosen in advance. We solve the same program with the method of multipliers: the coefficients become multipliers learned by dual ascent, with one penalty parameter $ρ$. In the convex case the fixed points are the KKT pairs of LBLP, and at every stationary point the applied constraint weights balance the objective exactly. The critic can serve a Gaussian actor, a flow actor, and best-of-N sampling, and for the Gaussian actor we propose an advantage-normalized DDPG+BC objective. With a single $Q$ and $V$ and no target network, our AL-LBLP with best-of-N reaches 60.1\% average success on the 50 state-based OGBench tasks. On long-horizon tasks, it reaches 81.5% on humanoidmaze-giant and 79.8% on antmaze-giant. It does not collapse up to batch size 8192.

cs.AI

版本更新 · v2arXiv:2611.14961

CommJEPA: When Predictive Representation Learning Meets Wireless Intelligence

Feiran You, Hongyang Du, Kang Wei, Jun Li, Abbas Jamalipour

原文摘要

Artificial intelligence (AI) is becoming an integral part of wireless systems, yet much of today's wireless AI remains task-specific and reactive, with models typically trained to map current observations to predefined outputs or reconstruct observed data. While effective for individual tasks, such approaches provide limited support for learning what is predictable, reusable, and transferable in dynamic wireless environments. Joint-Embedding Predictive Architecture (JEPA) offers a different perspective by learning predictive representations in latent space that capture informative structure in the observations. In this article, we introduce Communication JEPA (CommJEPA) as a communication-oriented framework for predictive representation learning. The central idea is bidirectional. JEPA can equip wireless systems with predictive representations for capturing latent channel and environmental dynamics, integrating heterogeneous observations, adapting to changing conditions, and supporting future decisions. Conversely, the physical structure, partial observability, multiple time scales, action-dependent evolution, and resource constraints of wireless systems motivate new communication-aware JEPA designs. We develop this mutual perspective, organize the resulting design space, and discuss representative JEPA-based wireless instantiations for prediction and control. We further highlight open challenges toward scalable, interactive, and predictive wireless intelligence.

cs.NI

版本更新 · v2arXiv:2609.34170

RAVEL: Asynchronous Rolling Inference for Flow-Based Vision-Language-Action Models

Yuhan Chen, Ke Yu, Pengfei Liu, Shuxun Wang, Yi Yang, Linchao Zhu

原文摘要

Flow-based vision-language-action (VLA) models are highly effective for generalist robot manipulation, yet their reliance on computationally expensive VLM encoding and multi-step iterative action generation imposes a significant latency bottleneck. The resulting inference latency makes it difficult for robots to respond quickly, especially in dynamic environments. We address this limitation with RAVEL (Rolling Asynchronous VLA Enabling Low-Latency Control), an asynchronous inference framework that addresses the computational bottlenecks of both the VLM backbone and the action expert. To reduce the delay from multi-step action denoising, RAVEL allows near-term actions to be executed after a single additional denoising step by carrying partially denoised future actions forward in a rolling buffer. To avoid blocking on slow VLM encoding, RAVEL decouples VLM encoding from rolling action generation, allowing the action expert to operate continuously using the latest available VLM context, while a lightweight Fast Observation Pathway (FOP) directly conditions the action expert on current observations. Across simulated and real-world manipulation tasks, RAVEL consistently achieves substantially lower response latency while maintaining the task capability of the underlying VLA, enabling high-frequency and responsive closed-loop control.

cs.RO

新论文 · v1arXiv:2611.26040

Streaming-AAA: Streaming AAA Game Video Generation at High Resolution, High Frame Rate, and Low Latency

Zhihao Hu, Jianqi Ma, Jun Zhang, Jiayang Bai, Haifeng Shi, Yanxiang Zhuang, Zhongqian Sun, Weidong Zhang 等 9 位作者

原文摘要

Controllable streaming video generation offers a promising route toward interactive game simulation, yet existing methods remain far from practical gameplay. They often fail to jointly achieve high visual fidelity, high frame rates, and low interaction latency, resulting in poor responsiveness and degraded user experience. We present Streaming-AAA, a new paradigm for controllable infinite generation of AAA-quality game videos. Our system generates 1080p gameplay videos at 43 FPS with 198 ms end-to-end latency interaction on merely NVIDIA A800 GPUs, while supporting long-horizon play without severe temporal degradation or collapse. Streaming-AAA is built upon three key designs. First, we redesign the VAE architecture for efficient high-resolution decoding, enabling real-time synthesis at 1080p. Second, we pretrain the diffusion model using diffusion forcing and significantly extend the temporal training horizon, allowing the model to capture long-term dependencies and maintain persistent memory. Third, we perform post-training distillation and memory compression to improve inference efficiency while retaining visual quality and temporal consistency. Experiments show that Streaming-AAA substantially improves visual fidelity, frame rate, latency, and long-term stability over prior controllable video generation approaches, enabling a significantly more playable experience for interactive AAA game video generation.

cs.CV

版本更新 · v3arXiv:2609.20050

The Missing Complement: State-Conditioned Minimal Sufficient Evidence for Coding Agents

Zhexi Feng, Ruiyi Zhang, Yongbo Yang, Pengtao Xie

原文摘要

Retrieval assembles repository context by ranking passages for relevance to the current query. A coding agent halfway through an issue has already read much of what such a ranker returns. Relevance is scored per passage, but sufficiency belongs to the set: independently scored passages can fill the budget with support for one requirement while another goes unmet. We formulate state-conditioned minimal sufficient evidence recovery: given a captured agent state, recover a compact evidence combination supplying what its next decision still lacks. SERBench measures this on 500 held-out states from 45 repositories, recording what the agent has seen, crediting only sets that satisfy every annotated evidence requirement of the current decision, and separating set recovery from candidate discovery. MSS-Complement treats acquisition as set construction, not ranking. Three semantic calls propose a jointly sufficient set, search for what it lacks, and return 4-8 intact source units within 6,144 tokens. One configuration, fixed on calibration data, recovers a complete set for 73.0% of those states at five items and 80.6% at eight, against 61.4% and 72.4% for Qwen3 embedding with reranking. A matched control ranking by similarity alone recovers fewer complete sets, placing the margin over it in the set-level policy, not the computation. The lead persists from frozen repository source with no gold-derived pool. On AMA-Bench it answers from a 76.2% smaller answer prompt, with accuracy 2.08 points above that benchmark's own memory agent. Removing one required group from a complete set costs repair-localization precision under two executors. Retrieval for agents is better posed as recovering what a decision lacks than re-ranking what an issue resembles.

cs.IR · cs.AI · cs.CL

版本更新 · v3arXiv:2603.17927

RoboForge: Cross-space Motion Refinement for Physically Executable Humanoid Whole-body Tracking

Xichen Yuan, Zhe Li, Zhenzhe Zhang, Yangyang Wei, Xinying Guo, Shanghang Zhang, Jianfei Yang

原文摘要

Whole-body motion tracking has rapidly expanded the skill repertoire of humanoid robots, yet nearly all of this progress has come from stronger tracking policies, while the motion references they imitate are treated as fixed supervision. We argue that reference quality is a first-order factor in tracking performance. Human motion data carry capture and estimation artifacts, and retargeting adds physical inconsistencies due to the human-robot embodiment gap; discarding such motions sacrifices valuable skill content, whereas retaining them uncorrected undermines policy learning. We present RoboForge, a data-centric framework that resolves this dilemma by refining references instead of filtering them, repairing each error in the space where it arises. In human motion space, a quality-guided diffusion model localizes corrupted segments and inpaints only those segments, leaving the rest of the motion intact. In robot motion space, kinematic repair corrects foot-contact and self-collision defects, and annealed sampling-based optimization under physics rollouts turns kinematically plausible references into dynamically executable ones. RoboForge requires no change to the tracker: it improves three retargeting methods and four tracking policies, raising the success rate of BeyondMimic from 89.51% to 96.20% while reducing the mean per-joint position error (MPJPE-L) by 31.6%. Refined references also accelerate policy learning, restore tracking performance from heavily corrupted inputs, and enable more than 30 high-dynamic motions, including flips and the Thomas flare, on a real Unitree G1.

cs.RO

新论文 · v1arXiv:2611.26036

Presenting Your Figures: Data-informed Animated Transitions Across Scientific Figure Panels

Lu Ying, Can Liu, Yuxiao Yang, Jianing Yin, Xiaolin Wen, Yong Wang

原文摘要

Multi-panel figures are commonly used in research papers to show scientific data, and researchers often reuse them when presenting their work. Presenting these figures often involves explaining how data across chart panels are related. Animated transitions can progressively reveal these relationships, but two static panels specify only the endpoints, leaving what intermediate keyframes should show and how the transition should progress unclear. To support transition design across diverse scientific figures, we developed Figure Space and Transition Space through iterative analysis of 48 published multi-panel figures across eight scientific subject areas. Figure Space represents panel composition, data transformations, and visual encodings while retaining the links needed to trace panel results back to records. Transition Space uses this representation and source data to construct and sequence keyframes that make corresponding data visible and align them while preserving the meaning of each panel's position encodings. Building on these spaces, we developed FigFlux, a human-in-the-loop authoring system that guides AI agents in generating animated transitions from a multi-panel figure and its associated materials. Researchers can revise keyframes in natural language before animation generation. We evaluate FigFlux through cross-domain case studies, a study with 16 scientific authors, and expert assessment. Authors reported lower overall workload than with their familiar tools, while experts gave FigFlux transitions higher ratings than transitions created with participants' familiar tools or generated by AI alone. The example gallery have been published online: https://figflux.github.io.

cs.HC