paper-with-me

홈 › Papers

Qualitatively characterizing neural network optimization problems

2014-12-19 · Ian J. Goodfellow, Oriol Vinyals, Andrew M. Saxe

Training neural networks involves solving large-scale non-convex optimization problems. This task has long been believed to be extremely difficult, with fear of local minima and other obstacles motivating a variety of schemes to improve optimization, such as unsupervised pretraining. However, modern neural networks are able to achieve negligible training error on complex tasks, using only direct training with stochastic gradient descent. We introduce a simple analysis technique to look for evidence that such networks are overcoming local optima. We find that, in fact, on a straight path from initialization to solution, a variety of state of the art neural networks never encounter any significant obstacles.

📄 PDF Abstract BibTeX arXiv:1412.6544

Code (1)

okn-yu/Visualizing-the-Loss-Landscape-of-Neural-Nets pytorch

Similar Papers 제목 키워드 기반

Revisiting "Qualitatively Characterizing Neural Network Optimization Problems"

2020-12-12 · NeurIPS Workshop DL-IG 2020 12 · Jonathan Frankle

We revisit and extend the experiments of Goodfellow et al. (2014), who showed that - for then state-of-the-art networks - "the objective function has a simple, approximately convex shape" along the linear path between in…

Adaptation Properties Allow Identification of Optimized Neural Codes

2020-10-28 · NeurIPS 2020 12 · Luke Rast, Jan Drugowitsch

The adaptation of neural codes to the statistics of their environment is well captured by efficient coding approaches. Here we solve an inverse problem: characterizing the objective and constraint functions that efficien…

Mathematical perspective on genetic algorithms with optimization guided operators

2026-06-10 · Anna Brandenberger, Ilan Doron-Arad, Elchanan Mossel arxiv

Recent work in ML applies genetic algorithms at inference time to iteratively improve solutions to optimization problems. The basic mutation and recombination operators involved are qualitatively different from those stu…

Reinforcement Learning

The Tradeoffs of Large Scale Learning

2007-12-01 · NeurIPS 2007 12 · Léon Bottou, Olivier Bousquet

This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for the case of small-scale and large-scale …

Optimization for Amortized Inverse Problems

2022-10-25 · Tianci Liu, Tong Yang, Quan Zhang, Qi Lei

Incorporating a deep generative model as the prior distribution in inverse problems has established substantial success in reconstructing images from corrupted observations. Notwithstanding, the existing optimization app…

Denoising