arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.00308math.OC
收藏

关于稀疏典型相关分析

On Sparse Canonical Correlation Analysis

Yongchun Li, Santanu S. Dey, Weijun Xie

AI总结:

本文研究稀疏典型相关分析(SCCA),证明其推广了稀疏PCA、稀疏SVD和稀疏回归等NP难问题,并提出组合公式、混合整数半定规划模型及分支切割算法,经数值实验验证有效性。

摘要:

经典的典型相关分析(CCA)基于两组多元变量之间的协方差来识别其相关性,已广泛应用于计算机视觉、自然语言处理和语音分析等多个领域。尽管CCA广受欢迎,但在高维数据背景下,它在解释两组变量之间的相关性时可能面临挑战。因此,本文研究稀疏典型相关分析(SCCA),以增强CCA的可解释性。我们首先证明SCCA推广了三个著名的稀疏优化问题,即稀疏主成分分析(稀疏PCA)、稀疏奇异值分解(稀疏SVD)和稀疏回归,这些问题均被归类为NP难问题。这一结果促使我们开发强健的公式和高效算法。我们的主要贡献包括:(i)引入一种组合公式,该公式捕捉了SCCA的本质,并允许开发近似算法;(ii)推导出一个等价的混合整数半定规划模型,该模型便于采用具有解析割的专用分支切割算法;(iii)为SCCA的两个低秩特例建立了复杂度结果。我们提出的公式和算法的有效性通过数值实验得到了验证。

英文摘要:

The classical Canonical Correlation Analysis (CCA) identifies the correlations between two sets of multivariate variables based on their covariance, which has been widely applied in diverse fields such as computer vision, natural language processing, and speech analysis. Despite its popularity, CCA can encounter challenges in explaining correlations between two variable sets within high-dimensional data contexts. Thus, this paper studies Sparse Canonical Correlation Analysis (SCCA) that enhances the interpretability of CCA. We first show that SCCA generalizes three well-known sparse optimization problems, sparse PCA, sparse SVD, and sparse regression, which are all classified as NP-hard problems. This result motivates us to develop strong formulations and efficient algorithms. Our main contributions include (i) the introduction of a combinatorial formulation that captures the essence of SCCA and allows the development of approximation algorithms; (ii) the derivation of an equivalent mixed-integer semidefinite programming model that facilitates a specialized branch-and-cut algorithm with analytical cuts; and (iii) the establishment of the complexity results for two low-rank special cases of SCCA. The effectiveness of our proposed formulations and algorithms is validated through numerical experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