跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+1072新增论文
+845其中 AI 相关
+94已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-09 18:35 · 全站最近入库:2026-11-09 13:22各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-09 18:35最近发现新增版本:2026-11-09 13:22库内论文最新更新时间:2026-11-07 02:59

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

18,172 已收录论文15,506 AI 相关4,527 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-09 18:33(北京时间)
首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1143ACL Anthology · ACL 2026

Agentic Oversight via Dialectic Reasoning

Leonardo Ranaldi, Federico Ranaldi University of Roma "Tor Vergata"

原文摘要

Debate has emerged as a promising oversight mechanism for Large Language Models (LLMs) amid rising systemic complexity, particularly where models outperform human evaluators. Yet, Debate provides little verifiable evidence for its final judgments, and its scalability remains largely unexplored. To make oversight grounded and scale as capabilities extend, we introduce an Agentic Oversight framework. By using Dialectic Argumentation as a reasoning function, we extend this paradigm to multilingual and multimodal spaces. We employ a weak-to-strong oversight approach based on two expert models that evaluate and defend contesting answers, while a third blind judge determines the winner using Dialectic Argumentation. Experts argue only for belief-consistent answers, founding the Debate on disagreements. We experimented with six tasks on our framework in both multilingual and multimodal scenarios, and dialectic argumentation consistently outperforms single-expert baselines. Moreover, we show that dialectic judgements from a weaker model deliver argument-mediated supervision that, via fine-tuning, instils unsupervised reasoning signals in expert models.

cs.CL · cs.AI · cs.CV

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

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

Thinking in Schemas: Robust Syllogistic Reasoning in LLMs

Federico Ranaldi University of Roma "Tor Vergata", Leonardo Ranaldi, Fabio Massimo Zanzotto University of Rome Tor Vergata, Shay B Cohen University of Edinburgh

原文摘要

LLMs often mistake what sounds true for what is formally valid. This limitation is especially evident in syllogistic reasoning, where plausible arguments can lead models to endorse conclusions that are logically invalid, a phenomenon known as Content Effect (CE).We present Boethius, a schema-guided framework for syllogistic reasoning that disentangles semantic plausibility from logical validity. Boethius adopts an auditable, quasi-formal reasoning process with two complementary stages: a Schema Module, which deduces the underlying logical form by analysing the formal structure of the premises, and an Instantiation Module, which instantiates this form over the concrete argument and evaluates validity independently of content-level semantics.Our results show that Boethius consistently outperforms existing approaches, improving syllogistic reasoning accuracy while substantially reducing CE. These gains hold for both large models in a pure in-context learning setting and smaller models trained via schema-guided trajectories using supervised fine-tuning and optimisation-based refinement.

cs.CL

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

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

Evolving Agents

Leonardo Ranaldi

原文摘要

AI agents powered by LLMs plan, reason and use tools well, but remain brittle to adapt and evolve because they fail to abstract the mechanisms underlying problem-solving. Reasoning, memory, and decision-making remain fragmented, leaving the systematic reuse of experience for adaptation at scale out of reach. In this paper, we introduce EvA (Evolving Agents), a framework to improve evolution in agentic reasoning that leverages quasi-symbolic abstractions—semi-structured dynamic representations that furnish constructs to distil and reuse reasoning mechanisms. They are learned and refined through experience, and when instantiated, deliver meta-states for organising reasoning. EvA orchestrates this mechanism via a Perceptor modelling observation and action, an Actor conditioning its policy on these abstractions, and a Controller overseeing structure to explore paths or initiate rollbacks. As experience accumulates, EvA refines both its abstractions and the modules that construct and instantiate them by learning past trajectories into reusable mechanisms. Our initial analysis shows that EvA improves accuracy and adapts under mid-episode distribution shifts that cause agents to plateau on complex reasoning and interactive planning tasks. These results position EvA as a step towards adaptive reasoning, memory, and meta-control.

cs.CL · cs.AI

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