跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-22 00:20 — 2026-11-23 00:20(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

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

DeepEdu-F: A Framework for Efficient and Scalable Agentic LLMs in Vietnamese Education

Quang Nguyen, Hieu Nguyen, Toan Pham, Hien Hoang, Cong Tran, Nam Vu

原文摘要

Cloud AI assistants send student data to foreign servers, conflicting with data-sovereignty laws such as Vietnam's Decree 53, and are not grounded in the national curriculum, so they often hallucinate on local content. Self-hosting an open model keeps data on-premise but faces two costs that weight quantization does not remove. An AI tutoring session revisits the same long material every turn, so once prefix caching removes the prefill cost, decoding over a growing KV Cache dominates response time; and grounding the tutor in local knowledge by fine-tuning is too costly to repeat as that knowledge changes. We present DeepEdu-F, a framework for the Vietnamese AI tutor DeepEdu with two components. LastSet selects the critical KV Cache entries once per turn from the question's attention, decodes the whole turn from that set, and keeps the full cache so later questions can select again. REPAIR (Reliable Evidence-based Playbook Adaptation and Insight Revision) curates a verified playbook from past interactions instead of updating weights. LastSet decodes up to 3.1x faster than dense decoding at a 256k-token context, faster than four sparse baselines, with accuracy close to full attention. Compared with ACE (ADD), REPAIR raises final accuracy from 70.0% to 80.5% on Formula and from 53.6% to 59.7% on FiNER, while mean task/scenario goal completion across AppWorld's normal and challenge splits increases from 9.28% to 16.28%.

cs.AI

新论文 · v1arXiv:2611.04061

On the Primacy Bias in RLVR Training

Phuc Minh Nguyen, Ngoc-Hieu Nguyen, Parshin Shojaee, Chinh Duc La, Duy Minh Ho Nguyen, Rui Zhang, Khoa D. Doan, Ting Hua 等 9 位作者

原文摘要

Reinforcement Learning with Verifiable Reward (RLVR) has emerged as a promising approach for enhancing the reasoning capabilities of large language models. However, it still remains unclear whether RLVR can extend reasoning capabilities beyond what is already encoded in the base model. In this paper, we study this question through the lens of primacy bias: the tendency of models to over-rely on already-learned representations, disproportionately improving performance on problems they already handle well while underexploring harder ones that require departing from those representations. Through our controlled experiments and large-scale analysis, we show that RLVR training on mixed data tends to further sharpen performance on easier problems while yielding only marginal gains on harder ones. We find that although hard problems lead to modest gains overall, they are actually the ones that help most in expanding the model's reasoning capabilities and pushing the representations. However, prolonged training on these hard problems may also hurt and lead to forgetting on easy problems. These findings help to better understand some of the prior conflicting observations about RLVR, specifically, why on (OOD) domains where the base model performs poorly, improvements on hard problems can expand reasoning; while on well-trained domains, forgetting can reduce performance and mask genuine gains obtained from hard problems.

cs.AI

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-demo.70ACL Anthology · ACL 2026

ThinkBooster: A Unified Framework for Seamless Test-Time Scaling of LLM Reasoning

Vladislav Smirnov, Quang-Chieu Nguyen, Sergey Senichev MTS AI and ITMO University, Minh Ngoc Ta, Ekaterina Fadeeva ETHZ - ETH Zurich, Artem Vazhentsev Mohamed bin Zayed University of Artificial Intelligence and Independent Researcher, Daria Galimzianova Mohamed bin Zayed University of Artificial Intelligence, Nikolai Rozanov 等 17 位作者

原文摘要

Test-time compute (TTC) scaling has emerged as a powerful paradigm for improving large language model (LLM) reasoning by allocating additional compute during inference, e.g., via multi-sample generation and verifier-based reranking. Existing TTC scaling strategies and reasoning scorers remain fragmented, evaluated under inconsistent protocols, and are rarely analyzed through the lens of quality-cost trade-offs. We introduce ThinkBooster, a unified framework for seamless test-time compute scaling of LLM reasoning, which consists of (i) a modular Python library implementing state-of-the-art TTC scaling strategy and scorer families, (ii) a benchmark that jointly evaluates performance and computational efficiency, and (iii) a deployable OpenAI-compatible proxy service that enables drop-in integration of adaptive reasoning into real-world applications. We further provide a demo visual debugger for inspecting the reasoning trajectories, intermediate selection decisions, and alternative reasoning paths. Empirical results on mathematical and coding tasks reveal the performance-compute trade-offs of TTC scaling strategies and scoring methods and demonstrate that ThinkBooster provides practical gains in real-world tasks. The code is available online under an MIT license.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations) · 2026 · 正式发表