arXiv:1805.08671

Adding One Neuron Can Eliminate All Bad Local Minima

Shiyu Liang, Ruoyu Sun, Jason D. Lee, R. Srikant

제출 2018-05-22

원문 초록

One of the main difficulties in analyzing neural networks is the non-convexity of the loss function which may have many bad local minima. In this paper, we study the landscape of neural networks for binary classification tasks. Under mild assumptions, we prove that after adding one special neuron with a skip connection to the output, or one special neuron per layer, every local minimum is a global minimum.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2506.21002공통 태그 Binary Classification공식 코드 · Papers with Code

Inverse Scene Text Removal

토론

이 논문과 연결된 포럼 글이 아직 없습니다.