Original: C RITICAL B ATCH S IZE M INIMIZES S TOCHASTIC F
Revised: C RITICAL B ATCH S IZE M INIMIZES S TOCHASTIC F

Original: IRST
Revised: IRST

Original: O RDER
Revised: O RDER

Original: O RACLE C OMPLEXITY OF D EEP L EARNING O PTIMIZER USING H YPERPARAMETERS C LOSE TO O NE
Revised: O RACLE C OMPLEXITY OF D EEP L EARNING O PTIMIZER USING H YPERPARAMETERS C LOSE TO O NE

Original: Anonymous authors
Revised: Anonymous authors

Original: Paper under double-blind review
Revised: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: Practical results have shown that deep learning optimizers using small constant learning rates, hyperparameters close to one, and large batch sizes can ﬁnd the model parameters of deep neural networks that minimize the loss functions.
Revised: Practical results have shown that deep learning optimizers using small constant learning rates, hyperparameters close to one, and large batch sizes can ﬁnd the model parameters of deep neural networks that minimize the loss functions.

Original: We ﬁrst show theoretical evidence that the momentum method (Momentum) and adaptive moment estimation (Adam) perform well in the sense that the upper bound of the theoretical performance measure is small with a small constant learning rate, hyperparameters close to one, and a large batch size.
Revised: We ﬁrst show theoretical evidence that the momentum method (Momentum) and adaptive moment estimation (Adam) perform well in the sense that the upper bound of the theoretical performance measure is small with a small constant learning rate, hyperparameters close to one, and a large batch size.

Original: Next, we show that there exists a batch size called the critical batch size minimizing the stochastic ﬁrst-order oracle (SFO) complexity, which is the stochastic gradient computation cost, and that SFO complexity increases once the batch size exceeds the critical batch size.
Revised: Next, we show that there exists a batch size called the critical batch size minimizing the stochastic ﬁrst-order oracle (SFO) complexity, which is the stochastic gradient computation cost, and that SFO complexity increases once the batch size exceeds the critical batch size.

Original: Finally, we provide numerical results that support our theoretical results.
Revised: Finally, we provide numerical results that support our theoretical results.

Original: That is, the numerical results indicate that Adam using a small constant learning rate, hyperparameters close to one, and the critical batch size minimizing
Revised: That is, the numerical results indicate that Adam using a small constant learning rate, hyperparameters close to one, and the critical batch size minimizing

Original: SFO complexity has faster convergence than Momentum and stochastic gradient descent (SGD).
Revised: SFO complexity has faster convergence than Momentum and stochastic gradient descent (SGD).

Original:  I NTRODUCTION 1. B ACKGROUND
Revised:  I NTRODUCTION 1. B ACKGROUND

Original: Useful deep learning optimizers have been proposed to ﬁnd the model parameters of the deep neural networks that minimize loss functions called the expected risk and empirical risk, such as stochastic gradient descent (SGD) (Robbins & Monro, 1951; Zinkevich, 2003; Nemirovski et al., 2009; Ghadimi & Lan, 2012; 2013), momentum methods (Polyak, 1964; Nesterov, 1983), and adaptive methods.
Revised: Useful deep learning optimizers have been proposed to ﬁnd the model parameters of the deep neural networks that minimize loss functions called the expected risk and empirical risk, such as stochastic gradient descent (SGD) (Robbins & Monro, 1951; Zinkevich, 2003; Nemirovski et al., 2009; Ghadimi & Lan, 2012; 2013), momentum methods (Polyak, 1964; Nesterov, 1983), and adaptive methods.

Original: The various adaptive methods include Adaptive Gradient (AdaGrad) (Duchi et al., 2011), Root Mean Square Propagation (RMSProp) (Tieleman & Hinton, 2012), Adaptive Moment Estimation (Adam) (Kingma & Ba, 2015), Adaptive Mean Square Gradient (AMSGrad) (Reddi et al., 2018), Yogi (Zaheer et al., 2018), Adam with decoupled weight decay (AdamW) (Loshchilov & Hutter, 2019), and AdaBelief (named for adapting stepsizes by the belief in observed gradients)
Revised: The various adaptive methods include Adaptive Gradient (AdaGrad) (Duchi et al., 2011), Root Mean Square Propagation (RMSProp) (Tieleman & Hinton, 2012), Adaptive Moment Estimation (Adam) (Kingma & Ba, 2015), Adaptive Mean Square Gradient (AMSGrad) (Reddi et al., 2018), Yogi (Zaheer et al., 2018), Adam with decoupled weight decay (AdamW) (Loshchilov & Hutter, 2019), and AdaBelief (named for adapting stepsizes by the belief in observed gradients)

Original: (Zhuang et al., 2020).
Revised: (Zhuang et al., 2020).

Original: Theoretical analyses of adaptive methods for nonconvex optimization were presented in (Zaheer et al., 2018;
Revised: Theoretical analyses of adaptive methods for nonconvex optimization were presented in (Zaheer et al., 2018;

Original: Zou et al., 2019; Chen et al., 2019;
Revised: Zou et al., 2019; Chen et al., 2019;

Original: Zhou et al., 2020; Zhuang et al., 2020; Chen et al., 2021) (see (Jain et al., 2018; Fehrman et al., 2020; Chen et al., 2020;
Revised: Zhou et al., 2020; Zhuang et al., 2020; Chen et al., 2021) (see (Jain et al., 2018; Fehrman et al., 2020; Chen et al., 2020;

Original: Scaman & Malherbe, 2020; Loizou et al., 2021) for convergence analyses of SGD).
Revised: Scaman & Malherbe, 2020; Loizou et al., 2021) for convergence analyses of SGD).

Original: A particularly interesting feature of adaptive methods is the use of hyperparameters, denoted by β 1 and β 2 , that can be set to inﬂuence the method performance P( K ) :
Revised: A particularly interesting feature of adaptive methods is the use of hyperparameters, denoted by β 1 and β 2 , that can be set to inﬂuence the method performance P( K ) :

Original: = 1 K P K k =1 E [ ∥∇ f ( θ k ) ∥ 2 ] , where ∇ f is the gradient of a loss function f : R d → R , ( θ k )
Revised: = 1 K P K k =1 E [ ∥∇ f ( θ k ) ∥ 2 ] , where ∇ f is the gradient of a loss function f : R d → R , ( θ k )

Original: Kk =1 is the sequence generated by an optimizer, and K is the number of steps.
Revised: Kk =1 is the sequence generated by an optimizer, and K is the number of steps.

Original: The previous results are summarized in Table 1 indicating that using β 1 and/or β 2 close to 0 makes the upper bound of P( K ) small (see also Appendix A.1).
Revised: The previous results are summarized in Table 1 indicating that using β 1 and/or β 2 close to 0 makes the upper bound of P( K ) small (see also Appendix A.1).

Original: Meanwhile, practical results for adaptive methods were presented in (Kingma & Ba, 2015;
Revised: Meanwhile, practical results for adaptive methods were presented in (Kingma & Ba, 2015;

Original: Reddi et al., 2018;
Revised: Reddi et al., 2018;

Original: Zaheer et al., 2018; Zou et al., 2019; Chen et al., 2019; Zhuang et al., 2020;
Revised: Zaheer et al., 2018; Zou et al., 2019; Chen et al., 2019; Zhuang et al., 2020;

Original: Chen et al., 2021).
Revised: Chen et al., 2021).

Original: These studies have shown that using, for example, β 1 ∈ { 0 . 9 , 0 . 99 } and β 2 ∈ { 0 . 99 , 0 . 999 } provides superior performance for training deep neural networks.
Revised: These studies have shown that using, for example, β 1 ∈ { 0 . 9 , 0 . 99 } and β 2 ∈ { 0 . 99 , 0 . 999 } provides superior performance for training deep neural networks.

Original: The practically useful β 1 and β 2 are each close to 1 , whereas in contrast, the theoretical results (Table 1) show that using β 1 and/or β 2 close to 0 makes the upper bounds of the performance measures small.
Revised: The practically useful β 1 and β 2 are each close to 1 , whereas in contrast, the theoretical results (Table 1) show that using β 1 and/or β 2 close to 0 makes the upper bounds of the performance measures small.

Original: [Table]
Revised: [Table]

Original: (Chen et al., 2019)
Revised: (Chen et al., 2019)

Original: AMSGrad
Revised: AMSGrad

Original: [Equation]
Revised: [Equation]

Original: (Zhou et al., 2020)
Revised: (Zhou et al., 2020)

Original: AdaBelief
Revised: AdaBelief

Original: [Equation]
Revised: [Equation]

Original: (Zhuang et al., 2020)
Revised: (Zhuang et al., 2020)

Original: Padam
Revised: Padam

Original: [Equation]
Revised: [Equation]

Original: (Chen et al., 2021)
Revised: (Chen et al., 2021)

Original: Adam,
Revised: Adam,

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: (this paper)
Revised: (this paper)

Original: The practical performance of a deep learning optimizer strongly depends on the batch size.
Revised: The practical performance of a deep learning optimizer strongly depends on the batch size.

Original: In (Smith et al., 2018), it was numerically shown that using an enormous batch size leads to a reduction in the number of parameter updates and model training time.
Revised: In (Smith et al., 2018), it was numerically shown that using an enormous batch size leads to a reduction in the number of parameter updates and model training time.

Original: The theoretical results in (Zaheer et al., 2018) showed that using large batch sizes makes the upper bound of P( K ) of an adaptive method small (Table 1).
Revised: The theoretical results in (Zaheer et al., 2018) showed that using large batch sizes makes the upper bound of P( K ) of an adaptive method small (Table 1).

Original: Convergence analyses of SGD in (Cotter et al., 2011; Chen et al., 2020;
Revised: Convergence analyses of SGD in (Cotter et al., 2011; Chen et al., 2020;

Original: Arjevani et al., 2022) indicated that running SGD with a decaying learning rate and large batch size for sufﬁciently many steps leads to convergence to a local minimizer of a loss function.
Revised: Arjevani et al., 2022) indicated that running SGD with a decaying learning rate and large batch size for sufﬁciently many steps leads to convergence to a local minimizer of a loss function.

Original: Accordingly, the practical results for large batch sizes match the theoretical ones.
Revised: Accordingly, the practical results for large batch sizes match the theoretical ones.

Original: In (Shallue et al., 2019; Zhang et al., 2019), it was studied how increasing the batch size affects the performances of deep learning optimizers.
Revised: In (Shallue et al., 2019; Zhang et al., 2019), it was studied how increasing the batch size affects the performances of deep learning optimizers.

Original: In both studies, it was numerically shown that increasing batch size tends to decrease the number of steps K needed for training deep neural networks, but with diminishing returns.
Revised: In both studies, it was numerically shown that increasing batch size tends to decrease the number of steps K needed for training deep neural networks, but with diminishing returns.

Original: Moreover, it was shown that momentum methods can exploit larger batches than SGD (Shallue et al., 2019), and that K-FAC and Adam can exploit larger batches than momentum methods (Zhang et al., 2019).
Revised: Moreover, it was shown that momentum methods can exploit larger batches than SGD (Shallue et al., 2019), and that K-FAC and Adam can exploit larger batches than momentum methods (Zhang et al., 2019).

Original: 1. M OTIVATION 1.2. H YPERPARAMETERS CLOSE TO ONE AND CONSTANT LEARNING RATE
Revised: 1. M OTIVATION 1.2. H YPERPARAMETERS CLOSE TO ONE AND CONSTANT LEARNING RATE

Original: As described in Section 1.1, the practically useful β 1 and β 2 are each close to 1 , whereas in contrast, the theoretical results show that using β 1 and/or β 2 close to 0 makes the upper bounds of the performance measures small.
Revised: As described in Section 1.1, the practically useful β 1 and β 2 are each close to 1 , whereas in contrast, the theoretical results show that using β 1 and/or β 2 close to 0 makes the upper bounds of the performance measures small.

Original: Hence, there is a gap between theory ( β 1 , β 2 ≈ 0 ) and practice ( β 1 , β 2 ≈ 1 ) for adaptive methods.
Revised: Hence, there is a gap between theory ( β 1 , β 2 ≈ 0 ) and practice ( β 1 , β 2 ≈ 1 ) for adaptive methods.

Original: As a consequence, the ﬁrst motivation of this paper is to bridge this gap.
Revised: As a consequence, the ﬁrst motivation of this paper is to bridge this gap.

Original: Since using small constant learning rates is robust for training deep neural networks (Kingma & Ba, 2015; Reddi et al., 2018;
Revised: Since using small constant learning rates is robust for training deep neural networks (Kingma & Ba, 2015; Reddi et al., 2018;

Original: Zaheer et al., 2018; Zou et al., 2019; Chen et al., 2019; Zhuang et al., 2020;
Revised: Zaheer et al., 2018; Zou et al., 2019; Chen et al., 2019; Zhuang et al., 2020;

Original: Chen et al., 2021), we focus on using a small constant learning rate α .
Revised: Chen et al., 2021), we focus on using a small constant learning rate α .

Original: Here, we note that using a learning rate depending on the Lipschitz constant L of the gradient of a loss function f would be unrealistic.
Revised: Here, we note that using a learning rate depending on the Lipschitz constant L of the gradient of a loss function f would be unrealistic.

Original: This is because computing the Lipschitz constant L is NP-hard (Virmaux & Scaman, 2018, Theorem 2).
Revised: This is because computing the Lipschitz constant L is NP-hard (Virmaux & Scaman, 2018, Theorem 2).

Original: The results using varying learning rates are given in Appendix A.6.
Revised: The results using varying learning rates are given in Appendix A.4.

Original: 1.2. C RITICAL BATCH SIZE
Revised: 1.2. C RITICAL BATCH SIZE

Original: The second motivation of this paper is to clarify theoretically the relationship between the diminishing returns reported in (Shallue et al., 2019; Zhang et al., 2019) and batch size.
Revised: The second motivation of this paper is to clarify theoretically the relationship between the diminishing returns reported in (Shallue et al., 2019; Zhang et al., 2019) and batch size.

Original: Numerical evaluations in (Shallue et al., 2019; Zhang et al., 2019) have deﬁnitively shown that, for deep learning optimizers, the number of steps K needed to train a deep neural network halves for each doubling of the batch size b and that there is a region of diminishing returns beyond the critical batch size b ⋆ .
Revised: Numerical evaluations in (Shallue et al., 2019; Zhang et al., 2019) have deﬁnitively shown that, for deep learning optimizers, the number of steps K needed to train a deep neural network halves for each doubling of the batch size b and that there is a region of diminishing returns beyond the critical batch size b ⋆ .

Original: This implies that there is a positive number C such that
Revised: This implies that there is a positive number C such that

Original: [Equation]
Revised: [Equation]

Original: where K and b are deﬁned for i, j ∈ N by K = 2 i and b = 2 j (For example, Figure 1 in Section 4 shows C
Revised: where K and b are deﬁned for i, j ∈ N by K = 2 i and b = 2 j (For example, Figure 1 in Section 4 shows C

Original: ≈ 20 and b ⋆ ≈ 2 11 for Adam used to train ResNet-20 on the CIFAR-10 dataset).
Revised: ≈ 20 and b ⋆ ≈ 2 11 for Adam used to train ResNet-20 on the CIFAR-10 dataset).

Original: We deﬁne the stochastic ﬁrst-order oracle (SFO) complexity of a deep learning optimizer as N :=
Revised: We deﬁne the stochastic ﬁrst-order oracle (SFO) complexity of a deep learning optimizer as N :=

Original: Kb on the basis of the number of steps K needed for training the deep neural network and the batch size b used in the optimizer.
Revised: Kb on the basis of the number of steps K needed for training the deep neural network and the batch size b used in the optimizer.

Original: Let b ⋆ be a critical batch size such that there are diminishing returns for all batch sizes beyond b ⋆ , as asserted in (Shallue et al., 2019; Zhang et al., 2019).
Revised: Let b ⋆ be a critical batch size such that there are diminishing returns for all batch sizes beyond b ⋆ , as asserted in (Shallue et al., 2019; Zhang et al., 2019).

Original: This fact, expressed in (1), implies that, while SFO complexity N initially almost does not change (i.e., K halves for each doubling of b ), N is minimized at critical batch size b ⋆ , and there are diminishing returns once the batch size exceeds b ⋆ .
Revised: This fact, expressed in (1), implies that, while SFO complexity N initially almost does not change (i.e., K halves for each doubling of b ), N is minimized at critical batch size b ⋆ , and there are diminishing returns once the batch size exceeds b ⋆ .

Original: 1. C ONTRIBUTION
Revised: 1. C ONTRIBUTION

