paper-with-me

Papers

Simple2Complex: Global Optimization by Gradient Descent

2016-05-02 · Ming Li

A method named simple2complex for modeling and training deep neural networks is proposed. Simple2complex train deep neural networks by smoothly adding more and more layers to the shallow networks, as the learning procedure going on, the network is just like growing. Compared with learning by end2end, simple2complex is with less possibility trapping into local minimal, namely, owning ability for global optimization. Cifar10 is used for verifying the superiority of simple2complex.

📄 PDF Abstract BibTeX arXiv:1605.00404

Code (0)

등록된 구현이 없습니다.

Tasks

global-optimization

Similar Papers 제목 키워드 기반

No Spurious Local Minima in a Two Hidden Unit ReLU Network

2018-01-01 · ICLR 2018 1 · Chenwei Wu, Jiajun Luo, Jason D. Lee

Deep learning models can be efficiently optimized via stochastic gradient descent, but there is little theoretical evidence to support this. A key question in optimization is to understand when the optimization landscape…

Vocal Bursts Valence Prediction

Learning to Learn without Gradient Descent by Gradient Descent

2016-11-11 · ICML 2017 8 · Yutian Chen, Matthew W. Hoffman, Sergio Gomez Colmenarejo, Misha Denil 외

We learn recurrent neural network optimizers trained on simple synthetic functions by gradient descent. We show that these learned optimizers exhibit a remarkable degree of transfer in that they can be used to efficientl…

Bayesian Optimizationglobal-optimization

Training Dynamics of Softmax Self-Attention: Fast Global Convergence via Preconditioning

2026-03-02 · Gautam Goel, Mahdi Soltanolkotabi, Peter Bartlett arxiv

We study the training dynamics of gradient descent in a softmax self-attention layer trained to perform linear regression and show that a simple first-order optimization algorithm can converge to the globally optimal sel…

Combining resampling and reweighting for faithful stochastic optimization

2021-05-31 · Jing An, Lexing Ying

Many machine learning and data science tasks require solving non-convex optimization problems. When the loss function is a sum of multiple terms, a popular method is the stochastic gradient descent. Viewed as a process f…

Computational chemistryStochastic Optimization

Continuous vs. Discrete Optimization of Deep Neural Networks

2021-07-14 · NeurIPS 2021 12 · Omer Elkabetz, Nadav Cohen

Existing analyses of optimization in deep learning are either continuous, focusing on (variants of) gradient flow, or discrete, directly treating (variants of) gradient descent. Gradient flow is amenable to theoretical a…

Computational EfficiencyDeep LearningLearning TheoryOpen-Ended Question Answering