跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

采集已暂停
正在读取账号与研究记录…

全站更新概况

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

arXiv 最近完成扫描:等待完成 · 全站最近入库:2026-11-02 00:39各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:尚未完成最近发现新增版本:2026-11-02 00:39库内论文最新更新时间:2026-10-30 01:59

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

8,677 已收录论文7,675 AI 相关1,866 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。

找到 5 篇论文 · 按版本更新时间排序等待首次采集
版本更新 · v6arXiv:2502.08005

DiffRatio: Training One-Step Diffusion Models Without Teacher Supervision

Wenlin Chen, Mingtian Zhang, Jiajun He, Zijing Ou, José Miguel Hernández-Lobato, Bernhard Schölkopf, David Barber

Score-based distillation methods train one-step diffusion models in two stages: they first train a teacher score model, then distill it into a one-step student model. However, this distillation process can introduce bias from two sources: errors in the teacher score model and student score estimate. We propose DiffRatio, a new approach for training one-step diffusion models without teacher supervision based on a density-ratio formulation that connects score-based distribution matching and GAN-style adversarial training. Instead of using a teacher score model to provide training targets, DiffRatio directly learns a log density ratio between the student and data distributions across diffusion time steps. As a pre-trained score model is only used to initialize the one-step generator and does not supervise training, this design simplifies the training pipeline, mitigates gradient estimation bias, and reduces the size of auxiliary networks. The learned density ratio can be used as a verifier, enabling a principled inference-time parallel scaling method that further improves sample quality without external rewards or extra sequential computation. DiffRatio achieves strong one-step generation results on CIFAR-10 and ImageNet (64x64 and 512x512), outperforming most teacher-supervised distillation methods.

尚无 AI 解读,展示原文摘要

cs.LG · cs.CV
arXiv ↗PDF ↗
版本更新 · v3arXiv:2602.17433

Do LLMs Rewrite History? Detecting Historical Revisionism in Large Language Models

Francesco Ortu, Joeun Yook, Punya Syon Pandey, Bernhard Schölkopf, Alberto Cazzaniga, Rada Mihalcea, Zhijing Jin

Large language models (LLMs) are increasingly used to disseminate information, yet their handling of contested historical events and politically charged narratives remains understudied. We introduce HistoricalMisinfo, a dataset of 500 contested events from 45 countries and regions, each paired with a factual and a documented revisionist reference narrative, instantiated across 11 prompt scenarios reflecting common real-world usage. Using an LLM-as-a-judge protocol, we evaluate multiple model architectures under neutral prompts and robustness prompts that explicitly request revisionist content. Under neutral prompts, models generally align with factual references, though alignment varies by scenario and model. Robustness prompting reveals a consistent and sharp increase in revisionism scores across all models, indicating limited resistance to user-driven revisionist framing. HistoricalMisinfo offers a practical benchmark for evaluating robustness to historical revisionism in AI systems. Code and dataset: https://github.com/francescortu/PreservingHistoricalTruth

尚无 AI 解读,展示原文摘要

cs.CY
arXiv ↗PDF ↗
首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-demo.39ACL Anthology · ACL 2026

PaperMentor: A Human-Centered Multi-Agent Writing Tutor for AI Research Papers in Overleaf

Jiarui Liu, Terry Jingchen Zhang Vector Institute, Ryan Faulkner DeepMind, Xuanqiang Angelo Huang, Vilém Zouhar Department of Computer Science, ETHZ - ETH Zurich, Dominik Glandorf EPFL - EPF Lausanne, Isabel Dahlgren, Rishit Dagli University of Toronto 等 21 位作者

Expert writing feedback from experienced researchers is critical for early-career scholars to improve their manuscripts, yet high-quality feedback often remains scarce because reviewing research papers is labor-intensive. Emerging AI-powered writing assistants largely focus on grammar fixes or simulating peer review with final scores, yet they fall short of providing concrete, actionable suggestions that help students improve their papers during drafting. We present PaperMentor, a human-centered writing assistant system that delivers actionable suggestions as Overleaf-native inline comments while leaving the actual writing entirely to human authors. PaperMentor integrates an expert skill library carefully curated from established researchers’ writing advice with 12 specialized agents covering different aspects of paper writing, such as formatting compliance, phrasing accuracy, and terminology consistency. In a user study (n=14), 90.6% of the generated comments were rated actionable and 67.5% were rated valid, significantly outperforming a GPT-5.2 baseline without the skill library. We release PaperMentor as open source for public use.

尚无 AI 解读,展示原文摘要

cs.CL · cs.MA

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

ACL Anthology · ACL 2026 ↗PDF ↗
首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1693ACL Anthology · ACL 2026

Test of Time: Rethinking Temporal Signal of Benchmark Contamination

Terry Jingchen Zhang Vector Institute, Gopal Dev EuroSafeAI, Max-Planck Institute and Jinesis Lab, University of Toronto & Vector Institute, Ning Wang ETHZ - ETH Zurich, Max Obreiter ETHZ - ETH Zurich, Punya Syon Pandey University of Toronto, Keenan Samway Max Planck Institute for Intelligent Systems, Max-Planck Institute, Wenyuan Jiang ETHZ - ETH Zurich, Yinya Huang ETH Zurich 等 11 位作者

Post-cutoff performance decay of LLMs has been widely interpreted as a temporal signal for benchmark contamination, where public information released before the training cutoff may have been included into training corpora and inflated model performance by memorization. We critically examine this view and demonstrate that this temporal signal is highly sensitive to how benchmark questions are constructed, even if the underlying source material remains invariant. Specifically, we show that LLM-transformed questions can produce remarkably different temporal patterns compared to fill-in-the-blank (cloze) questions directly retrieved from the very same documents. We validate this effect on prior benchmarks that report clear post-cutoff decay (LiveCodeBench), and show that a simple LLM-driven transformation of the same problems can effectively remove the temporal pattern. We further provide a mechanistic understanding of this phenomenon using influence function analysis. Overall, our results suggest that post-cutoff performance decay is a sensitive contamination signal, motivating more robust contamination probes for reliable LLM evaluation.

尚无 AI 解读,展示原文摘要

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

ACL Anthology · ACL 2026 ↗PDF ↗
首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.65ACL Anthology · ACL 2026

On the Emergence and Test-Time Use of Structural Information in Large Language Models

Michelle Chao Chen, Moritz Miller, Bernhard Schölkopf ELLIS Institute and Max Planck Institute for Intelligent Systems, Max-Planck Institute, Siyuan Guo Prior Labs

Learning structural information from observational data is central to producing new knowledge outside the training corpus. This holds for mechanistic understanding in scientific discovery as well as flexible test-time compositional generation. We thus study how language models learn abstract structures and utilize the learnt structural information at test-time. To ensure a controlled setup, we design a natural language dataset based on linguistic structural transformations. We empirically show that the emergence of learning structural information correlates with complex reasoning tasks, and that the ability to perform test-time compositional generation remains limited.

尚无 AI 解读,展示原文摘要

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

ACL Anthology · ACL 2026 ↗PDF ↗