Original: Our results are summarized in Table 2 (see also the “(this paper)” column of Table 1).
Revised: Our results are summarized in Table 2 (see also the “(this paper)” column of Table 1).

Original: Our goal is to ﬁnd a local minimizer of a loss function f over R d , i.e., a stationary point θ ⋆ ∈ R d satisfying ∇ f ( θ ⋆ ) = 0 , which is equivalent to the variational inequality (VI) deﬁned for all θ ∈ R d by ∇
Revised: Our goal is to ﬁnd a local minimizer of a loss function f over R d , i.e., a stationary point θ ⋆ ∈ R d satisfying ∇ f ( θ ⋆ ) = 0 , which is equivalent to the variational inequality (VI) deﬁned for all θ ∈ R d by ∇

Original: f ( θ ⋆ ) ⊤ ( θ ⋆ − θ ) ≤ 0 .
Revised: f ( θ ⋆ ) ⊤ ( θ ⋆ − θ ) ≤ 0 .

Original: Here, we show the relationship between (i) E [ ∇
Revised: Here, we show the relationship between (i) E [ ∇

Original: f ( θ k ) ⊤ ( θ k − θ )] ≤ ϵ ( θ ∈ R d , k ∈ N ) and (ii) E [ ∥∇ f ( θ k ) ∥ 2 ] ≤ ϵ ( k ∈ N ) , where ϵ > 0 is the precision.
Revised: f ( θ k ) ⊤ ( θ k − θ )] ≤ ϵ ( θ ∈ R d , k ∈ N ) and (ii) E [ ∥∇ f ( θ k ) ∥ 2 ] ≤ ϵ ( k ∈ N ) , where ϵ > 0 is the precision.

Original: Let us assume that ( θ k ) k ∈ N is bounded.
Revised: Let us assume that ( θ k ) k ∈ N is bounded.

Original: Suppose that (i) holds.
Revised: Suppose that (i) holds.

Original: Then, there exists a subsequence ( θ k i ) i ∈ N of ( θ k ) k ∈ N such that ( θ k i ) i ∈ N converges to θ ∗ .
Revised: Then, there exists a subsequence ( θ k i ) i ∈ N of ( θ k ) k ∈ N such that ( θ k i ) i ∈ N converges to θ ∗ .

Original: The continuity of ∇ f thus implies that, for all θ ∈ R d , E [ ∇ f ( θ ∗ ) ⊤ ( θ ∗ − θ )] ≤ ϵ .
Revised: The continuity of ∇ f thus implies that, for all θ ∈ R d , E [ ∇ f ( θ ∗ ) ⊤ ( θ ∗ − θ )] ≤ ϵ .

Original: Putting θ := θ ∗ −∇ f ( θ ∗ ) ensures that E [ ∥∇ f ( θ ∗ ) ∥ 2 ] ≤ ϵ .
Revised: Putting θ := θ ∗ −∇ f ( θ ∗ ) ensures that E [ ∥∇ f ( θ ∗ ) ∥ 2 ] ≤ ϵ .

Original: Suppose that (ii) holds.
Revised: Suppose that (ii) holds.

Original: Then, the deﬁnition of the inner product and Jensen’s inequality imply that, for all θ ∈ R d , E [ ∇ f ( θ k ) ⊤ ( θ k − θ )] ≤ Dist( θ ) √ ϵ , where Dist( θ ) :
Revised: Then, the deﬁnition of the inner product and Jensen’s inequality imply that, for all θ ∈ R d , E [ ∇ f ( θ k ) ⊤ ( θ k − θ )] ≤ Dist( θ ) √ ϵ , where Dist( θ ) :

Original: = sup {∥ θ k − θ ∥ : k ∈ N } < + ∞ .
Revised: = sup {∥ θ k − θ ∥ : k ∈ N } < + ∞ .

Original: Therefore, it is adequate to use (i) and ϵ -approximation VI( K, θ ) :
Revised: Therefore, it is adequate to use (i) and ϵ -approximation VI( K, θ ) :

Original: = 1 K P Kk =1 E [ ∇ f ( θ k ) ⊤ ( θ k − θ )] ≤ ϵ (Table 2) as the performance measure of an optimizer.
Revised: = 1 K P Kk =1 E [ ∇ f ( θ k ) ⊤ ( θ k − θ )] ≤ ϵ (Table 2) as the performance measure of an optimizer.

Original: 1.3. A DVANTAGE OF SETTING A SMALL CONSTANT LEARNING RATE AND HYPERPARAMETERS CLOSE TO ONE
Revised: 1.3. A DVANTAGE OF SETTING A SMALL CONSTANT LEARNING RATE AND HYPERPARAMETERS CLOSE TO ONE

Original: We can show that the upper bound C 1 K + C 2 b
Revised: We can show that the upper bound C 1 K + C 2 b

Original: + C 3 of VI( K, θ ) becomes small when α is small, βand β 2 are close to 1 , and K is large.
Revised: + C 3 of VI( K, θ ) becomes small when α is small, βand β 2 are close to 1 , and K is large.

Original: This implies that Momentum and Adam perform well when α is small and β 1 and β 2 are each set close to 1 .
Revised: This implies that Momentum and Adam perform well when α is small and β 1 and β 2 are each set close to 1 .

Original: Section 3.1 shows this result in detail.
Revised: Section 3.1 shows this result in detail.

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table]
Revised: [Table]

Original: C RITICAL BATCH SIZE
Revised: C RITICAL BATCH SIZE

Original: As described in Section 1.2.
Revised: As described in Section 1.2.

Original: [Table]
Revised: [Table]

Original: the practical performance of a deep learning optimizer strongly depends on the batch size (Shallue et al., 2019; Zhang et al., 2019).
Revised: the practical performance of a deep learning optimizer strongly depends on the batch size (Shallue et al., 2019; Zhang et al., 2019).

Original: The advantage of this paper is to clarify theoretically the relationship between batch size and the performance of deep learning optimizers and develop a theory demonstrating the existence of critical batch sizes, which was shown numerically by (Shallue et al., 2019; Zhang et al., 2019).
Revised: The advantage of this paper is to clarify theoretically the relationship between batch size and the performance of deep learning optimizers and develop a theory demonstrating the existence of critical batch sizes, which was shown numerically by (Shallue et al., 2019; Zhang et al., 2019).

Original: Motivated by the results in (Shallue et al., 2019; Zhang et al., 2019) and Section 1.2.2, we use SFO complexity N :=
Revised: Motivated by the results in (Shallue et al., 2019; Zhang et al., 2019) and Section 1.2.2, we use SFO complexity N :=

Original: Kb as the performance measure of a deep learning optimizer.
Revised: Kb as the performance measure of a deep learning optimizer.

Original: We ﬁrst show that the number of steps K to satisfy VI( K, θ ) ≤ ϵ can be deﬁned as in Table 2.
Revised: We ﬁrst show that the number of steps K to satisfy VI( K, θ ) ≤ ϵ can be deﬁned as in Table 2.

Original: As a function, K is convex and monotone decreasing with respect to batch size b .
Revised: As a function, K is convex and monotone decreasing with respect to batch size b .

Original: Next, we show that SFO complexity N deﬁned as in Table 2 is convex with respect to batch size b .
Revised: Next, we show that SFO complexity N deﬁned as in Table 2 is convex with respect to batch size b .

Original: This result agrees with the fact of (1).
Revised: This result agrees with the fact of (1).

Original: Moreover, SFO complexity N is minimized at b ⋆ deﬁned as in Table 2.
Revised: Moreover, SFO complexity N is minimized at b ⋆ deﬁned as in Table 2.

Original: This result guarantees the existence of the critical batch size b ⋆ .
Revised: This result guarantees the existence of the critical batch size b ⋆ .

Original: Section 3.2 shows the above results in detail.
Revised: Section 3.2 shows the above results in detail.

Original: However, the accurate setting of the critical batch size b
Revised: However, the accurate setting of the critical batch size b

Original: ⋆ deﬁned as in Table 2 would be difﬁcult since b ⋆ involves unknown parameters, such as
Revised: ⋆ deﬁned as in Table 2 would be difﬁcult since b ⋆ involves unknown parameters, such as

Original: G and D ( θ ) (see Section 2.2.3).
Revised: G and D ( θ ) (see Section 2.2.3).

Original: The advantage of our analysis is that we can estimate appropriate batch sizes using the formula for b ⋆ before implementing deep learning optimizers.
Revised: The advantage of our analysis is that we can estimate appropriate batch sizes using the formula for b ⋆ before implementing deep learning optimizers.

Original: Section 4 will discuss estimation of appropriate batch sizes in detail.
Revised: Section 4 will discuss estimation of appropriate batch sizes in detail.

Original:  N ONCONVEX O PTIMIZATION AND D EEP L EARNING O PTIMIZERS
Revised:  N ONCONVEX O PTIMIZATION AND D EEP L EARNING O PTIMIZERS

Original: This section gives a nonconvex optimization problem in deep neural networks and optimizers for solving the problem under standard assumptions.
Revised: This section gives a nonconvex optimization problem in deep neural networks and optimizers for solving the problem under standard assumptions.

Original: 2. N ONCONVEX OPTIMIZATION IN DEEP LEARNING
Revised: 2. N ONCONVEX OPTIMIZATION IN DEEP LEARNING

Original: Let R d be a d -dimensional Euclidean space with inner product ⟨ x , y ⟩ := x ⊤ y inducing the norm ∥ x ∥ and N be the set of nonnegative integers.
Revised: Let R d be a d -dimensional Euclidean space with inner product ⟨ x , y ⟩ := x ⊤ y inducing the norm ∥ x ∥ and N be the set of nonnegative integers.

Original: Deﬁne [ n ] := { 1 , 2 , . . . , n } for n ≥ 1 .
Revised: Deﬁne [ n ] := { 1 , 2 , . . . , n } for n ≥ 1 .

Original: Given a parameter θ ∈ R d and a data point z in a data domain Z , a machine learning model provides a prediction whose quality is measured by a differentiable nonconvex loss function ℓ ( θ ; z ) .
Revised: Given a parameter θ ∈ R d and a data point z in a data domain Z , a machine learning model provides a prediction whose quality is measured by a differentiable nonconvex loss function ℓ ( θ ; z ) .

Original: We aim to minimize the expected loss deﬁned for all θ ∈ R d by f ( θ ) =
Revised: We aim to minimize the expected loss deﬁned for all θ ∈ R d by f ( θ ) =

Original: E z
Revised: E z

Original: ∼D
Revised: ∼D

Original: [ ℓ ( θ ; z )]
Revised: [ ℓ ( θ ; z )]

Original: =
Revised: =

Original: E [ ℓ ξ ( θ )] , where D is a probability distribution over Z , ξ denotes a random variable with distribution function P , and E [ · ] denotes the expectation taken with respect to ξ .
Revised: E [ ℓ ξ ( θ )] , where D is a probability distribution over Z , ξ denotes a random variable with distribution function P , and E [ · ] denotes the expectation taken with respect to ξ .

Original: A particularly interesting example of f ( θ ) is the empirical average loss deﬁned for all θ ∈ R d by f ( θ ; S )
Revised: A particularly interesting example of f ( θ ) is the empirical average loss deﬁned for all θ ∈ R d by f ( θ ; S )

Original: = 1 n P i ∈ [ n ] ℓ ( θ ; z i ) =
Revised: = 1 n P i ∈ [ n ] ℓ ( θ ; z i ) =

Original: 1 n P i ∈ [ n ] ℓ i ( θ ) , where S
Revised: 1 n P i ∈ [ n ] ℓ i ( θ ) , where S

Original: =
Revised: =

Original: ( z 1 , z 2 , . . .
Revised: ( z 1 , z 2 , . . .

Original: , z n ) denotes the training set and ℓ i ( · ) :=
Revised: , z n ) denotes the training set and ℓ i ( · ) :=

Original: ℓ ( · ; z i ) denotes the loss function corresponding to the i -th training data z i .
Revised: ℓ ( · ; z i ) denotes the loss function corresponding to the i -th training data z i .

Original: 2. D EEP LEARNING OPTIMIZERS 2.2. C ONDITIONS
Revised: 2. D EEP LEARNING OPTIMIZERS 2.2. C ONDITIONS

Original: We assume that a stochastic ﬁrst-order oracle (SFO) exists such that, for a given θ ∈ R d , it returns a stochastic gradient G ξ ( θ ) of the function f , where a random variable ξ is supported on Ξ independently of θ .
Revised: We assume that a stochastic ﬁrst-order oracle (SFO) exists such that, for a given θ ∈ R d , it returns a stochastic gradient G ξ ( θ ) of the function f , where a random variable ξ is supported on Ξ independently of θ .

Original: The following are standard conditions when considering a deep learning optimizer.
Revised: The following are standard conditions when considering a deep learning optimizer.

Original: (C1)
Revised: (C1)

Original: f : R d → R is continuously differentiable.
Revised: f : R d → R is continuously differentiable.

Original: (C2)
Revised: (C2)

Original: Let ( θ k ) k ∈ N ⊂ R
Revised: Let ( θ k ) k ∈ N ⊂ R

Original: d be the sequence generated by a deep learning optimizer.
Revised: d be the sequence generated by a deep learning optimizer.

Original: For each iteration k , E ξ k
Revised: For each iteration k , E ξ k

Original: [ G ξ k ( θ k )] = ∇ f ( θ k ) , where ξ 0 , ξ 1 , . .
Revised: [ G ξ k ( θ k )] = ∇ f ( θ k ) , where ξ 0 , ξ 1 , . .

Original: . are independent samples and the random variable ξ k is independent of ( θ l ) kl =0 .
Revised: . are independent samples and the random variable ξ k is independent of ( θ l ) kl =0 .

Original: There exists a nonnegative constant σ 2 such that E
Revised: There exists a nonnegative constant σ 2 such that E

Original: [Equation]
Revised: [Equation]

Original: (C3)
Revised: (C3)

Original: For each iteration k , the optimizer samples a batch B k of size b independently of k and estimates the full gradient ∇ f as ∇ f B k ( θ k ) :
Revised: For each iteration k , the optimizer samples a batch B k of size b independently of k and estimates the full gradient ∇ f as ∇ f B k ( θ k ) :

Original: = 1 b P i ∈ [ b ] G ξ k,i ( θ k ) , where ξ k,i is a random variable generated by the i
Revised: = 1 b P i ∈ [ b ] G ξ k,i ( θ k ) , where ξ k,i is a random variable generated by the i

Original: -th sampling in the k -th iteration.
Revised: -th sampling in the k -th iteration.

Original: A DAM
Revised: A DAM

Original: Algorithm 1 is the Adam optimizer (Kingma & Ba, 2015) under (C1)–(C3).
Revised: Algorithm 1 is the Adam optimizer (Kingma & Ba, 2015) under (C1)–(C3).

Original: The symbol ⊙ in step 6 is deﬁned for all x = ( x i ) di
Revised: The symbol ⊙ in step 6 is deﬁned for all x = ( x i ) di

Original: =1 ∈ R d , x ⊙ x := ( x 2 i ) di
Revised: =1 ∈ R d , x ⊙ x := ( x 2 i ) di

Original: =1 ∈ R d , and diag ( x i ) in step 8 is a diagonal matrix with diagonal components x 1 , x 2 , . . .
Revised: =1 ∈ R d , and diag ( x i ) in step 8 is a diagonal matrix with diagonal components x 1 , x 2 , . . .

Original: , x d .
Revised: , x d .

Original: Require: α ∈ (0 , + ∞ ) , b ∈ (0 , + ∞ ) , β 1 ∈ (0 , 1) , β 2 ∈ [0 , 1) 1: k ← 0 , θ 0 ∈ R d , m − 1 := 0 , v − 1 :=2: loop 3: ∇ f B k ( θ k ) :
Revised: Require: α ∈ (0 , + ∞ ) , b ∈ (0 , + ∞ ) , β 1 ∈ (0 , 1) , β 2 ∈ [0 , 1) 1: k ← 0 , θ 0 ∈ R d , m − 1 := 0 , v − 1 :=2: loop 3: ∇ f B k ( θ k ) :

Original: = 1 b
Revised: = 1 b

Original: P i ∈ [ b ] G ξ k,i ( θ k ) 4: m k :=
Revised: P i ∈ [ b ] G ξ k,i ( θ k ) 4: m k :=

Original: β 1 m k − 1 + (1 − β 1 ) ∇ f B k ( θ k ) 5:
Revised: β 1 m k − 1 + (1 − β 1 ) ∇ f B k ( θ k ) 5:

Original: ˆ m k :=
Revised: ˆ m k :=

Original: (1 − β k + ) − 1 m k 6: v k :=
Revised: (1 − β k + ) − 1 m k 6: v k :=

