Minimax Rates for Learning Smooth Populations of Parameters
学习光滑参数总体的极小极大速率AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用二项混合密度的统计学习界限,未明确对应所列经济或金融细分方向。
学习光滑参数总体的极小极大速率AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We study pointwise estimation of a smooth binomial mixing density and characterize its minimax rates. Assuming that the mixing density is $s$-Hölder smooth, we first consider the homogeneous setting with a common number of binomial trials $t$. We derive matching lower and upper bounds that reveal three regimes depending on the relative sizes of the sample size $n$ and the number of trials $t$. When $t$ is small, the finite number of trials creates an identification barrier that persists regardless of sample size; at intermediate $t$, more data reduce sampling uncertainty, while the number of trials limits how finely the mixing density can be recovered; and when $t$ is sufficiently large, the usual nonparametric density estimation rate is recovered. Our lower bounds exploit the polynomial structure of the binomial mixture model, while attainability is achieved by a suitably regularized orthogonal series estimator. We then extend the analysis to heterogeneous trial parameters, where the minimax rate depends on the full trial profile through the effective sample size available at each polynomial degree. These results characterize the fundamental statistical limits of learning smooth populations of binomial probabilities under both homogeneous and heterogeneous trials.