Original: More Specifically, A ( β 2 ) needs to satisfy ( ρ 1 , ρ 2and ρ 3 are defined in Appendix F.1).
Revised: More Specifically, A ( β 2 ) needs to satisfy ( ρ 1 , ρ 2and ρ 3 are defined in Appendix F.1).

Original: [Figure]
Revised: [Figure]

Original: [Equation]
Revised: [Equation]

Original: Then
Revised: Then

Original: [Equation]
Revised: [Equation]

Original: we have the following result when k is large enough such that β ( k − 1)
Revised: we have the following result when k is large enough such that β ( k − 1)

Original: n≤ β n 1 √ k − 1 and k ≥ 4 :
Revised: n≤ β n 1 √ k − 1 and k ≥ 4 :

Original: [Equation]
Revised: [Equation]

Original: Proof of Lemma G.6 can be seen in Appendix G.9.
Revised: Proof of Lemma G.6 can be seen in Appendix G.9.

Original: Remark G.7 .
Revised: Remark G.7 .

Original: Condition (33) specifies the smallest threshold of β 2 to ensure the convergence.
Revised: Condition (33) specifies the smallest threshold of β 2 to ensure the convergence.

Original: Thiscondition can be translated into the threshold funtion γ 1 ( n ) mentioned in Theorem 3.1.
Revised: Thiscondition can be translated into the threshold funtion γ 1 ( n ) mentioned in Theorem 3.1.

Original: As a roughestimate, Lemma G.6 requires β 2 ≥ γ 1 ( n ) = 1 − O (cid:0) (1 − β n 1 ) / ( n 2 ρ ) (cid:1) , where ρ = ρ 1 ρ 2 ρ 3 .
Revised: As a roughestimate, Lemma G.6 requires β 2 ≥ γ 1 ( n ) = 1 − O (cid:0) (1 − β n 1 ) / ( n 2 ρ ) (cid:1) , where ρ = ρ 1 ρ 2 ρ 3 .

Original: Asdiscussed in Appendix F.1, we have 0 ≤ ρ 3 ≤ √ nρ 1 ≤ n .
Revised: Asdiscussed in Appendix F.1, we have 0 ≤ ρ 3 ≤ √ nρ 1 ≤ n .

Original: When ρ 1 , ρ 2 , ρ 3 achieve their upper boundat the same time, we get the worst case bound β 2 ≥ γ 1 ( n ) = 1 − O (cid:0) (1 − β n 1 ) /n 4 .
Revised: When ρ 1 , ρ 2 , ρ 3 achieve their upper boundat the same time, we get the worst case bound β 2 ≥ γ 1 ( n ) = 1 − O (cid:0) (1 − β n 1 ) /n 4 .

Original: 5 (cid:1) .
Revised: 5 (cid:1) .

Original: However, ρ ishighly dependent on the problem instance f ( x ) and training process.
Revised: However, ρ ishighly dependent on the problem instance f ( x ) and training process.

Original: Our experiments in Appendix
Revised: Our experiments in Appendix

Original: B.1 shows that ρ is often much smaller than its worst case bound, making the threshold of β 2 lowerthan it appears to be.
Revised: B.1 shows that ρ is often much smaller than its worst case bound, making the threshold of β 2 lowerthan it appears to be.

Original: We further remark that γ 1 ( n ) ∝ (1 − β n 1 ) .
Revised: We further remark that γ 1 ( n ) ∝ (1 − β n 1 ) .

Original: That is to say, as β 1 increases, the threshold of β 2 alsoslowly increases (to ensure the convergence).
Revised: That is to say, as β 1 increases, the threshold of β 2 alsoslowly increases (to ensure the convergence).

Original: However, such phenomenon is not observed in ourexperiments.
Revised: However, such phenomenon is not observed in ourexperiments.

Original: We conjecture γ 1 ( n ) should be independent of β 1 , removing the dependence (1 − β n 1 )is considered as an interesting future direction.
Revised: We conjecture γ 1 ( n ) should be independent of β 1 , removing the dependence (1 − β n 1 )is considered as an interesting future direction.

Original: Remark G.8 .
Revised: Remark G.8 .

Original: We emphasize that the constant term O ( √ D 0 ) will vanish to 0 as β 2 goes to 1.
Revised: We emphasize that the constant term O ( √ D 0 ) will vanish to 0 as β 2 goes to 1.

Original: Thiscan be seen in the proof in Appendix G.9 (the definition of F 4 ) and Remark G.14.
Revised: Thiscan be seen in the proof in Appendix G.9 (the definition of F 4 ) and Remark G.14.

Original: Based on Lemma G.6, we can further rewrite (30) as follows.
Revised: Based on Lemma G.6, we can further rewrite (30) as follows.

Original: [Equation]
Revised: [Equation]

Original: The proof of Theorem 3.1 is concluded by plugging (34) into Descent Lemma (24) and then takingtelescope some from k = t 0 to k = T .
Revised: The proof of Theorem 3.1 is concluded by plugging (34) into Descent Lemma (24) and then takingtelescope some from k = t 0 to k = T .

Original: These steps are quite standard in non-convex optimization.
Revised: These steps are quite standard in non-convex optimization.

Original: We finish these calculation in Lemma G.

Revised: We finish these calculation in Lemma G.

Original: Lemma G.9.
Revised: Lemma G.9.

Original: When inequality (34) holds, we have the following results based on Descent Lemma(24) :
Revised: When inequality (34) holds, we have the following results based on Descent Lemma(24) :

Original: [Equation]
Revised: [Equation]

Original: Proof of Lemma G.9 can be seen in Appendix G.10.
Revised: Proof of Lemma G.9 can be seen in Appendix G.10.

Original: Now, the whole proof of Theorem 3.1 iscompleted.
Revised: Now, the whole proof of Theorem 3.1 iscompleted.

Original: G.2 Proof of Lemma G. 
Revised: G.2 Proof of Lemma G.

Original: To prove Lemma G.1, we only prove (27).
Revised: To prove Lemma G.1, we only prove (27).

Original: The proof for (26) can be analogized from the proof of(27).
Revised: The proof for (26) can be analogized from the proof of(27).

Original: We discuss the following two cases:
Revised: We discuss the following two cases:

Original: Case 1: When ∂ l f ( x k, 0 ) ( m l,k,i − ∂ l f i ( x k, 0 )) ≤ 0 , we have∂ l f ( x k, 0 )
Revised: Case 1: When ∂ l f ( x k, 0 ) ( m l,k,i − ∂ l f i ( x k, 0 )) ≤ 0 , we have∂ l f ( x k, 0 )

Original: [Equation]
Revised: [Equation]

Original: m l,k
Revised: m l,k

Original: ,i
Revised: ,i

Original: [Equation]
Revised: [Equation]

Original: ∂ l f
Revised: ∂ l f

Original: i
Revised: i

Original: [Equation]
Revised: [Equation]

Original: x k,
Revised: x k,

Original: [Equation]
Revised: [Equation]

Original: where ( a ) is because of √ v l,k,i ≥ (cid:112) β
Revised: where ( a ) is because of √ v l,k,i ≥ (cid:112) β

Original: i 2 √ v l,k, 0 .
Revised: i 2 √ v l,k, 0 .