Original: β 2 v k − 1 + (1 − β 2 ) ∇ f B k ( θ k ) ⊙ ∇ f B k ( θ k ) 7: ˆ v k :=
Revised: β 2 v k − 1 + (1 − β 2 ) ∇ f B k ( θ k ) ⊙ ∇ f B k ( θ k ) 7: ˆ v k :=

Original: (1 − β k + ) − 1 v k 8:
Revised: (1 − β k + ) − 1 v k 8:

Original: H k := diag ( p ˆ v k,i ) 9: θ k +1 :
Revised: H k := diag ( p ˆ v k,i ) 9: θ k +1 :

Original: = θ k − α H − 1 k ˆ m k 10: k ← k +11: end loop
Revised: = θ k − α H − 1 k ˆ m k 10: k ← k +11: end loop

Original: The SGD optimizer under (C1)–(C3) is Algorithm 1 when β 1 = 

Revised: The SGD optimizer under (C1)–(C3) is Algorithm 1 when β 1 =

Original: and H k is the identity matrix.
Revised: and H k is the identity matrix.

Original: The Momentum optimizer under (C1)–(C3) is deﬁned for all k ∈ N by θ k
Revised: The Momentum optimizer under (C1)–(C3) is deﬁned for all k ∈ N by θ k

Original: +1 :
Revised: +1 :

Original: = θ k − α m k .
Revised: = θ k − α m k .

Original: 2.2. A SSUMPTIONS
Revised: 2.2. A SSUMPTIONS

Original: We assume the following conditions that were used in (Kingma & Ba, 2015, Theorem 4.1):
Revised: We assume the following conditions that were used in (Kingma & Ba, 2015, Theorem 4.1):

Original: (A1)
Revised: (A1)

Original: There exist positive numbers G and B such that, for all k ∈ N , ∥∇ f ( θ k ) ∥ ≤ G and ∥∇ f B k ( θ k ) ∥ ≤ B (see also Appendix A.7).
Revised: There exist positive numbers G and B such that, for all k ∈ N , ∥∇ f ( θ k ) ∥ ≤ G and ∥∇ f B k ( θ k ) ∥ ≤ B (see also Appendix A.5).

Original: (A2)
Revised: (A2)

Original: For all θ ∈ R d , there exists a positive number Dist( θ ) such that, for all k ∈ N , ∥ θ k − θ ∥ ≤ Dist( θ ) .
Revised: For all θ ∈ R d , there exists a positive number Dist( θ ) such that, for all k ∈ N , ∥ θ k − θ ∥ ≤ Dist( θ ) .

Original: Let ( g 2 k,i ) di =1 :=
Revised: Let ( g 2 k,i ) di =1 :=

Original: ∇ f B k ( θ k ) ⊙ ∇ f B k ( θ k ) ( k ∈ N ) .
Revised: ∇ f B k ( θ k ) ⊙ ∇ f B k ( θ k ) ( k ∈ N ) .

Original: Assumption (A1) implies that M := sup { max i ∈ [ d ] g 2 k,i : k ∈ N } < + ∞ .
Revised: Assumption (A1) implies that M := sup { max i ∈ [ d ] g 2 k,i : k ∈ N } < + ∞ .

Original: Assumption (A2) implies that D ( θ ) :
Revised: Assumption (A2) implies that D ( θ ) :

Original: = sup { max i ∈
Revised: = sup { max i ∈

Original: [ d ] ( θ k,i − θ i ) 2 : k ∈ N } < + ∞ .
Revised: [ d ] ( θ k,i − θ i ) 2 : k ∈ N } < + ∞ .

Original: We deﬁne v ∗ := inf { min i ∈
Revised: We deﬁne v ∗ := inf { min i ∈

Original: [ d ] v k,i : k ∈ N } .
Revised: [ d ] v k,i : k ∈ N } .

Original: Theorem 3 in (Reddi et al., 2018) shows that there exists a stochastic convex optimization problem such that Adam using β 1 < √ β 2 (e.g., β 1 = 0 .
Revised: Theorem 3 in (Reddi et al., 2018) shows that there exists a stochastic convex optimization problem such that Adam using β 1 < √ β 2 (e.g., β 1 = 0 .

Original: 9 and β 2 = 0 .
Revised: 9 and β 2 = 0 .

Original: 999 ) does not converge to the optimal solution.
Revised: 999 ) does not converge to the optimal solution.

Original: If for all k ∈ N and all i ∈
Revised: If for all k ∈ N and all i ∈

Original: [ d ] , ˆ v k,i in Adam satisﬁes
Revised: [ d ] , ˆ v k,i in Adam satisﬁes

Original: [Equation]
Revised: [Equation]

Original: then Adam with a decaying learning rate α k
Revised: then Adam with a decaying learning rate α k

Original: = O ( 1 √ k ) and β 1 and β 2 satisfying β 1 < √ β 2 can solve the stochastic convex optimization problem (Reddi et al., 2018, (2), Theorem 4).
Revised: = O ( 1 √ k ) and β 1 and β 2 satisfying β 1 < √ β 2 can solve the stochastic convex optimization problem (Reddi et al., 2018, (2), Theorem 4).

Original: We thus assume condition (2) for Adam to guarantee the convergence of Adam.
Revised: We thus assume condition (2) for Adam to guarantee the convergence of Adam.

Original:  O UR R ESULTS
Revised:  O UR R ESULTS

Original: This section states our theoretical results (Theorem 3.1) in Table 2 and our contribution (Sections 3.1 and 3.2) in detail.
Revised: This section states our theoretical results (Theorem 3.1) in Table 2 and our contribution (Sections 3.1 and 3.2) in detail.

Original: The proof of Theorem 3.1 is given in Appendix A.2–A.5.
Revised: The proof of Theorem 3.1 is given in Appendix A.3.

Original: Theorem 3.1.
Revised: Theorem 3.1.

Original: The sequence ( θ k ) k ∈ N generated by each of SGD, Momentum, and Adam with (2) under (C1)–(C3) and (A1) and (A2) satisﬁes the following:
Revised: The sequence ( θ k ) k ∈ N generated by each of SGD, Momentum, and Adam with (2) under (C1)–(C3) and (A1) and (A2) satisﬁes the following:

Original: (i)
Revised: (i)

Original: [Upper bound of VI( K, θ ) ]
Revised: [Upper bound of VI( K, θ ) ]

Original: For all K ≥ 1 and all θ ∈ R d ,
Revised: For all K ≥ 1 and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: where C i ( i = 1 , 2 , 3) for SGD are
Revised: where C i ( i = 1 , 2 , 3) for SGD are

Original: [Equation]
Revised: [Equation]

Original: C i ( i = 1 , 2 , 3) for Momentum are
Revised: C i ( i = 1 , 2 , 3) for Momentum are

Original: [Equation]
Revised: [Equation]

Original: C i ( i = 1 , 2 , 3) for Adam with (2) are
Revised: C i ( i = 1 , 2 , 3) for Adam with (2) are

Original: [Equation]
Revised: [Equation]

Original: and the parameters are deﬁned as in Section 2.2.
Revised: and the parameters are deﬁned as in Section 2.2.

Original: (ii) [Steps to satisfy VI( K, θ ) ≤ ϵ ]
Revised: (ii) [Steps to satisfy VI( K, θ ) ≤ ϵ ]

Original: The number of steps K deﬁned by
Revised: The number of steps K deﬁned by

Original: [Equation]
Revised: [Equation]

Original: satisﬁes VI( K, θ ) ≤ ϵ and the function K ( b ) deﬁned by (3) is convex and monotone decreasing with respect to batch size b ( > C 2 ϵ − C 3 > 0)
Revised: satisﬁes VI( K, θ ) ≤ ϵ and the function K ( b ) deﬁned by (3) is convex and monotone decreasing with respect to batch size b ( > C 2 ϵ − C 3 > 0)

Original: (see also Appendix A.8 for the condition ϵ − C 3 > 0 ).
Revised: (see also Appendix A.6 for the condition ϵ − C 3 > 0 ).

Original: (iii)
Revised: (iii)

Original: [Minimization of SFO complexity]
Revised: [Minimization of SFO complexity]

Original: The SFO complexity deﬁned by
Revised: The SFO complexity deﬁned by

Original: [Equation]
Revised: [Equation]

Original: is convex with respect to batch size b ( > C 2 ϵ − C 3 > 0) .
Revised: is convex with respect to batch size b ( > C 2 ϵ − C 3 > 0) .

Original: The batch size
Revised: The batch size

Original: [Equation]

Original: [Equation]
Revised: [Equation]

Original:  attains the minimum value N ⋆ = K ( b ⋆ ) b ⋆ = 4 C 1 C 2 ( ϵ − C 3 ) 2 of N .
Revised: (5) attains the minimum value N ⋆ = K ( b ⋆ ) b ⋆ = 4 C 1 C 2 ( ϵ − C 3 ) 2 of N .

Original: The proof of Theorem 3.1(i) ensures that C i ( i = 1 , 2 , 3) of AMSGrad (Algorithm 1 with ˆ m k
Revised: The proof of Theorem 3.1(i) ensures that C i ( i = 1 , 2 , 3) of AMSGrad (Algorithm 1 with ˆ m k

Original: = m k , ˆ v k = v k , ˜ v k,i := max { ˜ v k − 1 ,i , v k,i } (i.e., ˜ v k +1 ,i ≥ ˜ v k,i ; see (2)), and
Revised: = m k , ˆ v k = v k , ˜ v k,i := max { ˜ v k − 1 ,i , v k,i } (i.e., ˜ v k +1 ,i ≥ ˜ v k,i ; see (2)), and

Original: H k :=
Revised: H k :=

Original: diag ( p ˜ v k,i ) ) are
Revised: diag ( p ˜ v k,i ) ) are

Original: [Equation]
Revised: [Equation]

Revised: where ˜ v − 1 := 0 and ˜ v ∗ := inf { min i ∈

Revised: [ d ] ˜ v k,i : k ∈ N } (see Appendix A.3.4).

Original: We give a brief outline of the proof strategy of Theorem 3.1, with an emphasis on the main difﬁculty that has to be overcome in order not to assume Lipschitz smoothness of f (i.e., ∇ f is Lipschitz continuous with the Lipschitz constant L ).
Revised: We give a brief outline of the proof strategy of Theorem 3.1, with an emphasis on the main difﬁculty that has to be overcome in order not to assume Lipschitz smoothness of f (i.e., ∇ f is Lipschitz continuous with the Lipschitz constant L ).

Original: First, we show that (C2) and (A1) imply that ( E [ ∥ m k ∥ ]) k ∈ N and ( E [ ∥ d k ∥ ]) k ∈ N are bounded, where d k := − H − 1 k ˆ m k .
Revised: First, we show that (C2) and (A1) imply that ( E [ ∥ m k ∥ ]) k ∈ N and ( E [ ∥ d k ∥ ]) k ∈ N are bounded, where d k := − H − 1 k ˆ m k .

Original: Since we do not assume Lipschitz smoothness of f , we cannot use the descent lemma, i.e., f ( y ) ≤ f ( x ) + ∇ f ( x ) ⊤ ( y − x ) + L 2 ∥ y − x ∥
Revised: Since we do not assume Lipschitz smoothness of f , we cannot use the descent lemma, i.e., f ( y ) ≤ f ( x ) + ∇ f ( x ) ⊤ ( y − x ) + L 2 ∥ y − x ∥

Original: ( x , y ∈ R d ) .
Revised: ( x , y ∈ R d ) .

Original: This is the main difﬁculty to prove Theorem 3.1.
Revised: This is the main difﬁculty to prove Theorem 3.1.

Original: Almost all of the previous analyses of adaptive methods are based on the descent lemma, and hence, they can use the expectation of the squared norm of the full gradient E [ ∥∇ f ( θ k ) ∥ 2 ] as the performance measure.
Revised: Almost all of the previous analyses of adaptive methods are based on the descent lemma, and hence, they can use the expectation of the squared norm of the full gradient E [ ∥∇ f ( θ k ) ∥ 2 ] as the performance measure.

Original: Accordingly, we must use other performance measures that are different from E [ ∥∇ f ( θ k ) ∥ 2 ] .
Revised: Accordingly, we must use other performance measures that are different from E [ ∥∇ f ( θ k ) ∥ 2 ] .

Original: This paper uses the performance measure VI( K, θ ) .
Revised: This paper uses the performance measure VI( K, θ ) .

Original: We next show that P Kk =1 E [ m ⊤ k − 1 ( θ k − θ )] ≤ a K + b K + c K ≤
Revised: We next show that P Kk =1 E [ m ⊤ k − 1 ( θ k − θ )] ≤ a K + b K + c K ≤

Original: C 1 + C 2 Kb + ˜ C 3 K , where C 1 and C 2 are deﬁned as in Theorem 3.1 and ˜ C 3 > 0 .
Revised: C 1 + C 2 Kb + ˜ C 3 K , where C 1 and C 2 are deﬁned as in Theorem 3.1 and ˜ C 3 > 0 .

Original: In particular, (2), (A1), and (A2) imply a K ≤ C 1 , the boundedness condition of ( E [ ∥ d k ∥ ]) k ∈ N implies b K ≤ C 2 Kb , and (A2) and the Cauchy–Schwarz inequality imply c K ≤ ˜ C 3 K .
Revised: In particular, (2), (A1), and (A2) imply a K ≤ C 1 , the boundedness condition of ( E [ ∥ d k ∥ ]) k ∈ N implies b K ≤ C 2 Kb , and (A2) and the Cauchy–Schwarz inequality imply c K ≤ ˜ C 3 K .

Original: The deﬁnition of m k , the Cauchy–
Revised: The deﬁnition of m k , the Cauchy–

Original: Schwarz inequality, the triangle inequality, and Jensen’s inequality imply Theorem 3.1(i).
Revised: Schwarz inequality, the triangle inequality, and Jensen’s inequality imply Theorem 3.1(i).

Original: Theorem 3.1(i) and C 1 K + C 2 b + C 3 =
Revised: Theorem 3.1(i) and C 1 K + C 2 b + C 3 =

Original: ϵ lead to Theorem 3.1(ii) and (iii).
Revised: ϵ lead to Theorem 3.1(ii) and (iii).

Original: 3. A DVANTAGE OF SETTING A SMALL CONSTANT LEARNING RATE AND HYPERPARAMETERS CLOSE TO ONE
Revised: 3. A DVANTAGE OF SETTING A SMALL CONSTANT LEARNING RATE AND HYPERPARAMETERS CLOSE TO ONE

Original: We ﬁrst show theoretical evidence that Adam using a small constant learning rate α , β 1 and β 2 close to 1 , and a large number of steps K performs well.
Revised: We ﬁrst show theoretical evidence that Adam using a small constant learning rate α , β 1 and β 2 close to 1 , and a large number of steps K performs well.

Original: Theorem 3.1(i) indicates that the upper bound of
Revised: Theorem 3.1(i) indicates that the upper bound of

Original: VI( K, θ ) for Adam is
Revised: VI( K, θ ) for Adam is

Original: [Equation]
Revised: [Equation]

Original: where β 1 ∈ (0 , 1) , β 2 ∈ [0 , 1) , and
Revised: where β 1 ∈ (0 , 1) , β 2 ∈ [0 , 1) , and

Original: [Equation]
Revised: [Equation]

Original: (the strict evaluation (6) of Theorem 3.1(i) comes from (29) in Appendix A).
Revised: (the strict evaluation (7) of Theorem 3.1(i) comes from (30) in Appendix A).

Original: Since the function h ( β 1 ) deﬁned by (7) is monotone decreasing, using β 1 close to 1 makes h ( β 1 ) small.
Revised: Since the function h ( β 1 ) deﬁned by (8) is monotone decreasing, using β 1 close to 1 makes h ( β 1 ) small.

Original: Since 1 β 1 (1 − β 1 ) is monotone increasing for β 1 ≥ 1 / 2 , using β 1 close to 1 makes 1 β 1 (1 − β 1 ) large.
Revised: Since 1 β 1 (1 − β 1 ) is monotone increasing for β 1 ≥ 1 / 2 , using β 1 close to 1 makes 1 β 1 (1 − β 1 ) large.

Original: Hence, we need to set a small α to make α ( σ 2 b − 1 + G 2 ) 2 √ v ∗ β 1 (1 − β 1 ) small.
Revised: Hence, we need to set a small α to make α ( σ 2 b − 1 + G 2 ) 2 √ v ∗ β 1 (1 − β 1 ) small.

Original: The function q
Revised: The function q

Original: [Equation]
Revised: [Equation]

