跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+816新增论文
+642其中 AI 相关
+95已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v4arXiv:2410.07468

Fast Mixed-Precision Real Evaluation

Artem Yadrov, Aditya Kumar, Pavel Panchekha

原文摘要

Evaluating real numbers to high precision is important in computational science, numerical computing, and in hardware and software design. Efficient algorithms exist for computing arithmetic operations and common elementary functions, but composing these primitives into larger expressions remains a challenge. The typical expression-evaluation algorithm computes all primitives in the expression to a uniform precision, doubling that precision until a sufficiently-accurate result is achieved. This is wasteful: usually only a few operations really need to be performed at high precision, and the bulk of the expression could be computed at a much lower, faster precision. However, no rigorous algorithm currently exists to compute these non-uniform precision assignments, nor to leverage non-uniform precision to reduce the number of primitive computations needed to evaluate an expression. We propose a new algorithm for deriving such rigorous precision assignments and reducing the number of primitive computations needed. This algorithm can leverage results computed at lower precisions to analytically determine a precision for each primitive that will result in a sufficiently-accurate evaluation. It can also use information from constant subexpressions, movability flags, and repeat flags to skip the computation of certain primitives, further reducing the time to evaluate real expressions. Our implementation, Reval, achieves an average speed-up of 3.97x compared to the widely-used Sollya tool, with the speed-up increasing to 9.26x on the most difficult inputs. A detailed evaluation shows that this speed-up results from both assigning lower precisions to the majority of primitives and from computing fewer primitives overall.

cs.MS · math.NA

新论文 · v1arXiv:2611.14671

Where Should the Code Go? Locating Foundation-Model Errors in Bitemporal Inventory Simulation

Durga Sandeep Saluru, Lanchen Song, Aditya Kumaran

原文摘要

Operational reports carry two clocks: when an event happened and when its report arrived; later reports can revise earlier ones. A foundation-model component that maintains the state supported by the reports visible at a cutoff, then rolls a supplied scenario forward, can be helped by exact code before it, after it or inside the call, or asked to reason harder. We ask which remedy removes which error, for which models, on an exactly solvable lost-sales inventory environment: 36,672 independently rescored requests over twelve configurations of closed and open-weight models, with a forced-answer-call interface as a control and protocols frozen before the calls. Weak models fail in separable ways. Canonical input removes report-selection error, exact continuation removes rollout error, neither repairs the other, and which error dominates differs by model; strong models are at ceiling on raw reports. Asking for more reasoning is no substitute and can depend on the interface: under a forced answer call high effort collapses GPT-5.4 mini and DeepSeek V4 Pro, which gain or hold under automatic choice; on its provider the forced call disables reasoning for DeepSeek V4 Flash; and at high effort gpt-oss exhausts its output budget. The contribution is a controlled component diagnostic, released with every request, and evidence that for some model and provider pairs the tool-calling interface confounds reasoning evaluation.

cs.SE · cs.AI · cs.LG

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

DUET-VLM: Dual stage Unified Efficient Token reduction for VLM Training and Inference

Singh, Aditya Kumar, Kandala, Hitesh, Brahma, Pratik Prabhanjan, Liu, Zicheng, Barsoum, Emad

原文摘要

Vision-language models (VLMs) have achieved remarkable multimodal understanding and reasoning capabilities, yet remain computationally expensive due to dense visual tokenization. Existing efficiency approaches either merge redundant visual tokens or drop them progressively in language backbone, often trading accuracy for speed. In this work, we propose DUET-VLM, a versatile plug-and-play dual compression framework that consists of (a) vision-only redundancy aware compression of vision encoder's output into information-preserving tokens, followed by (b) layer-wise, salient text-guided dropping of visual tokens within the language backbone to progressively prune less informative tokens. This coordinated token management enables aggressive compression while retaining critical semantics. On LLaVA-1.5-7B, our approach maintains over 99% of baseline accuracy with 67% fewer tokens, and still retains >97% even at 89% reduction. With this dual-stage compression during training, it achieves 99.7% accuracy at 67% and 97.6% at 89%, surpassing prior SoTA visual token reduction methods across multiple benchmarks. When integrated into Video-LLaVA-7B, it even surpasses the baseline--achieving >100% accuracy with a substantial 53.1% token reduction and retaining 97.6% accuracy under an extreme 93.4% setting. These results highlight end-to-end training with DUET-VLM, enabling robust adaptation to reduced visual (image/video) input without sacrificing accuracy, producing compact yet semantically rich representations within the same computational budget. Our code is available at https://github.com/AMD-AGI/DUET-VLM.

cs.CV · cs.CL

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