Original: Case 2: When ∂ l f ( x k, 0 ) ( m l,k,i − ∂ l f i ( x k, 0 )) ≥ 0 , we have∂ l f ( x k,
Revised: Case 2: When ∂ l f ( x k, 0 ) ( m l,k,i − ∂ l f i ( x k, 0 )) ≥ 0 , we have∂ l f ( x k,

Original: [Equation]
Revised: [Equation]

Original: ( m l,k,i − ∂ l f i ( x k,
Revised: ( m l,k,i − ∂ l f i ( x k,

Original: [Equation]
Revised: [Equation]

Original: where ( ∗ ) is due to 1 √ 1+ x ≥ 1 − x 2 .
Revised: where ( ∗ ) is due to 1 √ 1+ x ≥ 1 − x 2 .

Original: We further have
Revised: We further have

Original: [Table]
Revised: [Table]

Original: v
Revised: v

Original: [Table]
Revised: [Table]

Original: where ( ∗∗ ) is due to the condition in the Lemma max i | ∂ l f i ( x τ k, 0 )
Revised: where ( ∗∗ ) is due to the condition in the Lemma max i | ∂ l f i ( x τ k, 0 )

Original: | ≥ Q k ≥ n △ nk .
Revised: | ≥ Q k ≥ n △ nk .

Original: Plug the aboveresult into (35) we have
Revised: Plug the aboveresult into (35) we have

Original: [Equation]
Revised: [Equation]

Original: In the last step ( ∗ ∗ ∗ ) , we use the following Lemma G.10.
Revised: In the last step ( ∗ ∗ ∗ ) , we use the following Lemma G.10.

Original: Lemma G.10.
Revised: Lemma G.10.

Original: Under Assumption 2.1, if the l -th component of ∇ f i ( x k, 0 ) satisfies
Revised: Under Assumption 2.1, if the l -th component of ∇ f i ( x k, 0 ) satisfies

Original: [Equation]
Revised: [Equation]

Original: , we have
Revised: , we have

Original: [Equation]
Revised: [Equation]

Original: Proof.
Revised: Proof.

Original: The proof idea of Lemma G.10 is similar as Lemma F.1 in (Shi et al., 2020), but with thefollowing differences:
Revised: The proof idea of Lemma G.10 is similar as Lemma F.1 in (Shi et al., 2020), but with thefollowing differences:

Original: The condition of Lemma F.1 in (Shi et al., 2020)
Revised: The condition of Lemma F.1 in (Shi et al., 2020)

Original: both require the full batch gradient | ∂ l f ( x k, 0 ) | ≥nQ k , which is different from our condition.
Revised: both require the full batch gradient | ∂ l f ( x k, 0 ) | ≥nQ k , which is different from our condition.

Original: Here, we choose the condition of Lemma G.10because it meets the need of our decomposition strategy in (30) .2.
Revised: Here, we choose the condition of Lemma G.10because it meets the need of our decomposition strategy in (30) .2.

Original: The constant Q k is different.
Revised: The constant Q k is different.

Original: The difference is due to the different update formula of RMSPropand general Adam.
Revised: The difference is due to the different update formula of RMSPropand general Adam.

Original: Anyhow, Lemma G.10 can be easily proved following most of the steps in Lemma F.1 in (Shi et al.,2020).
Revised: Anyhow, Lemma G.10 can be easily proved following most of the steps in Lemma F.1 in (Shi et al.,2020).

Original: We omit the proof for brevity.
Revised: We omit the proof for brevity.

Original: Combining the above Case 1 and Case 2 , we have
Revised: Combining the above Case 1 and Case 2 , we have

Original: [Equation]
Revised: [Equation]

Original: i ( x k, 0 ) | , where δ 1 = (1 − β 2 )4 nρ 2 β
Revised: i ( x k, 0 ) | , where δ 1 = (1 − β 2 )4 nρ 2 β

Original: n+
Revised: n+

Original: (cid:18)
Revised: (cid:18)

Original: 1 √ β n 2 −(cid:19) .
Revised: 1 √ β n 2 −(cid:19) .

Original: Proof is completed.
Revised: Proof is completed.

Original: G.3 Proof of Lemma G. 
Revised: G.3 Proof of Lemma G.

Original: We first prove the result for j = 1 .
Revised: We first prove the result for j = 1 .

Original: We discuss the following two cases.
Revised: We discuss the following two cases.

Original: Case 1: when ∂ l f ( x k, 0 ) √ v l,k, 0 ≥ ∂ l f ( x k − 1 , 0 ) √ v l,k − 1 , 0 : when ∂ l f ( x k, 0 ) ≤ 0 , we have
Revised: Case 1: when ∂ l f ( x k, 0 ) √ v l,k, 0 ≥ ∂ l f ( x k − 1 , 0 ) √ v l,k − 1 , 0 : when ∂ l f ( x k, 0 ) ≤ 0 , we have

Original: [Equation]
Revised: [Equation]

Original: When ∂ l f ( x k, 0 ) > 0 , we have
Revised: When ∂ l f ( x k, 0 ) > 0 , we have

Original: [Equation]
Revised: [Equation]

Original: In conclusion, we have:
Revised: In conclusion, we have:

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

Original: , where δ 1 =
Revised: , where δ 1 =

Original: [Equation]
Revised: [Equation]

Original: is a constant that goes to 0 when β 2 goes to 1.
Revised: is a constant that goes to 0 when β 2 goes to 1.

Original: Therefore, wehave
Revised: Therefore, wehave

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: Note that
Revised: Note that

Original: Case 2: when ∂ l f
Revised: Case 2: when ∂ l f

Original: [Equation]
Revised: [Equation]

Original: x
Revised: x

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

Original: : when ∂ l f ( x k, 0 ) ≥ 0 , we have
Revised: : when ∂ l f ( x k, 0 ) ≥ 0 , we have

Original: [Equation]
Revised: [Equation]

Original: When ∂ l f ( x k, 0 ) < 0 , we have
Revised: When ∂ l f ( x k, 0 ) < 0 , we have

Original: [Equation]
Revised: [Equation]

Original: Following the same strategy as in Case 1, we can show that
Revised: Following the same strategy as in Case 1, we can show that

Original: [Equation]
Revised: [Equation]

Original: which further implies
Revised: which further implies

Original: [Equation]
Revised: [Equation]

Original: Case 1 and Case 2 together, we have
Revised: Case 1 and Case 2 together, we have

Original: [Equation]
Revised: [Equation]

Original: Now we consider the case when j > 1 .
Revised: Now we consider the case when j > 1 .

Original: Based on the above inequality, we have
Revised: Based on the above inequality, we have

Original: [Table]
Revised: [Table]

Original: The proof is completed.
Revised: The proof is completed.

Original: G.4 Proof of Lemma G. 
Revised: G.4 Proof of Lemma G.

Original: To prove Lemma G.4, we need to further decompose E [ (cid:80) l large ( b 1 )] .
Revised: To prove Lemma G.4, we need to further decompose E [ (cid:80) l large ( b 1 )] .

Original: First and foremost, we write(cid:80)
Revised: First and foremost, we write(cid:80)

Original: n − 1 i =

Revised: n − 1 i =

Original: m l,k,i in an explicit form.m l,k,i = (1 − β
Revised: m l,k,i in an explicit form.m l,k,i = (1 − β

Original: [Equation]
Revised: [Equation]

Original: ∂ l f ( x 1 , 0 ) (37)
Revised: ∂ l f ( x 1 , 0 ) (37)

Original: Since ∂ l f ( x 1 , 0 ) =
Revised: Since ∂ l f ( x 1 , 0 ) =

Original: ∂ l f ( x 1 , 0 )(1 − β 1 )(1 + β 1 + · · · + β ∞ 1 ) and ∂ l f ( x 1 , 0 ) =
Revised: ∂ l f ( x 1 , 0 )(1 − β 1 )(1 + β 1 + · · · + β ∞ 1 ) and ∂ l f ( x 1 , 0 ) =

Original: (cid:80) n − 1 i =

Revised: (cid:80) n − 1 i =

Original: ∂ l f i ( x 1 , 0 ) , wehaveβ (
Revised: ∂ l f i ( x 1 , 0 ) , wehaveβ (

Original: [Equation]
Revised: [Equation]

Original: − 1) n + i +

Revised: − 1) n + i +

Original: [Equation]
Revised: [Equation]

Original: Plugging (38) into (37), we have
Revised: Plugging (38) into (37), we have

Original: [Equation]
Revised: [Equation]

Original: ∂ l f τ k, 0 ( x k, 0 )
Revised: ∂ l f τ k, 0 ( x k, 0 )

Original: +
Revised: +

Original: β
Revised: β

Original: i +11 f τ k − 1 ,n − 1 ( x k − 1 ,n − 1 ) + · · · + β i
Revised: i +11 f τ k − 1 ,n − 1 ( x k − 1 ,n − 1 ) + · · · + β i

Original: + nf τ k − 1 , 0 ( x k − 1 , 0 ) + · · · + β ( k − 2) n
Revised: + nf τ k − 1 , 0 ( x k − 1 , 0 ) + · · · + β ( k − 2) n

Original: + i +1∂ l f τ 1 ,n − 1 ( x 1 ,n − 1 ) + · · · + β ( k − 1) n + i∂ l f τ 1 , 0 ( x 1 , 0 )
Revised: + i +1∂ l f τ 1 ,n − 1 ( x 1 ,n − 1 ) + · · · + β ( k − 1) n + i∂ l f τ 1 , 0 ( x 1 , 0 )

Original: + β ( k − 1) n
Revised: + β ( k − 1) n

Original: + i +1∂
Revised: + i +1∂

Original: [Equation]
Revised: [Equation]

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

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

Original: ( k − 1) n
Revised: ( k − 1) n

Original: [Equation]
Revised: [Equation]

Original: i +

Revised: i +

Original: [Equation]
Revised: [Equation]

Original: n
Revised: n

Original: [Equation]
Revised: [Equation]

Original: ( x
Revised: ( x

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

Original: [Equation]
Revised: [Equation]

Original: 1) n + i +

Revised: 1) n + i +

Original: [Equation]
Revised: [Equation]

Original: l f 0 ( x 1 , 0 ) + · · ·
Revised: l f 0 ( x 1 , 0 ) + · · ·

Original: [Equation]
Revised: [Equation]

Original: β ( k − 1) n
Revised: β ( k − 1) n

Original: + i +

Revised: + i +

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

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

Original: Using (39), we have (For each ‘epoch’, we suggest readers to read from bottom to the top.)
Revised: Using (39), we have (For each ‘epoch’, we suggest readers to read from bottom to the top.)

Original: [Equation]
Revised: [Equation]

Original: thepoch
Revised: thepoch

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

Original: ( x 1 ,n − 1 ) + · · · + β ( k − 1) n + n − 2∂ l f τ 1 , 0 ( x 1 , 0 ) + · · · + β ( k − 2) n +1∂ l f τ 1 ,n − 1 ( x 1 ,n − 1 ) + · · · + β ( k − 1) n∂ l f τ 1 , 0 ( x 1 , 0 ) (cid:124) (cid:123)(cid:122) (cid:125) 

Revised: ( x 1 ,n − 1 ) + · · · + β ( k − 1) n + n − 2∂ l f τ 1 , 0 ( x 1 , 0 ) + · · · + β ( k − 2) n +1∂ l f τ 1 ,n − 1 ( x 1 ,n − 1 ) + · · · + β ( k − 1) n∂ l f τ 1 , 0 ( x 1 , 0 ) (cid:124) (cid:123)(cid:122) (cid:125)

Original: -thepoch
Revised: -thepoch

Original: +
Revised: +

Original: [Equation]
Revised: [Equation]

Original: ( k
Revised: ( k

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

Original: f
Revised: f

Original: [Equation]
Revised: [Equation]

Original: ) n
Revised: ) n

Original: [Equation]
Revised: [Equation]

Original: n
Revised: n

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

Original: l f n
Revised: l f n

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

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

Original: ∂ l f
Revised: ∂ l f

Original: [Equation]
Revised: [Equation]

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

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

Original: ( k
Revised: ( k

Original: [Equation]
Revised: [Equation]

Original: 1) n
Revised: 1) n

Original: [Equation]
Revised: [Equation]

Original: 1∂ l f n − 1 ( x 1 , 0 )
Revised: 1∂ l f n − 1 ( x 1 , 0 )

Original: [Equation]
Revised: [Equation]

Original: (cid:124) (cid:123)(cid:122) (cid:125) 

Revised: (cid:124) (cid:123)(cid:122) (cid:125)

Original: -thepoch ... } (40)
Revised: -thepoch ... } (40)

Original: Note that in (40), the power of β 1 grows slower in the blue part (when k = 0 ), such a transition willcause trouble in bounding the (cid:80) n − 1 i =

Revised: Note that in (40), the power of β 1 grows slower in the blue part (when k = 0 ), such a transition willcause trouble in bounding the (cid:80) n − 1 i =

Original: ( m l,k,i − ∂ l f i ( x k, 0 )) .
Revised: ( m l,k,i − ∂ l f i ( x k, 0 )) .

Original: Therefore, we need to define an auxillarysequence M ′ l,k which does not involve such a phase transition.
Revised: Therefore, we need to define an auxillarysequence M ′ l,k which does not involve such a phase transition.

Original: We define M ′ l,k as follows.
Revised: We define M ′ l,k as follows.

Original: (For each‘epoch’, we suggest readers to read from bottom to the top.)
Revised: (For each‘epoch’, we suggest readers to read from bottom to the top.)

Original: [Equation]
Revised: [Equation]

Original: [Figure] 
Revised: [Figure] [Equation] [Table] [Equation]

Revised: [Table]

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

Revised: [Equation]

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

Revised: [Table]

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

Revised: [Equation]

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

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

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

Original: [Equation]

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

Original: [Table]

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

Original: [Equation]

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

Original: [Table]

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

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]

Original: [Equation]

Original: [Table]
Revised: [Table]

Original: n
Revised: n

Original: [Equation]
Revised: [Equation]

Original: n
Revised: n

Original: [Equation]
Revised: [Equation]

Original: ∂ l f n
Revised: ∂ l f n

Original: [Equation]
Revised: [Equation]

Original: ∂
Revised: ∂

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

Original: Now we bound (cid:80) n − 1 i =

Revised: Now we bound (cid:80) n − 1 i =

Original: ( m l,k,i − ∂ l f i ( x k, 0 )) with the help of M ′ l,k .
Revised: ( m l,k,i − ∂ l f i ( x k, 0 )) with the help of M ′ l,k .

Original: Denoting F l,k :=(cid:80) n − 1 i =

Revised: Denoting F l,k :=(cid:80) n − 1 i =

Original: ∂ l f i ( x k, 0 ) , we have:
Revised: ∂ l f i ( x k, 0 ) , we have:

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

Original: To proceed, we use the relation 1 = (1 − β 1 )(1 + β 1 + β 21 + · · · ) to rewrite F l,k .
Revised: To proceed, we use the relation 1 = (1 − β 1 )(1 + β 1 + β 21 + · · · ) to rewrite F l,k .

Original: F l
Revised: F l

Original: [Equation]
Revised: [Equation]

Original: k := n − 1 (cid:88) i =
Revised: k := n − 1 (cid:88) i =

Original: [Equation]
Revised: [Equation]

Original: + ...
Revised: + ...

Original: +
Revised: +

Original: [Figure]
Revised: [Figure]

Original: [Equation]
Revised: [Equation]

Original: [Figure]
Revised: [Figure]

Original: [Equation]
Revised: [Equation]

Original: For the sake of better presentation
Revised: For the sake of better presentation

Original: [Equation]
Revised: [Equation]

Original: we rewrite F l
Revised: we rewrite F l

Original: [Equation]
Revised: [Equation]

Original: k and M ′ l
Revised: k and M ′ l

Original: [Equation]
Revised: [Equation]

Original: k as follows:
Revised: k as follows:

Original: [Equation]
Revised: [Equation]

Original: · , where ( F l,k ) j contains the summand of F l,k in the j -th epoch, j = k, k − 1 , · · · − ∞ .
Revised: · , where ( F l,k ) j contains the summand of F l,k in the j -th epoch, j = k, k − 1 , · · · − ∞ .

Original: Similarly for
Revised: Similarly for

Original: M ′ l,k .
Revised: M ′ l,k .

Original: Now, we separate M ′ l,k − F l,k into two parts.
Revised: Now, we separate M ′ l,k − F l,k into two parts.

Original: [Equation]
Revised: [Equation]

Original: Now, we rewrite E [ (cid:80) l large ( b 1 )] :
Revised: Now, we rewrite E [ (cid:80) l large ( b 1 )] :

Original: [Equation]
Revised: [Equation]

Original: l large
Revised: l large

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

Original: l large
Revised: l large

Original: [Equation]
Revised: [Equation]

Original: l large
Revised: l large

Original: [Equation]
Revised: [Equation]

Original: (cid:88) l large
Revised: (cid:88) l large

Original: [Equation]
Revised: [Equation]

Original: (cid:124) (cid:123)(cid:122) (cid:125) (1)
Revised: (cid:124) (cid:123)(cid:122) (cid:125) (1)

Original: [Equation]
Revised: [Equation]

Original: We bound (1) , (2) and (3) respectively.
Revised: We bound (1) , (2) and (3) respectively.

Original: We bound (1) and (3) in the following Lemma G.11 and
Revised: We bound (1) and (3) in the following Lemma G.11 and

Original: Lemma G.12.
Revised: Lemma G.12.

Original: Since the difference of M l,k − M ′ l,k only occurs in the high order terms of the infinitesum sequence, (1) is expected to vanish as k grows.
Revised: Since the difference of M l,k − M ′ l,k only occurs in the high order terms of the infinitesum sequence, (1) is expected to vanish as k grows.

Original: Similarly for (3) .
Revised: Similarly for (3) .

Original: Lemma G.11.
Revised: Lemma G.11.

Original: When k is large enough such that: β ( k − 1) n
Revised: When k is large enough such that: β ( k − 1) n

Original: [Equation]
Revised: [Equation]

Original: 1 and k ≥ 4 , then we have
Revised: 1 and k ≥ 4 , then we have

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

Original: where G 4 = d (cid:113)
Revised: where G 4 = d (cid:113)

Original: [Equation]
Revised: [Equation]

Original: β n 2 β n
Revised: β n 2 β n

Original: [Equation]
Revised: [Equation]

Original: √ 2 n ( n
Revised: √ 2 n ( n

Original: [Equation]
Revised: [Equation]

Original: (cid:80)
Revised: (cid:80)

Original: [Equation]
Revised: [Equation]

Original: Lemma G.12.
Revised: Lemma G.12.

Original: When k is large enough such that: β ( k − 1)
Revised: When k is large enough such that: β ( k − 1)

Original: n≤ β n 1 √ k − 1 and k ≥ 4 , then we have
Revised: n≤ β n 1 √ k − 1 and k ≥ 4 , then we have

Original: E
Revised: E

Original: [Equation]
Revised: [Equation]

Original: where G 5 = d (cid:113)
Revised: where G 5 = d (cid:113)

Original: [Equation]
Revised: [Equation]

Original: 23 β n 2 (cid:16) β 2 n 1 2 n 3 △
Revised: 23 β n 2 (cid:16) β 2 n 1 2 n 3 △

Original: [Equation]
Revised: [Equation]

Original: We relegate the proof of Lemma G.11 and G.12 to Appendix G.5 and G.6.
Revised: We relegate the proof of Lemma G.11 and G.12 to Appendix G.5 and G.6.

Original: Now we bound (2) .
Revised: Now we bound (2) .

Original: This part involves the difficulties (i), (ii) and (iii) mentioned in Appendix G.1.
Revised: This part involves the difficulties (i), (ii) and (iii) mentioned in Appendix G.1.

Original: We bound (2) in Lemma G.13.
Revised: We bound (2) in Lemma G.13.

Original: Lemma G.13.
Revised: Lemma G.13.

Original: When k is large enough such that: β ( k − 1)
Revised: When k is large enough such that: β ( k − 1)

Original: n≤ β n 1 √ k − 1 and k ≥ 2 , then we have
Revised: n≤ β n 1 √ k − 1 and k ≥ 2 , then we have

Original: [Equation]
Revised: [Equation]

Original: The constant terms G 6 and G 7 are specified in Appendix G.7.
Revised: The constant terms G 6 and G 7 are specified in Appendix G.7.

Original: Proof is shown in Appendix G.7.
Revised: Proof is shown in Appendix G.7.

Original: Combining Lemma G.11, G.12 and G.13 together, we conclude the proof.
Revised: Combining Lemma G.11, G.12 and G.13 together, we conclude the proof.

Original: [Equation]
Revised: [Equation]

Original: G.5 Proof of Lemma G. 
Revised: G.5 Proof of Lemma G.

Original: By definition of M l,k and M ′ l,k (see (40) and (41)), they only differ when k ≤ 0 .
Revised: By definition of M l,k and M ′ l,k (see (40) and (41)), they only differ when k ≤ 0 .

Original: More specifically,
Revised: More specifically,

Original: We have (For each ‘epoch’, we suggest readers to read from bottom to the top.)
Revised: We have (For each ‘epoch’, we suggest readers to read from bottom to the top.)

Original: M l,k
Revised: M l,k

Original: [Equation]
Revised: [Equation]

Original: l,k
Revised: l,k

Original: [Equation]
Revised: [Equation]

Original: + · · · + (cid:16) β ( k − 1) n +3− β kn +2(cid:17) ∂ l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +3− β kn + n +1(cid:17) ∂ l f n − 1 ( x 1 , 0 ) + (cid:16) β ( k − 1) n +2− β kn +1(cid:17)
Revised: + · · · + (cid:16) β ( k − 1) n +3− β kn +2(cid:17) ∂ l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +3− β kn + n +1(cid:17) ∂ l f n − 1 ( x 1 , 0 ) + (cid:16) β ( k − 1) n +2− β kn +1(cid:17)

Original: ∂ l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +2− β kn + n(cid:17) ∂ l f n − 1 ( x 1 , 0 ) (cid:124) (cid:123)(cid:122) (cid:125) -

Revised: ∂ l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +2− β kn + n(cid:17) ∂ l f n − 1 ( x 1 , 0 ) (cid:124) (cid:123)(cid:122) (cid:125) -

Original: -th epoch + (cid:16) β
Revised: -th epoch + (cid:16) β

Original: ( k − 1) n + n +2− β
Revised: ( k − 1) n + n +2− β

Original: ( k +1) n + n(cid:17) ∂
Revised: ( k +1) n + n(cid:17) ∂

Original: l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n + n +2− β
Revised: l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n + n +2− β

Original: ( k +1) n + n + n − 1(cid:17)
Revised: ( k +1) n + n + n − 1(cid:17)

Original: ∂ l f n − 1 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +4− β ( k +1) n +2(cid:17) ∂ l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +4− β ( k +1) n + n +1(cid:17)
Revised: ∂ l f n − 1 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +4− β ( k +1) n +2(cid:17) ∂ l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +4− β ( k +1) n + n +1(cid:17)

Original: ∂ l f n − 1 ( x 1 , 0 )
Revised: ∂ l f n − 1 ( x 1 , 0 )

Original: + (cid:16) β
Revised: + (cid:16) β

Original: ( k − 1) n +3− β
Revised: ( k − 1) n +3− β

Original: ( k +1) n +1(cid:17) ∂
Revised: ( k +1) n +1(cid:17) ∂

Original: l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +3− β ( k +1) n + n(cid:17) ∂ l f n − 1 ( x 1 , 0 ) (cid:124)
Revised: l f 0 ( x 1 , 0 ) + · · · + (cid:16) β ( k − 1) n +3− β ( k +1) n + n(cid:17) ∂ l f n − 1 ( x 1 , 0 ) (cid:124)

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

Original: We start with the 1st column in the ‘0-th epoch’
Revised: We start with the 1st column in the ‘0-th epoch’

Original: (from the bottom to the top).
Revised: (from the bottom to the top).

Original: The 1st column in the ‘0-th epoch’
Revised: The 1st column in the ‘0-th epoch’

Original: [Equation]
Revised: [Equation]

Original: Similarly, we can bound every column in the in the ‘0-th epoch’, e.g. last ( n − 1 -th) column can bebounded as follows.
Revised: Similarly, we can bound every column in the in the ‘0-th epoch’, e.g. last ( n − 1 -th) column can bebounded as follows.

Original: The last column in the ‘0-th epoch’ =
Revised: The last column in the ‘0-th epoch’ =

Original: β ( k − 1) n +

Revised: β ( k − 1) n +

Original: [Equation]
Revised: [Equation]

Original: Summing up all the columns, we have
Revised: Summing up all the columns, we have

Original: The ‘0-th epoch’
Revised: The ‘0-th epoch’

Original: [Equation]
Revised: [Equation]

Original: Using the same technique, it can be shown that
Revised: Using the same technique, it can be shown that

Original: The
Revised: The

Original: ‘-1-th epoch’ ≤ β
Revised: ‘-1-th epoch’ ≤ β

Original: [Equation]
Revised: [Equation]

Original: k −
Revised: k −

Original: [Equation]
Revised: [Equation]

Original: The
Revised: The

Original: ‘-2-th epoch’ ≤ β
Revised: ‘-2-th epoch’ ≤ β

Original: k
Revised: k

Original: −
Revised: −

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

Original: Plugging all these results in (47), we have
Revised: Plugging all these results in (47), we have

Original: [Equation]
Revised: [Equation]

Original: That is to say, when k is large enough such that β ( k − 1)
Revised: That is to say, when k is large enough such that β ( k − 1)

Original: n≤ β n 1 √ k − 1 we have
Revised: n≤ β n 1 √ k − 1 we have

Original: [Equation]
Revised: [Equation]

Original: Combining with Lemma G.10, the proof is completed.
Revised: Combining with Lemma G.10, the proof is completed.

Original: G.6 Proof of Lemma G. 
Revised: G.6 Proof of Lemma G.

Original: We start with (cid:16) M ′ l,k (cid:17) 0 − ( F l,k ) 0 .
Revised: We start with (cid:16) M ′ l,k (cid:17) 0 − ( F l,k ) 0 .

Original: [Equation]
Revised: [Equation]

Original: M ′ l
Revised: M ′ l

Original: [Equation]
Revised: [Equation]

Original: k (cid:1)
Revised: k (cid:1)

Original: [Equation]
Revised: [Equation]

Original: F
Revised: F

Original: [Equation]
Revised: [Equation]

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

Original: where
Revised: where

Original: [Equation]
Revised: [Equation]

Original: We further have
Revised: We further have

Original: [Equation]
Revised: [Equation]

Original: Therefore,
Revised: Therefore,

Original: [Equation]
Revised: [Equation]

Original: Using the same calculation
Revised: Using the same calculation

Original: [Equation]
Revised: [Equation]

Original: we can get the following result:
Revised: we can get the following result:

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

Original: (cid:0)
Revised: (cid:0)

Original: [Equation]
Revised: [Equation]

Original: (cid:1) n −
Revised: (cid:1) n −

Original: [Equation]
Revised: [Equation]

Original: i =
Revised: i =

Original: | ∂ l f i ( x 1 , 0 ) | .
Revised: | ∂ l f i ( x 1 , 0 ) | .

Original: Repeat this calculation, we have
Revised: Repeat this calculation, we have

Original: [Equation]
Revised: [Equation]

Original: When β ( k − 1)
Revised: When β ( k − 1)

Original: n≤ β n 1 √ k − 1 , we further have:
Revised: n≤ β n 1 √ k − 1 , we further have:

Original: [Equation]
Revised: [Equation]

Original: k, where ( ∗ ) : 1 √ n ( k − 1) − 1 ≤ (cid:113) 2 nk when k ≥ 4 .
Revised: k, where ( ∗ ) : 1 √ n ( k − 1) − 1 ≤ (cid:113) 2 nk when k ≥ 4 .

Original: Therefore, we have
Revised: Therefore, we have

Original: (cid:12)(cid:12)(cid:12)(cid:0)
Revised: (cid:12)(cid:12)(cid:12)(cid:0)

Original: [Equation]
Revised: [Equation]

Original: ˜
Revised: ˜

Original: [Equation]
Revised: [Equation]

Original: Combining with Lemma G.10, the proof is completed with constant G 5 defined in Lemma G.12.
Revised: Combining with Lemma G.10, the proof is completed with constant G 5 defined in Lemma G.12.

Original: G.7 Proof of Lemma G. 
Revised: G.7 Proof of Lemma G.

Original: In this section, we derive a lower bound for E (cid:104)(cid:80)
Revised: In this section, we derive a lower bound for E (cid:104)(cid:80)

Original: [Equation]
Revised: [Equation]

Original: We will use the ideas mentioned in Appendix G.1 (i.e., Step 1,2 and 3).
Revised: We will use the ideas mentioned in Appendix G.1 (i.e., Step 1,2 and 3).

Original: We first rewrite “ l large" intoindicator function as follows:
Revised: We first rewrite “ l large" intoindicator function as follows:

Original: [Table]
Revised: [Table]

Original: where I k :
Revised: where I k :

Original: = I (cid:16) max i | ∂ l f i ( x k, 0 ) | ≥ Q k := △ 1 n √ n √ k
Revised: = I (cid:16) max i | ∂ l f i ( x k, 0 ) | ≥ Q k := △ 1 n √ n √ k

Original: [Table]
Revised: [Table]

Original: n 2 (cid:17) .
Revised: n 2 (cid:17) .

Original: We also define I k − j :=
Revised: We also define I k − j :=

Original: I (cid:16) max i | ∂ l f i ( x k − j, 0 ) | ≥ (cid:80) kp = k − j Q p (cid:17) , it will be used later.
Revised: I (cid:16) max i | ∂ l f i ( x k − j, 0 ) | ≥ (cid:80) kp = k − j Q p (cid:17) , it will be used later.

Original: We take the conditional expectation over the history before x k, 0 .
Revised: We take the conditional expectation over the history before x k, 0 .

Original: We first focus on
Revised: We first focus on

Original: E k (cid:104)(cid:80) dl
Revised: E k (cid:104)(cid:80) dl

Original: =1 I k ∂
Revised: =1 I k ∂

Original: [Table]
Revised: [Table]

Original: f ( x k, 0 ) √ v k, 0 (cid:16)(cid:16)
Revised: f ( x k, 0 ) √ v k, 0 (cid:16)(cid:16)

Original: M ′ l,k (cid:17) k − ( F l,k ) k (cid:17)(cid:105)
Revised: M ′ l,k (cid:17) k − ( F l,k ) k (cid:17)(cid:105)

Original: and we delegate the history part for later analysis.
Revised: and we delegate the history part for later analysis.

Original: For each possible (cid:16) M ′ l,k (cid:17) k − ( F l,k ) k , we first convert all x k,i into x k, 0 using Lemma F.2.
Revised: For each possible (cid:16) M ′ l,k (cid:17) k − ( F l,k ) k , we first convert all x k,i into x k, 0 using Lemma F.2.

Original: Since(cid:16)
Revised: Since(cid:16)

Original: M ′ l,k (cid:17) k contains ( n − 1) + · ·
Revised: M ′ l,k (cid:17) k contains ( n − 1) + · ·

Original: [Equation]
Revised: [Equation]

Original: terms of x k,i (with i ̸ = 0 ), we have
Revised: terms of x k,i (with i ̸ = 0 ), we have

Original: [Equation]
Revised: [Equation]

Original: Using the same strategy for analyzing the color-ball toy example
Revised: Using the same strategy for analyzing the color-ball toy example

Original: [Equation]
Revised: [Equation]

Original: we have
Revised: we have

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: We denote J 1 := (cid:0) − 1 n β 1 − 2 n β 21 − · · · − n − 1 n β n − 1(cid:1) , it will be used repeatedly in the followingderivation.
Revised: We denote J 1 := (cid:0) − 1 n β 1 − 2 n β 21 − · · · − n − 1 n β n − 1(cid:1) , it will be used repeatedly in the followingderivation.

Original: Now we move one step further exert E k − 1 ( · ) .
Revised: Now we move one step further exert E k − 1 ( · ) .

Original: In particular, we need to calculate
Revised: In particular, we need to calculate

Original: E k
Revised: E k

Original: [Equation]
Revised: [Equation]

Original: (cid:17)(cid:35)(cid:41)
Revised: (cid:17)(cid:35)(cid:41)

Original: [Equation]
Revised: [Equation]

Original:  
Revised:  

Original: [Equation]
Revised: [Equation]

Original: The blue term is the residue from the k -th epoch.
Revised: The blue term is the residue from the k -th epoch.

Original: The red term is the main component in the ( k − 1)
Revised: The red term is the main component in the ( k − 1)

Original: -thepoch.
Revised: -thepoch.

Original: Before calculating E k − 1 ( · ) , we need to convert all the variable x into x k − 1 , 0 using Lipschitzproperty.
Revised: Before calculating E k − 1 ( · ) , we need to convert all the variable x into x k − 1 , 0 using Lipschitzproperty.

Original: First of all, we work on ( a ) .
Revised: First of all, we work on ( a ) .

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

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

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: where I k,k − j :=
Revised: where I k,k − j :=

Original: I (cid:16) max i | ∂ l f i ( x k, 0 )
Revised: I (cid:16) max i | ∂ l f i ( x k, 0 )

Original: | ≥ Q k and max i | ∂ l f i ( x k − j, 0 ) | ≥ (cid:80) kp = k − j Q p (cid:17) and˜ I k,k − j := I (cid:16) max i | ∂ l f i ( x k, 0 ) | ≥ Q k and max i | ∂ l f i ( x k − j, 0 ) | ≤ (cid:80) kp = k − j Q p (cid:17) .
Revised: | ≥ Q k and max i | ∂ l f i ( x k − j, 0 ) | ≥ (cid:80) kp = k − j Q p (cid:17) and˜ I k,k − j := I (cid:16) max i | ∂ l f i ( x k, 0 ) | ≥ Q k and max i | ∂ l f i ( x k − j, 0 ) | ≤ (cid:80) kp = k − j Q p (cid:17) .

Original: By Lemma G.3,we know I k,k − 1 =
Revised: By Lemma G.3,we know I k,k − 1 =

Original: I k − 1 , so we have:
Revised: I k − 1 , so we have:

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: Now we derive a lower bound for (b).
Revised: Now we derive a lower bound for (b).

Original: Similarly as before, we rewrite (cid:16) M ′ l,k (cid:17) k − 1 and ( F l,k ) k − 1 asfollows.
Revised: Similarly as before, we rewrite (cid:16) M ′ l,k (cid:17) k − 1 and ( F l,k ) k − 1 asfollows.

Original: [Equation]
Revised: [Equation]

Original: where
Revised: where

Original: [Equation]
Revised: [Equation]

Original: We now calculate ( b ) .
Revised: We now calculate ( b ) .

Original: Using the same idea as in ( a ) , we have
Revised: Using the same idea as in ( a ) , we have

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: To proceed, we derive an upper bound for (cid:12)(cid:12)(cid:12) M l,k − 1 − ( F l,k − 1 ) k − 1 (cid:12)(cid:12)(cid:12) .
Revised: To proceed, we derive an upper bound for (cid:12)(cid:12)(cid:12) M l,k − 1 − ( F l,k − 1 ) k − 1 (cid:12)(cid:12)(cid:12) .

Original: [Equation]
Revised: [Equation]

Original: Therefore
Revised: Therefore

Original: [Equation]
Revised: [Equation]

Original: we have:
Revised: we have:

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: The red term will be handled using color-ball method when taking conditional expectation Ex k − 1 ( · ) .
Revised: The red term will be handled using color-ball method when taking conditional expectation Ex k − 1 ( · ) .

Original: Now we have derived lower bounds for both ( a ) and ( b ) .
Revised: Now we have derived lower bounds for both ( a ) and ( b ) .

Original: Combining together, we have:
Revised: Combining together, we have:

Original: [Table]
Revised: [Table]

Original: 
Revised: 

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: For the first term in the above inequality
Revised: For the first term in the above inequality

Original: [Equation]
Revised: [Equation]

Original: we can calculate it using the idea in the color-ball toyexample:
Revised: we can calculate it using the idea in the color-ball toyexample:

Original: [Equation]
Revised: [Equation]

Original: To proceed
Revised: To proceed

Original: [Equation]
Revised: [Equation]

Original: we further take E k − 2 ( · ) and bound
Revised: we further take E k − 2 ( · ) and bound

Original: E k −  d
Revised: E k −  d

Original: (cid:88)
Revised: (cid:88)

Original: [Equation]
Revised: [Equation]

Original:   .
Revised:   .

Original: Repeat this process until k = 1 , we have:
Revised: Repeat this process until k = 1 , we have:

Original: E
Revised: E

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: + Error 1 + Error 2 + Errorwhere ( ∗ ) holds for large k such that β ( k − 1) n ≤ β n 1 √ k − 1 .
Revised: + Error 1 + Error 2 + Errorwhere ( ∗ ) holds for large k such that β ( k − 1) n ≤ β n 1 √ k − 1 .

Original: We specify Error 1 , Error 2 , Error 3 as follows.
Revised: We specify Error 1 , Error 2 , Error 3 as follows.

Original: Error
Revised: Error

Original: [Equation]
Revised: [Equation]

Original: n
Revised: n

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: − d
Revised: − d

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

Original: β
Revised: β

Original: [Table]
Revised: [Table]

Original: ) △ n
Revised: ) △ n

Original: [Table]
Revised: [Table]

Original: d
Revised: d

Original: [Table]
Revised: [Table]

Original: β n 2 | J 1 | n [ Q k + Q k − 1 + β n 1 ( Q k + Q k − 1 + Q k − 2 )
Revised: β n 2 | J 1 | n [ Q k + Q k − 1 + β n 1 ( Q k + Q k − 1 + Q k − 2 )

Original: +
Revised: +

Original: [Table]
Revised: [Table]

Original: Since δ 2 = lim k →∞ (cid:80) k − 1 j =1 ( β n 1 ) j (cid:113) kk − j is a finite constant, we have (cid:80) ∞
Revised: Since δ 2 = lim k →∞ (cid:80) k − 1 j =1 ( β n 1 ) j (cid:113) kk − j is a finite constant, we have (cid:80) ∞

Original: j =0 β jn 1 △ n ( k − j ) =
Revised: j =0 β jn 1 △ n ( k − j ) =

Original: △ 1 δ 2 √ nk .
Revised: △ 1 δ 2 √ nk .

Original: Inaddition, we have[ Q
Revised: Inaddition, we have[ Q

Original: [Equation]
Revised: [Equation]

Original: + Q k − 1 + β n 1 ( Q k + Q k − 1 + Q k − 2 ) + · · · ] ( ∗ ) ≤
Revised: + Q k − 1 + β n 1 ( Q k + Q k − 1 + Q k − 2 ) + · · · ] ( ∗ ) ≤

Original: Q k (1 + β n 1 + · · · ) + Q k − 1 + β n 1 ( Q k − 1 + Q k −
Revised: Q k (1 + β n 1 + · · · ) + Q k − 1 + β n 1 ( Q k − 1 + Q k −

Original: [Equation]
Revised: [Equation]

Original: where ( ∗ ) uses the following fact: consider integers k > J > 0 , we have (cid:80) Jj = 

Revised: where ( ∗ ) uses the following fact: consider integers k > J > 0 , we have (cid:80) Jj =

Original: √ k − j ≤ 2 J √ k − 1 .
Revised: √ k − j ≤ 2 J √ k − 1 .

Original: This inequality can be simply proved by taking the integral over 1 √ k .
Revised: This inequality can be simply proved by taking the integral over 1 √ k .

Original: The final inequality is due to
Revised: The final inequality is due to

Original: Q k − 1 < 2 Q k .
Revised: Q k − 1 < 2 Q k .

Original: Now, we have
Revised: Now, we have

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: Based on the calculation in Lemma F.
Revised: Based on the calculation in Lemma F.

Original: [Equation]
Revised: [Equation]

Original: we have
Revised: we have

Original: Error
Revised: Error

Original: [Equation]
Revised: [Equation]

Original: Since 1 − β 1 1 − β n 1 ≤ 1 and | J 1 | ≤ n , we have
Revised: Since 1 − β 1 1 − β n 1 ≤ 1 and | J 1 | ≤ n , we have

Original: [Equation]
Revised: [Equation]

Original: Using the fact that
Revised: Using the fact that

Original: [Equation]
Revised: [Equation]

Original: for k ≥ 2 )
Revised: for k ≥ 2 )

Original: [Equation]
Revised: [Equation]

Original: we have:
Revised: we have:

Original: [Equation]
Revised: [Equation]

Original: +
Revised: +

Original: [Equation]
Revised: [Equation]

Original: +
Revised: +

Original: [Equation]
Revised: [Equation]

Original: + Error
Revised: + Error

Original: [Equation]
Revised: [Equation]

Original: where
Revised: where

Original: [Equation]
Revised: [Equation]

Original: where J 1 =
Revised: where J 1 =

Original: [Equation]
Revised: [Equation]

Original: −
Revised: −

Original: [Equation]
Revised: [Equation]

Original: β
Revised: β

Original: [Equation]
Revised: [Equation]

Original: − · ·
Revised: − · ·

Original: [Equation]
Revised: [Equation]

Original: , δ
Revised: , δ

Original: [Equation]
Revised: [Equation]

Original: =
Revised: =

Original: [Equation]
Revised: [Equation]

Original: kk − j (if needed, wecan further bound J 1 by n for simplicity).
Revised: kk − j (if needed, wecan further bound J 1 by n for simplicity).

Original: This conclude the proof.
Revised: This conclude the proof.

Original: G.8 Proof of Lemma G. 
Revised: G.8 Proof of Lemma G.

Original: We now derive upper bounds for (cid:80) l large ( a 2 ) and (cid:80) l large ( b 2 ) .
Revised: We now derive upper bounds for (cid:80) l large ( a 2 ) and (cid:80) l large ( b 2 ) .

Original: The upper bound for (cid:80) l large ( a 2 ) isvery straightforward using inequality (23).(cid:88)
Revised: The upper bound for (cid:80) l large ( a 2 ) isvery straightforward using inequality (23).(cid:88)

Original: [Equation]
Revised: [Equation]

Original: Now we shift gear to (cid:80) l large ( b 2 ) :
Revised: Now we shift gear to (cid:80) l large ( b 2 ) :

Original: = δ
Revised: = δ

Original: [Equation]
Revised: [Equation]

Original: ρ 23 β
Revised: ρ 23 β

Original: [Equation]
Revised: [Equation]

Original: m
Revised: m

Original: [Equation]
Revised: [Equation]

Original: − ∂
Revised: − ∂

Original: [Equation]
Revised: [Equation]

Original: f
Revised: f

Original: [Equation]
Revised: [Equation]

Original: ) | .
Revised: ) | .

Original: To proceed, weneed an upper bound for (cid:80) l large (cid:80) n − 1 i =

Revised: To proceed, weneed an upper bound for (cid:80) l large (cid:80) n − 1 i =

Original: | m l,k,i − ∂ l f i ( x k, 0 ) | .
Revised: | m l,k,i − ∂ l f i ( x k, 0 ) | .

Original: For each i , we perform the followingdecomposition.
Revised: For each i , we perform the followingdecomposition.

Original: [Equation]
Revised: [Equation]

Original: To start, we bound ( d 1 ) .
Revised: To start, we bound ( d 1 ) .

Original: [Equation]
Revised: [Equation]

Original: Now, we bound ( d 2 ) .
Revised: Now, we bound ( d 2 ) .

Original: Recall (cid:80) n − 1 i =

Revised: Recall (cid:80) n − 1 i =

Original: ∂ l f i ( x 1 , 0 ) =
Revised: ∂ l f i ( x 1 , 0 ) =

Original: ∂ l f ( x 1 , 0 ) , we have
Revised: ∂ l f ( x 1 , 0 ) , we have

Original: [Equation]
Revised: [Equation]

Original: l
Revised: l

Original: [Equation]
Revised: [Equation]

Original: Note that for any i ∈ [0 , n − 1] , j ∈ [0 , n − 1] , t ∈ [1 , k − 1] , we have the following result.
Revised: Note that for any i ∈ [0 , n − 1] , j ∈ [0 , n − 1] , t ∈ [1 , k − 1] , we have the following result.

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: where ( ∗ ) uses the following fact: consider integers k > J > 0 , we have (cid:80) Jj =
Revised: where ( ∗ ) uses the following fact: consider integers k > J > 0 , we have (cid:80) Jj =

Original: [Equation]
Revised: [Equation]

Original: ≤
Revised: ≤

Original: [Equation]
Revised: [Equation]

Original: k − 1 .
Revised: k − 1 .

Original: Plugging (62) into (61) and re-arranging the index, we have
Revised: Plugging (62) into (61) and re-arranging the index, we have

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

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

Original: ) |
Revised: ) |

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

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

Original: [Table]
Revised: [Table]

Original: d
Revised: d

Original: [Table]
Revised: [Table]

Original: |
Revised: |

Original: [Table]
Revised: [Table]

Original: f
Revised: f

Original: [Table]
Revised: [Table]

Original: ) | + (cid:114)
Revised: ) | + (cid:114)

Original: [Table]
Revised: [Table]

Original: (cid:33) + 2 qd
Revised: (cid:33) + 2 qd

Original: [Table]
Revised: [Table]

Original: (cid:112) n ( k
Revised: (cid:112) n ( k

Original: [Table]
Revised: [Table]

Original: 1) −(cid:35)
Revised: 1) −(cid:35)

Original: + β (
Revised: + β (

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

Original: d (cid:88) l
Revised: d (cid:88) l

Original: [Table]
Revised: [Table]

Original: 1 (cid:88)
Revised: 1 (cid:88)

Original: [Table]
Revised: [Table]

Original: | ∂
Revised: | ∂

Original: [Table]
Revised: [Table]

Original: f i (
Revised: f i (

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

Original: ) |
Revised: ) |

Original: [Table]
Revised: [Table]

Original: n
Revised: n

Original: [Table]
Revised: [Table]

Original: |
Revised: |

Original: [Table]
Revised: [Table]

Original: f
Revised: f

Original: [Table]
Revised: [Table]

Original: |
Revised: |

Original: [Table]
Revised: [Table]

Original: (cid:114)
Revised: (cid:114)

Original: [Table]
Revised: [Table]

Original: D
Revised: D

Original: [Table]
Revised: [Table]

Original: d
Revised: d

Original: [Table]
Revised: [Table]

Original: + 1 −
Revised: + 1 −

Original: [Table]
Revised: [Table]

Original: 2 d
Revised: 2 d

Original: [Table]
Revised: [Table]

Original: (cid:112) n ( k − 1) −+ β
Revised: (cid:112) n ( k − 1) −+ β

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

Original: d
Revised: d

Original: [Table]
Revised: [Table]

Original: l
Revised: l

Original: [Table]
Revised: [Table]

Original: n
Revised: n

Original: [Table]
Revised: [Table]

Original: i
Revised: i

Original: [Table]
Revised: [Table]

Original: | ∂
Revised: | ∂

Original: [Table]
Revised: [Table]

Original: f
Revised: f

Original: [Table]
Revised: [Table]

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

Original: ) |
Revised: ) |

Original: When
Revised: When

Original: [Table]
Revised: [Table]

Original: √ D
Revised: √ D

Original: [Table]
Revised: [Table]

Original: d
Revised: d

Original: [Table]
Revised: [Table]

Original: | ∂
Revised: | ∂

Original: [Table]
Revised: [Table]

Original: f
Revised: f

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

Original: ) | + (cid:114) D
Revised: ) | + (cid:114) D

