arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.03967cs.LGcs.NE
收藏

非线性PCA via 进化策略:一种新的目标函数

Non-linear PCA via Evolution Strategies: a Novel Objective Function

The Netherlands(荷兰)

Thomas Uriot, Elise Chung

AI总结:

本文提出了一种结合PCA可解释性和神经网络灵活性的非线性PCA方法,通过进化策略优化变量变换,提升模型性能和可解释性。

摘要:

主成分分析(PCA)是一种强大的、流行的降维技术。然而,由于其线性性质,它常常无法捕捉现实世界数据的复杂底层结构。虽然核PCA(kPCA)解决了非线性问题,但牺牲了可解释性,并且在超参数选择上面临困难。在本文中,我们提出了一种稳健的非线性PCA框架,该框架统一了PCA的可解释性和神经网络的灵活性。我们的方法通过神经网络参数化变量变换,利用进化策略(ES)优化,以处理特征分解的非可导性。我们引入了一种新颖的、细致的目标函数,最大化每个变量的个体方差贡献,提供比全局方差最大化更强的学习信号。这种方法原生地处理类别和顺序变量,而无需像one-hot编码那样带来维度爆炸。我们证明,我们的方法在合成和现实世界数据集上,在解释方差方面显著优于线性PCA和kPCA。同时,它保留了PCA的可解释性,使能够使用标准工具如生物图进行特征贡献的可视化和分析。代码可在GitHub上找到。

英文摘要:

Principal Component Analysis (PCA) is a powerful and popular dimensionality reduction technique. However, due to its linear nature, it often fails to capture the complex underlying structure of real-world data. While Kernel PCA (kPCA) addresses non-linearity, it sacrifices interpretability and struggles with hyperparameter selection. In this paper, we propose a robust non-linear PCA framework that unifies the interpretability of PCA with the flexibility of neural networks. Our method parametrizes variable transformations via neural networks, optimized using Evolution Strategies (ES) to handle the non-differentiability of eigendecomposition. We introduce a novel, granular objective function that maximizes the individual variance contribution of each variable providing a stronger learning signal than global variance maximization. This approach natively handles categorical and ordinal variables without the dimensional explosion associated with one-hot encoding. We demonstrate that our method significantly outperforms both linear PCA and kPCA in explained variance across synthetic and real-world datasets. At the same time, it preserves PCA's interpretability, enabling visualization and analysis of feature contributions using standard tools such as biplots. The code can be found on GitHub.

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

↑