跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 4 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 21:00(北京时间)
新论文 · v1arXiv:2611.26069

SheetAlign: Grounded Interaction and Stage-Isolated Learning for Spreadsheet Agents

Yuxiang Wang, Junhao Gan, Jianzhong Qi

原文摘要

Spreadsheets are widely used for data analysis and supporting decision-making. Automating spreadsheet analysis while protecting sensitive data and controlling deployment costs motivates locally deployed open-weight large language models (LLMs). Meanwhile, complex spreadsheet tasks require both task reasoning and workbook understanding, while predefined operation interfaces impose additional tool-selection and invocation demands. We introduce SheetAlign, a spreadsheet manipulation framework with stage-isolated policy learning, organized around where to operate, what to change, and how to implement transformations. Task-guided inspection and API grounding anchor code generation in workbook observations and available operations, while stage-isolated learning optimizes program generation and review using edit-progress rewards. At inference, execution consistency selects programs through agreement among workbook states. On SpreadsheetBench, our grounded task interface improves Qwen3-4B's accuracy from 13.5% to 29.2% on average without training. With learning and execution consistency, SheetAlign achieves 32.8% accuracy on average on SpreadsheetBench and 30.1% on Domain-Spreadsheet, outperforming comparable baselines. The code will be made publicly available upon publication.

cs.CL · cs.SE

新论文 · v1arXiv:2611.25853

TableRoute: Capability-Aware Routing for Scalable Table Question Answering

Yuxiang Wang, Junhao Gan, Jianzhong Qi

原文摘要

Table question answering with large language models remains difficult to scale: tables range from compact to million-token sizes, while questions require precise grounding of columns, values, and computations. Existing methods often specialize in a fixed inference strategy, which is brittle across different table scales and model capabilities. Full-table reading is efficient for compact inputs but suffers from irrelevant context. Table reduction helps long inputs but depends on reliable evidence localization, while execution is required when tables exceed the model context window and remains sensitive to schema and value grounding errors. We propose TableRoute, a capability-aware routing framework with evidence-conditioned inference for scalable TableQA. TableRoute first generates validated question--table evidence and identifies the required operations, then routes each instance among these three strategies according to serialized table length and calibrated estimates of how reliably the base model handles these operations. The validated evidence supports the selected route by grounding columns, values, and conditions. Across WikiTQ, WTQ-L, BirdQA, and TableBench, TableRoute consistently improves accuracy through complementary routing and evidence conditioning across table scales, while reducing online token cost. Code will be made available upon publication.

cs.CL

版本更新 · v2arXiv:2611.01074

Grounding Across Views: Cross-View Referring Reasoning for Visual Grounding

Hao Gan, Liuqian Wang, Zhuping Hu, Yufei Gao, Wentao Chao, Chong Fu, Shuang Li, Chengming Liu 等 9 位作者

原文摘要

Cross-view object geo-localization (CVOGL) aims to identify a query-view target in a satellite image, yet reliable instance grounding remains challenging under substantial viewpoint discrepancies. Although recent methods incorporate multimodal prompts, they insufficiently address the varying transferability of linguistic and visual evidence across views. Viewpoint-dependent descriptions (e.g., building facades visible in oblique UAV views but not in top-down satellite images) may become unreliable for satellite grounding, while visually similar instances further complicate target identification. To address these challenges, we rethink CVOGL from a visual grounding perspective and propose GAV (Grounding Across Views), a view-aware framework for constructing target-centered evidence and establishing discriminative cross-view correspondence. Specifically, view-aware referring reasoning mitigates viewpoint-dependent ambiguity, multi-token exemplar prompting and contrastive alignment strengthen visual-semantic correspondence, and scene-level supervision with alignment-based verification distinguishes competing satellite instances. We further introduce CVOGL-Text, a street- and drone-to-satellite benchmark with query-derived expressions. GAV achieves state-of-the-art performance on MoP-UAV with 62.55% Acc@0.5 (+18.19 percentage points) and outperforms evaluated click-point baselines on CVOGL-Text.

cs.CV

新论文 · v1arXiv:2611.05769

Noncrossing is All You Need: Beyond Identical Delay Functions in Online Matching with Delays on General Metrics

Yossi Azar, Junhao Gan, Shahar Lewkowicz, Xiao Sun, Seeun William Umboh

原文摘要

Online optimization with delays has emerged as a powerful paradigm with numerous applica- tions, including matching, caching, server management, network design, and set cover. In most of these problems, competitive algorithms are known for arbitrary monotone delay functions, even when different requests are associated with different delay functions. The notable exception is online matching with delays, where all previously known algorithms achieving constant or polylogarithmic competitive ratios require the delay functions to be identical, either linear or concave, and known in advance. We study the online minimum-cost perfect matching with delays problem on general metrics. We introduce the broad class of noncrossing delay functions, which strictly generalizes the classic setting of identical concave delay functions while naturally modeling scenarios in which different requests may experience different delay costs. We present the first deterministic $O(1)$-competitive algorithm for the single-location online matching problem with noncrossing delay functions in the non-clairvoyant setting as well as a randomized $O(lognlogΔ+log^2Δ)$-competitive algorithm of an arbitrary metric space where $n$ is the number of points of the metric space and $Δ$ is its aspect ratio. Our result allows each request to have an arbitrary noncrossing delay function, thereby simultaneously removing the assumptions of identical delay functions, concavity, and clairvoyance that were required by all previous constant or polylogarithmic-competitive algorithms.

cs.DS