Key points are not available for this paper at this time.
We present a novel per-dimension learning rate method for gradient descent called ADADELTA. The method dynamically adapts over time using only first order information and has minimal computational overhead beyond vanilla stochastic gradient descent. The method requires no manual tuning of a learning rate and appears robust to noisy gradient information, different model architecture choices, various data modalities and selection of hyperparameters. We show promising results compared to other methods on the MNIST digit classification task using a single machine and on a large scale voice dataset in a distributed cluster environment.
Building similarity graph...
Analyzing shared references across papers
Loading...
Matthew D. Zeiler (Sat,) studied this question.
www.synapsesocial.com/papers/696402a893519ba8671d048f — DOI: https://doi.org/10.48550/arxiv.1212.5701
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:
Matthew D. Zeiler
Building similarity graph...
Analyzing shared references across papers
Loading...