Existence and uniqueness of the Kronecker covariance MLE
Kronecker 协方差极大似然估计的存在性与唯一性AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要研究矩阵正态协方差估计的一般理论，未明确关联面板、因子或金融模型。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
Kronecker 协方差极大似然估计的存在性与唯一性
- 研究问题
- 矩阵正态模型中，样本量与矩阵行列维度如何共同决定似然是否有界，以及协方差极大似然估计是否几乎必然存在且唯一？
- 方法与思路
- 作者利用模型的不变性，把数据矩阵转化为规范形式，并借助矩阵束的 Kronecker 规范形研究似然最大化所需的样本量。
- 材料陈述的贡献
- 摘要称，当行数与列数之比介于二分之一和二之间时，主要结果给出精确样本量阈值；摘要没有列出这些阈值。
- 阅读关注点
- 应区分似然有界、最大值可达和唯一性三类结论，核对维度范围、协方差因子的尺度处理及边界样本量情形。
- 阅读边界
- 仅据稿件版本未注明的 OpenAlex 索引摘要；精确阈值与完整条件未提供，不能把特定情形的单样本检验推广为一般结论。
原文摘要
In matrix-valued datasets the sampled matrices often exhibit correlations among both their rows and their columns. A useful and parsimonious model of such dependence is the matrix normal model, in which the covariances among the elements of a random matrix are parameterized in terms of the Kronecker product of two covariance matrices, one representing row covariances and one representing column covariance. An appealing feature of such a matrix normal model is that the Kronecker covariance structure allows for standard likelihood inference even when only a very small number of data matrices is available. For instance, in some cases a likelihood ratio test of dependence may be performed with a sample size of one. However, more generally the sample size required to ensure boundedness of the matrix normal likelihood or the existence of a unique maximizer depends in a complicated way on the matrix dimensions. This motivates the study of how large a sample size is needed to ensure that maximum likelihood estimators exist, and exist uniquely with probability one. Our main result gives precise sample size thresholds in the paradigm where the number of rows and the number of columns of the data matrices differ by at most a factor of two. Our proof uses invariance properties that allow us to consider data matrices in canonical form, as obtained from the Kronecker canonical form for matrix pencils.