HackerPapers

arXiv:1702.00458cs.DS

Convergence Results for Neural Networks via Electrodynamics

Rina Panigrahy, Sushant Sachdeva, Qiuyi Zhang

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We study whether a depth two neural network can learn another depth two network using gradient descent. Assuming a linear output node, we show that the question of whether gradient descent converges to the target function is equivalent to the following question in electrodynamics: Given $k$ fixed protons in $\mathbb{R}^d,$ and $k$ electrons, each moving due to the attractive force from the protons and repulsive force from the remaining electrons, whether at equilibrium all the electrons will be matched up with the protons, up to a permutation. Under the standard electrical force, this follows from the classic Earnshaw's theorem. In our setting, the force is determined by the activation function and the input distribution. Building on this equivalence, we prove the existence of an activation function such that gradient descent learns at least one of the hidden nodes in the target network. Iterating, we show that gradient descent can be used to learn the entire network one node at a time.

arXiv comments
in ITCS 2018
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms cs.LGMachine Learning physics.data-anData Analysis, Statistics and Probability

On Hacker News

No comments linking this paper were found in the collected sources. Found in 2 HN submissions from Feb 2017 to Feb 2017. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.