Original:  is monotone decreasing with respect to β 2 , while using β 2 close to 1 makes 1 √ 1 − β 2 large.
Revised: − β k + is monotone decreasing with respect to β 2 , while using β 2 close to 1 makes 1 √ 1 − β 2 large.

Original: When β 2 close to 1 and a small learning rate α are used, we need to use a large number of steps K to make
Revised: When β 2 close to 1 and a small learning rate α are used, we need to use a large number of steps K to make

Original: [Equation]
Revised: [Equation]

Original: 3. C RITICAL BATCH SIZE
Revised: 3. C RITICAL BATCH SIZE

Original: Theorem 3.1(ii) indicates that the number of steps K to satisfy VI( K, θ ) ≤ ϵ can be expressed as (3).
Revised: Theorem 3.1(ii) indicates that the number of steps K to satisfy VI( K, θ ) ≤ ϵ can be expressed as (3).

Original: The function K ( b ) deﬁned by (3) is convex and monotone decreasing.
Revised: The function K ( b ) deﬁned by (3) is convex and monotone decreasing.

Original: Hence, the form of
Revised: Hence, the form of

Original: K deﬁned by (3) supports theoretically the relationship between K and b shown in (Shallue et al., 2019; Zhang et al., 2019) (see also Figures 1 and 3 in this paper).
Revised: K deﬁned by (3) supports theoretically the relationship between K and b shown in (Shallue et al., 2019; Zhang et al., 2019) (see also Figures 1 and 3 in this paper).

Original: Theorem 3.1(iii) indicates that
Revised: Theorem 3.1(iii) indicates that

Original: SFO complexity deﬁned by (4) is convex with respect to batch size b .
Revised: SFO complexity deﬁned by (4) is convex with respect to batch size b .

Original: This result agrees with the fact of (1) (see also Figures 2 and 4 in this paper).
Revised: This result agrees with the fact of (1) (see also Figures 2 and 4 in this paper).

Original: Moreover, SFO complexity N :=
Revised: Moreover, SFO complexity N :=

Original: Kb is minimized at b ⋆ deﬁned by (5); e.g., b ⋆ S for SGD, b ⋆ M for Momentum, and b ⋆ A for Adam are respectively
Revised: Kb is minimized at b ⋆ deﬁned by (5); e.g., b ⋆ S for SGD, b ⋆ M for Momentum, and b ⋆ A for Adam are respectively

Original: [Equation]
Revised: [Equation]

Original: where σ S , σ M , and σ A are positive constants depending on SGD, Momentum, and Adam and C 3 =
Revised: where σ S , σ M , and σ A are positive constants depending on SGD, Momentum, and Adam and C 3 =

Original: C 3 , S , C 3 , M , C 3 , A are positive constants deﬁned as in Theorem 3.1.
Revised: C 3 , S , C 3 , M , C 3 , A are positive constants deﬁned as in Theorem 3.1.

Original: From (8), the lower bounds b ∗ of b ⋆ S , b ⋆ M , and b ⋆ A are respectively
Revised: From (9), the lower bounds b ∗ of b ⋆ S , b ⋆ M , and b ⋆ A are respectively

Original: [Equation]
Revised: [Equation]

Original:  N UMERICAL R ESULTS
Revised:  N UMERICAL R ESULTS

Original: We evaluated the performances of SGD, Momentum, and Adam with different batch sizes.
Revised: We evaluated the performances of SGD, Momentum, and Adam with different batch sizes.

Original: The metrics were the number of steps K and the SFO complexity Kb satisfying f ( θ K ) ≤ 10 − 1 , where θ K is generated for each of SGD, Momentum, and Adam using batch size b .
Revised: The metrics were the number of steps K and the SFO complexity Kb satisfying f ( θ K ) ≤ 10 − 1 , where θ K is generated for each of SGD, Momentum, and Adam using batch size b .

Original: The stopping condition was 200 epochs.
Revised: The stopping condition was 200 epochs.

Original: The experimental environment consisted of two Intel(R)
Revised: The experimental environment consisted of two Intel(R)

Original: Xeon(R) Gold 6148 2.4GHz CPUs with 20 cores each, a 16-GB NVIDIA Tesla V100 900-Gbps GPU, and the Red Hat
Revised: Xeon(R) Gold 6148 2.4GHz CPUs with 20 cores each, a 16-GB NVIDIA Tesla V100 900-Gbps GPU, and the Red Hat

Original: Enterprise Linux 7.6 OS.
Revised: Enterprise Linux 7.6 OS.

Original: The code was written in Python 3.8.2 using the NumPy 1.17.3 and PyTorch 1.3.0 packages.
Revised: The code was written in Python 3.8.2 using the NumPy 1.17.3 and PyTorch 1.3.0 packages.

Original: A constant learning rate α = 10 − 3 was commonly used.
Revised: A constant learning rate α = 10 − 3 was commonly used.

Original: Momentum used β 1 = 0 .
Revised: Momentum used β 1 = 0 .

Original: Adam used β 1 = 0 .
Revised: Adam used β 1 = 0 .

Original: 9 and β 2 = 0 .
Revised: 9 and β 2 = 0 .

Original: 999 (Kingma & Ba, 2015).
Revised: 999 (Kingma & Ba, 2015).

Original: Here, we use (9) and estimate appropriate batch sizes in the sense that SFO complexity is minimized.
Revised: Here, we use (10) and estimate appropriate batch sizes in the sense that SFO complexity is minimized.

Original: The deﬁnitions of v ∗ and v k,i (see also (24) in Appendix A) imply that, for k ∈
Revised: The deﬁnitions of v ∗ and v k,i (see also (25) in Appendix A) imply that, for k ∈

Original: [ K ] and all i ∈ [ d ] ,
Revised: [ K ] and all i [Equation]

Original: [Equation]
Revised: [Equation]

Original:  implies that E [ ∥∇ f B k ( θ k ) ∥ 2 ] ≤ σ 2 b + E [ ∥∇ f ( θ k ) ∥ 2 ] (see also (13) in Appendix A).
Revised: dition (C2) implies that E [ ∥∇ f B k ( θ k ) ∥ 2 ] ≤ σ 2 b + E [ ∥∇ f ( θ k ) ∥ 2 ] (see also (14) in Appendix A).

Original: Conditions (C2) and (C3) imply that, if b is large, then σ is small.
Revised: Conditions (C2) and (C3) imply that, if b is large, then σ is small.

Original: Hence, assuming that σ 2 b ≈ 0 implies that v ∗ ≤ ∥∇ f
Revised: Hence, assuming that σ 2 b ≈ 0 implies that v ∗ ≤ ∥∇ f

Original: ( θ k ∗ ) ∥ 2 = 
Revised: ( θ k ∗ ) ∥ 2 = ∥

Original: [Equation]
Revised: [Equation]

Original: P
Revised: P

Original: [Equation]
Revised: [Equation]

Revised: [ n ] ∇

Original: [Equation]
Revised: [Equation]

Revised: =

Original: [Equation]
Revised: [Equation]

Original:  Since deep learning optimizers can approximate stationary points of f , we assume that, for example, G k ∗ ,i ≈ ϵ .
Revised: i . Since deep learning optimizers can approximate stationary points of f , we assume that, for example, G k ∗ ,i ≈ ϵ .

Original: Then, (9) implies that
Revised: Then, (10) implies that

Original: [Equation]
Revised: [Equation]

Original: Conditions (C2) and (C3) imply that, if b is large, then σ is small.
Revised: Conditions (C2) and (C3) imply that, if b is large, then σ is small.

Original: If SGD and Momentum can exploit large batch sizes, then σ S and σ M are small.
Revised: If SGD and Momentum can exploit large batch sizes, then σ S and σ M are small.

Original: However, (10) implies that b ∗ S and b ∗ M must be small when σ S and σ M are small.
Revised: However, (11) implies that b ∗ S and b ∗ M must be small when σ S and σ M are small.

Original: Accordingly, SGD and Momentum would not be able to use large batch sizes.
Revised: Accordingly, SGD and Momentum would not be able to use large batch sizes.

Original: Meanwhile, from (10), we expect that Adam can exploit a large batch size b ⋆ A > b ∗ A > b ∗∗ A , for example, when b ∗∗ A < 2 11 (CIFAR-10; n = 50000 , ResNet-20; d ≈ 1 . 1 × 10 7 , b ∗∗ A ≈ 1600 ) and 2 10 <
Revised: Meanwhile, from (11), we expect that Adam can exploit a large batch size b ⋆ A > b ∗ A > b ∗∗ A , for example, when b ∗∗ A < 2 11 (CIFAR-10; n = 50000 , ResNet-20; d ≈ 1 . 1 × 10 7 , b ∗∗ A ≈ 1600 ) and 2 10 <

Original: b
Revised: b

Original: ∗∗
Revised: ∗∗

Original: A < 2 11 (MNIST; n = 60000 , ResNet-18; d ≈ 1 . 

Revised: A < 2 11 (MNIST; n = 60000 , ResNet-18; d ≈ 1 .

Original: × 10 7 , b ∗∗ A ≈ 2000 )
Revised: × 10 7 , b ∗∗ A ≈ 2000 )

Original: (He et al., 2016;
Revised: (He et al., 2016;

Original: Leong et al., 2020), where σ 2A ≈ 10 − 2 and ϵ ≈ 10 − 3 are used.
Revised: Leong et al., 2020), where σ 2A ≈ 10 − 2 and ϵ ≈ 10 − 3 are used.

Original: 4. R ES N ET -20 ON THE CIFAR-10 DATASET
Revised: 4. R ES N ET -20 ON THE CIFAR-10 DATASET

Original: [Figure]
Revised: [Figure]

Original:  There  such that the number of steps K for Adam is inversely proportional to batch size b .
Revised: tum, and Adam versus batch size needed to train ResNet-20 on CIFAR-10. There is an initial period of perfect scaling (indicated by dashed line) such that the number of steps K for Adam is inversely proportional to batch size b .

Original: Adam has critical batch size b ⋆ = 2 11 .
Revised: Adam has critical batch size b ⋆ = 2 11 .

Original: [Figure]
Revised: [Figure]

Original: [Figure]

Original: [Figure]
Revised: [Figure]

Original: S F O ×

Revised: S F O ×

Original: SGDMomentumAdam
Revised: SGDMomentumAdam

Original: Let us consider training ResNet-20 on the CIFAR-10 dataset with n = 50000 .
Revised: Let us consider training ResNet-20 on the CIFAR-10 dataset with n = 50000 .

Original: Figure 1 shows the number of steps for SGD, Momentum, and Adam versus batch size.
Revised: Figure 1 shows the number of steps for SGD, Momentum, and Adam versus batch size.

Original: For SGD and Momentum, the number of steps K needed for f ( θ K ) ≤ 10 − 1 initially decreased.
Revised: For SGD and Momentum, the number of steps K needed for f ( θ K ) ≤ 10 − 1 initially decreased.

Original: However, SGD with b ≥ 2 6 and
Revised: However, SGD with b ≥ 2 6 and

Original: Momentum with b ≥ 2 10 did not satisfy f ( θ K ) ≤ 10 − 1 before the stopping condition was reached.
Revised: Momentum with b ≥ 2 10 did not satisfy f ( θ K ) ≤ 10 − 1 before the stopping condition was reached.

Original: Adam had an initial period of perfect scaling (indicated by dashed line) such that the number of steps K needed for f ( θ K ) ≤ 10 − 1 was inversely proportional to batch size b , and critical batch size b ⋆ = 2 11 such that K was not inversely proportional to the batch size beyond b ⋆ ; i.e., there were diminishing returns.
Revised: Adam had an initial period of perfect scaling (indicated by dashed line) such that the number of steps K needed for f ( θ K ) ≤ 10 − 1 was inversely proportional to batch size b , and critical batch size b ⋆ = 2 11 such that K was not inversely proportional to the batch size beyond b ⋆ ; i.e., there were diminishing returns.

Original: Figure 2 plots the SFO complexities for SGD, Momentum, and Adam versus batch size.
Revised: Figure 2 plots the SFO complexities for SGD, Momentum, and Adam versus batch size.

Original: For SGD,
Revised: For SGD,

Original: SFO complexity was minimum at b ⋆ = 2 2 ; for Momentum, it was minimum at b ⋆ = 2 3 .
Revised: SFO complexity was minimum at b ⋆ = 2 2 ; for Momentum, it was minimum at b ⋆ = 2 3 .

Original: This implies that SGD and Momentum could not use large batch sizes, as shown in (10).
Revised: This implies that SGD and Momentum could not use large batch sizes, as shown in (11).

Original: For Adam,
Revised: For Adam,

Original: SFO complexity was minimum at the critical batch size b ⋆ = 2 11 that was close to estimation of critical batch
Revised: SFO complexity was minimum at the critical batch size b ⋆ = 2 11 that was close to estimation of critical batch

Original: b ⋆ A > b ∗∗ A with 1600 ≈ b ∗∗ A < b ⋆ A = 2 11 = 2048 , as shown in (10).
Revised: b ⋆ A > b ∗∗ A with 1600 ≈ b ∗∗ A < b ⋆ A = 2 11 = 2048 , as shown in (11).

Original: We also checked that the elapsed time for Adam monotonically decreased for b ≤ 2 11 and that the elapsed time for critical batch size b ⋆ = 2 11 was the shortest.
Revised: We also checked that the elapsed time for Adam monotonically decreased for b ≤ 2 11 and that the elapsed time for critical batch size b ⋆ = 2 11 was the shortest.

Original: The elapsed time for b ≥ 2 12 increased with the SFO complexity, as shown in Figure 2 (see Tables 3, 4, 5, and 6 in Appendix A).
Revised: The elapsed time for b ≥ 2 12 increased with the SFO complexity, as shown in Figure 2 (see Tables 3, 4, 5, and 6 in Appendix A).

Original: 4. R ES N ET -18 ON THE MNIST DATASET
Revised: 4. R ES N ET -18 ON THE MNIST DATASET

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: Let us consider training ResNet-18 on the MNIST dataset with n = 60000 .
Revised: Let us consider training ResNet-18 on the MNIST dataset with n = 60000 .

Original: Figures 3 and 4 indicate that Adam could exploit larger batch sizes than SGD and Momentum.
Revised: Figures 3 and 4 indicate that Adam could exploit larger batch sizes than SGD and Momentum.

Original: Moreover, these ﬁgures indicate that Momentum minimized SFO complexity at the critical batch size b ⋆ = 2 3 and Adam minimized SFO complexity at the critical batch size b ⋆ = 2 10 that was close to estimation of critical batch
Revised: Moreover, these ﬁgures indicate that Momentum minimized SFO complexity at the critical batch size b ⋆ = 2 3 and Adam minimized SFO complexity at the critical batch size b ⋆ = 2 10 that was close to estimation of critical batch

Original: b ⋆ A > b ∗∗ A with 2 10 < b ∗∗ A ≈ 2000 < 2 11 , as shown in (10).
Revised: b ⋆ A > b ∗∗ A with 2 10 < b ∗∗ A ≈ 2000 < 2 11 , as shown in (11).

Original: We can also check that the elapsed time for critical batch size b ⋆ = 2 10 was the shortest (see Tables 7, 8, 9, and 10 in Appendix A).
Revised: We can also check that the elapsed time for critical batch size b ⋆ = 2 10 was the shortest (see Tables 7, 8, 9, and 10 in Appendix A).

Original: We also estimated appropriate batch sizes of Adam for (i) CNN on MNIST ( n = 60000 , d ≈ 7 .
Revised: We also estimated appropriate batch sizes of Adam for (i) CNN on MNIST ( n = 60000 , d ≈ 7 .

Original: 7 × 10 6 ) and (ii) ResNet-32 on CIFAR-10 ( n = 50000 , d ≈ 2 . 

Revised: 7 × 10 6 ) and (ii) ResNet-32 on CIFAR-10 ( n = 50000 , d ≈ 2 .

Original: × 10 7 ) from b ∗∗ A in (10) and checked that actual critical batch sizes in (Zhang et al., 2019, Figure 5(a), (e)) are close to estimated batch sizes ((i) b ⋆ A = 2 11 = 2048 >
Revised: × 10 7 ) from b ∗∗ A in (11) and checked that actual critical batch sizes in (Zhang et al., 2019, Figure 5(a), (e)) are close to estimated batch sizes ((i) b ⋆ A = 2 11 = 2048 >

Original: b ∗∗ A ≈ 2000 , (ii) b ⋆ A = 2 10 = 1024 ≈ b ∗∗ A ≈ 1200 ).
Revised: b ∗∗ A ≈ 2000 , (ii) b ⋆ A = 2 10 = 1024 ≈ b ∗∗ A ≈ 1200 ).

