基于刻面枚举和凸优化的单形结构矩阵分解框架
Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
摘要:
考虑一个结构化矩阵分解模型,其中一个因子被限制为使其列位于单位单纯形中。这种单纯形结构矩阵分解(SSMF)模型和相关的分解技术在不同领域引起了人们的极大兴趣,如遥感中的高光谱解混、机器学习中的主题发现等。在本文中,我们开发了一个新的理论SSMF框架,其思想是研究一个最大体积椭球内接在凸包的数据点。这种最大体积内接椭球(MVIE)的想法还没有尝试在以前的文献中,我们展示了一个充分条件下,MVIE框架保证准确恢复的因素。我们为MVIE所展示的充分恢复条件比可分离的非负矩阵分解(或纯像素搜索)要宽松得多;巧合的是,它也与最小体积封闭单纯形相同,这被认为是不可分离问题实例的强大SSMF框架。我们还表明,MVIE可以实际上通过执行面枚举,然后通过求解凸优化问题来实现。的MVIE框架的潜力说明了数值结果。
英文摘要:
Consider a structured matrix factorization model where one factor is restricted to have its columns lying in the unit simplex. This simplex-structured matrix factorization (SSMF) model and the associated factorization techniques have spurred much interest in research topics over different areas, such as hyperspectral unmixing in remote sensing, topic discovery in machine learning, to name a few. In this paper we develop a new theoretical SSMF framework whose idea is to study a maximum volume ellipsoid inscribed in the convex hull of the data points. This maximum volume inscribed ellipsoid (MVIE) idea has not been attempted in prior literature, and we show a sufficient condition under which the MVIE framework guarantees exact recovery of the factors. The sufficient recovery condition we show for MVIE is much more relaxed than that of separable non-negative matrix factorization (or pure-pixel search); coincidentally it is also identical to that of minimum volume enclosing simplex, which is known to be a powerful SSMF framework for non-separable problem instances. We also show that MVIE can be practically implemented by performing facet enumeration and then by solving a convex optimization problem. The potential of the MVIE framework is illustrated by numerical results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。