跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+2471新增论文
+2025其中 AI 相关
+163已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-10 15:23 · 全站最近入库:2026-11-10 15:22各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-10 15:23最近发现新增版本:2026-11-10 15:22库内论文最新更新时间:2026-11-10 02:59

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

20,643 已收录论文17,531 AI 相关5,643 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-10 15:22(北京时间)
版本更新 · v3arXiv:2607.00642

Coachable Agents for Interactive Gameplay

Roberto Capobianco, Harm van Seijen, Nolan D. Bard, Neil Burch, Fatima Davelouis, Josh Davidson, Alisa Devlic, Yunshu Du 等 41 位作者

原文摘要

Reinforcement learning has proven to be a valuable tool in the creation of advanced AI and robotic systems, contributing to everything from game playing (Silver et al., 2016; 2017; Wurman et al., 2022) to robotics (Levine et al., 2016; Andrychowicz et al., 2020; Luo et al., 2025; Dürr et al., 2026) to foundation models (Ouyang et al., 2022; Noukhovitch et al., 2024; Sun et al., 2024; Guo et al., 2025). Through trial and error, these AI systems typically learn a single, near-optimal behavior to solve their tasks. However, there are many use cases in which one would like to assert some level of control, after training is completed, over how the task is solved. We refer to these modifications of a core task as styles. We combine universal value function approximators (UVFAs) with carefully selected training scenarios, learning algorithms, and data augmentation to create a framework for coaching agents that exhibit styles in complex domains. We demonstrate the framework's application in the AAA video games Horizon Forbidden West and Gran Turismo, and in an open-source humanoid test domain. Despite the different nature of the domains--car racing, stylized game combat, and humanoid walking--each agent shows strong coherence to the style requests while still satisfying the main task in its domain. Importantly, the techniques outlined in this paper allow an end user to choose the final behavior at run time, giving them flexible control over the final executed performance.

cs.AI · cs.LG

版本更新 · v2arXiv:2610.22630

Choosing models for network-wide freeway speed estimation and forecasting from sparse fixed sensors

Ran Tu, Zihao Li, Arash Mirzaei

原文摘要

Most freeway agencies have fixed detectors on only part of their network but need speeds for all of it. This paper compares methods for estimating current and next-hour speeds on every link from such sparse detectors, using historical probe data for training. The test network is the Dallas--Fort Worth freeway system: 4,127 directional links, of which 643 (15.6\%) carry a side-fire detector. Eighteen methods from five families (non-learned baselines, statistical estimators, tabular learners, road-graph neural networks and models that learn spatial relations) were trained under one protocol with three random seeds. Each neural architecture was also retrained with a parameter-free, direction-aware kernel interpolation of the sensor readings as additional input. Graph neural networks that pass information along the road graph, including a plain graph convolutional recurrent network, reduced the current-hour error on unsensored links by about 17\% relative to the historical average. Models with adaptive graphs, attention or identity embeddings stayed close to the historical average and did not fit the training data well, indicating that they could not learn which detectors matter for which links. With the interpolation features, all ten architectures came within about 0.1 mph of each other. The remaining error depended mainly on coverage: almost all of the improvement was found within about 3 mi of a detector, and very little on tollways without detectors or on links with no road-graph connection to one. The results are summarised as guidance on model choice and detector placement.

cs.LG · cs.AI

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

Persona-E²: A Human-Grounded Dataset for Personality-Shaped Emotional Responses to Textual Events

Yuqin Yang, Haowu Zhou South China University of Technology, Haoran Tu, Zhiwen Hui, Shiqi Yan South China University of Technology, HaoYang Li, Dong She South China University of Technology, Xianrong Yao 等 10 位作者

原文摘要

Most affective computing research treats emotion as a static property of text, focusing on the writer’s sentiment while overlooking the reader’s perspective. This approach ignores how individual personalities lead to diverse emotional appraisals of the same event. Although role-playing Large Language Models (LLMs) attempt to simulate such nuanced reactions, they often suffer from "personality illusion”—relying on surface-level stereotypes rather than authentic cognitive logic. A critical bottleneck is the absence of ground-truth human data to link personality traits to emotional shifts. To bridge the gap, we introduce Persona-E² (Persona-Event2Emotion), a large-scale dataset grounded in annotated MBTI and Big Five traits to capture reader-based emotional variations across news, social media, and life narratives. Extensive experiments reveal that state-of-the-art LLMs struggle to capture precise appraisal shifts, particularly in social media domains. Crucially, we find that personality information significantly improves comprehension, with the Big Five traits alleviating "personality illusion.’

cs.CL

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