activity
20152023
most citedConjugate-gradient-based Adam for stochastic optimization and its application to deep learning

5 citations · 16 across the 22 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

cs.LG2022

Critical Bach Size Minimizes Stochastic First-Order Oracle Complexity of Deep Learning Optimizer using Hyperparameters Close to One

Hideaki Iiduka

Practical results have shown that deep learning optimizers using small constant learning rates, hyperparameters close to one, and large batch sizes can find the model parameters of…

math.OC2022

Global Convergence of Hager-Zhang type Riemannian Conjugate Gradient Method

Hiroyuki Sakai, Hiroyuki Sato, Hideaki Iiduka

This paper presents the Hager-Zhang (HZ)-type Riemannian conjugate gradient method that uses the exponential retraction. We also present global convergence analyses of our proposed…

cs.LG2022

Theoretical analysis of Adam using hyperparameters close to one without Lipschitz smoothness

Hideaki Iiduka

Convergence and convergence rate analyses of adaptive methods, such as Adaptive Moment Estimation (Adam) and its variants, have been widely studied for nonconvex optimization. The…

cs.LG2022

Conjugate Gradient Method for Generative Adversarial Networks

Hiroki Naganuma, Hideaki Iiduka

One of the training strategies of generative models is to minimize the Jensen--Shannon divergence between the model distribution and the data distribution. Since data distribution…

cs.LG2022★ 2 cited

Existence and Estimation of Critical Batch Size for Training Generative Adversarial Networks with Two Time-Scale Update Rule

Naoki Sato, Hideaki Iiduka

Previous results have shown that a two time-scale update rule (TTUR) using different learning rates, such as different constant rates or different decaying rates, is useful for tra…