跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

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

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

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

找到 4 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2607.14817

Evaluating Epistemic Uncertainty: Beyond OOD Detection and Active Learning

Jakub Paplhám, Willem Waegeman, Eyke Hüllermeier, Vojtěch Franc

原文摘要

Current evaluation of epistemic uncertainty relies on tasks such as out-of-distribution detection, active learning and selective prediction. However, common epistemic uncertainty scores, such as mutual information or the variance of the predictions, estimate the regret, the excess error of a predictor over the Bayes-optimal predictor. Building on the epistemic reject-option framework, we evaluate epistemic uncertainty using its ability to identify regret, and compare this evaluation with the other tasks. Benchmarking standard methods on datasets with repeated human labels reveals that the tasks rank the methods differently, including pairwise rank inversions between methods that are top-ranked on one criterion and bottom-ranked on another. The disagreement is present already at the optimum, where each task calls for a different score. Formulating selective prediction as a constrained optimization over coverage, expected risk, and regret, we prove that the optimal score is a convex combination of the ground-truth aleatoric and epistemic uncertainties, so that selective prediction and the regret task are the two endpoints of one family of tasks. Out-of-distribution detection, active learning and the regret task thus disagree, theoretically as well as empirically, on which method is a good estimator of epistemic uncertainty, while selective prediction departs from the regret task where the true risk and the regret order the inputs differently. Researchers must therefore state the downstream decision that an epistemic uncertainty estimate is meant to support, instead of relying on a general notion of model ignorance.

cs.LG · cs.AI

版本更新 · v2arXiv:2509.26305

Feedback Forensics: A Toolkit to Measure AI Personality

Arduin Findeis, Timo Kaufmann, Eyke Hüllermeier, Robert Mullins

原文摘要

Some traits making a "good" AI model are hard to describe upfront. For example, should responses be more polite or more casual? Such traits are sometimes summarized as model character or personality. Without a clear objective, conventional benchmarks based on automatic checks struggle to measure such traits. Evaluation methods using human feedback such as Chatbot Arena have emerged as a popular alternative. These methods infer "better" personality and other desirable traits implicitly by ranking multiple model responses relative to each other. Recent issues with model releases highlight limitations of these existing opaque evaluation approaches: goblin-obsessed, sycophantic and generally over-the-top personalities have resulted in model rollbacks and extensive media coverage. Despite these known issues, limited public tooling exists to explicitly evaluate model personality. We introduce Feedback Forensics: an open-source toolkit to track AI personality and related behavioural traits, both those encouraged by human (or AI) feedback, and those exhibited across AI models trained and evaluated on such feedback. Feedback Forensics is adaptive and can automatically find new traits appearing in models. We demonstrate the toolkit's usefulness in two steps: (A) first we analyse the personality traits encouraged in popular human feedback datasets including MultiPref, PRISM and data from Chatbot Arena; and (B) then use our toolkit to analyse how much popular models exhibit such traits. We release (1) our Feedback Forensics toolkit alongside (2) a web app tracking AI personality in popular models and feedback datasets and (3) the underlying annotation data, see https://github.com/rdnfn/feedback-forensics.

cs.CL · cs.AI

版本更新 · v2arXiv:2606.28065

OperatorSHAP: Fast and Accurate Shapley Value Estimation for Neural Operators

Joshua Stiller, Santo M. A. R. Thies, Felix Czaja, Eyke Hüllermeier

原文摘要

Understanding model predictions is essential for physical applications, where outputs often inform safety-critical decisions, such as structural load assessment, weather warnings, and clinical diagnosis. Shapley values satisfy many desirable properties as an attribution method, but their computational cost during inference hinders their practical use. Current amortized explainers, such as FastSHAP, are limited to homogeneous inputs, which is problematic for physical applications where data often comes from irregular grids and geometries. We introduce OperatorSHAP, a grid-agnostic attribution method that allows us to train FastSHAP-like explainers for neural operators. We establish a theoretical framework for attributions in function space, connecting to Aumann-Shapley values. We further show that OperatorSHAP's explanations are consistent with state-of-the-art discrete Shapley values across resolutions and transfer across grid sizes without retraining.

cs.LG · cs.AI

版本更新 · v2arXiv:2611.08409

Conformal Prediction for Time-Dependent PDEs

Joshua Stiller, Annika Schneider, Eyke Hüllermeier

原文摘要

Uncertainty quantification is crucial in scientific machine learning, where models inform safety-critical tasks such as flood forecasting, financial risk management, and thermal control in machines. Conformal prediction provides distribution-free coverage guarantees, but in time-dependent settings common to physics and engineering, these guarantees can break down, leading to systematic undercoverage. We study this problem in the context of surrogate models for time-dependent physical systems described by partial differential equations. We prove that in a function space setting, distributions at arbitrarily close times can be mutually singular, making exact coverage guarantees impossible. We further show that in discretized settings, the total variation distance between distributions often saturates exponentially fast with the grid resolution, mandating restrictions on the spatial discretization to ensure coverage. Finally, for certain settings, we show how to use principled weighted conformal prediction to obtain finite-sample coverage guarantees over growing time horizons.

cs.LG · stat.ML