跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:材料讨论通用均值区间与机器学习安全公平性,没有因果识别或金融风险模型;这些应用措辞不足以支持所列细分领域。

反馈分类问题

Philip S Thomas, Erik Learned-Miller and My Phan's contribution to the Discussion of ‘Estimating means of bounded random variables by betting’ by Waudby-Smith and Ramdas

Thomas等对《通过下注估计有界随机变量均值》的讨论意见

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Philip S Thomas
My Phan

Thomas等对《通过下注估计有界随机变量均值》的讨论意见

研究问题
这篇讨论关注无需正态性假设的均值置信区间与置信序列,如何帮助机器学习安全及公平性评估,并指出哪些比较尚待研究?
方法与思路
讨论者评述主论文的Hedged-CI及其与自身方法的比较,说明置信序列的潜在用途,并建议进一步比较Gaffke的统计量K。
材料陈述的贡献
讨论者认为更紧区间可能提高数据效率,置信序列便于新增数据后的持续评估;同时指出Gaffke方法的覆盖保证仍待解决。
阅读关注点
应分别核对主论文中的覆盖与宽度结果、讨论者的应用判断,以及Gaffke统计量K的定义和覆盖问题,避免混同证据来源。
阅读边界
所给OpenAlex材料是讨论意见,稿件版本未注明;不能冒充主论文或覆盖率证明,未找到反例也不等于已证明覆盖保证。

原文摘要

We enthusiastically agree about the importance of developing tighter confidence intervals and sequences for the mean—the topic of this paper. There are increasing concerns about the safety and fairness of machine learning systems, and we believe one powerful tool for ensuring that machine learning systems are safe, fair, and otherwise reliable is for them to provide guarantees in the form of their confidence that the models they produce will satisfy certain safety or fairness guarantees. At the core of such methods are mechanisms for producing confidence intervals on parameters related to fairness and safety. However, often these confidence intervals must be constructed from samples from extreme distributions for which normality assumptions remain unreasonable even with relatively large numbers of samples. In such cases, confidence intervals like those proposed in this paper are critical, because they do not rely on normality assumptions yet remain relatively tight. We appreciate the comparison of the Hedged-CI method to our own recent confidence interval for the mean (‘PTL21’ in the paper), and find the further increase in tightness compelling, as it could result in improved data-efficiency of safe and fair machine learning methods. Furthermore, we find the extension of the proposed methods to the confidence sequence setting compelling, as it could allow for the re-testing of the safety or fairness of machine learning models as additional data becomes available. One additional comparison that would be interesting to see would be to the confidence interval proposed by Gaffke (2005). (Among the three statistics presented by Gaffke, we are referring to statistic ‘K’.) Showing that this confidence interval has (or does not have) guaranteed coverage remains an open question. Nevertheless, given the remarkable tightness of Gaffke’s bound and the substantial effort that has gone into finding distributions for which it does not exhibit coverage (with no success), it seems like a promising direction for future analysis.

笔记与分组
相关领域论文