Original:  C ONCLUSION
Revised:  C ONCLUSION

Original: This paper showed the relationship between batch size b and the number of steps K to achieve an ϵ -approximation of deep learning optimizers using a small constant learning rate α and hyperparameters β 1 and β 2 close to 1 .
Revised: This paper showed the relationship between batch size b and the number of steps K to achieve an ϵ -approximation of deep learning optimizers using a small constant learning rate α and hyperparameters β 1 and β 2 close to 1 .

Original: From the convexity of SFO complexity N , there exists a global minimizer b ⋆ of N that is the critical batch size.
Revised: From the convexity of SFO complexity N , there exists a global minimizer b ⋆ of N that is the critical batch size.

Original: We also gave numerical results indicating that Adam using a small constant learning rate, hyperparameters close to one, and the critical batch size has faster convergence than Momentum and SGD.
Revised: We also gave numerical results indicating that Adam using a small constant learning rate, hyperparameters close to one, and the critical batch size has faster convergence than Momentum and SGD.

Original: Moreover, we estimated appropriate batch sizes from our formula for b ⋆ and showed that actual critical batch sizes are close to estimated batch sizes.
Revised: Moreover, we estimated appropriate batch sizes from our formula for b ⋆ and showed that actual critical batch sizes are close to estimated batch sizes.

Original: A A PPENDIX
Revised: A A PPENDIX

Original: Unless stated otherwise all relationships between random variables are supposed to hold almost surely.
Revised: Unless stated otherwise all relationships between random variables are supposed to hold almost surely.

Original: Let S be a positive deﬁnite matrix which is denoted by S ∈ S d ++ .
Revised: Let S be a positive deﬁnite matrix which is denoted by S ∈ S d ++ .

Original: The S -inner product of
Revised: The S -inner product of

Original: R d is deﬁned for all x , y ∈ R d by ⟨ x , y ⟩ S :
Revised: R d is deﬁned for all x , y ∈ R d by ⟨ x , y ⟩ S :

Original: = ⟨ x , S y ⟩ = x ⊤ ( S y ) and the S -norm is deﬁned by ∥ x ∥ S :
Revised: = ⟨ x , S y ⟩ = x ⊤ ( S y ) and the S -norm is deﬁned by ∥ x ∥ S :

Original: = p ⟨ x , S x ⟩ .
Revised: = p ⟨ x , S x ⟩ .

Original: A. P REVIOUS RESULTS IN T ABLE
Revised: A. P REVIOUS RESULTS IN T ABLE

Original: This section provides the upper bounds of the performance measure of optimizers indicated in Table 1.
Revised: This section provides the upper bounds of the performance measure of optimizers indicated in Table 1.

Original: A.1. T AIL - AVERAGED SGD
Revised: A.1. T AIL - AVERAGED SGD

Original: We consider the stochastic approximation problem of least square regression that is to minimize the expected square loss function f ( θ ) :
Revised: We consider the stochastic approximation problem of least square regression that is to minimize the expected square loss function f ( θ ) :

Original: = 12 E ( x ,y ) ∼D [ y − x ⊤ θ ] (see Section 2.1 for the mathematical preliminaries).
Revised: = 12 E ( x ,y ) ∼D [ y − x ⊤ θ ] (see Section 2.1 for the mathematical preliminaries).

Original: Tail-averaged SGD (Jain et al., 2018, Algorithm 1) with a constant learning rate α depending on the batch size b and the largest eigenvalue of the Hessian of f satisﬁes
Revised: Tail-averaged SGD (Jain et al., 2018, Algorithm 1) with a constant learning rate α depending on the batch size b and the largest eigenvalue of the Hessian of f satisﬁes

Original: [Equation]
Revised: [Equation]

Original: where s is the initial iterations, and n is the total samples, µ > 0 is the smallest eigenvalue of the
Revised: where s is the initial iterations, and n is the total samples, µ > 0 is the smallest eigenvalue of the

Original: Hessian of f , ( θ i ) i>s is the sequence generated by Tail-averaged SGD, and ¯ θ :=
Revised: Hessian of f , ( θ i ) i>s is the sequence generated by Tail-averaged SGD, and ¯ θ :=

Original: ⌊ nb ⌋− s
Revised: ⌊ nb ⌋− s

Original: [Equation]
Revised: [Equation]

Original: s
Revised: s

Original: [Equation]
Revised: [Equation]

Original: (Jain et al., 2018, Theorem 1).
Revised: (Jain et al., 2018, Theorem 1).

Original: The upper bound of Tail-averaged SGD when K :=
Revised: The upper bound of Tail-averaged SGD when K :=

Original: nb − s is
Revised: nb − s is

Original: [Equation]
Revised: [Equation]

Original: A.1. A DAM
Revised: A.1. A DAM

Original: Theorem 1 in (Zaheer et al., 2018) and the proof of Theorem 1 in (Zaheer et al., 2018) show that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , Adam using α
Revised: Theorem 1 in (Zaheer et al., 2018) and the proof of Theorem 1 in (Zaheer et al., 2018) show that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , Adam using α

Original: = O ( L − 1 ) , β 1 = 0 , and β 2 ≥ 1 − O
Revised: = O ( L − 1 ) , β 1 = 0 , and β 2 ≥ 1 − O

Original: G − 2 ) satisﬁes
Revised: G − 2 ) satisﬁes

Original:  K
Revised:  K

Original: [Equation]
Revised: [Equation]

Original: that is, the upper bound of Adam with β 1 = 0 is
Revised: that is, the upper bound of Adam with β 1 = 0 is

Original: [Equation]
Revised: [Equation]

Original: A.1. G ENERIC A DAM
Revised: A.1. G ENERIC A DAM

Original: Theorem 4 in (Zou et al., 2019) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , Generic Adam using α k
Revised: Theorem 4 in (Zou et al., 2019) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , Generic Adam using α k

Original: = O ( 1 √ k ) , β 1 ∈ (0 , 1)
Revised: = O ( 1 √ k ) , β 1 ∈ (0 , 1)

Original: [Equation]
Revised: [Equation]

Original: and β 2 k = 1 − αk + satisﬁes
Revised: and β 2 k = 1 − αk + satisﬁes

Original: [Equation]
Revised: [Equation]

Original: where τ is randomly chosen from { 1 , 2 , . .
Revised: where τ is randomly chosen from { 1 , 2 , . .

Original: , K } , α > 0 , γ ∈ (0 , 1) , v
Revised: , K } , α > 0 , γ ∈ (0 , 1) , v

Original: [Equation]
Revised: [Equation]

Original: i
Revised: i

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: D
Revised: D

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: θ 1 ) − f ( θ ⋆ ) .
Revised: θ 1 ) − f ( θ ⋆ ) .

Original: This implies that the upper bound of Generic Adam is
Revised: This implies that the upper bound of Generic Adam is

Original: [Equation]
Revised: [Equation]

Original: (see also Corollary 10 in (Zou et al., 2019) when s = 1 2 and r = 1 ).
Revised: (see also Corollary 10 in (Zou et al., 2019) when s = 1 2 and r = 1 ).

Original: A.1. A DA F OM
Revised: A.1. A DA F OM

Original: Corollary 3.2 in (Chen et al., 2019) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , the AdaGrad with First Order Momentum (AdaFom) algorithm using α k = 1 √ k and β 1 ∈ (0 , 1) satisﬁes
Revised: Corollary 3.2 in (Chen et al., 2019) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , the AdaGrad with First Order Momentum (AdaFom) algorithm using α k = 1 √ k and β 1 ∈ (0 , 1) satisﬁes

Original: [Equation]
Revised: [Equation]

Original: X
Revised: X

Original: [Equation]
Revised: [Equation]

Original: K , where ¯ G > 0 , c > 0 ,
Revised: K , where ¯ G > 0 , c > 0 ,

Original: Q 1 := G (cid:26)
Revised: Q 1 := G (cid:26)

Original: D
Revised: D

Original: [Equation]
Revised: [Equation]

Original: − log
Revised: − log

Original: [Equation]
Revised: [Equation]

Original: c
Revised: c

Original: [Equation]
Revised: [Equation]

Original: ) + 2 log
Revised: ) + 2 log

Original: [Equation]
Revised: [Equation]

Original: + D 2 d c + D 3 d c 2 + D(cid:27) , Q 2 :=
Revised: + D 2 d c + D 3 d c 2 + D(cid:27) , Q 2 :=

Original: GD 1 d,
Revised: GD 1 d,

Original: D 1 := 3 2 L + 1 2 + L 2 β 1 1 − β(cid:18) 1 − β(cid:19), D 2 := G(cid:18)
Revised: D 1 := 3 2 L + 1 2 + L 2 β 1 1 − β(cid:18) 1 − β(cid:19), D 2 := G(cid:18)

Original: β1 − β 1 +(cid:19) ,
Revised: β1 − β 1 +(cid:19) ,

Original: D 3 := G( 1 + (cid:18)
Revised: D 3 := G( 1 + (cid:18)

Original: L 1 − β(cid:19)β1 − β) (cid:18) β1 − β(cid:19),
Revised: L 1 − β(cid:19)β1 − β) (cid:18) β1 − β(cid:19),

Original: D 4 :=
Revised: D 4 :=

Original: (cid:18) β1 − β(cid:19)
Revised: (cid:18) β1 − β(cid:19)

Original: ( G 2 + ¯ G 2 ) + (cid:18) β1 − β(cid:19)¯
Revised: ( G 2 + ¯ G 2 ) + (cid:18) β1 − β(cid:19)¯

Original: G 2 + 2 α 1 G 2 E
Revised: G 2 + 2 α 1 G 2 E

Original: (cid:20)(cid:13) (cid:13)(cid:13)(cid:13) 1 √ ˆ v(cid:13) (cid:13)(cid:13)(cid:13) (cid:21) + E [ f ( θ 1 ) − f
Revised: (cid:20)(cid:13) (cid:13)(cid:13)(cid:13) 1 √ ˆ v(cid:13) (cid:13)(cid:13)(cid:13) (cid:21) + E [ f ( θ 1 ) − f

Original: ( θ ⋆ )] .
Revised: ( θ ⋆ )] .

Original: A.1. AMSG RAD
Revised: A.1. AMSG RAD

Original: Theorem 3 in (Zhou et al., 2020) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , AMSGrad using a constant learning rate α and β 1 and β 2 with β 1 < √ β 2 satisﬁes
Revised: Theorem 3 in (Zhou et al., 2020) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , AMSGrad using a constant learning rate α and β 1 and β 2 with β 1 < √ β 2 satisﬁes

Original: [Equation]
Revised: [Equation]

Original: where s ∈ (0 , 12 ) , G ∞ > 0 , γ > 0 ,
Revised: where s ∈ (0 , 12 ) , G ∞ > 0 , γ > 0 ,

Original: [Equation]
Revised: [Equation]

Original: Hence, the upper bound of AMSGrad is
Revised: Hence, the upper bound of AMSGrad is

Original: [Equation]
Revised: [Equation]

Original: A.1. A DA B ELIEF
Revised: A.1. A DA B ELIEF

Original: Theorem 2.2 in (Zhuang et al., 2020) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , AdaBelief using α k = α √ k , where α > 0 , and β 1 , β 2 ∈ (0 , 1) satisﬁes
Revised: Theorem 2.2 in (Zhuang et al., 2020) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , AdaBelief using α k = α √ k , where α > 0 , and β 1 , β 2 ∈ (0 , 1) satisﬁes

Original: [Equation]
Revised: [Equation]

Original: where c > 0 , ¯ G > 0 ,
Revised: where c > 0 , ¯ G > 0 ,

Original: [Equation]
Revised: [Equation]

Original: G
Revised: G

Original: [Equation]
Revised: [Equation]

Original: A.1. P ADAM
Revised: A.1. P ADAM

Original: Corollary 4.5 in (Chen et al., 2021) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , the Partially adaptive momentum estimation (Padam) method using a constant learning rate α , p ∈ [0 , 14 ] , and β 1 and β 2 with β 1 < β 2 p 2 satisﬁes
Revised: Corollary 4.5 in (Chen et al., 2021) shows that, under the condition that ∇ f is Lipschitz continuous with the Lipschitz constant L , the Partially adaptive momentum estimation (Padam) method using a constant learning rate α , p ∈ [0 , 14 ] , and β 1 and β 2 with β 1 < β 2 p 2 satisﬁes

Original: [Equation]
Revised: [Equation]

Original: where s ∈ (0 , 12 ) , G ∞ > 0 ,
Revised: where s ∈ (0 , 12 ) , G ∞ > 0 ,

Original: [Equation]
Revised: [Equation]

Original: Hence, the upper bound of Padam is
Revised: Hence, the upper bound of Padam is

Original: [Equation]
Revised: [Equation]

Original: A. L EMMAS
Revised: A. L EMMAS

Original: Lemma A.1.
Revised: Lemma A.1.

Original: Suppose that (C1), (C2), and (C3) hold.
Revised: Suppose that (C1), (C2), and (C3) hold.

Original: Then, Adam satisﬁes the following: for all k ∈ N and all θ ∈ R d ,
Revised: Then, Adam satisﬁes the following: for all k ∈ N and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: where d k := − H − 1 k ˆ m k , ˆ β 1 := 1 − β 1 , and ˜ β 1 k := 1 − β k + .
Revised: where d k := − H − 1 k ˆ m k , ˆ β 1 := 1 − β 1 , and ˜ β 1 k := 1 − β k + .

Original: Proof.
Revised: Proof.

Original: Let θ ∈ R d and k ∈ N .
Revised: Let θ ∈ R d and k ∈ N .

Original: The deﬁnition θ k +1 :
Revised: The deﬁnition θ k +1 :

Original: = θ k + α d k implies that
Revised: = θ k + α d k implies that

Original: [Equation]
Revised: [Equation]

Original: Moreover, the deﬁnitions of d k
Revised: Moreover, the deﬁnitions of d k

Original: [Equation]
Revised: [Equation]

Original: m k
Revised: m k

Original: [Equation]
Revised: [Equation]

Original: and ˆ m k ensure that
Revised: and ˆ m k ensure that

Original: [Equation]
Revised: [Equation]

Original: Hence,
Revised: Hence,

Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: Conditions (C2) and (C3) guarantee that
Revised: Conditions (C2) and (C3) guarantee that

Original: E
Revised: E

Original: [Equation]
Revised: [Equation]

Original: Therefore, the lemma follows from taking the expectation on both sides of (12).
Revised: Therefore, the lemma follows from taking the expectation on both sides of (13).

Original: This completes the proof.
Revised: This completes the proof.

Original: The discussion in the proof of Lemma A.1 also gives the following lemma.
Revised: The discussion in the proof of Lemma A.1 also gives the following lemma.

Original: Lemma A.2.
Revised: Lemma A.2.

Original: Suppose that (C1), (C2), and (C3) hold.
Revised: Suppose that (C1), (C2), and (C3) hold.

Original: Then, SGD satisﬁes the following: for all k ∈ N and all θ ∈ R d ,
Revised: Then, SGD satisﬁes the following: for all k ∈ N and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: Moreover, Momentum satisﬁes the following: for all k ∈ N and all θ ∈ R d ,
Revised: Moreover, Momentum satisﬁes the following: for all k ∈ N and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: where ˆ β 1 := 1 − β 1 .
Revised: where ˆ β 1 := 1 − β 1 .

Original: The following lemma indicates the bounds on ( E [ ∥ m k ∥ 2 ]) k ∈ N and ( E [ ∥ d k ∥ 2 H k ]) k ∈ N .
Revised: The following lemma indicates the bounds on ( E [ ∥ m k ∥ 2 ]) k ∈ N and ( E [ ∥ d k ∥ 2 H k ]) k ∈ N .

Original: Lemma A.3.
Revised: Lemma A.3.

Original: Adam under (C2) and (A1), for all k ∈ N satisﬁes
Revised: Adam under (C2) and (A1), for all k ∈ N satisﬁes

Original: [Equation]
Revised: [Equation]

Original: where v ∗ := inf { min i ∈
Revised: where v ∗ := inf { min i ∈

Original: [ d ] v k,i : k ∈ N } , ˜ β 1 k := 1 − β k +11 k , and ˜ β 2 k := 1 − β k +12 k .
Revised: [ d ] v k,i : k ∈ N } , ˜ β 1 k := 1 − β k +11 k , and ˜ β 2 k := 1 − β k +12 k .

Original: Proof.
Revised: Proof.

Original: Condition (C2) implies that
Revised: Condition (C2) implies that

Original: [Equation]
Revised: [Equation]

Original: which, together with (C2) and (A1), in turn implies that
Revised: which, together with (C2) and (A1), in turn implies that

