Likelihood inference for mixtures: Geometrical and other constructions of monotone step-length algorithms
混合模型的似然推断:单调步长算法的几何及其他构造AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究一般混合分布的似然优化,未明确涉及结构估计或离散选择应用。
混合模型的似然推断:单调步长算法的几何及其他构造AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This paper considers algorithms for the maximum likelihood estimator of the mixing distribution of a family of parametric densities. Specific interest is devoted to the monotonicity of the step-length of the solution. In ξ 2 we introduce the idea of estimating the area above the second derivative curve, and in Theorem 1 we relate area-overestimation to the monotonicity of the associated algorithm. In ξ 3 we apply Theorem 1 to the monotonicity analysis of well-known algorithms as well as to the construction of a new class of monotone step-length choices which is particularly simple in the mixture setting. Numerical comparisons and refinements in keeping the monotonic step-length from becoming too conservative are given. Theorem 3 characterizes conditions under which the Newton-Raphson step is monotonic and, if these conditions fail to hold, states that the regula falsi step is monotonic.