跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-23 01:05(北京时间)
版本更新 · 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:2610.36169

Don't Pick a Winner: Knowledge Conflicts Need a Prior, Not a Rule

Minh Pham Van, Cong Tran

原文摘要

A retrieval-augmented language model answers from two sources, the retrieved context and its own knowledge, and the two disagree whenever the context is incomplete or wrong. Existing methods settle the disagreement with a rule fixed at design time: follow the context, amplify it in proportion to how far it moves the model, or trust the model's memory. Each rule is confidently wrong in some deployment. In a decision-theoretic model of two sources, the score of any fixed rule is linear in the share of reliable contexts while the best attainable score is convex, so every fixed rule is beaten wherever it is not exactly optimal; and a symmetric divergence between the two sources, the signal adaptive decoding uses, carries no information about which one is right. Resolving a conflict therefore needs two inputs that no existing method keeps: evidence about each source separately, and a prior on how often the context is right. We test these claims on GRACE, a benchmark that intervenes on the knowledge-graph context of a fixed question, so that what the model knows, what the context says and what is true are measured separately. There, every baseline from four families is strong on right contexts or on wrong ones, never on both. We then build the two inputs: the model states its knowledge as notes, a small policy voices each note with a calibrated confidence, a reader answers in two voices, and a selector commits or abstains under a prior $π$ applied as an exact prior shift. With $π$ set to the true share of right contexts, the system is above the best baseline at every mixture of GRACE contexts, by up to 26 points. Its overall score is 45.3 and 35.0 (Qwen3.5-35B-A3B, Llama-3.1-8B), against 29.4 and 27.5 for the best baseline. On preregistered ClashEval it beats same-backbone CK-PLUG and TCR by 12 and 26 points. Where the model lacks the knowledge, the gains vanish, as the theory predicts.

cs.AI · cs.CL