arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.08373cs.LGcond-mat.dis-nnmath.STstat.MLstat.TH
收藏

基于平均场透镜的加权自编码器特征学习分析

Analysis of feature learning in weight-tied autoencoders via the mean field lens

The Voleon Group(Voleon集团);Stanford University(斯坦福大学)

Phan-Minh Nguyen

摘要:

自编码器是最早引入的用于无监督学习的非线性模型之一。尽管它们被广泛采用,但从数学上理解训练的非线性自动编码器提供的特征提取机制一直是一个长期存在的开放问题。在这项工作中,我们通过在平均场框架中分析一类两层权重绑定的非线性自编码器,在这个问题上取得了进展。在一个适当的缩放,在大量的神经元的政权,训练与随机梯度下降的模型示出承认一个平均场限制动态。这种有限的描述揭示了这些模型的特征学习的渐近精确的画面:它们的训练动态表现出不同的阶段,对应于数据的不同主子空间的学习,具有不同程度的非线性收缩依赖于$\ell_{2}$ -正则化和停止时间。虽然我们证明了这些结果下的理想化假设(相关)高斯数据,对现实生活中的数据的实验表明一个有趣的匹配理论。兴趣的自动编码器设置对证明这些结果提出了不平凡的数学挑战。在此设置中,模型的“Lipschitz”常数随着数据维度$d$而增长。因此,先前分析的适应需要在$d$中至少是指数的神经元$N$的数量。我们的主要技术贡献是一个新的论点,证明了所需的$N$是唯一的多项式在$d$。我们推测,$N\gg d$是足够的,并且$N$必然大于数据依赖的内在维度,这种行为与以前研究的设置有根本的不同。

英文摘要:

Autoencoders are among the earliest introduced nonlinear models for unsupervised learning. Although they are widely adopted beyond research, it has been a longstanding open problem to understand mathematically the feature extraction mechanism that trained nonlinear autoencoders provide. In this work, we make progress in this problem by analyzing a class of two-layer weight-tied nonlinear autoencoders in the mean field framework. Upon a suitable scaling, in the regime of a large number of neurons, the models trained with stochastic gradient descent are shown to admit a mean field limiting dynamics. This limiting description reveals an asymptotically precise picture of feature learning by these models: their training dynamics exhibit different phases that correspond to the learning of different principal subspaces of the data, with varying degrees of nonlinear shrinkage dependent on the $\ell_{2}$-regularization and stopping time. While we prove these results under an idealized assumption of (correlated) Gaussian data, experiments on real-life data demonstrate an interesting match with the theory. The autoencoder setup of interests poses a nontrivial mathematical challenge to proving these results. In this setup, the "Lipschitz" constants of the models grow with the data dimension $d$. Consequently an adaptation of previous analyses requires a number of neurons $N$ that is at least exponential in $d$. Our main technical contribution is a new argument which proves that the required $N$ is only polynomial in $d$. We conjecture that $N\gg d$ is sufficient and that $N$ is necessarily larger than a data-dependent intrinsic dimension, a behavior that is fundamentally different from previously studied setups.

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

↑