arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2006.06997cs.LGcond-mat.dis-nnmath.STstat.MLstat.TH
收藏

简单神经网络中的复杂动力学:理解相恢复中的梯度流

Complex Dynamics in Simple Neural Networks: Understanding Gradient Flow in Phase Retrieval

Université Paris-Saclay(巴黎萨克雷大学);CNRS(法国国家科学研究中心);CEA(法国原子能和替代能源委员会);Institut de physique théorique(理论物理研究所);Laboratoire de Physique de l’Ecole normale supérieure ENS(巴黎高等师范学院物理实验室);Université PSL(巴黎文理研究大学);Sorbonne Université(索邦大学);Université Paris-Diderot(巴黎第七大学);Sorbonne Paris Cité(巴黎索邦西岱大学);King’s College London(伦敦国王学院)

Stefano Sarao Mannelli, Giulio Biroli, Chiara Cammarota, Florent Krzakala, Pierfrancesco Urbani, Lenka Zdeborová

摘要:

尽管基于梯度的算法被广泛用于优化高维非凸函数,但了解它们找到良好最小值而不是陷入虚假最小值的能力在很大程度上仍然是一个开放的问题。在这里,我们专注于梯度流动力学相位恢复随机测量。当测量的数量与输入维度的比值很小时,动力学仍然被困在具有大吸引盆的虚假最小值中。我们分析发现,超过一个临界比率,这些临界点变得不稳定的发展朝着信号的负方向。通过数值实验,我们表明,在这种制度的梯度流算法是没有被困,它漂移远离虚假的临界点沿不稳定的方向,并成功地找到全局最小值。使用统计物理学的工具,我们描述了这种现象,这是一个BBP型过渡的Hessian的虚假极小值。

英文摘要:

Despite the widespread use of gradient-based algorithms for optimizing high-dimensional non-convex functions, understanding their ability of finding good minima instead of being trapped in spurious ones remains to a large extent an open problem. Here we focus on gradient flow dynamics for phase retrieval from random measurements. When the ratio of the number of measurements over the input dimension is small the dynamics remains trapped in spurious minima with large basins of attraction. We find analytically that above a critical ratio those critical points become unstable developing a negative direction toward the signal. By numerical experiments we show that in this regime the gradient flow algorithm is not trapped; it drifts away from the spurious critical points along the unstable direction and succeeds in finding the global minimum. Using tools from statistical physics we characterize this phenomenon, which is related to a BBP-type transition in the Hessian of the spurious minima.

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

↑