研究过参数MDA在遥感分类中的理论表现，证明其收敛快且误差逼近最优。
Overspecified Mixture Discriminant Analysis: Exponential Convergence, Statistical Guarantees, and Remote Sensing Applications
- 用过参数混合模型拟合单高斯数据，分析EM算法收敛性。
- 理论证明算法以指数速度收敛到贝叶斯风险，有限样本下误差率约n^{-1/2}。
- 适用于图像、文本等复杂数据分类，尤其适合遥感数据验证。
本研究探讨了在混合成分数量超过真实数据分布的情况下，混合判别分析（MDA）的分类误差问题。通过在每类中使用两成分高斯混合模型来拟合来自单一高斯分布的数据，分析了期望最大化（EM）算法的算法收敛性和统计分类误差。结果表明，在合适的初始化条件下，EM算法能在总体层面以指数速度收敛至贝叶斯风险。进一步地，在有限样本下，当初始参数估计和样本量满足温和条件时，分类误差以 $n^{-1/2}$ 的速率收敛至贝叶斯风险。该工作为复杂数据场景（如图像与文本分类）中常被经验使用的过参数化MDA提供了严格的理论支撑。为验证理论，我们在遥感数据集上进行了实验。
原文摘要 · Abstract (English)
This study explores the classification error of Mixture Discriminant Analysis (MDA) in scenarios where the number of mixture components exceeds those present in the actual data distribution, a condition known as overspecification. We use a two-component Gaussian mixture model within each class to fit data generated from a single Gaussian, analyzing both the algorithmic convergence of the Expectation-Maximization (EM) algorithm and the statistical classification error. We demonstrate that, with suitable initialization, the EM algorithm converges exponentially fast to the Bayes risk at the population level. Further, we extend our results to finite samples, showing that the classification error converges to Bayes risk with a rate $n^{-1/2}$ under mild conditions on the initial parameter estimates and sample size. This work provides a rigorous theoretical framework for understanding the performance of overspecified MDA, which is often used empirically in complex data settings, such as image and text classification. To validate our theory, we conduct experiments on remote sensing datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。