Rong Jiang and Keming Yu's contribution to the Discussion of ‘Estimating means of bounded random variables by betting’ by Waudby-Smith and Ramdas
江荣与余克明对《通过下注估计有界随机变量均值》的讨论AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:讨论围绕一般序贯推断与置信序列,提及分位数扩展不足以归入经济学分布效应方向。
江荣与余克明对《通过下注估计有界随机变量均值》的讨论AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We want to congratulate the authors on estimating means of bounded random variables in both with- and without-replacement settings. The authors constructed confidence intervals and time-uniform confidence sequences for the mean of a bounded random variable using test supermartingale technique. It deepens our understanding of the confidence sequence. Confidence sequence is one particular tool in sequential design that facilitates anytime-valid inference. In particular, confidence sequence is a sequence of confidence intervals that is valid at data-dependent stopping times. We offer three comments. First, the CtPrPl−EB in Theorem 2 involves (λt)t=1∞. The authors recommend the predictable plug-in (λtPrPl−EB)t=1∞ given by Whether so many parameter estimators λtPrPl−EB will lead to the superposition of errors and the failure of the method. The Hoeffding process (MtH(m))t=0∞ in equation (8) only need one λ. In particular, when t<100, is CtPrPl−EB still correct? See Figure 2, we can see the results are bed when t<100. Thus, whether Theorem 2 needs to add restrictions on t. Moreover, whether CtPrPl−EB is sensitive to c in λtPrPl−EB, and if so, how to select c, although 1/2 or 3/4 is recommended. Second, the author mentioned their test supermartingle can also be inverted to get a confidence sequence for any quantile. How about mode (Chernoff, 1964), expectile (Newey & Powell, 1987), and extremile (Daouia et al., 2019)? Third, the authors consider arbitrary distribution but bounded distribution which implies all moments exist and require a Chernoff-type assumption on the distribution resulting in O(logt/t) shrinkage rates for the confidence sequences. Recently, Wang and Ramdas (2023) show that employing Catoni’s estimator improves the rate to O(loglog2t/t) under weaker assumptions on the distribution ((1+δ)-th moment bound). We wonder if the methods and results can be generalised to unbounded observations, since the σ2-bounded-variance assumption (Wang & Ramdas, 2023) is more realistic and easier to verify.