Original: [Table]
Revised: [Table]

Original: D
Revised: D

Original: [Table]
Revised: [Table]

Original: d (cid:33) + 1 − β2 √ 2 d △ 1 √ nk + β ( k
Revised: d (cid:33) + 1 − β2 √ 2 d △ 1 √ nk + β ( k

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: where the second last inequality holds because: when k ≥ 4 ,
Revised: where the second last inequality holds because: when k ≥ 4 ,

Original: [Equation]
Revised: [Equation]

Original: √ nk .
Revised: √ nk .

Original: ( i ) holds when kis large enough such that β ( k − 1) n
Revised: ( i ) holds when kis large enough such that β ( k − 1) n

Original: [Equation]
Revised: [Equation]

Original: Further
Revised: Further

Original: [Equation]
Revised: [Equation]

Original: k when k ≥ 2 .
Revised: k when k ≥ 2 .

Original: Now, we have derived upper bounds for ( d 1 ) and ( d 2 ) .
Revised: Now, we have derived upper bounds for ( d 1 ) and ( d 2 ) .

Original: Plugging (63) and (60) into (59), we concludethe proof.
Revised: Plugging (63) and (60) into (59), we concludethe proof.

Original: [Table]
Revised: [Table]

Original: ∂
Revised: ∂

Original: [Equation]
Revised: [Equation]

Original: The proof is concluded by adding expectation on both sides of the inequality.
Revised: The proof is concluded by adding expectation on both sides of the inequality.

Original: G.9 Proof of Lemma G. 
Revised: G.9 Proof of Lemma G.

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: where constant terms G 4 , G 5 , G 6 , G 7 can be seen at the end of Appendix G.7.
Revised: where constant terms G 4 , G 5 , G 6 , G 7 can be seen at the end of Appendix G.7.

Original: Since α = arg max l =1 , 2 , ··· ,d | ∂ l f ( x k, 0 ) | and (cid:80) l large ∂ l f ( x k, 0 ) 2 √ v l,k,≥ ∂ α f ( x k, 0 ) 2 √ v α,k, 0 , we have
Revised: Since α = arg max l =1 , 2 , ··· ,d | ∂ l f ( x k, 0 ) | and (cid:80) l large ∂ l f ( x k, 0 ) 2 √ v l,k,≥ ∂ α f ( x k, 0 ) 2 √ v α,k, 0 , we have

Original: [Equation]
Revised: [Equation]

Original: Now, we discuss two cases.
Revised: Now, we discuss two cases.

Original: Case (a): when | ∂ α f ( x k, 0 )
Revised: Case (a): when | ∂ α f ( x k, 0 )

Original: | ≥ 4 √∆ 1 (1 − β 2 ) √ D 1 nkd .
Revised: | ≥ 4 √∆ 1 (1 − β 2 ) √ D 1 nkd .

Original: In this case, we have the following result.
Revised: In this case, we have the following result.

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: ≥
Revised: ≥

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: Now we consider the following two sub-cases.
Revised: Now we consider the following two sub-cases.

Original: • When ∂ α f ( x k, 0 ) 2 ≤ D 0 D 1 d :
Revised: • When ∂ α f ( x k, 0 ) 2 ≤ D 0 D 1 d :

Original: [Equation]
Revised: [Equation]

Original: • When ∂ α f
Revised: • When ∂ α f

Original: [Equation]
Revised: [Equation]

Original: x k
Revised: x k

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

Original: Combining together
Revised: Combining together

Original: [Equation]
Revised: [Equation]

Original: we have the following results for Case (a)
Revised: we have the following results for Case (a)

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: Case (b): When | ∂ α f ( x k, 0 ) | < 4 √
Revised: Case (b): When | ∂ α f ( x k, 0 ) | < 4 √

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: we have
Revised: we have

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: where G 1 :
Revised: where G 1 :

Original: = F 2 + F 3 4 √∆ 1 (1 − β 2 ) √ D 1 nd .
Revised: = F 2 + F 3 4 √∆ 1 (1 − β 2 ) √ D 1 nd .

Original: Now, the following two claims are both true.
Revised: Now, the following two claims are both true.

Original: • Claim 1:
Revised: • Claim 1:

Original: [Equation]
Revised: [Equation]

Original: Claim
Revised: Claim

Original: [Equation]
Revised: [Equation]

Original: Combining Claim 1 and Claim
Revised: Combining Claim 1 and Claim

Original: [Equation]
Revised: [Equation]

Original: we have
Revised: we have

Original: [Equation]
Revised: [Equation]

Original: where G 2 :=
Revised: where G 2 :=

Original: max
Revised: max

Original: [Equation]
Revised: [Equation]

Original: Combining Case (a) and Case (b) together, we have
Revised: Combining Case (a) and Case (b) together, we have

Original: [Equation]
Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: where the last inequality is because of ∥∇ f ( x k, 0 )
Revised: where the last inequality is because of ∥∇ f ( x k, 0 )

Original: ∥ 22 ≤ d∂
Revised: ∥ 22 ≤ d∂

Original: [Equation]
Revised: [Equation]

Original: Recall F 3 → 0 when β 2 → 1 , so there exists an interval (1 − ϵ, 1] , such that 1 √ 5 D 1 d − F 3 ≥ 1 √ 10 D 1 d ,or equivalently F 3 ≤ 1 √ 10 D 1 d (note that F 3 is the same as “ A ( β 2 ) ” stated in the condition of Lemma
Revised: Recall F 3 → 0 when β 2 → 1 , so there exists an interval (1 − ϵ, 1] , such that 1 √ 5 D 1 d − F 3 ≥ 1 √ 10 D 1 d ,or equivalently F 3 ≤ 1 √ 10 D 1 d (note that F 3 is the same as “ A ( β 2 ) ” stated in the condition of Lemma

Original: G.6).
Revised: G.6).

Original: With such a choice of β 2 , we have the following results by changing all the F 3 into
Revised: With such a choice of β 2 , we have the following results by changing all the F 3 into

Original: [Equation]
Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: In inequality ( ∗ ) , we change F 4 into F 5 := (cid:113) D 0 D 1 d 1 √ 10 D 1 d .
Revised: In inequality ( ∗ ) , we change F 4 into F 5 := (cid:113) D 0 D 1 d 1 √ 10 D 1 d .

Original: This is because: first, F 4 = F 3 (cid:113) D 0 D 1 d ;second, F 3 ≤ 1 √ 10 D 1 d .
Revised: This is because: first, F 4 = F 3 (cid:113) D 0 D 1 d ;second, F 3 ≤ 1 √ 10 D 1 d .

Original: The proof of Lemma G.6 is completed.
Revised: The proof of Lemma G.6 is completed.

Original: We restate all the constants as follows ( G 4 , G 5 , G 6 are specified in Appendix G.7):
Revised: We restate all the constants as follows ( G 4 , G 5 , G 6 are specified in Appendix G.7):

Original: [Equation]
Revised: [Equation]

Original: Remark G.14 .
Revised: Remark G.14 .

Original: We comment that we can always replace F 5 in the final result by F 4 , i.e., we can choosenot to apply the last inequality ( ∗ ) in the proof.
Revised: We comment that we can always replace F 5 in the final result by F 4 , i.e., we can choosenot to apply the last inequality ( ∗ ) in the proof.

Original: The benefit of using F 4 is that F 4 monotonouslydecrease to 0 when increasing β 2 to 1.
Revised: The benefit of using F 4 is that F 4 monotonouslydecrease to 0 when increasing β 2 to 1.

Original: This monotone property is not shown in the notation of F 5 .
Revised: This monotone property is not shown in the notation of F 5 .

Original: Nevertheless, we choose to use F 5 since it is a much cleaner constant.
Revised: Nevertheless, we choose to use F 5 since it is a much cleaner constant.

Original: G.10 Proof of Lemma G. 
Revised: G.10 Proof of Lemma G.

Original: Based on Descent Lemma, we have
Revised: Based on Descent Lemma, we have

Original: [Equation]
Revised: [Equation]

Original: Plugging in the r.h.s.
Revised: Plugging in the r.h.s.

Original: of (34), we have the following relation after rearranging.
Revised: of (34), we have the following relation after rearranging.

Original: T
Revised: T

Original: [Equation]
Revised: [Equation]

Original: Recall we have 2 (cid:16) √ T −
Revised: Recall we have 2 (cid:16) √ T −

Original: [Equation]
Revised: [Equation]

Original: t
Revised: t

Original: [Equation]
Revised: [Equation]

Original: −
Revised: −

Original: [Equation]
Revised: [Equation]

Original: (cid:80)
Revised: (cid:80)

Original: [Equation]
Revised: [Equation]

Original: = t 

Revised: = t

Original: [Equation]
Revised: [Equation]

Original: k , (cid:80) Tk = t 0 1 k ≤ log T +1 t 0 .
Revised: k , (cid:80) Tk = t 0 1 k ≤ log T +1 t 0 .

Original: Further, since ∥·∥ 1 ≥ ∥·∥ 2 ,we get the following relation when t 0 = 1 .
Revised: Further, since ∥·∥ 1 ≥ ∥·∥ 2 ,we get the following relation when t 0 = 1 .

Original: [Equation]
Revised: [Equation]

Original: We specify all the constant as follows.
Revised: We specify all the constant as follows.

Original: For all the following constants, We keep the same notation astheir appearance in their corresponding lemmas.
Revised: For all the following constants, We keep the same notation astheir appearance in their corresponding lemmas.

Original: [Equation]
Revised: [Equation]

Original: [Figure]
Revised: [Figure]

Original: [Equation]
Revised: [Equation]

Original: [Figure]
Revised: [Figure]

Original: [Equation]
Revised: [Equation]

Original: [Figure]
Revised: [Figure]

Original: [Equation]
Revised: [Equation]

Original: [Figure]
Revised: [Figure]

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

Original: where J 1 = (cid:0) − 1 n β 1 − 2 n β 21 − · · · − n − 1 n β n − 

Revised: where J 1 = (cid:0) − 1 n β 1 − 2 n β 21 − · · · − n − 1 n β n −

Original: [Equation]
Revised: [Equation]

Original: Ifneeded, we can further bound J 1 by n for simplicity.
Revised: Ifneeded, we can further bound J 1 by n for simplicity.

Original: Further, ρ 1 , ρ 2 , ρ 3 are constants satisfying the following conditions for ∀ l = 1 , · · · , d .
Revised: Further, ρ 1 , ρ 2 , ρ 3 are constants satisfying the following conditions for ∀ l = 1 , · · · , d .

Original: Usually, theseconstants can be different for different problems.
Revised: Usually, theseconstants can be different for different problems.

Original: In the worst case, we have 0 ≤ ρ 3 ≤ √ nρ 1 ≤ n .ρ 3 is larger when ∂ l f i ( x k, 0 ) are more aligned.
Revised: In the worst case, we have 0 ≤ ρ 3 ≤ √ nρ 1 ≤ n .ρ 3 is larger when ∂ l f i ( x k, 0 ) are more aligned.

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

Original: [Table]
Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original: The proof of Lemma G.9 is now completed.
Revised: The proof of Lemma G.9 is now completed.

Original: This also concludes the whole proof of Theorem 3.1.
Revised: This also concludes the whole proof of Theorem 3.1.