跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 09:48(北京时间)
版本更新 · v3arXiv:2604.01502

Conformal Risk Control under Non-Monotone Losses: Theory and Finite-Sample Guarantees

Tareq Aldirawi, Yun Li, Wenge Guo

原文摘要

Conformal risk control (CRC) provides distribution-free guarantees for controlling the expected loss at a user-specified level. Existing theory typically assumes that the loss decreases monotonically with a tuning parameter that governs the size of the prediction set. However, this assumption is often violated in practice, where losses may behave non-monotonically due to competing objectives such as coverage and efficiency. In this paper, we study CRC under non-monotone loss functions when the tuning parameter is selected from a finite grid, a setting commonly arising in thresholding and discretized decision rules. Revisiting a known counterexample, we show that the validity of CRC without monotonicity depends critically on the relationship between the calibration sample size and the grid resolution. In particular, reliable risk control can still be achieved when the calibration sample is sufficiently large relative to the grid size. We establish a finite-sample guarantee for bounded losses over a grid of size $m$, showing that the excess risk above the target level $α$ scales on the order of $\sqrt{\log(m)/n}$, where $n$ is the calibration sample size. A matching lower bound demonstrates that this rate is sharp for the CRC selection rule under the same population-safe endpoint condition. We also derive refined guarantees under additional structural conditions, including Lipschitz continuity and monotonicity, and extend the analysis to settings with distribution shift via importance weighting. Numerical experiments on synthetic multilabel classification and real object detection data illustrate the practical implications of non-monotonicity. Methods that explicitly account for finite-sample uncertainty achieve more stable risk control than approaches based on monotonicity transformations, while maintaining competitive prediction set sizes.

stat.ML · cs.LG

新论文 · v1arXiv:2611.10472

Group-Conditional Conformal Risk Control: Exact Guarantees, Limits, and Overlapping Extensions

Tareq Aldirawi, Wenge Guo

原文摘要

We study group-conditional conformal risk control (CRC) for disjoint and overlapping groups under bounded monotone losses. For disjoint groups, we establish exact finite-sample conditional risk control, two-sided bounds on the group-restricted risk, and fundamental limitations arising from local support and calibration-rank granularity. For overlapping groups, we study two exactly valid approaches: group-restricted calibration followed by union deployment, and direct calibration of the deployed prediction-set family. We characterize the union's limiting reconciliation gap, identify conditions for its disappearance, and establish sharp lower bounds for structured losses in specified product-form models. We also demonstrate a strict size advantage for direct calibration in an ordinal model. Experiments show that direct calibration can reduce prediction-set size, but its efficiency depends on group structure, loss type, and shape fitting. Results on historical diabetic-retinopathy scores further illustrate these tradeoffs. Overall, local support, reconciliation slack, and threshold heterogeneity determine efficiency, with neither approach uniformly dominating.

stat.ML · cs.LG · math.ST