Adjustment by Minimum Discriminant Information
最小判别信息调整AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用信息投影与约束分布估计,未涉及具体分位数、分布效应或其他所列应用方向。
最小判别信息调整AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Minimum discriminant information adjustment has primarily been used in the analysis of multinomial data; however, no such restriction is necessary. Let $P$ be a distribution on $R^a$, and let $\mathscr{C}$ be a convex set of distributions on $R^a$. Let $\mathbf{X}_i, 1 \leq i \leq n$, be independent and identically distributed observations with common distribution $P$. The minimum discriminant information adjustment (MDIA) of $P$ relative to $\mathscr{C}$ is the element $Q$ of $\mathscr{C}$ that is closest to $P$ in the sense of Kullback-Leibler discriminant information. If $\bar{P}_n$ is the empirical distribution of the $X_i, 1 \leq i \leq n$, and $\bar{Q}_n$ is the MDIA of $\bar{P}_n$ relative to $\mathscr{C}$, then $\bar{Q}_n$ is the maximum likelihood estimate in $\mathscr{C}$. Let $\mathscr{C}$ consist of distributions $A$ on $R^a$ such that $\int T dA = t$, where $T$ is a measurable transformation from $R^a$ to $R^b$ and $t \in R^b$. It is shown that under mild regularity conditions $\bar{Q}_n$ converges weakly to $Q$, the MDIA of the true $P$, with probability 1 and that $\bar{E}_n(D) = \int Dd\bar{Q}_n$ is an asymptotically normal and asymptotically unbiased estimate of $E(D) = \int D dQ$.