Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,982 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.1% · Apr 201919922001200920172026
6 results for Nadam

Adam and similar methods fail to converge in some deep learning tasks.

problem Adam and similar methods fail to converge to optimal solutions in some deep learning tasks.
method Analysis of gradient updates scaled by square roots of exponential moving averages of squared past gradients. Proposed new variants of Adam with `long-term memory'.
result New variants of Adam algorithms fix convergence issues and often lead to improved empirical performance.

Adam optimization algorithm can have non-zero average regret under certain conditions.

problem Non-zero average regret in Adam optimization algorithm.
method Used a three-periodic sequence of linear functions on [-1,1] with slopes c, -1, -1, and analyzed Adam variants.
result Adam optimization algorithm can have non-zero average regret under certain conditions.

SGD methods fail to converge to global minimizers in deep neural networks with ReLU activation.

problem Failure of SGD methods to converge to global minimizers in deep neural networks.
method Stochastic Gradient Descent (SGD) and its variants like Adam, RMSProp, etc.
result SGD methods fail to converge to global minimizers with high probability in deep neural networks with ReLU activation.

A higher-order Runge-Kutta optimizer performs poorly compared to Adam when evaluated fairly.

problem Evaluating the performance of adaptive Runge-Kutta optimizers under strict conditions.
method Built and evaluated a representative Adam variant using a Bogacki-Shampine 3(2) RK pair, FSAL reuse, and local-error step control.
result The adaptive nature of the RK optimizer is illusory; it behaves like a fixed-step optimizer with gradient averaging.