Original: [Equation]
Revised: [Equation]

Original: The convexity of ∥ · ∥ 2 , together with the deﬁnition of m k and (14), guarantees that, for all k ∈ N ,
Revised: The convexity of ∥ · ∥ 2 , together with the deﬁnition of m k and (15), guarantees that, for all k ∈ N ,

Original: E
Revised: E

Original: [Equation]
Revised: [Equation]

Original: Induction thus ensures that, for all k ∈ N ,
Revised: Induction thus ensures that, for all k ∈ N ,

Original: [Equation]
Revised: [Equation]

Original: where m − 1 = 0 .
Revised: where m − 1 = 0 .

Original: For k ∈ N , H k ∈ S d
Revised: For k ∈ N , H k ∈ S d

Original: +
Revised: +

Original: + guarantees the existence of a unique matrix
Revised: + guarantees the existence of a unique matrix

Original: H k ∈ S d ++ such that H k
Revised: H k ∈ S d ++ such that H k

Original: = H 2 k (Horn & Johnson, 1985, Theorem 7.2.6).
Revised: = H 2 k (Horn & Johnson, 1985, Theorem 7.2.6).

Original: We have that, for all x ∈ R d ,
Revised: We have that, for all x ∈ R d ,

Original: ∥ x ∥ 2 H k = ∥
Revised: ∥ x ∥ 2 H k = ∥

Original: H k x ∥ 2 .
Revised: H k x ∥ 2 .

Original: Accordingly, the deﬁnitions of d k and ˆ m k imply that, for all k ∈ N ,
Revised: Accordingly, the deﬁnitions of d k and ˆ m k imply that, for all k ∈ N ,

Original: E
Revised: E

Original: [Equation]
Revised: [Equation]

Original: where
Revised: where

Original: [Equation]
Revised: [Equation]

Original: Moreover, the deﬁnition of v ∗ := inf { v k,i ∗ : k ∈ N } and (15) imply that, for all k ∈ N ,
Revised: Moreover, the deﬁnition of v ∗ := inf { v k,i ∗ : k ∈ N } and (16) imply that, for all k ∈ N ,

Original: [Equation]
Revised: [Equation]

Original: completing the proof.
Revised: completing the proof.

Original: A.  SGD
Revised: A. P ROOF OF T HEOREM 3. A.3. SGD

Original: We show Theorem 3.1 for SGD.
Revised: We show Theorem 3.1 for SGD.

Original: Proof.
Revised: Proof.

Original: (i) Lemma A.2 and (14) imply that, for all k ∈ N and all θ ∈ R d ,
Revised: (i) Lemma A.2 and (15) imply that, for all k ∈ N and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: Summing the above inequality from k = 1 to k = K leads to the ﬁnding that, for all K ≥ 1 , 2 α
Revised: Summing the above inequality from k = 1 to k = K leads to the ﬁnding that, for all K ≥ 1 , 2 α

Original: K X
Revised: K X

Original: [Equation]
Revised: [Equation]

Original: which implies that, for all K ≥ 1 and all θ ∈ R d ,

Original: VI

Original: [Equation]
Revised: [Equation]

Original: K,
Revised: K

Original: [Equation]
Revised: [Equation]

Original: =
Revised: which implies that, for all K ≥ 1 and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original:  (ii) Let θ ∈ R d and ϵ > 0 .
Revised: (17) (ii) Let θ ∈ R d and ϵ > 0 .

Original: Condition C 1 K + C 2 b
Revised: Condition C 1 K + C 2 b

Original: + C 3 =
Revised: + C 3 =

Original: ϵ is equivalent to
Revised: ϵ is equivalent to

Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: Since ϵ = C 1 K + C 2 b + C 3 > C 3 , we consider the case b > C 2 ϵ − C 3 > 0 to guarantee that K > 0 .
Revised: Since ϵ = C 1 K + C 2 b + C 3 > C 3 , we consider the case b > C 2 ϵ − C 3 > 0 to guarantee that K > 0 .

Original: From (16), the function K deﬁned by (17) satisﬁes VI( K, θ ) ≤ C 1 K + C 2 b {++ C 
+}
Revised: From (17), the function K deﬁned by (18) satisﬁes VI( K, θ ) ≤ C 1 K + C 2 b {++ C 
+}

Original: + C 3 = ϵ .
Revised: = ϵ .

Original: Moreover, from (17),
Revised: Moreover, from (18),

Original: [Equation]
Revised: [Equation]

Original: which implies that K is convex and monotone decreasing with respect to b .
Revised: which implies that K is convex and monotone decreasing with respect to b .

Original: (iii)
Revised: (iii)

Original: We have that
Revised: We have that

Original: [Equation]
Revised: [Equation]

Original: Accordingly,
Revised: Accordingly,

Original: [Equation]
Revised: [Equation]

Original: which implies that K ( b ) b is convex with respect to b and d 
Revised: which implies that K ( b ) b is convex with respect to b and d K ( b ) b

Original: [Equation]
Revised: [Equation]

Original: The point b ⋆ attains the minimum value K ( b ⋆ ) b
Revised: The point b ⋆ attains the minimum value K ( b ⋆ ) b

Original: ⋆ = 4 C 1 C 2 ( ϵ − C 3 ) 2 of K ( b ) b .
Revised: ⋆ = 4 C 1 C 2 ( ϵ − C 3 ) 2 of K ( b ) b .

Original: This completes the proof.
Revised: This completes the proof.

Original: A. M OMENTUM
Revised: A.3. M OMENTUM

Original: We show Theorem 3.1 for Momentum.
Revised: We show Theorem 3.1 for Momentum.

Original: Proof.
Revised: Proof.

Original: (i) Lemma A.2 ensures that, for all k ∈ N and all θ ∈ R d ,
Revised: (i) Lemma A.2 ensures that, for all k ∈ N and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: which, together with Lemma A.
Revised: which, together with Lemma A.

Original: [Equation]
Revised: [Equation]

Original: the Cauchy–Schwarz inequality
Revised: the Cauchy–Schwarz inequality

Original: [Equation]
Revised: [Equation]

Original: and (A1) and (A2)
Revised: and (A1) and (A2)

Original: [Equation]
Revised: [Equation]

Original: implies that
Revised: implies that

Original: [Equation]
Revised: [Equation]

Original: Summing the above inequality from k = 1 to k = K gives a relation that implies that
Revised: Summing the above inequality from k = 1 to k = K gives a relation that implies that

Original: K X k =
Revised: K X k =

Original: [Equation]
Revised: [Equation]

Original: and hence,
Revised: and hence,

Original: K
Revised: K

Original: [Equation]
Revised: [Equation]

Original: Moreover
Revised: Moreover

Original: [Equation]
Revised: [Equation]

Original: we have that, for all k ∈ N and all θ ∈ R d ,
Revised: we have that, for all k ∈ N and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: where the ﬁrst equality comes from the deﬁnition of m k and the ﬁrst inequality comes from the
Revised: where the ﬁrst equality comes from the deﬁnition of m k and the ﬁrst inequality comes from the

Original: Cauchy–Schwarz inequality, the triangle inequality
Revised: Cauchy–Schwarz inequality, the triangle inequality

Original: [Equation]
Revised: [Equation]

Original: and (A2).
Revised: and (A2).

Original: Hence, from Lemma A.3, (14),
Revised: Hence, from Lemma A.3, (15),

Original: Jensen’s inequality
Revised: Jensen’s inequality

Original: [Equation]
Revised: [Equation]

Original: and b ≥ 1 ,
Revised: and b ≥ 1 ,

Original: [Equation]
Revised: [Equation]

Original: Therefore, for all K ≥ 1 and all θ ∈ R d ,
Revised: Therefore [Equation] for all K ≥ 1 and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: The deﬁnition of m k ensures that
Revised: The deﬁnition of m k ensures that

Original: [Equation]
Revised: [Equation]

Original: which, together with the Cauchy–Schwarz inequality, the triangle inequality
Revised: which, together with the Cauchy–Schwarz inequality, the triangle inequality

Original: [Equation]
Revised: [Equation]

Original: and (A2), implies that
Revised: and (A2), implies that

Original: [Equation]
Revised: [Equation]

Original: θ
Revised: θ

Original: [Equation]
Revised: [Equation]

Original: +∥
Revised: +

Original: [Equation]
Revised: [Equation]

Original: Lemma A.3, (14), Jensen’s inequality
Revised: Lemma A.3, (15), Jensen’s inequality

Original: [Equation]
Revised: [Equation]

Original: and b ≥ 1 guarantee that
Revised: and b ≥ 1 guarantee that

Original: [Equation]
Revised: [Equation]

Original: Therefore, (19) ensures that, for all K ≥ 1 and all θ ∈ R d ,
Revised: Therefore, (20) ensures that, for all K ≥ 1 and all θ ∈ R d ,

Original: [Equation]
Revised: [Equation]

Original: (ii) A discussion similar to the one showing (ii) in Theorem 3.1 for SGD would show (ii) in Theorem 3.1 for Momentum.
Revised: (ii) A discussion similar to the one showing (ii) in Theorem 3.1 for SGD would show (ii) in Theorem 3.1 for Momentum.

Original: (iii)
Revised: (iii)

Original: An argument
Revised: An argument

Original: similar to that which obtained (iii) in Theorem 3.1 for SGD would prove (iii) in
Revised: similar to that which obtained (iii) in Theorem 3.1 for SGD would prove (iii) in

Original: Theorem 3.1 for Momentum.
Revised: Theorem 3.1 for Momentum.

Original: A. A DAM
Revised: A.3. A DAM

Original: We show Theorem 3.1 for Adam.
Revised: We show Theorem 3.1 for Adam.

Original: Proof.
Revised: Proof.

Original: (i) Let θ ∈ R d .
Revised: (i) Let θ ∈ R d .

Original: Lemma A.1 guarantees that for all k ∈ N ,
Revised: Lemma A.1 guarantees that for all k ∈ N ,

Original: [Equation]
Revised: [Equation]

Original: We deﬁne γ k := ˜ β
Revised: We deﬁne γ k := ˜ β

Original: 1 k 2 β 1 α ( k ∈ N ) .
Revised: 1 k 2 β 1 α ( k ∈ N ) .

Original: Then, for all K ≥ 1 ,
Revised: Then, for all K ≥ 1 ,

Original: K X
Revised: K X

Original: [Equation]
Revised: [Equation]

Original: Since H k ∈ S d ++ exists such that H k
Revised: Since H k ∈ S d ++ exists such that H k

Original: = H 2 k
Revised: = H 2 k

Original: [Equation]
Revised: [Equation]

Original: we have ∥ x
Revised: we have ∥ x

Original: ∥ 2 H k = ∥
Revised: ∥ 2 H k = ∥

Original: H k x ∥ 2 for all x ∈ R d .
Revised: H k x ∥ 2 for all x ∈ R d .

Original: Accordingly, we also have
Revised: Accordingly, we also have

Original: [Equation]
Revised: [Equation]

Original: o# .
Revised: o# .

Original: From H k = diag (ˆ v 1 / 4 k,i ) , we have that, for all x = ( x i ) di =1 ∈ R d , ∥ H k x ∥ 2 = P di = p ˆ v k,i x 2 i .
Revised: From H k = diag (ˆ v 1 / 4 k,i ) , we have that, for all x = ( x i ) di =1 ∈ R d , ∥ H k x ∥ 2 = P di = p ˆ v k,i x 2 i .

Original: Hence, for all K ≥ 2 , [Equation] K
Revised: Hence, for all K ≥ 2 , Γ K

Original: [Equation]
Revised: [Equation]

Original: E
Revised: E

Original: [Equation]
Revised: [Equation]

Original: Condition (2) and γ k ≥ γ k − 1 ( k ≥ 1 ) imply that, for all k ≥ 1 and all i ∈ [ d ] ,
Revised: Condition (2) and γ k ≥ γ k − 1 ( k ≥ 1 ) imply that, for all k ≥ 1 and all i ∈ [ d ] ,

Original: [Equation]
Revised: [Equation]

Original: Moreover, (A2) ensures that D ( θ ) :
Revised: Moreover, (A2) ensures that D ( θ ) :

Original: = sup { max i ∈
Revised: = sup { max i ∈

Original: [ d ] ( θ k,i − θ i ) 2 : k ∈ N } < + ∞ .
Revised: [ d ] ( θ k,i − θ i ) 2 : k ∈ N } < + ∞ .

Original: Accordingly, for all K ≥ 2 ,
Revised: Accordingly, for all K ≥ 2 ,

Revised: [Equation]

Revised: E

Original: [Equation]
Revised: [Equation]

Original: Let ∇ f B k
Revised: Let ∇ f B k

Original: ( θ k ) ⊙ ∇ f B k ( θ k ) :
Revised: ( θ k ) ⊙ ∇ f B k ( θ k ) :

Original: = ( g 2 k,i
Revised: = ( g 2 k,i

Original: ) ∈
Revised: ) ∈

Original: R d + .
Revised: R d + .

Original: Assumption (A1) ensures that there exists M ∈ R such that, for all k ∈ N , max i ∈
Revised: Assumption (A1) ensures that there exists M ∈ R such that, for all k ∈ N , max i ∈

Original: [ d ] g 2 k,i ≤ M .
Revised: [ d ] g 2 k,i ≤ M .

Original: The deﬁnition of v k guarantees that, for all i ∈
Revised: The deﬁnition of v k guarantees that, for all i ∈

Original: [ d ] and all k ∈ N ,
Revised: [ d ] and all k ∈ N ,

Original: [Equation]
Revised: [Equation]

Original: Induction thus ensures that, for all i ∈
Revised: Induction thus ensures that, for all i ∈

Original: [ d ] and all k ∈ N ,
Revised: [ d ] and all k ∈ N ,

Original: [Equation]
Revised: [Equation]

Original: k,i ≤max
Revised: k [Equation] i ≤

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: i
Revised: i

Original: [Equation]
Revised: [Equation]

Original: =

Original: M
Revised: M

Original: [Equation]
Revised: [Equation]

Original: (24) where v 0 = ( v 0 ,i ) = 0 .
Revised: (25) where v 0 = ( v 0 ,i ) = 0 .

Original: From the deﬁnition of ˆ v k , we have that, for all i ∈ [ d ] and all k ∈ N , ˆ 
Revised: From the deﬁnition of ˆ v k , we have that, for all i ∈ [ d ] and all k ∈ N , ˆ [Equation] k

Original: [Equation]
Revised: [Equation]

Original: k,i =
Revised: i =

Original: [Equation]
Revised: [Equation]

Original: Therefore, (22), E [ ∥ θ 1 − θ ∥ 2 H 1 ] ≤ D ( θ ) E
Revised: Therefore, (23), E [ ∥ θ 1 − θ ∥ 2 H 1 ] ≤ D ( θ ) E

Original: [ P di =1 p ˆ v 1 ,i ] , and (25) imply, for all K ≥ 1 ,
Revised: [ P di =1 p ˆ v 1 ,i ] , and (26) imply, for all K ≥ 1 ,

Original: K X
Revised: K X

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: q ˜ β 2 K .
Revised: q ˜ β [Equation] K .

Original: Inequality (26) with ˜ β 1 K := 

Revised: Inequality (27) with ˜ β 1 K :=

Original: − β K +1≤ 1 and ˜ β 2 K := 1 − β K +1≥ 1 − β 2 =: ˆ β 2 implies that
Revised: − β K +1≤ 1 and ˜ β 2 K := 1 − β K +1≥ 1 − β 2 =: ˆ β 2 implies that

Original: K X k = a k ≤ dD ( θ ) √
Revised: K X k = a k ≤ dD ( θ ) √

Original: M ˜ β 1 K 2 β 1 α q ˜ β 2 K ≤ dD ( θ ) √
Revised: M ˜ β 1 K 2 β 1 α q ˜ β 2 K ≤ dD ( θ ) √

Original: M 2 β 1 α q ˆ β.
Revised: M 2 β 1 α q ˆ β.

Original: Lemma A.3 guarantees that, for all k ∈ N ,
Revised: Lemma A.3 guarantees that, for all k ∈ N ,

Original: [Equation]
Revised: [Equation]

Original: i
Revised: i

Original: [Equation]
Revised: [Equation]

Original: b
Revised: b

Original: [Equation]
Revised: [Equation]

Original: Inequality (28) with ˜ β 1 k := 1 − β k +
Revised: Inequality (29) with ˜ β 1 k := 1 − β k +

Original: [Equation]
Revised: [Equation]

Original: 1 implies that
Revised: 1 implies that

Original: [Equation]
Revised: [Equation]

