跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+2093新增论文
+1639其中 AI 相关
+186已有论文修订
+100新增 AI 导读

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

统计口径与数据新鲜度

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

最近完成检查:2026-11-11 13:10最近发现新增版本:2026-11-11 13:09库内论文最新更新时间:2026-11-11 08:00

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

21,672 已收录论文18,320 AI 相关6,055 有修订112 HF 社区发现

浏览论文库

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

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

Be My Eye: Learning to See Beyond a Robot's Own Perspective

Baifu Huang, Shilin Fang, Jianan Wang

原文摘要

Robots operating in the real world are inherently subject to partial observability, particularly in multi-robot collaboration, where individual observations may be insufficient for effective task execution. A key challenge is leveraging complementary observations from partner robots to support collaborative decision-making. We argue that information sharing should go beyond passively transmitting raw observations or generic visual features. Instead, robots should selectively encode task-relevant information according to task objectives and execution progress. To this end, we propose a task-oriented active context sharing framework that transforms robot observations into compact representations, preserving critical information under constrained communication budgets. The framework adopts a two-stage training paradigm. In the first stage, onboard observations and task instructions are jointly encoded into compact context representations. Task-oriented future prediction and soft task-progress correspondence learning guide this collaboration-agnostic compression, preserving information about task objectives and execution progress. In the second stage, the learned representations are integrated into a pretrained Vision-Language-Action (VLA) policy, enabling bidirectional context exchange. Each robot combines complementary partner information with local observations to guide action generation. Action supervision jointly refines the context representations and policy, aligning information sharing with collaborative decision-making. Controlled experiments demonstrate substantial performance gains under constrained communication budgets, while three real-world experiments validate the framework in complex dual-robot tasks. These results highlight a shift from passive visual transmission toward active, task-oriented context sharing that directly supports collaborative decision-making.

cs.RO · cs.AI

首次观测 · 记录 #1CVF · CVPR 2026:cvf:10fbd6cfe87355f1f6486a12e78aafa7CVF · CVPR 2026

ARC Is a Vision Problem!

Hu, Keya, Cy, Ali, Qiu, Linlu, Ding, Xiaoman Delores, Wang, Runqian, Zhu, Yeyin Eva, Andreas, Jacob, He, Kaiming

原文摘要

The Abstraction and Reasoning Corpus (ARC) is designed to promote research on abstract reasoning, a fundamental aspect of human intelligence. Common approaches to ARC treat it as a language-oriented problem, addressed by large language models (LLMs) or recurrent reasoning models. However, although the puzzle-like tasks in ARC are inherently visual, existing research has rarely approached the problem from a vision-centric perspective. In this work, we formulate ARC within a vision paradigm, framing it as an image-to-image translation problem. To incorporate visual priors, we represent the inputs on a "canvas" that can be processed like natural images. It is then straightforward for us to apply standard vision architectures, such as a vanilla Vision Transformer (ViT), to perform image-to-image mapping. Our model is trained from scratch solely on ARC data and generalizes to unseen tasks through test-time training. Our framework, termed Vision ARC (VARC), achieves 60.4% accuracy on the ARC-1 benchmark, substantially outperforming existing methods that are also trained from scratch. Our results are competitive with those of leading LLMs and close the gap to average human performance.

cs.CV · cs.CL

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition · 2026 · 正式发表

首次观测 · 记录 #1CVF · CVPR 2026:cvf:2a46847d84a24f7fe60580d5ecd83543CVF · CVPR 2026

Measure The Feature Universe: Topology-based Pseudo Labeling and Gravity Consistency for Source-Free Domain Adaptation

Lee, Jae Yun, Nam, Hyeok, Cho, Sung In

原文摘要

Source-free domain adaptation (SFDA) adapts a pre-trained source model to an unlabeled target domain using only the model itself, typically relying on pseudo labeling augmented with auxiliary knowledge and consistency regularization (CR) mechanisms to alleviate noise in the generated pseudo labels. However, existing approaches overlook the geometric structure of the target embedding manifold when assigning pseudo labels, resulting in unreliable distance measurements and consequently severe mislabeling. Moreover, existing CR is applied solely to output logits, making it insensitive to feature-level reliability. To solve these issues, we propose a novel pseudo labeling scheme based on Feature universe, which is an expanded embedding space that models class-wise target distributions and Gravity consistency (GV) regularization, which modulates consistency strength according to feature-level similarity. Our pseudo labeling strategy first models the embedding space with virtual features to construct a feature universe. On this space, pseudo labels are generated through feature traversal, which propagates labels only from statistically reliable regions. In addition, GV jointly encourages logit- and feature-level consistency, aligning predictions for augmented images while preserving the geometric structure of the embedding space. It further modulates the strength of CR for each sample, preventing the confirmation of noisy pseudo labels through a gravity-based force defined between two input embeddings. Experiments on Office-Home, DomainNet-126, and VisDA-C demonstrate consistent improvements over prior SFDA methods, and incorporating GV into baselines yields additional gains.

cs.CV

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition · 2026 · 正式发表