On stochastic complexity and nonparametric density estimation
随机复杂度与非参数密度估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究一般非参数密度估计与平滑选择,未涉及经济分布效应或所列其他应用方向。
随机复杂度与非参数密度估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We use the concepts of stochastic complexity, description length, and model selection to develop data-based methods for choosing smoothing parameters in nonparametric density estimation. In the case of histogram estimators, we derive a simple, exact formula for stochastic complexity when the prior distribution of cell probabilities is uniform over the class of all possible choices. The formula depends only on the data and the smoothing parameter, which is readily chosen according to the criterion of minimum stochastic complexity. Approaches based on stochastic complexity and description length are shown to be asymptotically equivalent in certain circumstances. They produce a degree of smoothing which is almost optimal from the viewpoint of minimizing L∞, or supremum, distance, but which smooths a little more than is optimal in the sense of minimizing Lr distance for any finite value of r.