Original: The Cauchy–Schwarz inequality and (A2) imply that, for all k ∈ N , 
Revised: The Cauchy–Schwarz inequality and (A2) imply that, for all k ∈ N , [Equation]

Original: [Equation]
Revised: [Equation]

Original: Hence, (21), (27), (29), and (30) ensure that, for all K ≥ 1 ,
Revised: Hence, (22), (28), (30), and (31) ensure that, for all K ≥ 1 ,

Original: [Equation]
Revised: [Equation]

Original: Therefore, from (18), for all K ≥ 1 ,
Revised: Therefore, from (19) [Equation] for all K ≥ 1 ,

Original: [Equation]
Revised: [Equation]

Original: From (20) and (31), for all K ≥ 1 ,
Revised: From (21) and (32), for all K ≥ 1 ,

Original: K
Revised: K

Original: [Equation]
Revised: [Equation]

Revised: [Equation]

Original:  (ii) A discussion similar to the one showing (ii) in Theorem 3.1 for SGD would show (ii) in Theorem 3.1 for Adam.
Revised: | { [Equation] [Equation] (ii) A discussion similar to the one showing (ii) in Theorem 3.1 for SGD would show (ii) in Theorem 3.1 for Adam.

Original: (iii)
Revised: (iii)

Original: An argument similar to that which obtained (iii) in Theorem 3.1 for SGD would prove (iii) in Theorem 3.1 for Adam. 
Revised: An argument similar to that which obtained (iii) in Theorem 3.1 for SGD would prove (iii) in Theorem 3.1 for Adam. A.3. AMSG RAD We show that C i of AMSGrad are (6). Proof.

Original: A. R ESULTS FOR VARYING LEARNING RATES
Revised: Let us consider AMSGrad (Algorithm 1 with ˆ m k = m k , ˆ v k = v k , ˜ v k,i := max { ˜ v k − 1 ,i , v k,i } (i.e., ˜ v k +1 ,i ≥ ˜ v k,i ), and H k := diag ( p ˜ v k,i ) ).

Revised: From (25) and ˜ v k,i := max { ˜ v k − 1 ,i , v k,i } , induction ensures that, for all k ∈ N , ˜ v k,i ≤ M , where ˜ v − 1 =

Revised: (˜ v − 1 ,i ) = 0 .

Revised: An argument similar to that which showed (i) in Appendix A.3.3 ensures that

Revised: [Equation]

Revised: , and c k ≤ Dist

Revised: [Equation]

Revised: θ

Revised: [Equation]

Revised: 1 , where a k , b k , and c k are deﬁned as in (22) and ˜ v ∗ := inf { min i ∈

Revised: [ d ] ˜ v k,i : k ∈ N } .

Revised: Inequalities (21) and (32) thus imply that C i of AMSGrad are (6).

Revised: A. R ESULTS FOR VARYING LEARNING RATES

Original: We can establish the upper bound of VI( K, θ ) for Adam with varying learning rates from a discussion similar to the one for proving Theorem 3.1(i).
Revised: We can establish the upper bound of VI( K, θ ) for Adam with varying learning rates from a discussion similar to the one for proving Theorem 3.1(i).

Original: If ( α k ) k ∈ N is monotone decreasing, then we have
Revised: If ( α k ) k ∈ N is monotone decreasing, then we have

Original: [Equation]
Revised: [Equation]

Original: Let us consider the case where α k = 1 √ k ( k ≥ 1) .
Revised: Let us consider the case where α k = 1 √ k ( k ≥ 1) .

Original: From (32) [Equation] we have that
Revised: From (33), we have that

Original: [Equation]
Revised: [Equation]

Original: where 1 − β k +1≤ 1 and P K k =1 1 √ k ≤√
Revised: where 1 − β k + ≤ 1 and P Kk =1 1 √ k ≤√

Original: K .
Revised: K .

Original: Hence,
Revised: Hence,

Original: VI( K, θ ) ≤
Revised: VI( K, θ ) ≤

Original: [Equation]
Revised: [Equation]

Original: Theorem 3.1(i) indicates that Adam with a constant learning rate α satisﬁes
Revised: Theorem 3.1(i) indicates that Adam with a constant learning rate α satisﬁes

Original: [Equation]
Revised: [Equation]

Original: Hence, using α k = 1 √ k mitigates the variance (the term ˜ C 2 b √ K ) in contrast to the term C 2 b using α k = α .
Revised: Hence, using α k = 1 √ k mitigates the variance (the term ˜ C 2 b √ K ) in contrast to the term C 2 b using α k = α .

Original: However, the bias term C 1 K using α k
Revised: However, the bias term C 1 K using α k

Original: = α would be better than the bias term ˜ C 1 √ K using α k = 1 √ k in the sense of minimizing the upper bound of VI( K, θ ) .
Revised: = α would be better than the bias term ˜ C 1 √ K using α k = 1 √ k in the sense of minimizing the upper bound of VI( K, θ ) .

Original: Let T ≥ 1 , γ ∈ (0 , 1) , α > 0 , and P := KT .
Revised: Let T ≥ 1 , γ ∈ (0 , 1) , α > 0 , and P := KT .

Original: Next, let us consider the following varying learning rate
Revised: Next, let us consider the following varying learning rate

Original: [Equation]
Revised: [Equation]

Original: where α jT = ( γ j − 1 α, γ j − 1 α, . .
Revised: where α jT = ( γ j − 1 α, γ j − 1 α, . .

Original: , γ j − 1 α ) ( j = 1 , 2 , . . .
Revised: , γ j − 1 α ) ( j = 1 , 2 , . . .

Original: , P ) .
Revised: , P ) .

Original: That is, ( α k ) is (( α, α, . . .
Revised: That is, ( α k ) is (( α, [Equation]

Original: , α|
Revised: α

Original: [Equation]
Revised: [Equation]

Original: Let α > 0 be the lower bound of α k .
Revised: Let α > 0 be the lower bound of α k .

Original: From
Revised: From

Original: K X
Revised: K X

Original: [Equation]
Revised: [Equation]

Original: and (32), we have that
Revised: and (33), we have that

Original: [Equation]
Revised: [Equation]

Original: Here, we recall that Adam with α k = α satisﬁes
Revised: Here, we recall that Adam with α k = α satisﬁes

Original: [Equation]
Revised: [Equation]

Original: and Adam with α k = 1 √ k satisﬁes
Revised: and Adam with α k = 1 √ k satisﬁes

Original: [Equation]
Revised: [Equation]

Original: Therefore, using ( α k 
Revised: Therefore, using ( α k ) =

Original: [Equation] α PT ) is more desirable to minimize the upper bound of VI( K, θ ) for Adam than using α k
Revised: ( α T , α 2 T , . . . , α PT ) is more desirable to minimize the upper bound of VI( K, θ ) for Adam than using α k

Original: = α, 1 √ k .
Revised: = α, 1 √ k .

Original: A. B OUNDEDNESS CONDITION OF ( ∇ f ( θ k )) k ∈ N
Revised: A. B OUNDEDNESS CONDITION OF ( ∇ f ( θ k )) k ∈ N

Original: Let f : R d → R be convex.
Revised: Let f : R d → R be convex.

Original: Then, f is Lipschitz continuous (i.e., | f ( x ) − f ( y ) | ≤ G ∥ x − y ∥ )
Revised: Then, f is Lipschitz continuous (i.e., | f ( x ) − f ( y ) | ≤ G ∥ x − y ∥ )

Original: if and only if ∥∇ f ( x ) ∥ ≤ G ( x ∈ R d ) (see, e.g., Theorem 6.2.2, Corollary 6.1.2, and Exercise 6.1.9(c) in (Borwein & Lewis, 2000)).
Revised: if and only if ∥∇ f ( x ) ∥ ≤ G ( x ∈ R d ) (see, e.g., Theorem 6.2.2, Corollary 6.1.2, and Exercise 6.1.9(c) in (Borwein & Lewis, 2000)).

Original: Let θ ∗ be a local minimizer of a Lipschitz continuous function f .
Revised: Let θ ∗ be a local minimizer of a Lipschitz continuous function f .

Original: The continuity of f ensures that f is convex around θ ∗ .
Revised: The continuity of f ensures that f is convex around θ ∗ .

Original: Hence, for any θ belonging to a neighborhood
Revised: Hence, for any θ belonging to a neighborhood

Original: N ( θ ∗ ) of θ ∗ , ∥∇ f ( θ ) ∥ ≤ G .
Revised: N ( θ ∗ ) of θ ∗ , ∥∇ f ( θ ) ∥ ≤ G .

Original: If the sequence ( θ k ) k ∈ N generated by an optimizer approximates θ ∗ , then θ k ∈ N ( θ ∗ ) for sufﬁciently large k , i.e., ∥∇ f ( θ k ) ∥ ≤ G .
Revised: If the sequence ( θ k ) k ∈ N generated by an optimizer approximates θ ∗ , then θ k ∈ N ( θ ∗ ) for sufﬁciently large k , i.e., ∥∇ f ( θ k ) ∥ ≤ G .

Original: [Equation]
Revised: A. C ONDITION ϵ − C 3 >

Original: Under Lipschitz smoothness condition of f (i.e., ∥∇ f ( x ) − ∇ f ( y ) ∥
Revised: Under Lipschitz smoothness condition of f (i.e., ∥∇ f ( x ) − ∇ f ( y ) ∥

Original: ≤ L ∥ x − y ∥ ), the gradient descent (GD) with a constant learning rate α
Revised: ≤ L ∥ x − y ∥ ), the gradient descent (GD) with a constant learning rate α

Original: = O ( L − 1 ) satisﬁes that lim
Revised: = O ( L − 1 ) satisﬁes that lim

Original: k
Revised: k

Original: → + ∞ ∥∇ f ( θ k ) ∥
Revised: → + ∞ ∥∇ f ( θ k ) ∥

Original: = 0 by the descent lemma ( f ( y ) ≤
Revised: = 0 by the descent lemma ( f ( y ) ≤

Original: f ( x )+ ∇ f ( x ) ⊤ ( y − x )+ L 2 ∥ y − x ∥ 2 ).
Revised: f ( x )+ ∇ f ( x ) ⊤ ( y − x )+ L 2 ∥ y − x ∥ 2 ).

Original: Under non-smoothness condition of f , GD with a constant learning rate α > 0 satisﬁes that lim inf k → + ∞ ∇ f ( θ k ) ⊤ ( θ k − θ ) ≤
Revised: Under non-smoothness condition of f , GD with a constant learning rate α > 0 satisﬁes that lim inf k → + ∞ ∇ f ( θ k ) ⊤ ( θ k − θ ) ≤

Original: G 2 2 α .
Revised: G 2 2 α .

Original: Hence, it is not guaranteed that, under non-smoothness condition of f , GD with a constant learning rate α > 0 converges.
Revised: Hence, it is not guaranteed that, under non-smoothness condition of f , GD with a constant learning rate α > 0 converges.

Original: However, we can expect that using a small constant learning rate α approximates a stationary point of f .
Revised: However, we can expect that using a small constant learning rate α approximates a stationary point of f .

Original: Meanwhile, under non-smoothness condition of f , GD with a diminishing learning rate α k = 1 √ k satisﬁes that
Revised: Meanwhile, under non-smoothness condition of f , GD with a diminishing learning rate α k = 1 √ k satisﬁes that

Original: [Equation]
Revised: [Equation]

Original: (see also Appendix A.3 when α is 1 √ k ).
Revised: (see also Appendix A.3.1 when α is 1 √ k ).

Original: Hence, GD with a diminishing learning rate does not need
Revised: Hence, GD with a diminishing learning rate does not need

Original: C 3 used in Theorem 3.1.
Revised: C 3 used in Theorem 3.1.

Original: This result strongly depends on the condition β 1 = 0 .
Revised: This result strongly depends on the condition β 1 = 0 .

Original: Under non-smoothness condition of f , Adam with a diminishing step size α k = 1 √ k and b = n (i.e., σ = 0 ) satisﬁes that
Revised: Under non-smoothness condition of f , Adam with a diminishing step size α k = 1 √ k and b = n (i.e., σ = 0 ) satisﬁes that

Original: [Equation]
Revised: [Equation]

Original: (see (33)) and Adam with a constant learning rate α and b = n (i.e., σ = 0 ) satisﬁes that
Revised: (see (34)) and Adam with a constant learning rate α and b = n (i.e., σ = 0 ) satisﬁes that

Original: [Equation]
Revised: [Equation]

Original: The previous results (Zaheer et al., 2018) indicated that Adam with a constant learning rate α =
Revised: The previous results (Zaheer et al., 2018) indicated that Adam with a constant learning rate α =

Original: O ( L − 1 ) , β 1 = 0 , and σ = 0 satisﬁes that
Revised: O ( L − 1 ) , β 1 = 0 , and σ = 0 satisﬁes that

Original: [Equation]
Revised: [Equation]

Original: The condition β 1 ̸ = 0 is essential to analyze Adam since the practically useful β 1 is close to 1 .
Revised: The condition β 1 ̸ = 0 is essential to analyze Adam since the practically useful β 1 is close to 1 .

Original: The upper bound of VI( K, θ ) for Adam with β 1 ̸ = 0 depends on the term with respect to β 1 , i.e.,
Revised: The upper bound of VI( K, θ ) for Adam with β 1 ̸ = 0 depends on the term with respect to β 1 , i.e.,

Original: C 3 :=
Revised: C 3 :=

Original: G 2 α 2 √ v ∗ β 1 (1 − β 1 )
Revised: G 2 α 2 √ v ∗ β 1 (1 − β 1 )

Original: + h ( β 1 ) .
Revised: + h ( β 1 ) .

Original: Hence, ϵ > C 3 and ϵ > h ( β 1 ) are needed to consider K to satisfy
Revised: Hence, ϵ > C 3 and ϵ > h ( β 1 ) are needed to consider K to satisfy

Original: VI( K, θ ) ≤ ˜ C 1 √ K + h ( β 1 ) =
Revised: VI( K, θ ) ≤ ˜ C 1 √ K + h ( β 1 ) =

Original: ϵ (diminishing learning rate case) and VI( K, θ ) ≤ C 1 K + C 

Revised: ϵ (diminishing learning rate case) and VI( K, θ ) ≤ C 1 K + C

Original: =
Revised: =

Original: ϵ (constant learning rate case) even if σ = 0 .
Revised: ϵ (constant learning rate case) even if σ = 0 .

Original: A. L OWER AND UPPER BOUNDS ON THE NUMBER OF STEPS K
Revised: A. L OWER AND UPPER BOUNDS ON THE NUMBER OF STEPS K

Original: Let us consider SGD under (C1)–(C3) and let θ ∗ be a stationary point f .
Revised: Let us consider SGD under (C1)–(C3) and let θ ∗ be a stationary point f .

Original: From Lemma A.2, we have that
Revised: From Lemma A.2, we have that

Original: [Equation]
Revised: [Equation]

Original: Hence, for all K ≥ 1 ,
Revised: Hence, for all K ≥ 1 ,

Original: [Equation]
Revised: [Equation]

Original: Here [Equation] we assume that there exists c ∈ [0 , 1] such that cσ 2 ≤ E [ ∥ G ξ k ( θ k ) − ∇ f
Revised: Here, we assume that there exists c ∈ [0 , 1] such that cσ 2 ≤ E [ ∥ G ξ k ( θ k ) − ∇ f

Original: ( θ k ) ∥ 2 ] ≤ σ 2 .
Revised: ( θ k ) ∥ 2 ] ≤ σ 2 .

Original: From (13) [Equation] we have that
Revised: From (14), we have that

Original: [Equation]
Revised: [Equation]

Original: Since θ K +1 approximates θ ∗ , we assume that there exists X ( θ ∗ ) ≥ 0 such that E [ ∥ θ 1 − θ ∗ ∥ 2 ] − E [ ∥ θ K +1 − θ ∗ ∥ 2 ] ≥ X ( θ ∗ ) .
Revised: Since θ K +1 approximates θ ∗ , we assume that there exists X ( θ ∗ ) ≥ 0 such that E [ ∥ θ 1 − θ ∗ ∥ 2 ] − E [ ∥ θ K +1 − θ ∗ ∥ 2 ] ≥ X ( θ ∗ ) .

Original: Hence,
Revised: Hence,

Original: [Equation]

Original: K

Original: [Equation]
Revised: [Equation]

Original: which implies that
Revised: which implies that

Original: [Equation]
Revised: [Equation]

Original: where
Revised: where

Revised: D 1 :=

Revised: X

Original: [Equation]
Revised: [Equation]

Original: and
Revised: θ

Original: [Equation]
Revised: [Equation]

Revised: 2 α and D 2 := cσ 2 α 2 .

Original: Meanwhile, Theorem 3.1(i) indicates that
Revised: Meanwhile, Theorem 3.1(i) indicates that

Original: [Equation]
Revised: [Equation]

Original: where
Revised: where

Revised: C

Original: [Equation]
Revised: [Equation]

Revised: =

Revised: E [ ∥ θ

Revised: [Equation]

Revised: ∥

Revised: [Equation]

Revised: C

Revised: [Equation]

Revised: σ

Revised: [Equation]

Revised: α

Revised: [Equation]

Revised: , and C 3 :

Original:  Suppose that VI( K, θ ∗ ) ≤ ϵ .
Revised: = G 2 α 2 . Suppose that VI( K, θ ∗ ) ≤ ϵ .

Original: Then, we have that
Revised: Then, we have that

Original: [Equation]
Revised: [Equation]

Original:  which implies that
Revised: , which implies that

Original: [Equation]
Revised: [Equation]

Original: Suppose that VI( K, θ ∗ ) ≥ ϵ .
Revised: Suppose that VI( K, θ ∗ ) ≥ ϵ .

Original: Then, we have that
Revised: Then, we have that

Original: C

Original: [Equation]
Revised: [Equation]

Original: ϵ, which implies that
Revised: which implies that

Original: [Equation]
Revised: [Equation]

Original: From
Revised: From

Original: [Equation]
Revised: [Equation]

Original:  and ( ϵ − C 3 ) b − C 2 ≤ ϵb − C 2 ≤ ϵb − D 2 , we have that K ( b ) ≤ K ( b ) .
Revised: [Equation] and [Equation] we have that K ( b ) ≤ K ( b ) .

Original: Hence, K with VI( K, θ ∗ )
Revised: Hence, K with VI( K, θ ∗ )

Original: =
Revised: =

Original: ϵ satisﬁes
Revised: ϵ satisﬁes

Original: K( b
Revised: K

Original: [Equation]
Revised: [Equation]

Original: and the SFO complexity N =
Revised: and the SFO complexity N =

Original: Kb satisﬁes
Revised: Kb satisﬁes

Original: [Equation]
Revised: [Equation]

Original: Moreover, b ⋆ := 2 D 2 ϵ minimizing N and b ⋆ := 2 C 2 ϵ − C 3 minimizing N (see Theorem 3.1(iii)) satisfy that b ⋆ ≤ b ⋆ .
Revised: Moreover, b ⋆ := 2 D 2 ϵ minimizing N and b ⋆ := 2 C 2 ϵ − C 3 minimizing N (see Theorem 3.1(iii)) satisfy that b ⋆ ≤ b ⋆ .

Original: Let α be small enough.
Revised: Let α be small enough.

Original: Then, we have that 
Revised: Then, we have that b ⋆

Revised: [Equation]

Revised: and K

Revised: [Equation]

Revised: b

Revised: [Equation]

Revised: b

Revised: [Equation]

Revised: ≈ K

Revised: [Equation]

Revised: b

Original: [Equation]
Revised: [Equation]

Revised: b

Revised: [Equation]

Original:  where
Revised: , where

Original: [Equation]
Revised: [Equation]

Original: are used.
Revised: are used.

Original: Hence, the batch sizes b ⋆ and b ⋆ ( b ⋆ ≈ b ⋆ ) approximate the batch size minimizing N =
Revised: Hence, the batch sizes b ⋆ and b ⋆ ( b ⋆ ≈ b ⋆ ) approximate the batch size minimizing N =

Original: Kb .
Revised: Kb .

Original: A. SFO COMPLEXITY REGARDING COMPUTATIONAL COST OF PARALLELIZABLE STEPS
Revised: A. SFO COMPLEXITY REGARDING COMPUTATIONAL COST OF PARALLELIZABLE STEPS

Original: Let us consider Tail-averaged SGD (Jain et al., 2018, Algorithm 1) independently in P machines, each of which contains nP samples, for minimizing the expected square loss function f ( θ ) :
Revised: Let us consider Tail-averaged SGD (Jain et al., 2018, Algorithm 1) independently in P machines, each of which contains nP samples, for minimizing the expected square loss function f ( θ ) :

Original: = 12 E ( x ,y ) ∼D [ y − x ⊤ θ ] (see Appendix A.1.1).
Revised: = 12 E ( x ,y ) ∼D [ y − x ⊤ θ ] (see Appendix A.1.1).

Original: Let ¯ θ
Revised: Let ¯ θ

Original: i be the point generated by Tail-averaged SGD with the batch size b on machine i ( i ∈
Revised: i be the point generated by Tail-averaged SGD with the batch size b on machine i ( i ∈

Original: [ P ]) and let ¯ θ := 1 P P Pi =1 ¯ θ i be the point generated by
Revised: [ P ]) and let ¯ θ := 1 P P Pi =1 ¯ θ i be the point generated by

Original: Parallelizing Tail-averaged SGD.
Revised: Parallelizing Tail-averaged SGD.

Original: Then, Theorem 6 in (Jain et al., 2018) guarantees that
Revised: Then, Theorem 6 in (Jain et al., 2018) guarantees that

Original: [Equation]
Revised: [Equation]

Original:  where s is the initial iterations, and n is the total samples, µ > 0 is the smallest eigenvalue of the
Revised: ) , where s is the initial iterations, and n is the total samples, µ > 0 is the smallest eigenvalue of the

Original: Hessian of f , and ( θ i ) i>s and ¯ θ i := 1 ⌊ nPb ⌋− s
Revised: Hessian of f , and ( θ i ) i>s and ¯ θ i := 1 ⌊ nPb ⌋− s

Original: P i>
Revised: P i>

Original: s θ
Revised: s θ

Original: i are the sequences generated by Tail-averaged
Revised: i are the sequences generated by Tail-averaged

Original: SGD (see also Appendix A.1.1).
Revised: SGD (see also Appendix A.1.1).

Original: This result with P = 1 coincides with (11).
Revised: This result with P = 1 coincides with (12).

Original: Setting s > κ b log P and α = α b, max(Jain et al., 2018, P. 15, Remarks) ensures that
Revised: Setting s > κ b log P and α = α b, max(Jain et al., 2018, P. 15, Remarks) ensures that

Original: [Equation]
Revised: [Equation]

Original: which, together with K :
Revised: which, together with K :

Original: =
Revised: =

Original: nPb − s , implies that
Revised: nPb − s , implies that

Original: [Equation]
Revised: [Equation]

Original: Hence, (34) indicates that the larger the number of machines P is, the smaller the upper bound of E
Revised: Hence, (35) indicates that the larger the number of machines P is, the smaller the upper bound of E

Original: [ f (¯ θ )] − f ( θ ⋆ ) becomes.
Revised: [ f (¯ θ )] − f ( θ ⋆ ) becomes.

Original: Next, let us consider SGD independently in P machines, each of which contains nP samples, for minimizing the expected square loss function f .
Revised: Next, let us consider SGD independently in P machines, each of which contains nP samples, for minimizing the expected square loss function f .

Original: Given θ k ∈ R d , machine i ( i ∈
Revised: Given θ k ∈ R d , machine i ( i ∈

Original: [ P ]) generates the point
Revised: [ P ]) generates the point

Original: [Equation]
Revised: [Equation]

Original: using SGD with the batch size b and computes
Revised: using SGD with the batch size b and computes

Original: [Equation]
Revised: [Equation]

Original:  where ξ ( i ) k,j is a random variable generated by the j -th sample in the k -the iteration for machine
Revised: 36) where ξ ( i ) k,j is a random variable generated by the j -th sample in the k -the iteration for machine

Original: i and we assume that the stochastic gradient G ξ ( i ) k,j ( θ k ) satisﬁes (C2).
Revised: i and we assume that the stochastic gradient G ξ ( i ) k,j ( θ k ) satisﬁes (C2).

Original: We have the following theorem.
Revised: We have the following theorem.

Original: Theorem A.1.
Revised: Theorem A.1.

Original: Consider minimizing the expected square loss function f
Revised: Consider minimizing the expected square loss function f

Original: ( θ ) :
Revised: ( θ ) :

Original: = 12 E ( x ,y ) ∼D [ y − x ⊤ θ ] and let θ ⋆ be a minimizer of f .
Revised: = 12 E ( x ,y ) ∼D [ y − x ⊤ θ ] and let θ ⋆ be a minimizer of f .

Original: Then, under (C2) and (A1), the sequence ( θ k ) generated by
Revised: Then, under (C2) and (A1), the sequence ( θ k ) generated by

Original: Parallelizing SGD (35) satisﬁes the following: (i)
Revised: Parallelizing SGD (36) satisﬁes the following: (i)

Original: [Upper bound of VI( K, θ ⋆ ) ]
Revised: [Upper bound of VI( K, θ ⋆ ) ]

Original: For all K ≥ 1 ,
Revised: For all K ≥ 1 ,

Original: [Equation]
Revised: [Equation]

Original: where P is the number of machines,
Revised: where P is the number of machines,

Original: [Equation]
Revised: [Equation]

Original: (ii) [Steps to satisfy VI( K, θ ⋆ ) ≤ ϵ
Revised: (ii) [Steps to satisfy VI( K, θ ⋆ ) ≤ ϵ

Original: The number of steps K P deﬁned by
Revised: The number of steps K P deﬁned by

Original: [Equation]
Revised: [Equation]

Original: satisﬁes VI( K P , θ ⋆ ) ≤ ϵ and the function K P ( b ) deﬁned by (36) is convex and monotone decreasing with respect to b ( >
Revised: satisﬁes VI( K P , θ ⋆ ) ≤ ϵ and the function K P ( b ) deﬁned by ( 37) is convex and monotone decreasing with respect to b ( >

Original: C 2 ( ϵ − C 3 ) P > 0) .
Revised: C 2 ( ϵ − C 3 ) P > 0) .

Original: (iii)
Revised: (iii)

Original: [Minimization of SFO complexity]
Revised: [Minimization of SFO complexity]

Original: The SFO complexity deﬁned by
Revised: The SFO complexity deﬁned by

Original: [Equation]
Revised: [Equation]

Revised: [Equation]

Original: is convex with respect to b ( >
Revised: is convex with respect to b ( >

Original: C 2 ( ϵ − C 3 ) P > 0) .
Revised: C 2 ( ϵ − C 3 ) P > 0) .

Original: The batch size
Revised: The batch size

Original: [Equation]
Revised: [Equation]

Original: attains the following minimum value of N P deﬁned by (37):
Revised: attains the following minimum value of N P deﬁned by (38):

Original: [Equation]
Revised: [Equation]

Revised: [Equation]

Original: Let θ ( i ) 

Revised: Let θ ( i )

Original: = θ 1 ( i ∈
Revised: = θ 1 ( i ∈

Original: [ P ]) .
Revised: [ P ]) .

Original: Then, the SFO complexity N ⋆ = K ( b ⋆ ) b ⋆ for non-parallelizing SGD with the batch size b ⋆ = 2 C 2 ϵ − C 3 is obtained by (38) with P = 1 (see also Theorem 3.1(iii)), i.e.,
Revised: Then, the SFO complexity N ⋆ = K ( b ⋆ ) b ⋆ for non-parallelizing SGD with the batch size b ⋆ = 2 C 2 ϵ − C 3 is obtained by (39) with P = 1 (see also Theorem 3.1(iii)), i.e.,

Original: [Equation]
Revised: [Equation]

Original: Meanwhile, Parallelizing SGD (35) with the batch size b ⋆P =

Original: [Equation] − [Equation] ) P , where P ( > 1) is the number of machines, has SFO complexity (38), i.e.,
Revised: Meanwhile, Parallelizing SGD (36) with the batch size b ⋆P = 2 C 2 ( ϵ − C 3 ) P , where P ( > 1) is the number of machines, has SFO complexity (39), i.e.,

Original: [Equation]
Revised: [Equation]

Original: Therefore, we can conclude that, the larger P is, the smaller SFO complexity becomes.
Revised: Therefore, we can conclude that, the larger P is, the smaller SFO complexity becomes.

Original: Proof of Theorem A.1.
Revised: Proof of Theorem A.1.

Original: (i) Let k ∈ N .
Revised: (i) Let k ∈ N .

Original: The deﬁnition of θ ( i ) k
Revised: The deﬁnition of θ ( i ) k

Original: +1 :
Revised: +1 :

Original: = θ k − α ∇ f B ( i ) k
Revised: = θ k − α ∇ f B ( i ) k

Original: ( θ k ) ensures that, for all i ∈
Revised: ( θ k ) ensures that, for all i ∈

Original: [ P ] ,
Revised: [ P ] ,

Original: [Equation]
Revised: [Equation]

Original: which implies that
Revised: which implies that

Revised: E

Original: [Equation]
Revised: [Equation]

Original:  Hence, (C2) implies that, for all i ∈
Revised: i . Hence, (C2) implies that, for all i ∈

Original: [ P ] ,
Revised: [ P ] ,

Revised: [Equation]

Revised: ii

Original: [Equation]
Revised: [Equation]

Original: A discussion similar to the one showing (13) implies that, for all i ∈
Revised: A discussion similar to the one showing (14) implies that, for all i ∈

Original: [ P ] ,
Revised: [ P ] ,

Revised: [Equation]

Revised: The deﬁnition of θ k and the linearity of ∇ f guarantee that

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: (cid:13)(cid:13) (cid:13)(cid:13)(cid:13)(cid:13)b X j ∈ [ b ] (cid:16) G ξ ( i ) k,j ( θ k ) − ∇ f ( θ k ) (cid:17)(cid:13)(cid:13) (cid:13)(cid:13)(cid:13)(cid:13) 2 (cid:12) (cid:12)(cid:12)(cid:12)(cid:12) θ k  = b 2 E 64 (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)X j ∈ [ b ] @

Original: [Equation]
Revised: G ξ ( i ) k,j @ P X i ∈ [ P ] θ ( i ) k

Original: which, together with (C2)
Revised: A − ∇ f @ P X i ∈ [ P ] θ ( i ) k

Original: [Equation]
Revised: A A (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13) 2 (cid:12)(cid:12)(cid:12)(cid:12)(cid:12) θ k  = P 2 b 2 E 64 (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)X j ∈ [ b ] X i ∈

Original:  in turn implies that
Revised: [ P ] (cid:16) G ξ ( i ) k,j ( θ ( i ) k ) − ∇ f ( θ ( i ) k ) (cid:17)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13) 2 (cid:12)(cid:12)(cid:12)(cid:12)(cid:12) θ k 75 , which, together with (C2), in turn implies that

Original: [Equation]
Revised: [Equation]

Original: Hence, from (A1),
Revised: Hence, from (A1)

Original: [Equation]
Revised: [Equation]

Original: Accordingly, from (39) and (40)
Revised: E

Original: [Equation]
Revised: [Equation]

Original:  for all i ∈ [ P ] , 
Revised: Accordingly, from (40) and (41), for all i ∈ [ P ] , E

Original: [Equation]
Revised: [Equation]

Original: Since the convexity of ∥ · ∥ 2 and the deﬁnition of θ k imply that
Revised: Since the convexity of ∥ · ∥ 2 and the deﬁnition of θ k imply that

Original: [Equation]
Revised: [Equation]

Original: we have that
Revised: we have that

Original: [Equation]
Revised: [Equation]

Original: Hence, for all K ≥ 1 ,
Revised: Hence, for all K ≥ 1 ,

Original: [Equation]
Revised: [Equation]

Revised: 2 αP

Revised: K + σ 2 α

Revised: Pb +

Revised: G 2 α ≤ max i ∈

Revised: [ P ] E [ ∥ θ ( i ) 1 − θ ⋆ ∥ 2 ] 2 α | {z }

Revised: C

Revised: K + σ 2 α 2 |{z}

Revised: C

Revised: Pb +

Revised: G 2 α 2 | {z }

Revised: C.

Original: Since f is convex, we have that 
Revised: Since f is convex, we have that E

Original: [Equation]
Revised: [Equation]

Original: ii) A discussion similar to the one showing (ii) in Theorem 3.1 for SGD would show (ii) in Theorem A.1.
Revised: (ii) A discussion similar to the one showing (ii) in Theorem 3.1 for SGD would show (ii) in Theorem A.1.

Original: (iii)
Revised: (iii)

Original: An argument similar to that which obtained (iii) in Theorem 3.1 for SGD would prove (iii) in Theorem A.1.
Revised: An argument similar to that which obtained (iii) in Theorem 3.1 for SGD would prove (iii) in Theorem A.1.

Original: A. A DDITIONAL NUMERICAL RESULTS
Revised: A. A DDITIONAL NUMERICAL RESULTS

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table][Table]
Revised: [Table] [Table]