June 04, 2026
In this paper, we study the finite-time behavior of the TD(0) temporal-difference method with linear function approximation (LFA). We consider on-policy independent and identically distributed (i.i.d.) samples, a constant learning step, and the Polyak-Juditsky averaging method. We establish a new convergence rate, for the Mean-Square Error (MSE) on the approximated function, that is (i) fast in the sense that it admits an optimal dependency in the number of iterations \(k\) (i.e., of order \(1/k\)), (ii) robust to ill-conditioning: it only depends on an initial error and model-independent constants and (iii) sharp up to a multiplicative constant lower than \(11\). In particular, it does not depend on the smallest eigenvalue of the uncentered covariance matrix of the linear parametrization, unlike all pre-existing \(O(1/k)\) rates in the TD(0) literature. We also introduce PCTD(0), a variant of TD(0), which benefits from better convergence properties under an additional assumption of strong mixing on the Markov Chain.
Temporal Difference (TD) learning [1], [2], is a fundamental algorithm in reinforcement learning (RL) for estimating the value function associated with a policy. Among the various TD variants, the TD(0) algorithm stands out for its simplicity and practical efficiency, particularly when combined with linear function approximation (LFA). Despite its widespread empirical success, obtaining sharp non-asymptotic convergence guarantees for TD(0) remains a significant theoretical challenge.
When used with LFA, TD(0) enters the more general framework of linear stochastic approximation (LSA) methods. Since the early work of [3], it has been known that stochastic approximation (SA) schemes can achieve a \(O(1/k)\) behavior under strong convexity assumptions, but these guarantees heavily depend on the constant of strong convexity. Later developments, such as the “robust SA” and mirror-descent approaches of [4] instead obtain non-asymptotic \(O(1/\sqrt{k})\) bounds that hold for general convex problems and no longer depend on a strong convexity constant.
For practical SA algorithms, rates are in general either fast or robust, but rarely both. The most famous and impactful example of a fast and robust convergence rate applies to SGD in a particular setting. While many classical SGD analyses require strong convexity to get \(O(1/k)\) rates, the breakthrough paper by [5] showed that in least-squares regression, averaged SGD with a constant stepsize still attains a \(O(1/k)\) convergence rate without any strong convexity assumption, thus providing fast yet robust guarantees in the non-strongly-convex setting.
In the whole field of RL, prior to our work, we are not aware of any rate on a non-tabular sample-based numerical method that is both fast and robust. For TD(0) with LFA, existing non-asymptotic convergence rates divide into two classes, aligned with the SA literature. The first one consists of fast \(O(1/k)\) rates, [6]–[11], where the constant in the \(O(1/k)\) can be arbitrarily large in practice, especially for large dimensions where systems arising from modern ML are most often ill-conditioned. The dependence on the conditioning in the latter rates generally appears through the smallest eigenvalue of the uncentered covariance matrix of the linear parameterization, which we denote \(\omega\). We qualify this constant as being model-dependent, where the wording model refers, in the usual statistical sense, to the choice of the parameterization. It has to be noted that this \(\omega\) admits the exact same definition as the strong convexity in [5], making the comparison with this paper relevant.
The second class consists of robust rates, [7], [12], [13]. Even though they are of order \(O(1/\sqrt{k})\), they are often thought to lead to tighter upper bounds in practice since they do not deteriorate when \(\omega\) tends to zero. On the smallness of \(\omega\), [5] write that “typical ML problems are high dimensional and have correlated variables so that [\(\omega\)] is zero or very close to zero, and in any case smaller than [\(O(1/\sqrt{k})\)]. This then makes the non-strongly convex methods better.”
In the relevant literature, the most popular conjecture on the open question of whether or not a fast and robust rate is attainable seems to be the negative answer. The second author in [5], together with their coauthors in [10], wrote: “Note that the leading term of the bound in [our first main result for TD(0) (with i.i.d. samples)] includes factors of [\(1/\omega\)]. This dependence is generally unavoidable if one aims to obtain the MSE bound [on the approximated functions] that scales as \([1/k]\)”. Furthermore, while the main purpose in [6] (which appears in their title) is to obtain the sharpest rate on LSA and TD(0) using the same averaging method as in the present work, they did not attain a robust rate. They even provide a lower bound that scales as \(\omega^{-2}\) on the MSE on the parameters (while we consider the MSE on the approximated functions, similarly to [10], and others).
Our main contributions are:
Under standard assumptions, for learning rates lower than \(\frac{2(1-\gamma)}{(1+\gamma)^2}\), we prove the first fast and robust convergence rate for TD(0), see Theorem 1. Proposition 2 shows that this rate is sharp up to a multiplicative constant lower than \(11\). This significantly improves on existing results as summarized in Table 1.
In Theorem 3, we prove another convergence rate that benefits from the largest range of admissible learning rates in the literature up to our knowledge, namely \(\alpha<\frac{2}{1+\gamma}\). Unlike the former rate, it is not robust but it remains faster than any existing rate prior to this work. We also prove that for \(\alpha>\frac{2}{1+\gamma}\), convergence of TD(0) may fail.
Theorem 4 states that using minibatches of size \(B\leq (1-\gamma)^{-1}\) reduces the total error by approximately a factor \(B^{-1}\), affecting not only the part of the error due to the variance but also the part due to the bias, which is non-standard.
We propose two methods to reduce the dependence on \((1-\gamma)^{-1}\) of our robust rates when the transition operator of the Markov Chain admits a positive spectral gap \(g>0\). In the first method, we consider different learning rates for the constant part of the parametrization and the rest, see Theorem 5. For the second one, we introduce PCTD(0) which uses the differences of two independent copies of the Markov Chain to obtain centered feature maps. This allows one to: (i) consider \(\gamma\) larger than one; (ii) get a convergence rate independent of \((1-\gamma)^{-1}\) when \(\gamma\leq1\) (but dependent on \(g^{-1}\) that may be large in practice).
For a more general class of LSA methods, which satisfy Assumptions [hypo:SPD]-[hypo:ineq95LSA], we prove a convergence rate in \(O(1/k)\) with a dependence on the model only appearing in a faster converging \(O(1/k^2)\) term, see Theorem 9.
| Paper | Type of error | Step size | Averaging | Convergence rate |
|---|---|---|---|---|
| [7] | \({\mathbb{E}}[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2]\) | \(O(K^{-\frac{1}{2}})\) | yes | \(O(K^{-\frac{1}{2}})\) |
| \({\mathbb{E}}\left[|\theta_k-\theta^*|^2\right]\) | \(O(k^{-1}\omega^{-1})\) | no | \(O(k^{-1}\omega^{-2})\) | |
| [8] | \({\mathbb{E}}\left[|\theta_k-\theta^*|^2\right]\) | \(O(k^{-1} \omega^{-1})\) | no | \(O(k^{-1} \omega^{-1})\) |
| [12] | \({\mathbb{E}}[|v(X,{\overline{\theta}}_K)-v(X,\theta^*)|^2]\) | \(O(K^{-1/2})\) | yes | \(O(K^{-1/2})\) |
| [13] | \({\mathbb{E}}[|v(X,{\overline{\theta}}_K)-v(X,\theta^*)|^2]\) | \(O(K^{-1/2})\) | yes | \(O(K^{-1/2})\) |
| [14] | \({\mathbb{E}}\left[|\theta_k-\theta^*|^2\right]\) | \(O(k^{-\beta})\) | no | \(O(k^{-\beta}\omega^{-1} e^{C(1-\beta)^{-1}\omega^{-\frac{1}{\beta}+1}})\) |
| [6] | \({\mathbb{E}}\left[|{\overline{\theta}}_k-\theta^*|^2\right]\) | \(O(1)\) | yes | \(O(k^{-1}\omega^{-2})\) |
| [9] | \({\mathbb{E}}\left[|{\overline{\theta}}_k-\theta^*|^2\right]\) | \(O(1)\) | yes | \(O(k^{-1}\omega^{-2})\) |
| [11] | \({\mathbb{E}}[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2]\) | \(O(1)\) | yes | \(O( k^{-1} \omega^{-2})\) |
| [10] | \({\mathbb{E}}[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2]\) | \(O(1)\) | yes | \(O(k^{-1}\omega^{-2})\) |
| Our Theorem 1 | \({\mathbb{E}}[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2]\) | \(O(1)\) | yes | \(O(k^{-1})\) |
| Our Theorem 3 | \({\mathbb{E}}[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2]\) | \(O(1)\) | yes | \(O(k^{-1}\omega^{-1})\) |
In Section 2, we review the related literature. Section 3 introduces our mathematical setting and states our main convergence results for TD(0). Section 4 presents our main convergence results for more general LSA methods. Some insights into our proof strategies for TD(0) are given in Section 5. Numerical simulations are presented in Section 6, and concluding remarks are given in Section 7.
The euclidean norm on \(\mathbb{R}^d\) is denoted by \(|\cdot|\), using the same symbol as the absolute value for real numbers and modulus for complex numbers, by a slight abuse of notation. The set of \(d\times d\)-sized square matrices is denoted by \(\mathbb{R}^{d\times d}\). The operator norm on \(\mathbb{R}^{d\times d}\) associated with the euclidean norm is denoted \(\|\cdot\|_{\rm op}\), and the Frobenius norm is denoted \(\|\cdot\|_{F}\). For \(S_1,S_2\) two symmetric matrices, the notation \(S_1\leq S_2\) means that \(S_2-S_1\) is positive semi-definite (similarly we define \(\geq\), \(<\) and \(>\) on the set of symmetric matrices). If \(S\) is a symmetric positive semi-definite matrix, its square root is denoted by \(S^{\frac{1}{2}}\).
The literature corpus of theoretical analyses of TD-learning is rich and has continuously developed over the past thirty years. The tabular version of the TD-learning algorithm was introduced by [1], with the first convergence results. Later, [15] proved that TD(0) with LFA converges with probability one, in the case of linearly independent features, yet without an explicit convergence rate. [6] proposed a non-asymptotic analysis in the i.i.d. sampling setting, while [7] proposed a different analysis, applicable to the Markov sampling setting. Around the same period, [14] and [8] derived alternative convergence rates, and [16] introduced a variance-reduced variant of TD(0). Exploring different approximation schemes, [17] proposed an analysis of a version of TD(0) where approximation is done using a finite-width one-hidden layer neural network, while [18] studied a non-parametric version of TD learning, using an infinite-dimensional linear approximation scheme. More recent analyses of TD(0) include those by [11], [10], [12], [13] and [9]. These analyses essentially differ in a few crucial elements: the obtained convergence rate – fast or slow – often related to the choice of the learning rate, the dependence on unknown model-dependent quantities, the coverage or not of the Markov sampling scheme, and the potential need for projection. We detail below some of these elements.
An important criterion to compare different analyses is whether or not, and how, the required learning rates and obtained convergence rates depend on quantities defined by the approximation model. While some dependence on the problem instance, like the initial error or the variance of the samples, is inevitable, a dependence on the model is usually unwanted. Indeed, such constants are typically unknown to the user, which might complicate the practical implementation of the method. Moreover, if such a dependence is present in the rate, it might become arbitrarily slow, typically as the dimension of the model grows. On the contrary, a rate is called robust if it does not depend on such model-dependent quantities. Such rates often extend to infinite-dimensional, universal approximation schemes, like in [18], which in turn remove approximation errors.
More specifically, in this paper, we study the mean squared error (MSE) in the setting of on-policy i.i.d. samples, whose optimal convergence rates admit upper bounds proportional to \(1/k\), where \(k\) is the number of iterations [6], [7], [9], [10]. In [7], the \(1/k\)-convergence rate is impractical because the learning rate depends on an intractable problem-specific constant, namely, \(\omega\) that will be introduced later and was already discussed in Section 1. After that, it became an important issue for subsequent authors to use universal learning steps, which do not depend on \(\omega\) or other intractable constants. Such a goal was achieved by [6], [9]–[11], whereas all their convergence rates continued to depend on \(\omega\).
Table 1 shows the explicit dependency on \(\omega\) of some of the state-of-the-art convergence results. On the one hand, arbitrarily small \(\omega\) may significantly weaken the rates from the above listed works. On the other hand, [7] proved another convergence result with a rate independent of \(\omega\) and any model-dependent constants, at the price of reducing the speed of convergence in \(k\), to \(O(1/\sqrt{k})\). Later works by [12], [13] obtained similar rates. Let us point out another common inconvenience of the latter three results: they require knowing \(K\) the total number of iterations before starting the computations, in order to take a constant learning step of order \(O(1/\sqrt{K})\). This implies that: (i) the rate is no longer guaranteed if we increase the number of iterations afterwards; (ii) learning can be slow at the beginning since the learning step is small for large \(K\). As it will appear in our main result, Theorem 1, our rates do not suffer from this issue.
In the literature, the convergence results for TD(0) with linear function approximation can be divided into two groups depending on the assumptions made on the data. In the first case, we assume that the samples used to compute the TD(0) iterates are i.i.d., directly sampled from the invariant distribution of the Markov chain. Whereas in the second situation, it is assumed that the samples are obtained from following the exponentially mixing Markov Chain associated with the dynamics. This case introduces a major difficulty: two consecutive samples are usually correlated, which introduces some complications in the analysis, handled by coupling arguments. Consequently, many analyses in the Markov sampling setting require one to actively bound the iterates, which is usually ensured by adding a projection to the TD updates [7]. Recent works suggest that this projection is not mandatory to obtain convergence [10], [11], [13].
In the present paper, we stick to the i.i.d. sampling setting. This choice is motivated by the simplicity of the analysis and the fact that it is often closer to practitioners’ settings, where the samples can be obtained offline, or replayed using buffers, and do not necessarily strictly follow a trajectory. For instance, both AlphaGo Zero [19] and its open-source reimplementation [20] used a replay buffer with a size of \(500,000\) games (then, on average, a game contains more than \(200\) moves). In such a situation, two consecutively drawn samples have a probability of around \(1/500,000\) of not being independent, so the sampling is much closer to an i.i.d. model than to a single Markov trajectory. Finally, an important take-home message from the vast TD literature is that the convergence rates obtained in the Markov case do not significantly differ from the i.i.d. case, except for the introduction of a multiplicative factor due to mixing. For all these reasons, extending our present analysis to the Markov setting is left for future work.
This section focuses solely on the TD(0) method. The mathematical framework and the main assumptions are discussed in Subsection 3.1. We state our main convergence results without additional mixing assumptions in Subsection 3.2. Under an additional mixing assumption on the Markov chain, Subsection 3.4 shows that the dependence on \((1-\gamma)^{-1}\) can be reduced by using two separate learning rates; Subsection 3.5 shows that this dependence can be entirely eliminated by replacing standard temporal differences with differences of independent copies of such quantities, thereby introducing the method we call PCTD(0).
For \((X_{\ell},R_{\ell})_{\ell\geq0}\) a Markov Reward Process (MRP), we consider the problem of policy evaluation, consisting in approximating the value function \(V\) defined by \[\label{eq:def95V} V(x) = {\mathbb{E}}\left[\sum_{\ell=0}^{\infty}\gamma^{\ell}R_{\ell}\,\Big|\,X_0=x\right],\tag{1}\] for \(\gamma\in[0,1)\), where \(R_{\ell}\) is the reward at step \(\ell\) and the law of \((R_{\ell},X_{\ell+1})\) is given by some probability kernel \(((r,x')\mapsto P(x,r,x'))_{x\in{\mathcal{X}}}\in{\mathcal{P}}( \mathbb{R}\times{\mathcal{X}})^{{\mathcal{X}}}\). In particular, \((X_{\ell})_{\ell}\) is a Markov chain of probability transition \((P_{x'}(x,\cdot))_{x\in{\mathcal{X}}}\in{\mathcal{P}}({\mathcal{X}})^{{\mathcal{X}}}\), where \(P_{x'}(x)\) is the second marginal of \(P(x)\) and \(P_r(x)\) its first one. The value function satisfies the Bellman equation \[\label{eq:Bellman} V(x) = {\mathbb{E}}\left[R+\gamma V(X')\,|\,(R,X')\sim P(x)\right].\tag{2}\] Our goal is to approximate \(V\) using a parameterized function \(v(\cdot,\theta)\) where \(\theta\in \mathbb{R}^d\) is the parameter that we will learn. We make the following assumptions:
The Markov Chain induced by \(P_{x'}\) admits an invariant probability measure \(m\) and we access i.i.d. samples \((X_k,X'_k,R_k)\) with \(m\) being the law of \(X_k\).
The second moment of \(P_r(x)\) is uniformly bounded, i.e., \(C_R:=\sup_{x\in{\mathcal{X}}}{\mathbb{E}}_{R\sim P_r(x)}[R^2]<\infty\).
The parameterization is linear, i.e., \(v(x,\theta)=\theta^{\top}\varphi(x)\) where \(\varphi:{\mathcal{X}}\to \mathbb{R}^d\) are linearly independent on the support of \(m\) and satisfy \(|\varphi|\leq1\).
Let us define the uncentered covariance matrices: \[\Sigma_0 = {\mathbb{E}}\left[\varphi(X)\varphi(X)^{\top}\right] \;\text{ and }\; \Sigma_1 = {\mathbb{E}}\left[\varphi(X)(\varphi(X'))^{\top}\right].\] The linear independence from Assumption [hypo:linear] implies that \(\Sigma_0\) is symmetric positive definite. Let \(\omega>0\) be its minimal eigenvalue, that was already discussed in Sections 1, 2. Consider \(U=\Sigma_0^{-\frac{1}{2}}\Sigma_1\Sigma_0^{-\frac{1}{2}}\), we have \[\Sigma_1 = \Sigma_0^{\frac{1}{2}}U\Sigma_0^{\frac{1}{2}} \;\text{ with }\; \|U\|_{\rm op}\leq 1,\] as a consequence of the Cauchy-Schwarz inequality.
Under Assumptions [hypo:iid]-[hypo:linear], the TD(0) algorithm consists in the following iterative method, from an initial parameter \(\theta_0\) and for \(k\geq1\): \[\theta_k = \theta_{k-1} -\alpha\delta_k\varphi(X_k),\] where \(\delta_k= v(X_k,\theta_{k-1}) -\gamma v(X'_k,\theta_{k-1}) -R_k\) is named the temporal difference. As is usual in the literature, we do not consider the convergence of \(\theta_k\) itself, but of its Polyak-Juditsky averaging, denoted \({\overline{\theta}}_k\), defined by \[{\overline{\theta}}_k = \frac{1}{k} \sum_{i=0}^{k-1}\theta_i.\] Under a suitable choice of the learning step \(\alpha\), it is known that \({\overline{\theta}}_k\) converges to \(\theta^*\), which satisfies \[H_0\theta^* = b_0,\] where \(H_0=(\Sigma_0-\gamma\Sigma_1)\) and \(b_0={\mathbb{E}}\left[R\,\varphi(X)\right]\). The value function associated with \(\theta^*\) is the unique solution of the projected Bellman equation, \[v(\cdot,\theta^*) = \Pi_{\left\{\theta^{\top}\varphi\right\}} \left( x\mapsto {\mathbb{E}}_{(X',R)\sim P(x)}\left[R+\gamma v(X',\theta^*)\right] \right),\] which is similar to the Bellman equation 2 with an additional projection step onto the set of admissible functions. In particular, if the actual value function \(V\) belongs to the set of admissible functions, we get \(V=v(\cdot,\theta^*)\) by uniqueness of the solution of the projected Bellman equation. Otherwise, the projection step generally introduces an approximation error.
See Figure 1 for an overview of the results stated in this section. Our main result writes as follows.
Theorem 1. Assume [hypo:iid]-[hypo:linear]. For \(\gamma\in[0,1)\), define \(\alpha_0(\gamma)=\frac{2(1-\gamma)}{(1+\gamma)^2}\) and \(\alpha_1(\gamma)=\frac{2}{1+\gamma}>\alpha_0(\gamma)\). For \(0<\alpha<\alpha_0(\gamma)\), and \(k\geq1\), we have \[\begin{align} &{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \leq \frac{1}{(1-\gamma)^2k} \\ &\left(\left(\frac{|\theta_0-\theta^*|^2}{2\left(1-\frac{\alpha}{\alpha_1(\gamma)}\right)\frac{\alpha}{1-\gamma}}\right)^{\frac{1}{2}} +\left(\frac{de\sigma_0^2(1+\varepsilon_{k,\gamma})}{1-\frac{\alpha}{\alpha_0(\gamma)}}\right)^{\frac{1}{2}}\right)^2, \end{align}\] with \(\varepsilon_{k,\gamma}= \frac{4}{k(1-\gamma)} +3(1-\gamma) +\frac{10}{k}+\frac{2}{k(2-(1+\gamma)\alpha)}\), \(\sigma_0^2={\left\| x\mapsto {\mathbb{E}}[\delta(X,R,X',\theta^*)^2\,|\,X=x] \right\|_{\infty}^{}}\) and \(\delta(x,s,x',\theta^*)= v(x,\theta^*)-\gamma v(x',\theta^*)-s\).
As is customary in SA, the above rate is the sum of a bias term (which depends on \(|\theta_0-\theta^*|\)) and a variance term (which depends on \(\sigma_0^2\)).
Given the above rate, the interesting regime is for \(k\gg(1-\gamma)^{-2}\). In this case and for \(\gamma\) near one, \(\varepsilon_{k,\gamma}\) is small.
As explained in the introduction, the above rate does not depend on \(\omega\) the smallest eigenvalue of \(\Sigma_0\), nor on any constant that might generally be qualified as model-dependent. The only two quantities in this rate that are unknown a priori come from the mathematical problem at hand. They are the initial error \(|\theta_0-\theta^*|^2\) and the quantity \(\sigma_0^2\) that is often referred to as a variance (since \({\mathbb{E}}\left[\delta(X,R,X',\theta^*)\right]=(\Sigma_0-\gamma\Sigma_1)\theta^*-b=0\)) or a residual of the Bellman equation, at the limit \(\theta^*\). We can easily bound \(\sigma_0^2\) using \(\sigma_0^2\leq 4|\theta^*|^2+2C_R\), but we think that this inequality is in general very loose.
To the best of our knowledge, this is the first convergence result for TD(0) that states a rate which is optimal in \(k\) and independent of \(\omega\) at the same time. We refer to Table 1 for the dependency on \(\omega\) of some state-of-the-art results in the setting of i.i.d. on-policy samples.
Observe that the upper bound in Theorem 1 gets unbounded for \(\alpha\) near \(\alpha_0(\gamma)\). In this case, it is standard in SA to restrict further the range of \(\alpha\) by a factor \(\frac{1}{2}\) and to consider only \(\alpha\leq\frac{\alpha_0(\gamma)}{2}\). Under this standard regime, let us discuss the sharpness of Theorem 1.
****Proposition** 2**. Consider the constant Markov Chain on \({\mathcal{X}}=\{1,\dots,d\}\), i.e. \(X'=X\) almost surely. Take \((X_k)_{k\geq0}\) i.i.d. with \(X_1\sim m\), where \(m\equiv\frac{1}{d}\) is the uniform probability measure. Take \((R_k)_{k\geq1}\) i.i.d. with \(R_1\sim{\mathcal{N}}(0,\sigma_0^2)\) for \(\sigma_0^2>0\), and \(\varphi_i(x)=\sqrt{d\omega}\mathbb{1}_{\{i=x\}}\) for \(\omega\in(0,\frac{1}{d}]\) and \(1\leq i,x\leq d\). Assumptions [hypo:iid]-[hypo:linear] are satisfied and \(\omega\) is the smallest eigenvalue of \(\Sigma_0\). Fix \(\lambda\in(0,\frac{1}{2}]\) and \(\alpha=\lambda\alpha_0(\gamma)\), in the regime \(k\to\infty\), \(\gamma\to1\) and \(k(1-\gamma)\alpha\omega\to 5.5\), we have \[\begin{align} &{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \gtrsim \frac{1}{11(1-\gamma)^2k} \\ &\left(\left(\frac{|\theta_0-\theta^*|^2}{2\left(1-\frac{\alpha}{\alpha_1(\gamma)}\right)\frac{\alpha}{1-\gamma}}\right)^{\frac{1}{2}} +\left(\frac{de\sigma_0^2(1+\varepsilon_{k,\gamma})}{1-\frac{\alpha}{\alpha_0(\gamma)}}\right)^{\frac{1}{2}}\right)^2, \end{align}\]
This implies that our upper bound in Theorem 1 is sharp up to a constant at most equal to \(11\), for \(0<\alpha\leq\frac{\alpha_0(\gamma)}{2}\). We refer to Corollary 1 where we prove that our upper bounds for the bias and variance terms are sharp up to constants \(1.25\) and \(2e\) respectively.
Observe that this proposition holds for any \(\omega\in(0,1)\) and does not rely on examples with specific or ill-conditioned structures; instead, our lower bound is obtained on one of the simplest examples one can think of. Therefore, we believe that our upper bound in Theorem 1 captures the actual convergence speed of practical computations of TD(0), on average and up to a multiplicative constant that should not be too big.
Now, let us describe what happens when \(\alpha\geq\alpha_0(\gamma)\).
Theorem 3. Assume [hypo:iid]-[hypo:linear]. For \(\gamma\in[0,1)\), \(0<\alpha<\alpha_1(\gamma)=\frac{2}{1+\gamma}\) and \(k\geq1\), we have \[\begin{align} &{\mathbb{E}}_{m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \leq \frac{|\theta_0-\theta^*|^2}{\left(1-\frac{\alpha}{\alpha_1(\gamma)}\right)\alpha(1-\gamma)k} \\ &+ \frac{2d}{(1-\gamma)^2k} \left(\frac{\alpha\sigma_1^2}{\left(1-\frac{\alpha}{\alpha_1(\gamma)}\right)\alpha_0(\gamma)\omega} +\sigma_0^2\right) \\ &\times \left(3+\frac{1}{2\left(1-\frac{\alpha}{\alpha_1(\gamma)}\right)\alpha(1-\gamma)\omega k}\right), \end{align}\] with \(\sigma_1^2=\mathop{\mathrm{\mathop{\rm Var}}}(\delta(X,R,X',\theta^*))\leq\sigma_0^2\). Moreover, there exist an MRP and feature functions such that Assumptions [hypo:iid]-[hypo:linear] are satisfied and, for any \(\alpha>\alpha_1(\gamma)\), \[\lim_{k\to\infty} {\mathbb{E}}_{m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] = \infty = \lim_{k\to\infty}{\mathbb{E}}\left[|\theta_k|^2\right].\]
Let us discuss the latter convergence result. In the regime \(\alpha\geq\alpha_0(\gamma)\), the rate is slower than that of Theorem 1. However, it applies to a wider range of learning rates. Furthermore, it is both faster and valid for a broader range of \(\alpha\) than any previously known rate. To our knowledge, [6] allowed the widest range of learning rates, namely \(\alpha<1\), while [10] achieved the fastest rate (for \(\alpha\leq\frac{1-\gamma}{256}\)), with a variance term of order \(O(\frac{\alpha\sigma_0^2}{(1-\gamma)^3\omega^2 k})\). In comparison, we obtain \(O(\frac{\alpha\sigma_1^2}{(1-\gamma)^3\omega k})\). Moreover, Theorem 3 shows that this range cannot be extended further in general.
Recall that the upper bounds on the convergence rates stated in the previous subsection decompose into a bias term and a variance term. As is customary in ML, using mini-batches of size \(B\geq1\) divides the variance term by \(B\), while leaving the bias term essentially unchanged. More surprisingly, here the range of admissible learning steps from Theorem 1 grows approximately linearly in \(B\) in the regime \(B\leq (1-\gamma)^{-1}\). This in turn also makes it possible to reduce the bias term by a factor proportional to \(B\).
Theorem 4. Assume [hypo:iid]-[hypo:linear] and consider TD(0) with mini-batches of size \(B\geq1\). For \(\gamma\in[0,1)\), \(0<\alpha<\alpha_B(\gamma) :=\frac{2}{1+\gamma}\frac{1}{1+\frac{2\gamma}{B(1-\gamma)}}\) and \(k\geq1\), we have \[\begin{align} &{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \leq \frac{1}{(1-\gamma)^2k} \\ &\left(\left(\frac{|\theta_0-\theta^*|^2}{2\left(1-\frac{\alpha}{\alpha_1(\gamma)}\right)\frac{\alpha}{1-\gamma}}\right)^{\frac{1}{2}} +\left(\frac{de\sigma_0^2(1+{\widetilde{\varepsilon}}_{k,\gamma})}{1-\frac{\alpha}{\alpha_B(\gamma)}}\right)^{\frac{1}{2}}\right)^2, \end{align}\] with \({\widetilde{\varepsilon}}_{k,\gamma}= \frac{8}{k(1-\gamma)^2} +3(1-\gamma) +\frac{4}{k(1-\frac{\alpha}{\alpha_1(\gamma)})^2}\).
This result suggests that the minibatch size should be chosen as a function of \((1-\gamma)^{-1}\). In particular, when \(1-\gamma\) is small, setting \(B=\lceil c_B(1-\gamma)^{-1}\rceil\) for some fixed \(c_B\in[0.1,1]\) yields a convergence rate of \(O\left(\frac{|\theta_0-\theta^*|^2+\sigma_0^2}{1-\gamma}\right)\) with the learning rate \(\alpha=\frac{\alpha_B(\gamma)}{2}\approx \frac{c_B}{2(2+c_B)}\). This improves upon the rate of Theorem 1 by a factor of \(1-\gamma\), at the cost of using \(O((1-\gamma)^{-1})\) additional samples per iteration. In other words, the ratio of the error to the number of samples used is essentially the same whether the computations are carried out sequentially (i.e., with \(B=1\)) or in parallel with a batch of size \(O((1-\gamma)^{-1})\). Since the wall-clock time required to process a batch is in general comparable to that of a single sample, this translates into a factor \((1-\gamma)^{-1}\) saved in actual computation time.
Proposition 2 and Theorem 3 extend straightforwardly to the minibatch setting, but without a gain comparable to that between Theorems 1 and 4, so we refrain from carrying out such an extension.
In fact, \(| \theta^* |\) generally grows as \(O((1-\gamma)^{-1})\) when \(\gamma\) tends to \(1\), see Lemma 8. Therefore, the bias term in Theorem 1 is of order \(O(k^{-1}(1-\gamma)^{-4})\). Here, we propose a parameterization trick that allows us to keep \(\theta^*\) bounded and obtain a \(O(k^{-1}(1-\gamma)^{-2})\) rate.
In fact, the latter assumption simply corresponds to having a different learning rate for the constant part of the parametrization and for the rest, as follows.
Lemma 1. For \(C>0\), TD(0) computes the same value function in any of the following cases:
(i) [hypo:linear95bis] with \(c_{\gamma}=C\), \(\theta_0\) and \(\alpha>0\).
(ii) [hypo:linear95bis] with \(c_{\gamma}=1\), \({\widetilde{\theta}}_0:=(C\theta_{0,1},\theta_{0,(-1)})\) and \({\widetilde{\alpha}}=\mathop{\mathrm{{\mathop{\rm diag}}}}(C^2\alpha,\alpha,\dots,\alpha)\in \mathbb{R}^{d\times d}\).
Let us introduce the following standard assumption.
Observe that \(g\) is a priori unknown and may be arbitrarily small in practice. However, it is model-independent: it does not depend on the choice of the feature maps \(\varphi\) but only on the Markov Chain itself.
Theorem 5. Assume [hypo:iid], [hypo:R], [hypo:linear95bis] with \(c_{\gamma}=\frac{1}{1-\gamma}\) and [hypo:spectral95gap]. We have \((\theta^*,\sigma_0^2)\) uniformly bounded in \(\gamma\), for \(\gamma\in[\frac{1}{2},1)\) and \(0<\alpha<\alpha_2(\gamma) :=\frac{2(1-\gamma)}{1+(1+\gamma)^2}\), \[\begin{align} &{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \leq \frac{|\theta_0-\theta^*|^2}{2\alpha(1-\gamma)(1-\frac{\alpha}{\alpha_2(\gamma)})k} \\ &+\frac{de(1+\varepsilon_{k,\gamma})}{(1-\gamma)^2k} \left(\sqrt{5}|\theta_0-\theta^*| +\frac{\sigma_0}{\sqrt{1-\frac{\alpha}{\alpha_2(\gamma)}}}\right)^2. \end{align}\]
As illustrated in the previous subsection, the constant part of the value function requires significantly more computation to learn than the non-constant part. Moreover, in RL it is generally sufficient to know the value function up to an additive constant. This is why, in this subsection, we discuss a method that only approximates the value function up to an additive constant, allowing for faster convergence over a broader range of admissible learning rates.
Without loss of generality, the samples of Assumption [hypo:iid] can be divided into two independent sequences \((X_k,X'_k,R_k)\) and \(({\widetilde{X}}_k,{\widetilde{X}}'_k,{\widetilde{R}}_k)\). We then define the pairwise centered temporal difference (PCTD) as \[\label{eq:PCTD} \begin{align} {\widetilde{\delta}}_k =& \frac{1}{2}\bigl(v(X_k,\theta_{k-1}) -\gamma v(X'_k,\theta_{k-1}) -R_k \\ & -(v({\widetilde{X}}_k,\theta_{k-1}) -\gamma v({\widetilde{X}}'_k,\theta_{k-1}) -{\widetilde{R}}_k)\bigr). \end{align}\tag{3}\] Then PCTD(0) is defined using the update rule \[\label{eq:PCTD40041} \theta_k = \theta_{k-1} -\alpha{\widetilde{\delta}}_k(\varphi(X_k)-\varphi({\widetilde{X}}_k)).\tag{4}\] Its limit is \({\widehat \theta}^*={\widehat H}^{-1}{\mathbb{E}}[R(\varphi(X)-\mu)]\) where \({\widehat H}:=H-(1-\gamma)\mu\mu^{\top}\) is invertible under [hypo:spectral95gap] if the set of parameterized functions does not contain \(\mathbb{1}\).
****Proposition** 6**. PCTD(0) is an instance of TD(0) on the MRP defined on \({\mathcal{X}}\times{\mathcal{X}}\) by \(((X_{\ell},{\widetilde{X}}_{\ell}),R_{\ell}-{\widetilde{R}}_{\ell})_{\ell\geq0}\) with feature maps \({\widetilde{\varphi}}(x,{\widetilde{x}})=\frac{1}{\sqrt2}(\varphi(x)-\varphi({\widetilde{x}}))\), where \((X_{\ell},R_{\ell})_{\ell\geq0}\) and \(({\widetilde{X}}_{\ell},{\widetilde{R}}_{\ell})_{\ell\geq0}\) are two independent copies of the MRP defined in Section 3.1. Therefore, all existing results for TD(0) apply to PCTD(0), for both i.i.d. and Markovian sampling schemes.
However, PCTD(0) has an important advantage over TD(0): it is centered, i.e., \({\mathbb{E}}_{m\otimes m}[{\widetilde{\varphi}}(X,{\widetilde{X}})]=0\).
Theorem 7. Assume [hypo:iid]-[hypo:spectral95gap]. The rates from Theorems 1, 3 and 4 hold with \(\varphi\) replaced by \({\widetilde{\varphi}}\), \(\theta^*\) by \({\widehat \theta}^*\), \(\gamma\) by \((1-g)\gamma\), \(\alpha_0(\gamma)\) by \({\widehat \alpha}_0(\gamma):=\frac{1-(1-g)\gamma}{(1+\gamma)^2}\), \(\alpha_1(\gamma)\) by \({\widehat \alpha}_1(\gamma):=\frac{1}{1+\gamma}\), \(\alpha_B(\gamma)\) by \({\widehat \alpha}_B(\gamma):= \frac{1}{1+\gamma}\frac{1}{1+\frac{\gamma(2-g)}{1-(1-g)\gamma}}\), \(\sigma_0^2\) by \(2{\widehat{\sigma}}_0^2\) with \({\widehat{\sigma}}_0^2:={\left\| x\mapsto {\mathbb{E}}[(\Pi_{\mathbb{1}^{\perp}}\delta(X,R,X',{\widehat \theta}^*))^2\,|\,X=x] \right\|_{\infty}^{}}\), and the range of admissible \(\gamma\) becoming \(\gamma\in[0,\frac{1}{1-g})\), where \(\Pi_{\mathbb{1}^{\perp}}\) is the projection over \(\mathbb{1}^{\perp}\) that is orthogonal with respect to the \(L^2(m)\)-scalar product.
Observe that the latter result allows for \(\gamma=1\), and even slightly beyond. Moreover, for \(\gamma\leq1\), it yields the first convergence rate independent of \(\gamma\) for a variant of TD(0) with general mixing Markov Chains up to our knowledge. Indeed, [12] claim to obtain a slow rate of order \(O(\frac{1}{\sqrt{k}})\) independent of the choice of \(\gamma<1\), but it is in fact only of order \(O((1-\gamma)^{-2}k^{-\frac{1}{2}})\) since it depends on \(|\theta^*|^2\) which is of order \((1-\gamma)^{-2}\) in general, as proven in Lemma 8.
Let us mention that most TD algorithms (e.g., \(TD(\lambda)\)) admit PC variants which benefit from properties similar to Proposition 6, allowing one to extend the results of the original versions to the variants without further analysis. We believe that in most cases, these variants benefit from better convergence behaviors than their original versions, as exemplified by PCTD(0) using Theorem 7. For Markovian sampling schemes (instead of i.i.d.), such extensions apply but they require access to two independent trajectories of the Markov Chain, which might be considered a restrictive assumption for some specific applications.
As is customary in the literature establishing convergence rates of TD(0) with LFA and i.i.d. samples, we will consider the larger class of linear stochastic approximation methods. To make a clear distinction from the framework of TD(0) introduced in the previous section, we are going to use different notations.
The goal here is to approximate \(y^*\in \mathbb{R}^d\) satisfying \[Hy^* = b,\] for some invertible matrix \(H\in \mathbb{R}^{d\times d}\) and vector \(b\in \mathbb{R}^d\). To do so, we are going to use the iterative method described by, for some initial state \(y_0\), for any \(k\geq1\), \[y_{k} = y_{k-1} -\alpha (h_ky_{k-1}-b_k),\] where \(\alpha>0\) is the learning step, \((h_k,b_k)\) are couples of random variables in \(\mathbb{R}^{d\times d}\times \mathbb{R}^d\). Let us assume
The symmetric part of \(H\), denoted \(S:=\frac{H+H^{\top}}{2}\), satisfies \(S\geq \mu I_d\) for some \(\mu>0\).
\((h_k,b_k)_{k\geq1}\) is i.i.d. with \({\mathbb{E}}[h_k]=H\) and \({\mathbb{E}}[b_k]=b\).
There exist \(\Sigma\in \mathbb{R}^{d\times d}\) symmetric definite positive and constants \(c_{\Sigma},\beta,\beta_1,\sigma^2\) such that \(\Sigma\leq c_{\Sigma}S\) and \[\begin{align} &{\mathbb{E}}\left[h_kh_k^{\top}\right]\leq \beta \Sigma, \\ &{\mathbb{E}}\left[(h_ky^*-b_k)(h_ky^*-b_k)^{\top}\right]\leq \sigma^2\Sigma, \\ &{\mathbb{E}}\left[h_k^{\top}h_k\right]\leq \beta_1S. \end{align}\]
Observe that we can always take \(\Sigma=S\) and \(c_{\Sigma}=1\) in Assumption [hypo:ineq95LSA]; but, to obtain our sharper rates on TD(0), we will need to take \(\Sigma\) and \(S\) distinct.
We first state a proposition that will be useful to prove our main results on TD(0) as well as for our more general result on LSA, Theorem 9 below.
****Proposition** 8**. Under Assumptions [hypo:SPD]-[hypo:ineq95LSA], for \(0<\alpha<\min(2c_{\Sigma}^{-1}\beta^{-1},2\beta_1^{-1})\), we have \[\begin{gather} {\mathbb{E}}\left[({\overline{y}}_k^{\top}-y^*)^{\top}\Sigma({\overline{y}}_k-y^*)\right] \\ \leq \left(\left( \frac{c_{\Sigma}|y_0-y^*|^2}{\alpha(2-\alpha\beta_1) k} \right)^{\frac{1}{2}} +\left(\frac{2\sigma^2{\mathcal{S}}_k}{(2-\alpha\beta c_{\Sigma})k}\right)^{\frac{1}{2}}\right)^2. \end{gather}\] and \(\mathcal{S}_k\leq c_{\Sigma}^2(3d+\widetilde{\mathcal{S}}_k)\), where \(\mathcal{S}_k\) and \(\widetilde{\mathcal{S}}_k\) are defined by \[\begin{align} \mathcal{S}_k &= \frac{1}{k}\sum_{j=0}^{k-1} {\left\| \left(I_d-(I_d-\alpha\Sigma^{\frac{1}{2}}H\Sigma^{-\frac{1}{2}})^j\right) \Sigma^{\frac{1}{2}}H^{-1}\Sigma^{\frac{1}{2}} \right\|_{F}^{2}} \\ \widetilde{\mathcal{S}}_k &= \frac{1}{k}\sum_{j=0}^{k-1} {\left\| \left(I_d-\alpha\Sigma^{\frac{1}{2}}H\Sigma^{-\frac{1}{2}}\right)^j \right\|_{F}^{2}}. \end{align}\]
Our main convergence result on LSA methods is:
Theorem 9. Under Assumptions [hypo:SPD]-[hypo:ineq95LSA], for \(0<\alpha<\min(2c_{\Sigma}^{-1}\beta^{-1},2\beta_1^{-1})\), we have \[\begin{gather} {\mathbb{E}}\left[({\overline{y}}_k^{\top}-y^*)^{\top}\Sigma({\overline{y}}_k-y^*)\right] \leq \frac{2c_{\Sigma}|y_0-y^*|^2}{(2-\alpha\beta_1)\alpha k} \\ +\frac{4\sigma^2c_{\Sigma}^2d}{k(2-\alpha\beta c_{\Sigma})} \left(3+\frac{1}{\alpha(2-\alpha\beta_1)\mu k}\right). \end{gather}\]
Let us mention that this theorem is more general than Theorem 1 in the sense that it holds for a larger class of methods. However, its convergence rate is weaker: only its leading term with respect to \(k\) is model-independent, and there is an additional error term that is model-dependent but admits a faster decay in \(k^{-2}\). In the end, the rate is of order \(O(k^{-1}+\mu^{-1}k^{-2})\) where \(\mu\) is typically the smallest eigenvalue of \(S\). Up to our knowledge, the fastest convergence rates for LSA methods proved in the literature of TD(0) with similar assumptions are of order \(O(k^{-1}\mu^{-2})\) (see [6], [10]), which makes our rate faster.
In the appendix, we present two extensions of this theorem. The first one, Theorem 14, does not require the third inequality in Assumption [hypo:ineq95LSA], applies to learning rates \(\alpha<\frac{2}{c_{\Sigma}\beta}\) and admits a \(O(k^{-1}+\mu^{-1}k^{-2})\) convergence rate, similar to that of Theorem 9. The second extension, Theorem 15, allows one to take \(\alpha<\frac{2}{\beta_1}\) and admits a slower convergence rate of \(O(k^{-1}\mu^{-1})\). Up to our knowledge, even this latter rate is faster than any existing one prior to this work.
Given Proposition 8, the remainder of the proof of Theorem 1 relies on arguments from complex analysis and is highly technical. However, it is possible to get a robust \(O(k^{-1})\) rate much more easily. This is what we will show in this subsection, in order to illustrate the type of arguments we used to prove Theorem 1. More precisely, this simpler result mainly relies on a classical result from the literature known as Kreiss’ Theorem, that we state here in the same formulation as the one from [21].
Theorem 10 (Kreiss Theorem). Let \(Q\in \mathbb{R}^{d\times d}\) be a matrix such that \(\sup_{k\geq1}{\left\| Q^k \right\|_{\rm op}^{}}<\infty\), then we have \[\mathcal{K}(Q) \leq \sup_{k\geq1}{\left\| Q^k \right\|_{\rm op}^{}} \leq d\,e\,\mathcal{K}(Q),\] where \(\mathcal{K}(Q)\) is the Kreiss constant defined by \[\mathcal{K}(Q) = \sup_{|z|>1}(|z|-1){\left\| (Q-z)^{-1} \right\|_{\rm op}^{}}.\]
In general, the Kreiss constant may depend on the spectrum of \(Q\), so the latter theorem cannot be used to directly obtain a robust rate on LSA methods. However, in the case of TD(0), we will be able to bound the Kreiss constant of \(Q_0:=(I_d-\alpha \Sigma_0^{\frac{1}{2}}H_0\Sigma_0^{-\frac{1}{2}})\) uniformly with respect to the linear model. To do so, we will use the specific structure of \(H_0\), that is \(H_0 = \Sigma_0^{\frac{1}{2}}(I_d-\gamma U)\Sigma_0^{\frac{1}{2}}\), with \({\left\| U \right\|_{\rm op}^{}}\leq1\). For \(z\in \mathbb{C}\) with \(|z|>1\), we then get \[\begin{align} (z-Q_0)^{-1} =& \left((z-1)I_d+\alpha\Sigma_0-\gamma\alpha\Sigma_0U\right)^{-1} \\ =& \left(I_d-\gamma\alpha((z-1)I_d+\alpha\Sigma_0)^{-1}\Sigma_0U\right)^{-1} \\ &\times\left((z-1)I_d+\alpha\Sigma_0\right)^{-1}. \end{align}\] On the one hand, using that \(\Sigma_0\) is symmetric positive definite and the triangular inequality on \(\mathbb{C}\), we have \[\begin{align} {\left\| (z-1)I_d+\alpha\Sigma_0)^{-1} \right\|_{\rm op}^{}} &\leq \sup_{\lambda\in{\rm Sp}(\Sigma_0)}\frac{1}{|z-1+\alpha\lambda|} \\ &\leq \sup_{\lambda\in{\rm Sp}(\Sigma_0)}\frac{1}{|z|-(1-\alpha\lambda)} \\ &\leq \frac{1}{|z|-1}. \end{align}\] On the second hand, observe that \[\begin{align} &{\left\| \alpha((z-1)I_d+\alpha\Sigma_0)^{-1}\Sigma_0U \right\|_{\rm op}^{}} \\ &\leq {\left\| \alpha((z-1)I_d+\alpha\Sigma_0)^{-1}\Sigma_0 \right\|_{\rm op}^{}} \\ &= \sup_{\lambda\in{\rm Sp}(\Sigma_0)}\frac{\alpha\lambda}{|z-1+\alpha\lambda|} \\ &\leq \sup_{\lambda\in{\rm Sp}(\Sigma_0)}\frac{\alpha\lambda}{|z|-(1-\alpha\lambda)} \leq 1, \end{align}\] which implies that \[{\left\| \left(I_d-\gamma\alpha((z-1)I_d+\alpha\Sigma_0)^{-1}\Sigma_0U\right)^{-1} \right\|_{\rm op}^{}} \leq \frac{1}{1-\gamma}.\] From the definition of the Kreiss constant and the above inequalities, we get \[\label{eq:kreiss95constant} \mathcal{K}(Q_0) \leq \frac{1}{1-\gamma}\tag{5}\] Assuming that Proposition 8 applies to TD(0) with \(\Sigma=\Sigma_0\), \(\beta=4\), \(c_{\Sigma}=\frac{1}{1-\gamma}\), \(\beta_1=2\), and \(\sigma^2=\sigma_0^2\), we obtain \(\widetilde{\mathcal{S}}_k\leq de\mathcal{K}(Q_0) \leq\frac{de}{1-\gamma}\) and the following robust \(O(1/k)\)-convergent rate:
Theorem 11. Under Assumptions [hypo:iid]-[hypo:linear], for \(0<\alpha\leq\frac{1-\gamma}{8}\), for \(k\geq1\), we have \[\begin{gather} {\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \\ \leq \frac{2|\theta_0-\theta^*|^2}{(1-\gamma)\alpha k} +\frac{4\sigma_0^2d}{(1-\gamma)^2k} \left(1+ \frac{d^2e^2}{(1-\gamma)^2}\right). \end{gather}\]
We do not consider this theorem one of our main results, since its convergence rate is loose compared to the one of Theorem 1. We only presented it to show a simple proof of a first model-independent \(O(k^{-1})\)-rate.
One may prove that our upper bound on the Kreiss constant 5 is sharp on the set of admissible matrices \(Q_0\) obtained from instances of TD(0). Moreover, it is known, see [21], that the inequalities in Theorem 10 are sharp for general power-bounded matrices \(Q\). So one may ask: how can the constants in the rate of Theorem 11 be improved to get the one in Theorem 1? The answer lies in the fact that the right inequality from Theorem 10 is not sharp over the class of admissible \(Q_0\). In the end, using the particular structure of \(H_0\) once more, we obtain the subsequent proposition that is the last missing part to prove Theorem 1.
****Proposition** 12**. Assume [hypo:iid]-[hypo:linear]. For \(\varepsilon_{k,\gamma}\) and \({\mathcal{S}}_k\) defined as in Theorem 1 and Proposition 8, for \(0<\alpha<\alpha_0(\gamma)\), \(k\geq1\), we have \({\mathcal{S}}_k \leq \frac{de}{(1-\gamma)^2} \left(1+ \varepsilon_{k,\gamma}\right).\)
Theorem 1 is then a direct consequence of the latter proposition and Proposition 8 with \(\Sigma=\Sigma_0\), \(c_{\Sigma}=(1-\gamma)^{-1}\), \(\beta=(1+\gamma)^2\), \(\beta_1=1+\gamma\) and \(\sigma^2=\sigma_0^2\).
Figure 3: We take \(d=3\) with \(\lambda_1=1\) and \(\lambda_2=\lambda_3=10^{-j/2}\) for \(0\leq j\leq 4\), so that \(\omega\in\{\frac{1}{3}\times 10^{-j}, \, 0\leq j \leq 4\}\). We use \(\gamma=0.9\) and \(\alpha=\frac{1-\gamma}{4}=0.025\). We draw the bias on the left (taking \(\sigma_R^2=0\)), the variance in the middle (taking \(\theta_0=\theta^*=0\) and \(\sigma_R^2=1\)) and the total MSE error on the right. The curves are averaged over 10 simulations for 3 (a) and 1000 simulations for 3 (b) and 3 (c), always with the same transition matrix, initial parameter and matrices \(P,Q\) (that have been randomly drawn with \(\alpha_w=1\)). In any case, the dashed pink line is the smallest curve of the form \(y=C/x\) that upper bounds all curves from the same figure.. a — Bias, b — Variance, c — Total error
We consider \(d=3\) and draw a random MRP on \({\mathcal{X}}=\{1,2,3\}\) with \(\omega=\frac{1}{3}\times 10^{-j}\) for \(0\leq j\leq 4\) as described in Appendix 8.1. Figure 3 shows the convergence of the bias, the variance and the total MSE error on the values.
Focusing first on the bias, we observe that each curve exhibits a threshold, seemingly proportional to \(\omega^{-1}\), after which the bias decays quadratically in \(k\). Before this threshold, the bias stays below a bound of the form \(y=C/x\), with \(C\) apparently independent of \(\omega\).
The variance term initially increases, because too little noise has been observed so far, and then decreases. It also appears to switch between two envelopes of the form \(y=C/x\) at an iteration count proportional to \(\omega^{-1}\).
For the total error (which is upper bounded by twice the sum of the bias and the variance terms), the bias dominates at the beginning; once it enters its quadratic decay regime, the variance eventually becomes dominant. The crossover again occurs after a number of iterations proportional to \(\omega^{-1}\). Finally, all curves remain bounded by a function \(C/x\) with \(C\) independent of \(\omega\), in agreement with Theorem 1.
Figure 4 (a) compares the numerical performance of: (i) the standard TD(0), (ii) TD(0) with two different learning rates as described in Subsection 3.4, and (iii) PCTD(0). The details of the model are given in Subsection 8.3. It uses minibatches of size \(B=100\) which, compared with the simulations in Figure 3, allow us to significantly increase several hyperparameters. More precisely, we take \(\gamma=0.99\), \(d=100\) and \(|{\mathcal{X}}|=1000\). Recall that the error of PCTD(0) is only reduced up to an additive constant, so for this method we consider the mean-square error of the value function projected onto the orthogonal complement of the constant functions (this matches the error obtained when \(\varphi\) is replaced by \({\widetilde{\varphi}}\), as described in Subsection 3.5). For TD(0), we can compute both this metric and the standard MSE of the value function. We observe that the standard TD(0) performs significantly worse than the two other methods, which is consistent with our theoretical findings.
Using the same Markov decision process as in the previous paragraph, described in Subsection 8.3, we are able to compute the spectral gap, which is approximately \(g=0.145\). By Theorem 7, this allows us to consider values of \(\gamma\) larger than one, while still satisfying \(\gamma\in[0,\frac{1}{1-g})\). We compare four instances of PCTD(0), each with a different \(\gamma\) in \(\{0.9,0.99,1,1.15\}\). As predicted by Theorem 7, the
We observe that PCTD(0) appears to be very robust with respect to changes in \(\gamma\).
Figure 4: We take \(d=100\) and \({\mathcal{X}}=\{1,\dots,1000\}\). The transition matrix is drawn atrandom: each column is a sample from a Dirichlet distribution with parameter\(2/|{\mathcal{X}}|=2\times 10^{-3}\). We consider minibatches with size \(B=100\).On the left, using \(\gamma=0.99\),we compare the standard TD(0) with an instance of TD(0) using thetwo learning rates described in Subsection 3.4, andwith PCTD(0) as described in Subsection 3.5. The dashed linescorrespond to the MSE of the value functions. The solid lines correspond to themean square of the value-function error projected onto the orthogonalcomplement of the constant functions (this matches the error obtained when\(\varphi\) is replaced by \({\widetilde{\varphi}}\), as described in Subsection 3.5).On the right, we compare different instances of PCTD(0) with\(\gamma\in\{0.9,0.99,1.,1.1\}\) and \(\alpha(\gamma)=\frac{\alpha_B((1-g)\gamma)}{2}\),where \(g\approx 0.145\) here. All curves are averaged over \(10\) simulations.. a — TD(0) vs. PCTD(0), b — PCTD(0) with different \(\gamma\)
In this paper, we derived a robust convergence rate of order \(1/k\) for the TD(0) algorithm with i.i.d. samples, using a universal learning rate. The key ingredient behind these results is a set of new Kreiss-like estimates tailored to the particular structure of TD(0). These estimates describe the behavior of dynamical systems obtained by iterating a linear system whose associated matrix is non-symmetric. We also established a lower bound on the convergence of TD(0) that matches our rate up to a multiplicative constant smaller than \(11\). Since this lower bound is obtained on simple examples, we believe that our analysis accurately captures the actual asymptotic behavior of TD(0), a belief that is further supported by our numerical simulations.
As a consequence, we showed through theoretical arguments that the main bottleneck in the convergence of TD(0) is in fact the smallness of \((1-\gamma)\). Without further assumptions, in the regime of our main result, Theorem 1, the bias part of the error is of order \(O((1-\gamma)^{-4}k^{-1})\), while the variance part is only of order \(O((1-\gamma)^{-2}k^{-1})\). Using minibatches then allows one to divide both parts of the error by a factor proportional to the batch size; remarkably, this applies not only to the variance but also to the bias, which is non-standard (see Theorem 4). Moreover, when the Markov chain is strongly mixing, we propose two methods to reduce the dependence on \((1-\gamma)^{-1}\). The second of these is particularly promising: it consists in introducing a variant of TD(0), which we call PCTD(0), that can be computed for \(\gamma=1\) and even slightly beyond. This variant enjoys a robust and fast convergence rate whose dependence is governed by \((1-(1-g)\gamma)^{-1}\) rather than the usual \((1-\gamma)^{-1}\), where \(g>0\) denotes the spectral gap, which is unknown a priori and may be small in practice.
Across all the convergence regimes presented here, we believe that the fastest in practice is PCTD(0) with minibatch size \(B=\lceil c_B(1-\gamma)^{-1}\rceil\) and \(c_B\in[0.1,1]\). This yields a convergence rate of order \(O((1-\gamma)^{-1}k^{-1})\), which substantially outperforms all previously existing rates.
Alongside these main results, we developed related bounds for general LSA schemes and obtained a convergence rate of order \(1/k\) with a model-independent leading term, the model dependence being confined to a faster-decaying term of order \(1/k^2\).
While these results significantly improve our understanding of the behavior of TD(0), several open questions remain:
Defining \(\alpha_{\rm rob}(\gamma)>0\) as the supremum of learning rates that allow robust and fast convergence in the present regime, we proved that \(\alpha_1(\gamma)\leq\alpha_{\rm rob}(\gamma)\leq\alpha_2(\gamma)\). Can we characterize \(\alpha_{\rm rob}\) more precisely?
Is it possible to adapt the main result to infinite-dimensional linear approximation, so that one could potentially combine optimal rates and universal approximation?
Can the proof be extended to the Markovian sampling setup while preserving similar rates, affected only by mixing constants? Alternatively, can one identify fundamental limitations in the Markovian setting that would preclude such results?
Do these proof techniques extend to other, more complex reinforcement learning algorithms beyond policy evaluation, such as SARSA, Q-learning, or actor-critic methods?
All experiments were run on a standard personal laptop (Intel Core i7, 32 GB RAM) using only CPU. Total computation time amounted to a few hours.
In this section, we describe how we create an MRP with the following properties:
we can fix the spectrum of \(\Sigma_0\): it is particularly useful to illustrate the independence of the convergence with respect to \(\omega\), the smallest eigenvalue of \(\Sigma_0\).
It is not reversible. Indeed, we believe that reversibility is both unrealistic and overly simplistic. For reversible MRPs, the theoretical analysis becomes significantly simpler. In this case, most of the matrices involved are symmetric and commute with one another. As a result, one can obtain results similar to those proved in the main body of this article with considerably less effort. In particular, much of our theoretical analysis becomes unnecessary, especially the part relying on complex analysis.
It is random.
We take \(\{1,\dots,n\}\) as the state space and \(T\in \mathbb{R}^{n\times n}\) as the transition matrix. Recall that \(T\) is stochastic by definition, i.e., its coefficients are nonnegative and the sum of any row equals one. Here, we make the additional assumption that \(T\) is bistochastic, i.e., any column sums to one as well. This implies that the uniform distribution \(m=\frac{1}{n}\) is invariant. For \(n\leq 2\), any bistochastic matrix is in fact symmetric which implies that the Markov Chain is reversible. For this reason, we always assume \(n\geq3\) when working with bistochastic matrices.
It is well-known that the set of bistochastic matrices is exactly the convex hull of permutations matrices and therefore is of dimension \((n-1)^2\). Therefore, using Carathéodory’s theorem, we can randomly draw a bistochastic \(T\) of the form \(T={\sum_{i=1}^{(n-1)^2+1}w_ip_i}\), where \((p_i)_i\) are permutation matrices and \(w\) follows a Dirichlet distribution \({\rm Dir}(\alpha_w,\dots,\alpha_w)\) for some \(\alpha_w>0\). The support of the latter random variable is the whole set of bistochastic matrices.
We simply take \((R_k)_{k\geq0}\) i.i.d. with \(R_1\sim{\mathcal{N}}(0,\sigma_R^2)\). In particular, the noise does not depend on the state of the Markov Chain. This implies that \(\theta^*=0\).
We have to take \(d\leq n\) in order for the linear independence of the feature maps to be possible. Since the number of states is finite, the feature maps can be represented using the matrix \(\Phi:=(\varphi_i(j))_{1\leq i\leq d,1\leq j\leq n}\). Consider its singular value decomposition \(\Phi=PD_{\varphi}Q^{\top}\), where \(P\in \mathbb{R}^{d\times d},Q\in \mathbb{R}^{n\times n}\) are orthogonal and \(D_{\varphi}=\mathop{\mathrm{{\mathop{\rm diag}}}}(\lambda_1,\dots,\lambda_d)\in \mathbb{R}^{d\times n}\) with \(1\geq\lambda_1\geq\dots\geq\lambda_d>0\). Observe that, with the above assumption on the transition matrix, we have \[\Sigma_0 = \Phi D_m \Phi^{\top} = \frac{1}{n}PD_{\varphi}D_{\varphi}^{\top}P^{\top},\] where \(D_m=\frac{1}{n}I_n\) is the diagonal matrix with the invariant distribution as diagonal coefficients. Therefore, the eigenvalues of \(\Sigma_0\) are given by \(\lambda_i^2/d\) for \(1\leq i\leq d\). Moreover, the boundedness condition of Assumption [hypo:linear] holds since \(|\varphi(j)|^2=(QD_{\varphi}^{\top}D_{\varphi}Q^{\top})_{j,j} \leq \lambda_1^2\leq1\).
To randomly draw a matrix \(\Sigma_0\) with fixed spectrum \((\frac{\lambda_i^2}{n})_{1\leq i\leq d}\), it is then sufficient to randomly draw \(P,Q\). We do so by computing the singular value decomposition of a randomly drawn matrix in \(\mathbb{R}^{d\times n}\) with i.i.d. coefficients distributed according to \({\mathcal{U}}(-1,1)\).
When we are only interested in the variance part of the error, we take \(\theta_0=0\). Otherwise, each coordinate of \(\theta_0\) is drawn uniformly over \([-1,1]\).
We take \(d=3\) because it is the smallest dimension for which there exist bistochastic matrices \(T\) that are not symmetric. We fix \(\lambda_1=1\) and vary \(\lambda_2=\lambda_3\) so that \(\omega = 5\times 10^{-j}\) for \(1\leq j\leq 5\). Focusing first on the bias, we observe that each curve exhibits a threshold, seemingly proportional to \(\omega^{-1}\), after which the bias decays quadratically in \(k\). Before this threshold, the bias stays below a bound of the form \(y=C/x\), with \(C\) apparently independent of \(\omega\).
The variance term initially increases, because too little noise has been observed so far, and then decreases. It also appears to switch between two envelopes of the form \(y=C/x\) at an iteration count proportional to \(\omega^{-1}\).
For the total error (which is upper bounded by twice the sum of the bias and the variance terms), the bias dominates at the beginning; once it enters its quadratic decay regime, the variance eventually becomes dominant. The crossover again occurs after a number of iterations proportional to \(\omega^{-1}\). Finally, all curves remain bounded by a function \(C/x\) with \(C\) independent of \(\omega\), in agreement with Theorem 1.
In the first line of Figure 5, we take \(\alpha=1\) so that Theorem 3 implies that the convergence is fast but does not ensure the robustness with respect to the smallness of \(\omega\). Yet, in our numerical simulations, we experience convergence speeds that do not degrade when \(\omega\) is small.
We observe that the bias term is much smaller than the one in Figure 3, but the variance and the total MSE are larger. Therefore, for bounded \(|\theta_0-\theta^*|\), the regime \(\frac{1-\gamma}{4}\) may seem better at first sight. However, this statement has to be nuanced with the fact that \(\theta^*\) can be of order \((1-\gamma)^{-1}\) in practice.
In the second line of Figure 5, we took \(\gamma=0.99\) and observe approximately the same behavior as in Figure 3 with a shift to the right. Observe that the coefficient of the dashed pink line is multiplied by a factor \(100\) in the three figures, which is aligned with the upper bound from Theorem 1.
Figure 5: We use similar parameters as in Figure 3 but with \(\gamma=0.9\) and \(\alpha=1\) for the first line and \(\gamma=0.99\) and \(\alpha=\frac{1-\gamma}{4}=2.5\times10^{-3}\) for the second line.. a — Bias, b — Variance, c — Total error, d — Bias, e — Variance, f — Total error
Here, we give more details on the model used for the simulations in Figure 4. It is random, as the one described in Subsection 8.1, but it is no longer bistochastic and we do not prescribe its eigenvalues.
We take \({\mathcal{X}}=\{1,\dots,n\}\) with \(n=1000\) as the state space. The transition matrix \(T\in \mathbb{R}^{n\times n}\) is drawn at random: its rows \((T_i)_{1\leq i\leq n}\) are i.i.d., each distributed according to a Dirichlet law with parameter \(2/|{\mathcal{X}}|=2\times10^{-3}\). The rewards follow \({\mathcal{N}}(1,\sigma_R^2)\) with \(\sigma_R^2=1\).
We take \(d=100<n\), so that the space of admissible functions is strictly smaller than the set of all functions on \({\mathcal{X}}\). The first feature map is constant equal to one, i.e., \(\varphi_1\equiv1\). The remaining feature maps are defined as follows: let \(\overline{\Phi}\) and \(\widetilde{\Phi}\) be two uniform random variables with values in \([-1,1]^{d-1}\) and \([-1,1]^{(d-1)\times n}\), respectively; we then set, for \(1\leq i\leq d-1\) and \(1\leq j\leq n\), \[\Phi_{i+1,j} = (\overline{\Phi}_i +\widetilde{\Phi}_{i,j})/Z_j\text{ with }Z_j=\sum_{\ell=1}^{d-1} |\overline{\Phi}_{\ell} +\widetilde{\Phi}_{\ell,j}|.\] The initial condition \(\theta_0\in \mathbb{R}^d\) is drawn from the uniform distribution over \([-1,1]^d\).
We use a minibatch size of \(B=100\) and take \(\gamma=0.99\). For the orange curves (TD(0) with two learning rates, as described in Subsection 3.4), the learning rate of the first component is \(\frac{1}{4(1-\gamma)}\). All remaining learning rates—those of the other components of the orange curves and of the other curves—are set to \(\frac{\alpha_B(\gamma)}{2}\), where \(\alpha_B(\gamma)\) is defined in Theorem 4.
We again use a minibatch size of \(B=100\). This time, each curve has its own discount factor \(\gamma\in\{0.9,0.99,1,1.15\}\). Once the MRP was drawn, we computed the spectral gap defined in Assumption [hypo:spectral95gap], which was approximately \(0.145\). By Theorem 7, the corresponding range of admissible \(\gamma\) was approximately \((0,1.17)\), which covers all the values above; we used the learning rate \(\alpha=\frac{\alpha_B((1-g)\gamma)}{2}\).
Proof of Proposition 8. Define \(z_k=y_k-y^*\), it satisfies \[z_{k} = (I_d-\alpha h_k)z_{k-1} -\alpha (h_ky^*-b_k) \;\text{ with }\; z_0 = y_0-y^*.\] Observe that \(-\alpha (h_ky^*-b_k)\) plays the role of a source term. Therefore, by linearity (or Duhamel’s principle), we get that \(z_k=w_k+\eta_k\), where \(w_k\) and \(\eta_k\) are defined by induction as \[\begin{align} w_{k} &= (I_d-\alpha h_k)w_{k-1}\text{ with }w_0 = y_0-y^*, \\ \eta_{k} &= (I_d-\alpha h_k)\eta_{k-1} -\alpha (h_ky^*-b_k)\text{ with }\eta_0 = 0. \end{align}\] In the following, we will prove \[{\mathbb{E}}\left[{\overline{w}}_k^{\top} \Sigma{\overline{w}}_k\right] \leq \frac{c_{\Sigma}|w_0|^2}{\alpha(2-\alpha\beta_1) k} \;\text{ and }\; {\mathbb{E}}\left[{\overline{\eta}}_k^{\top}\Sigma{\overline{\eta}}_k\right] \leq \frac{2\sigma^2}{(2-\alpha\beta c_{\Sigma})k} {\mathcal{S}}_k.\] so that we will be able to conclude using the inequality \({\mathbb{E}}\left[{\overline{z}}_k^{\top} \Sigma{\overline{z}}_k\right] \leq \left({\mathbb{E}}\left[{\overline{w}}_k^{\top} \Sigma{\overline{w}}_k\right]^{\frac{1}{2}} +{\mathbb{E}}\left[{\overline{\eta}}_k^{\top}\Sigma{\overline{\eta}}_k\right]^{\frac{1}{2}}\right)^2\).
First step: dealing with the initial condition (corresponding to \(w\)).
For \(k\geq1\), using \({\mathbb{E}}\left[h_k^{\top}h_k\right]\leq \beta_1S\), observe that \[\begin{align} {\mathbb{E}}\left[|w_k|^2\right] &= {\mathbb{E}}\left[w_{k-1}^{\top}(I_d-\alpha h_k-\alpha h_k^{\top}+\alpha^2 h_k^{\top}h_k)w_{k-1}\right] \\ &\leq {\mathbb{E}}\left[w_{k-1}^{\top}(I_d-2\alpha S+\alpha^2\beta_1 S)w_{k-1}\right] \\ &\leq {\mathbb{E}}\left[w_{k-1}^{\top}(I_d-\alpha(2-\alpha\beta_1) S)w_{k-1}\right] \\ &= {\mathbb{E}}\left[|w_{k-1}|^2\right] -\alpha(2-\alpha\beta_1){\mathbb{E}}\left[w_{k-1}^{\top}Sw_{k-1}\right]. \end{align}\] Taking the sum from \(1\) to \(k\) in the latter inequality and using that \(u\mapsto u^{\top}Su\) is convex, we obtain \[{\mathbb{E}}\left[{\overline{w}}_k^{\top} S{\overline{w}}_k\right] \leq \frac{1}{k}\sum_{i=0}^{k-1}{\mathbb{E}}\left[w_i^{\top} Sw_i\right] \leq \frac{1}{\alpha k}\sum_{i=1}^{k} \left({\mathbb{E}}\left[|w_{k-1}|^2\right] -{\mathbb{E}}\left[|w_k|^2\right]\right) \leq \frac{|w_0|^2}{\alpha(2-\alpha\beta_1) k}.\] This and \(\Sigma\leq c_{\Sigma}S\) conclude the part on the bias.
Second step: getting bounds on the uncentered covariances of variance term (corresponding to \(\eta\)).
Using a straightforward induction, we have \({\mathbb{E}}[\eta_k]=0\) for \(k\geq0\). We will now prove by induction that \[\label{eq:etaketakt} {\mathbb{E}}\left[\eta_k\eta_k^{\top}\right] \leq \frac{\sigma^2\alpha c_{\Sigma}}{2-\alpha\beta c_{\Sigma}}I_d.\tag{6}\] Recall that \(\eta_0=0\) so the above inequality holds for \(k=0\). Then, for \(k\geq1\), we assume that it holds at index \(k-1\). Since \(\eta_{k-1}\) and \((h_k,b_k)\) are independent, we obtain \[{\mathbb{E}}\left[(I_d-\alpha h_k)\eta_{k-1}(h_ky^*-b_k)^{\top}\right] = {\mathbb{E}}\left[(I_d-\alpha h_k){\mathbb{E}}\left[\eta_{k-1}\right](h_ky^*-b_k)^{\top}\right] = 0.\] Using the latter equality, Inequality ?? , \(\Sigma\leq c_{\Sigma}S\), and the second inequality in Assumption [hypo:ineq95LSA], we obtain \[\begin{align} {\mathbb{E}}\left[\eta_k\eta_k^{\top}\right] &= {\mathbb{E}}\left[(I_d-\alpha h_k)\eta_{k-1}\eta_{k-1}^{\top}(I_d-\alpha h_k^{\top})\right] +\alpha^2{\mathbb{E}}\left[(h_ky^*-b_k)(h_ky^*-b_k)^{\top}\right] \\ &\leq \frac{\sigma^2\alpha c_{\Sigma}}{2-\alpha\beta c_{\Sigma}} {\mathbb{E}}\left[(I_d-\alpha h_k)(I_d-\alpha h_k^{\top})\right] +\sigma^2\alpha^2\Sigma \\ &\leq \frac{\sigma^2\alpha c_{\Sigma}}{2-\alpha\beta c_{\Sigma}} (I_d-\alpha(2-\alpha\beta c_{\Sigma}) S) +\sigma^2\alpha^2 c_{\Sigma}S \\ &\leq \frac{\sigma^2\alpha c_{\Sigma}}{2-\alpha\beta c_{\Sigma}}I_d. \end{align}\] This concludes the induction and the proof of Inequality 6 .
Third step: introduce an appropriate decomposition for \(\eta\).
Let us then define \((\eta^r_k)_{k\geq0,0\leq r\leq k+1}\) and \((\chi^r_k)_{1\leq r\leq k}\) by induction by, for \(1\leq r\leq k\), \[\begin{align} \eta^r_k &= (I_d-\alpha H)\eta^r_{k-1} +\chi_k^r\text{ with }\eta^0_{k-1} = \eta^{k}_{k-1} = 0, \\ \chi_k^{r} &= -\alpha(h_k-H)\eta^{r-1}_{k-1} -\alpha(h_ky^*-b_k) \delta_{\left\{r=1\right\}}. \end{align}\] Let us check by induction on \(k\geq1\) that \(\eta_k=\sum_{r=1}^k\eta^r_k\). The case \(k=1\) is a simple consequence of the above initial condition. Now assume that it holds for \(k-1\), for \(k\geq2\), and let us prove it for index \(k\): \[\begin{align} \eta_k &= (I_d-\alpha h_k) \sum_{r=1}^{k-1}\eta^r_{k-1} +\chi^1_k \\ &= (I_d-\alpha H) \sum_{r=1}^{k-1}\eta^r_{k-1} -\alpha(h_k-H) \sum_{r=2}^{k}\eta^{r-1}_{k-1} +\chi^1_k \\ &= \sum_{r=1}^{k} \left((I_d-\alpha H) \eta^r_{k-1} +\chi^r_k\right) \\ &= \sum_{r=1}^{k} \eta^r_k. \end{align}\]
In fact, \(\eta^r_k\) can be rewritten as a sum of terms, each of which admits exactly \(r\) different multiplicative centered noises (of the form \(h_j-H\) or \(h_jy^*-b_j\) for some \(1\leq j\leq k\)). Therefore, for \(r'\neq r\), any term from the development of \(\eta^{r'}_k(\eta^{r}_k)^{\top}\) contains at least one multiplicative centered noise that appears only once and is independent of the rest of this same term (i.e., is of the form \(R_1(h_j-H)R_2\) or \(R_1(h_jy^*-b_j)\) with neither \(R_1\) or \(R_2\) containing \(h_j\) or \(b_j\)). This implies that \({\mathbb{E}}\left[\eta^{r'}_k(\eta^{r}_k)\right]=0\), so that we get \[\label{eq:decomp95eta} {\mathbb{E}}\left[\eta_k(\eta_k)^{\top}\right] = \sum_{r=1}^k \sum_{r'=1}^k {\mathbb{E}}\left[\eta^r_k(\eta^{r'}_k)^{\top}\right] = \sum_{r=1}^k {\mathbb{E}}\left[\eta^r_k(\eta^{r}_k)^{\top}\right].\tag{7}\] Using similar arguments, we also have that, for \({\overline{\eta}}_k:=\frac{1}{k}\sum_{j=0}^{k-1}\eta_k\) and \({\overline{\eta}}^r_k:=\frac{1}{k}\sum_{j=0}^{k-1}\eta^r_k\), \[\label{eq:decomp95etao} {\mathbb{E}}\left[{\overline{\eta}}_k^{\top}\Sigma{\overline{\eta}}_k\right] = \sum_{r=1}^k {\mathbb{E}}\left[({\overline{\eta}}^r_k)^{\top}\Sigma{\overline{\eta}}^r_k\right].\tag{8}\]
Fourth step: obtaining the convergence rate.
For \(1\leq r\leq k\), the induction relation of \(\eta^r_k\) implies \[\eta^r_k = \sum_{j=1}^k (I_d-\alpha H)^{k-j}\chi^r_j.\] For \(k\geq2\), define \({\overline{\eta}}^r_k=\frac{1}{k}\sum_{i=1}^{k-1}\eta^r_k\), it satisfies \[{\overline{\eta}}^r_k = \frac{1}{k} \sum_{i=1}^{k-1} \sum_{j=1}^i (I_d-\alpha H)^{i-j}\chi^r_j = \frac{1}{k} \sum_{j=1}^{k-1} \sum_{i=j}^{k-1} (I_d-\alpha H)^{i-j}\chi^r_j = \frac{1}{\alpha k} \sum_{j=1}^{k-1} M_{k-j}H^{-1}\chi^r_j = \frac{1}{\alpha k} \sum_{j=0}^{k-1} M_{j}H^{-1}\chi^r_{k-j}.\] where \(M_{j}=I_d-(I_d-\alpha H)^{j}\). Observe that \(M_{j}\) commutes with \(H\) and \(H^{-1}\) (but not with \(H^{\top}\) and \(H^{-\top}\)). On the one hand, using Inequality ?? , we get \[\begin{align} {\mathbb{E}}\left[({\overline{\eta}}^1_k)^{\top}\Sigma{\overline{\eta}}^1_k\right] &= \frac{1}{\alpha^2 k^2} \sum_{j=0}^{k-1} {\mathbb{E}}\left[(\chi^1_{k-j})^{\top}H^{-\top} M_{j}^{\top}\Sigma M_{j} H^{-1}\chi^1_{k-j}\right] \\ &= \frac{1}{\alpha^2 k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[\chi^1_{k-j}(\chi^1_{k-j})^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &= \frac{1}{k^2} \sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}y^*-b_{k-j})(h_{k-j}y^*-b_{k-j})^{\top})\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\sigma^2}{k^2} \sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1}\Sigma H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \end{align}\] On the other hand, we have \[\begin{align} \sum_{r=2}^k {\mathbb{E}}\left[({\overline{\eta}}^r_k)^{\top}\Sigma{\overline{\eta}}^r_k\right] &= \frac{1}{\alpha^2 k^2} \sum_{r=2}^k \sum_{j=0}^{k-1} {\mathbb{E}}\left[(\chi^r_{k-j})^{\top}H^{-\top} M_{j}^{\top}\Sigma M_{j} H^{-1}\chi^r_{k-j}\right] \\ &= \frac{1}{\alpha^2 k^2} \sum_{r=2}^k \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[\chi^r_{k-j}\otimes\chi^r_{k-j}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &= \frac{1}{k^2} \sum_{r=2}^k \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}-H)\eta^{r-1}_{k-j-1}(\eta^{r-1}_{k-j-1})^{\top}(h_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &= \frac{1}{k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}-H) \sum_{r=2}^k {\mathbb{E}}\left[\eta^{r-1}_{k-j-1}(\eta^{r-1}_{k-j-1})^{\top}\right] (h_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &= \frac{1}{k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}-H) {\mathbb{E}}\left[\eta_{k-j-1}(\eta_{k-j-1})^{\top}\right] (h_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\sigma^2\alpha c_{\Sigma}}{(2-\alpha\beta c_{\Sigma})k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}-H)(h_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\sigma^2\alpha\beta c_{\Sigma}}{(2-\alpha\beta c_{\Sigma})k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j} H^{-1}\Sigma H^{-\top} M_{j}^{\top}\Sigma^{\frac{1}{2}}\right), \end{align}\] where we used Equality 7 to get the fifth line, the second step of this proof to get the sixth line and the first inequality of Assumption [hypo:ineq95LSA] to obtain the last one. The latter two chains of inequalities and Equality 8 imply \[\begin{align} {\mathbb{E}}\left[{\overline{\eta}}_k^{\top}\Sigma{\overline{\eta}}_k\right] &= \sum_{r=1}^k {\mathbb{E}}\left[({\overline{\eta}}^r_k)^{\top}\Sigma{\overline{\eta}}^r_k\right] \\ &\leq \frac{\sigma^2}{k^2}\left(1+\frac{\alpha\beta c_{\Sigma}}{2-\alpha\beta c_{\Sigma}}\right) \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j} H^{-1}\Sigma H^{-\top} M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &= \frac{2\sigma^2}{(2-\alpha\beta c_{\Sigma})k^2} \sum_{j=0}^{k-1} {\left\| \Sigma^{\frac{1}{2}}\left(I_d-(I_d-\alpha H)^j\right)H^{-1}\Sigma^{\frac{1}{2}} \right\|_{F}^{2}} \\ &= \frac{2\sigma^2}{(2-\alpha\beta c_{\Sigma})k^2} \sum_{j=0}^{k-1} {\left\| \left(I_d-(I_d-\alpha \Sigma^{\frac{1}{2}}H\Sigma^{-\frac{1}{2}})^j\right)\Sigma^{\frac{1}{2}} H^{-1}\Sigma^{\frac{1}{2}} \right\|_{F}^{2}} \\ &= \frac{2\sigma^2}{(2-\alpha\beta c_{\Sigma})k} {\mathcal{S}}_k. \end{align}\]
To conclude, it only remains to prove that \({\mathcal{S}}_k\leq c_{\Sigma}^2(3d+ \widetilde{\mathcal{S}}_k)\), which is a consequence of the following computations, \[\Sigma^{\frac{1}{2}}H^{-1}\Sigma H^{-\top}\Sigma^{\frac{1}{2}} \leq c_{\Sigma}\Sigma^{\frac{1}{2}}H^{-1}S H^{-\top}\Sigma^{\frac{1}{2}} = c_{\Sigma}\Sigma^{\frac{1}{2}}\frac{H^{-1}+H^{-\top}}{2}\Sigma^{\frac{1}{2}} = c_{\Sigma}\Sigma^{\frac{1}{2}}S^{-1}\Sigma^{\frac{1}{2}} \leq c_{\Sigma}^2I_d,\] where we used \(\Sigma\leq c_{\Sigma}S\), Heinz’s inequality \(H^{-1}+H^{-\top}\leq 2S^{-1}\) and \(S^{-1}\leq c_{\Sigma}\Sigma^{-1}\); and \[{\left\| \left(I_d-Q^j\right)\Sigma^{\frac{1}{2}} H^{-1}\Sigma^{\frac{1}{2}} \right\|_{F}^{2}} \leq c_{\Sigma}^2 {\left\| I_d-Q^j \right\|_{F}^{2}} = c_{\Sigma}^2\left({\rm tr}(I_d) -2{\rm tr}(Q^j) +{\left\| Q^j \right\|_{F}^{2}}\right) \leq c_{\Sigma}^2(3d+{\left\| Q^j \right\|_{F}^{2}}),\] where we used \(|{\rm tr}(Q^j)|=|{\rm tr}((I_d-\alpha H)^j)| \leq d\|I_d-\alpha H\|_{\rm op}^j\leq d\). This concludes the proof. ◻
Lemma 2. Under Assumptions [hypo:SPD]-[hypo:ineq95LSA], for \(0<\alpha<\frac{2}{\beta_1}\), we have \[{\mathcal{S}}_k \leq c_{\Sigma}^2d\left(3+\frac{1}{\alpha(2-\alpha\beta_1)\mu k}\right).\] Under Assumptions [hypo:SPD],[hypo:iid95LSA] and [hypo:ineq95LSA] without the last inequality, for \(0<\alpha<\frac{2}{\beta c_{\Sigma}}\), we have \[{\mathcal{S}}_k \leq c_{\Sigma}^2d\left(3+\frac{1}{\alpha(2-\alpha\beta c_{\Sigma})\mu k}\right).\]
Proof. Let us prove the first inequality. Using \(M_j=I_d-(I_d-\alpha H)^j\) and \(N_j=(I_d-\alpha H)^j\) for \(j\geq1\), we have for \(k\geq1\): \[\begin{align} {\mathcal{S}}_k &= \frac{1}{k}\sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1}\Sigma H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{c_{\Sigma}}{k}\sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1}S H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{c_{\Sigma}}{k}\sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}\frac{H^{-1}+H^{-\top}}{2} M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{c_{\Sigma}}{k}\sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}S^{-1} M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &= \frac{c_{\Sigma}}{k}\sum_{j=1}^{k-1} {\rm tr}\left( S^{-\frac{1}{2}}M^{\top}_{j}\Sigma M_{j}S^{-\frac{1}{2}}\right) \\ &\leq \frac{c_{\Sigma}^2}{k}\sum_{j=1}^{k-1} {\rm tr}\left( S^{-\frac{1}{2}}M^{\top}_{j}S M_{j}S^{-\frac{1}{2}}\right) \\ &= \frac{c_{\Sigma}^2}{k}\sum_{j=1}^{k-1} {\rm tr}\left( I_d+ 2{\rm tr}(N_j) +S^{-\frac{1}{2}}N^{\top}_{j}S N_{j}S^{-\frac{1}{2}}\right) \\ &\leq 3c_{\Sigma}^2d +\frac{c_{\Sigma}^2}{k}{\rm tr}\left(S^{-\frac{1}{2}}\left(\sum_{j=1}^{k-1}N_j^{\top}SN_j\right)S^{-\frac{1}{2}}\right) \\ &\leq c_{\Sigma}^2\left(3d+\frac{{\rm tr}(S^{-1})}{\alpha(2-\alpha\beta_1)k}\right) \\ &\leq c_{\Sigma}^2d\left(3+\frac{1}{\alpha(2-\alpha\beta_1)\mu k}\right), \end{align}\] where we used \(\Sigma\leq c_{\Sigma}S\) to get the second and sixth lines, Heinz’s inequality (Lemma 4) to get the fourth one, \({\rm tr}(N_j)\leq{\rm tr}(I_d)^{\frac{1}{2}}{\rm tr}(N_j^{\top}N_j)^{\frac{1}{2}}\leq {\rm tr}(I_d)=d\) (since \((I_d-\alpha H)^{\top}(I_d-\alpha H)\leq I_d\)) and Inequality ?? to get the eighth one, and \(S^{-1}\leq\mu^{-1}I_d\) to get the last one.
To get the second inequality, we write \[{\mathcal{S}}_k = \frac{1}{k}\sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}^{\top}H^{-\top}\Sigma H^{-1}M_{j}\Sigma^{\frac{1}{2}}\right),\] using that \(H\) and \(M_j\) commutes. Then, we repeat similar arguments as the ones for the first inequality. This concludes the proof. ◻
****Proposition** 13**. Assume [hypo:SPD]-[hypo:ineq95LSA]. Consider the following LSA with minibatches \[y_k = y_k-\alpha (h^B_ky_{k-1}-b^B_k)\text{ with }h^B_k=\frac{1}{B}\sum_{i=1}^Bh_{k,i}\text{ with }b^B_k=\frac{1}{B}\sum_{i=1}^Bb_{k,i},\] where \((h_{k,i},b_{k,i})_{k\geq1,1\leq i\leq B}\) are i.i.d. copies of \((h_k,b_k)\) from Section 4. For \(0<\alpha<\min\left(\frac{2B}{\beta c_{\Sigma}+(B-1)\beta_1},\frac{2}{\beta_1}\right)\), with \({\mathcal{S}}_k\) defined in Proposition 8, we have \[{\mathbb{E}}\left[({\overline{y}}_k^{\top}-y^*)^{\top}\Sigma({\overline{y}}_k-y^*)\right] \leq \left(\left( \frac{c_{\Sigma}|\theta_0-\theta^*|^2}{\alpha(2-\alpha\beta_1) k} \right)^{\frac{1}{2}} +\left(\frac{2\sigma^2{\mathcal{S}}_k}{(2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1))k}\right)^{\frac{1}{2}}\right)^2.\]
Proof. The proof follows a strategy similar to that of Proposition 8 and uses similar notations. Only the second and fourth step changes, as shown below.
Changes in the second step.
First, let us notice that using minibatches allows us to improve Inequality ?? , we have \[\label{eq:LSA95minibatch95aux} \begin{align} {\mathbb{E}}\left[(I_d-\alpha h_k^B)(I_d-\alpha h_k^B)^{\top}\right] &= \frac{1}{B}{\mathbb{E}}\left[(I_d-\alpha h)(I_d-\alpha h)^{\top}\right] +\frac{B-1}{B}(I_d-\alpha H)(I_d-\alpha H^{\top}) \\ &\leq \frac{1}{B}\left(I_d-\alpha(2-\alpha\beta c_{\Sigma})S\right) +\frac{B-1}{B}\left(I_d-\alpha(2-\alpha\beta_1)S\right) \\ &= I_d-\alpha\left(2-\frac{\alpha \beta c_{\Sigma}}{B}-\frac{(B-1)\alpha\beta_1}{B}\right)S, \end{align}\tag{9}\] where we used ?? and ?? to get the second line.
This then allows us to improve Inequality 6 . More precisely, we are going to prove by induction: \[\label{eq:etaketakt95minibatch} {\mathbb{E}}\left[\eta_k\eta_k^{\top}\right] \leq \frac{\sigma^2\alpha c_{\Sigma}}{2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1)}I_d.\tag{10}\] The case \(k=0\) is straightforward. Let us assume that the inequality holds at index \(k-1\) and prove it at \(k\), \[\begin{align} {\mathbb{E}}\left[\eta_k\eta_k^{\top}\right] &= {\mathbb{E}}\left[(I_d-\alpha h^B_k)\eta_{k-1}\eta_{k-1}^{\top}(I_d-\alpha h^B_k)^{\top}\right] +\alpha^2{\mathbb{E}}\left[(h^B_ky^*-b^B_k)(h^B_ky^*-b^B_k)^{\top}\right] \\ &\leq \frac{\sigma^2\alpha c_{\Sigma}}{2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1)} {\mathbb{E}}\left[(I_d-\alpha h^B_k)(I_d-\alpha h^B_k)^{\top}\right] +\frac{\sigma^2\alpha^2}{B}\Sigma \\ &\leq \frac{\sigma^2\alpha c_{\Sigma}}{2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1)} \left(I_d-\alpha\left(2-\frac{\alpha \beta c_{\Sigma}}{B}-\frac{(B-1)\alpha\beta_1}{B}\right)S\right) +\frac{\sigma^2\alpha^2c_{\Sigma}}{B}S \\ &\leq \frac{\sigma^2\alpha c_{\Sigma}}{2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1)}I_d, \end{align}\] where we used 9 to get the third line. This concludes the induction.
Changes in the fourth step. Recall the notation \(M_{j}=I_d-(I_d-\alpha H)^{j}\). On the one hand, using Inequality ?? , we get \[\begin{align} {\mathbb{E}}\left[({\overline{\eta}}^1_k)^{\top}\Sigma{\overline{\eta}}^1_k\right] &= \frac{1}{\alpha^2 k^2} \sum_{j=0}^{k-1} {\mathbb{E}}\left[(\chi^1_{k-j})^{\top}H^{-\top} M_{j}^{\top}\Sigma M_{j} H^{-1}\chi^1_{k-j}\right] \\ &= \frac{1}{k^2} \sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h^B_{k-j}y^*-b^B_{k-j})(h^B_{k-j}y^*-b^B_{k-j})^{\top})\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\sigma^2}{Bk}{\mathcal{S}}_k \end{align}\] On the other hand, using similar arguments as in the proof of Proposition 8, we have \[\begin{align} \sum_{r=2}^k {\mathbb{E}}\left[({\overline{\eta}}^r_k)^{\top}\Sigma{\overline{\eta}}^r_k\right] &= \frac{1}{\alpha^2 k^2} \sum_{r=2}^k \sum_{j=0}^{k-1} {\mathbb{E}}\left[(\chi^r_{k-j})^{\top}H^{-\top} M_{j}^{\top}\Sigma M_{j} H^{-1}\chi^r_{k-j}\right] \\ &= \frac{1}{k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h^B_{k-j}-H) {\mathbb{E}}\left[\eta_{k-j-1}(\eta_{k-j-1})^{\top}\right] (h^B_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\sigma^2\alpha c_{\Sigma}}{(2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1))k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h^B_{k-j}-H)(h^B_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\sigma^2\alpha\beta c_{\Sigma}}{B(2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1))k} {\mathcal{S}}_k, \end{align}\] where we used Inequality 10 to obtain the third line, and the first inequality of Assumption [hypo:ineq95LSA] to obtain the last one. The latter two chains of inequalities and Equality 8 imply \[\begin{align} {\mathbb{E}}\left[{\overline{\eta}}_k^{\top}\Sigma{\overline{\eta}}_k\right] &= \sum_{r=1}^k {\mathbb{E}}\left[({\overline{\eta}}^r_k)^{\top}\Sigma{\overline{\eta}}^r_k\right] \\ &\leq \frac{\sigma^2}{Bk}{\mathcal{S}}_k +\frac{\sigma^2\alpha\beta c_{\Sigma}}{B(2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1))k}{\mathcal{S}}_k \\ &= \frac{\sigma^2(2B-(B-1)\alpha\beta_1)}{B(2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1))k}{\mathcal{S}}_k \\ &\leq \frac{2\sigma^2}{(2B-\alpha(\beta c_{\Sigma}+(B-1)\beta_1))k}{\mathcal{S}}_k. \end{align}\] From there, we conclude with similar arguments as in the proof of Proposition 8. ◻
Here, we present two extensions of Theorem 9. The first one, Theorem 14, allows for learning steps up to \(\alpha<\frac{2}{c_{\Sigma}\beta}\) and keep a \(O\left(\frac{1}{k}+\frac{1}{k^2\mu}\right)\) like Theorem 9.
The second extension is Theorem 15 below that holds for \(\alpha<\frac{2}{\beta_1}\), but admits a slower convergence rate of \(O\left(\frac{1}{k\mu}\right)\). Still this rate remains better than any existing rate on LSA with similar assumptions prior to this work.
Theorem 14. Assume [hypo:SPD], [hypo:iid95LSA] and [hypo:ineq95LSA] without the third inequality. For \(0<\alpha<\frac{2}{\beta c_{\Sigma}}\), we have \[{\mathbb{E}}\left[({\overline{y}}_k^{\top}-y^*)^{\top}\Sigma({\overline{y}}_k-y^*)\right] \leq \frac{c_{\Sigma}|y_0-y^*|^2}{(2-\alpha\beta c_k)\alpha k} +\left(\left(\frac{\beta|y_0-y^*|^2}{k}\right)^{\frac{1}{2}} +\left(\frac{2\sigma^2}{(2-\alpha\beta c_{\Sigma})k}\right)^{\frac{1}{2}}\right)^2 \left(3+\frac{1}{\alpha(2-\alpha\beta c_{\Sigma})\mu k}\right).\]
Theorem 15. Assume [hypo:SPD]-[hypo:ineq95LSA]. Define \({\widetilde{\sigma}}^2={\mathbb{E}}[|h_ky^*-b_k|^2]\). For \(0<\alpha<\frac{2}{\beta_1}\), we have \[{\mathbb{E}}\left[({\overline{y}}_k^{\top}-y^*)^{\top}\Sigma({\overline{y}}_k-y^*)\right] \leq \frac{2c_{\Sigma}|y_0-y^*|^2}{\alpha(2-\alpha\beta_1) k} +\frac{2c_{\Sigma}^2d}{k}\left(\sigma^2 +\frac{\alpha\beta{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu }\right) \left(3+\frac{1}{\alpha(2-\alpha\beta_1)\mu k}\right).\]
The following proposition is an extension of Proposition 8 to learning rates up to \(\alpha<\frac{2}{\beta c_{\Sigma}}\).
****Proposition** 16**. Under Assumptions [hypo:SPD]-[hypo:ineq95LSA] without the third inequality, for \(0<\alpha<\frac{2}{c_{\Sigma}\beta}\), we have \[{\mathbb{E}}\left[({\overline{y}}_k^{\top}-y^*)^{\top}\Sigma({\overline{y}}_k-y^*)\right] \leq \frac{c_{\Sigma}|y_0-y^*|^2}{(2-\alpha\beta c_{\Sigma})\alpha k} +\left(\left(\frac{\beta|y_0-y^*|^2}{k}\right)^{\frac{1}{2}} +\left(\frac{2\sigma^2}{(2-\alpha\beta c_{\Sigma})k}\right)^{\frac{1}{2}}\right)^2 {\mathcal{S}}_k.\] where \({\mathcal{S}}_k\) is defined as in Proposition 8.
Proof of Proposition 16. The three last point of the proof of Proposition 8 holds when removing the third inequality in [hypo:ineq95LSA]. Therefore, to prove Proposition 16, it is sufficient to prove that \[{\mathbb{E}}\left[{\overline{w}}_k^{\top} \Sigma{\overline{w}}_k\right] \leq \frac{c_{\Sigma}|y_0-y^*|^2}{(2-\alpha\beta c_{\Sigma})\alpha k} +\frac{\beta|y_0-y^*|^2}{k}{\mathcal{S}}_k.\] Similarly as in the third step of the proof of Proposition 8, we define \((w^r_k)_{k,r\geq0}\) such that \(w_k=\sum_{r=0}^kw_k^r\) and, for \(r\geq0\) and \(k\geq1\), \[\begin{align} w^r_k &= (I_d-\alpha H)w^r_{k-1} +\chi_k^r\text{ with }w^r_{0} = w_0\mathbb{1}_{\{r=0\}}, \\ \chi_k^{r} &= -\alpha(h_k-H)\eta^{r-1}_{k-1}\mathbb{1}_{\{r\neq 0\}}. \end{align}\]
First step: getting a bound on \(({\overline{w}}^0_k)^{\top}S{\overline{w}}^0_k\).
Take \({\widetilde{\alpha}}=\frac{2}{\beta c_{\Sigma}}\), ?? implies that \((I_d-{\widetilde{\alpha}}H)(I_d-{\widetilde{\alpha}}H)^{\top}\leq I_d\). This implies that the operator norm of \((I_d-{\widetilde{\alpha}}H)\) is upper bounded by one and that \[(I_d-{\widetilde{\alpha}}H)^{\top}(I_d-{\widetilde{\alpha}}H)\leq I_d.\] This then implies \[\begin{align} (I_d-\alpha H)^{\top}(I_d-\alpha H) &= \frac{\alpha^2}{{\widetilde{\alpha}}^2} (I_d-{\widetilde{\alpha}}H)^{\top}(I_d-{\widetilde{\alpha}}H) +\left(1-\frac{\alpha^2}{{\widetilde{\alpha}}^2}\right)I_d -2\left(\alpha -\frac{\alpha^2}{{\widetilde{\alpha}}}\right)S \\ &\leq I_d-\alpha(2-\alpha\beta c_{\Sigma})S. \end{align}\] As a consequence, for \(k\geq1\), we obtain \[\begin{align} |w^0_k|^2 &= (w^0_{k-1})^{\top} (I_d-\alpha H)^{\top}(I_d-\alpha H) w^0_{k-1} \\ &\leq |w^0_{k-1}|^2 -\alpha(2-\alpha\beta c_{\Sigma}) (w^0_{k-1})^{\top}Sw^0_{k-1} \end{align}\] Taking the sum from \(1\) to \(k\) in the latter inequality and using that \(u\mapsto u^{\top}Su\) is convex, we obtain \[({\overline{w}}^0_k)^{\top} S{\overline{w}}_k^0 \leq \frac{1}{k}\sum_{i=0}^{k-1}(w_i^0)^{\top} Sw_i^0 \leq \frac{1}{\alpha k}\sum_{i=1}^{k} \left(|w^0_{k-1}|^2 -|w^0_k|^2\right) \leq \frac{|w_0|^2}{\alpha(2-\alpha\beta c_{\Sigma}) k}.\] This and \(\Sigma\leq c_{\Sigma}S\) yield \[({\overline{w}}^0_k)^{\top} \Sigma{\overline{w}}_k^0 \leq \frac{c_{\Sigma}|w_0|^2}{\alpha(2-\alpha\beta c_{\Sigma}) k}.\]
Second step: getting the bound on the bias term.
Then, using similar arguments as in the third step of the proof of Proposition 8, we have \[\begin{align} \sum_{r=1}^k {\mathbb{E}}\left[({\overline{w}}^r_k)^{\top}\Sigma{\overline{w}}^r_k\right] &= \frac{1}{k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}-H) {\mathbb{E}}\left[w_{k-j-1}(w_{k-j-1})^{\top}\right] (h_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{|y_0-y^*|^2}{k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}-H) (h_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\beta|y_0-y^*|^2}{k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} \Sigma H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &= \frac{\beta|y_0-y^*|^2}{k}{\mathcal{S}}_k. \end{align}\] In the end, we obtain \[{\mathbb{E}}\left[{\overline{w}}_k^{\top}\Sigma{\overline{w}}_k\right] = \sum_{r=0}^k {\mathbb{E}}\left[({\overline{w}}^r_k)^{\top}\Sigma{\overline{w}}^r_k\right] \leq \frac{c_{\Sigma}|w_0|^2}{\alpha(2-\alpha\beta c_{\Sigma}) k} +\frac{\beta|y_0-y^*|^2}{k}{\mathcal{S}}_k.\]
Third step: deal with the cross term and conclude.
We have \[{\mathbb{E}}\left[{\overline{z}}_k^{\top}\Sigma{\overline{z}}_k\right] = {\mathbb{E}}\left[{\overline{w}}_k^{\top}\Sigma{\overline{w}}_k\right] +{\mathbb{E}}\left[{\overline{\eta}}_k^{\top}\Sigma{\overline{\eta}}_k\right] +2{\mathbb{E}}\left[{\overline{w}}_k^{\top}\Sigma{\overline{\eta}}_k\right],\] where the last term is the cross term and satisfies \[\begin{align} {\mathbb{E}}\left[{\overline{w}}_k^{\top}\Sigma{\overline{\eta}}_k\right] &= {\mathbb{E}}\left[\left(\sum_{r=0}^k{\overline{w}}^r_k\right)^{\top} \Sigma\left(\sum_{r=1}^k{\overline{\eta}}^r_k\right)\right] \\ &= {\mathbb{E}}\left[\left(\sum_{r=1}^k{\overline{w}}^r_k\right)^{\top} \Sigma\left(\sum_{r=1}^k{\overline{\eta}}^r_k\right)\right] \\ &= {\mathbb{E}}\left[\left(\sum_{r=1}^k{\overline{w}}^r_k\right)^{\top} \Sigma\left(\sum_{r=1}^k{\overline{w}}^r_k\right)\right]^{\frac{1}{2}} {\mathbb{E}}\left[\left(\sum_{r=1}^k{\overline{\eta}}^r_k\right)^{\top} \Sigma\left(\sum_{r=1}^k{\overline{\eta}}^r_k\right)\right]^{\frac{1}{2}} \\ &\leq \left(\frac{\beta|y_0-y^*|^2}{k}{\mathcal{S}}_k\right)^{\frac{1}{2}} \left(\frac{2\sigma^2{\mathcal{S}}_k}{(2-\alpha\beta c_{\Sigma})k}\right)^{\frac{1}{2}}. \end{align}\] The above inequalities imply the upper bound in Proposition 16. ◻
****Proposition** 17**. Under Assumptions [hypo:SPD]-[hypo:ineq95LSA], with \({\widetilde{\sigma}}^2={\mathbb{E}}[|h_ky^*-b_k|^2]\), for \(0<\alpha<\frac{2}{\beta_1}\), we have \[{\mathbb{E}}\left[({\overline{y}}_k^{\top}-y^*)^{\top}\Sigma({\overline{y}}_k-y^*)\right] \leq \frac{2c_{\Sigma}|y_0-y^*|^2}{\alpha(2-\alpha\beta_1) k} +\frac{2}{k}\left(\sigma^2 +\frac{\alpha\beta{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu }\right){\mathcal{S}}_k\]
Proof of Proposition 17. Let us use \(z_k=y_k-y^*\) and the decomposition \(z_k=w_k+\eta_k\), similarly as defined in the proof of Proposition 8.
Repeating the first step of the proof of Proposition 8, we obtain \[{\mathbb{E}}\left[{\overline{w}}_k^{\top} \Sigma{\overline{w}}_k\right] \leq \frac{c_{\Sigma}|w_0|^2}{\alpha(2-\alpha\beta_1) k}.\] Therefore, using inequality \({\mathbb{E}}\left[{\overline{z}}_k^{\top} \Sigma{\overline{z}}_k\right] \leq 2{\mathbb{E}}\left[{\overline{w}}_k^{\top} \Sigma{\overline{w}}_k\right] +2{\mathbb{E}}\left[{\overline{\eta}}_k^{\top}\Sigma{\overline{\eta}}_k\right]\), to conclude it only remains to prove that \[{\mathbb{E}}\left[{\overline{\eta}}_k^{\top}\Sigma{\overline{\eta}}_k\right] \leq \frac{1}{k} \left(\sigma^2 +\frac{\alpha\beta{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu }\right) {\mathcal{S}}_k.\]
First step: getting an upper bound on \({\mathbb{E}}[|\eta_k|^2]\)
Recall that, using a straightforward induction, we have \({\mathbb{E}}[\eta_k]=0\) for \(k\geq0\). We will now prove that \[\label{eq:etak942} {\mathbb{E}}\left[|\eta_k|^2\right] \leq \frac{\alpha{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu}.\tag{11}\] For \(k=0\), the result holds since \(\eta_0=0\). Then, for \(k\geq1\), we assume that it holds for index \(k-1\). Since \(\eta_{k-1}\) and \((h_k,b_k)\) are independent, we obtain \[{\mathbb{E}}\left[\eta_{k-1}^{\top}(I_d-\alpha h_k)^{\top}(h_ky^*-b_k)\right] = {\mathbb{E}}\left[\eta_{k-1}^{\top}\right]{\mathbb{E}}\left[(I_d-\alpha h_k)^{\top}(h_ky^*-b_k)\right] = 0.\] This and inequality ?? imply that \[\begin{align} {\mathbb{E}}\left[|\eta_k|^2\right] &= {\mathbb{E}}\left[|(I_d-\alpha h_k)\eta_{k-1}|^2\right] +\alpha^2 {\mathbb{E}}\left[|h_ky^*-b_k|^2\right] \\ &\leq {\mathbb{E}}\left[\eta_{k-1}^{\top}(I_d-\alpha(2-\alpha\beta_1)S)\eta_{k-1}\right] +\alpha^2{\widetilde{\sigma}}^2 \\ &\leq (1-\alpha(2-\alpha\beta_1)\mu) {\mathbb{E}}\left[|\eta_{k-1}|^2\right] +\alpha^2{\widetilde{\sigma}}^2 \\ &\leq \frac{\alpha{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu}, \end{align}\] which concludes the induction.
Second step: obtaining the convergence rate.
Let us use the same decomposition \(\eta_k=\sum_{r=1}^k\eta_k^r\) as introduced in the proof of Proposition 8. Similarly as in the third step of the latter proof, we get \[{\mathbb{E}}\left[({\overline{\eta}}^1_k)^{\top}\Sigma{\overline{\eta}}^1_k\right] \leq \frac{\sigma^2}{k^2} \sum_{j=1}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1}\Sigma H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) = \frac{\sigma^2}{k}{\mathcal{S}}_k,\] and \[\begin{align} \sum_{r=2}^k {\mathbb{E}}\left[({\overline{\eta}}^r_k)^{\top}\Sigma{\overline{\eta}}^r_k\right] &= \frac{1}{k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}-H) {\mathbb{E}}\left[\eta_{k-j-1}(\eta_{k-j-1})^{\top}\right] (h_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\alpha{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j}H^{-1} {\mathbb{E}}\left[(h_{k-j}-H)(h_{k-j}-H)^{\top}\right] H^{-\top}M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &\leq \frac{\alpha\beta{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu k^2} \sum_{j=0}^{k-1} {\rm tr}\left( \Sigma^{\frac{1}{2}}M_{j} H^{-1}\Sigma H^{-\top} M_{j}^{\top}\Sigma^{\frac{1}{2}}\right) \\ &= \frac{\alpha\beta{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu k}{\mathcal{S}}_k, \end{align}\] where we used \({\mathbb{E}}\left[\eta_{j}(\eta_{j})^{\top}\right]\leq {\mathbb{E}}\left[|\eta_{j}|^2\right]I_d \leq \frac{\alpha{\widetilde{\sigma}}^2}{(2-\alpha\beta_1)\mu k^2}I_d\) to get the second line, and the first inequality of Assumption [hypo:ineq95LSA] for the third line. This concludes the proof. ◻
Lemma 3. Under assumptions [hypo:SPD]-[hypo:ineq95LSA], for \(\alpha\leq \frac{2}{\beta c_{\Sigma}}\), we have \[\begin{align} \label{eq:bound95Id-aaH} (I_d-\alpha H)(I_d-\alpha H)^{\top} &\leq {\mathbb{E}}\left[(I_d-\alpha h)(I_d-\alpha h)^{\top}\right] \leq I_d-\alpha(2-\alpha\beta c_{\Sigma}) S, \end{align}\qquad{(1)}\] Moreover, for \(\alpha< \frac{2}{\beta_1}\), we get \[\begin{align} \label{eq:bound95Id-aaHtop} (I_d-\alpha H)^{\top}(I_d-\alpha H) &\leq {\mathbb{E}}\left[(I_d-\alpha h)^{\top}(I_d-\alpha h)\right] \leq I_d-\alpha(2-\alpha\beta_1) S, \\ \label{eq:bound95Id-aaH2} (I_d-\alpha H)(I_d-\alpha H)^{\top} &\leq I_d-\alpha(2-\alpha\beta_1) S, \\ \label{eq:bound95sum95sym} \sum_{i=0}^{k-1} (I_d-\alpha H^{\top})^iS(I_d-\alpha H)^i &\leq \frac{1}{\alpha(2-\alpha\beta_1)}I_d. \end{align}\] {#eq: sublabel=eq:eq:bound95Id-aaHtop,eq:eq:bound95Id-aaH2,eq:eq:bound95sum95sym}
Proof. The first inequality in ?? is straightforward. Then, we have, \[{\mathbb{E}}\left[(I_d-\alpha h)(I_d-\alpha h)^{\top}\right] = I_d-2\alpha S+\alpha^2{\mathbb{E}}[hh^{\top}] \leq I_d-\alpha(2-\alpha\beta c_{\Sigma}) S,\] using \({\mathbb{E}}[hh^{\top}]\leq \beta \Sigma\leq \beta c_{\Sigma} S\). Inequality ?? can be proved with a similar computation.
In particular, the operator norm of \(I_d-\frac{2}{\beta_1} H\) is bounded by one, so is the one of \(I_d-\frac{2}{\beta_1} H^{\top}\), i.e., \[\left(I_d-\frac{2}{\beta_1} H\right) \left(I_d-\frac{2}{\beta_1} H\right)^{\top} \leq I_d.\] This allows us to prove ?? as follows, for \(\alpha\leq \frac{2}{\beta_1}\), \[\begin{align} (I_d-\alpha H)(I_d-\alpha H)^{\top} &= I_d-2\alpha S+\alpha^2HH^{\top} \\ &= \frac{\alpha^2\beta_1^2}{4} \left(I_d-\frac{2}{\beta_1}H\right) \left(I_d-\frac{2}{\beta_1}H\right)^{\top} +\left(1- \frac{\alpha^2\beta_1^2}{4}\right)I_d -2\left(\alpha-\alpha^2\beta_1\right)S \\ &\leq I_d +\left(1- \frac{\alpha^2\beta_1^2}{4}\right)I_d -\left(2\alpha-\alpha^2\beta_1\right)S \\ &= I_d-\alpha (2-\alpha\beta_1)S. \end{align}\]
Then, using the notation \(N_i=(I_d-\alpha H)^i\), we have \[\begin{align} I_d \geq I_d-N_k^{\top}N_k &= \sum_{i=0}^{k-1} N_i^{\top}N_i -N_{i+1}^{\top}N_{i+1} \\ &= \sum_{i=0}^{k-1} N_i^{\top}N_i -N_i^{\top}(I_d-\alpha H^{\top}) (I_d-\alpha H)N_i \\ &= \sum_{i=0}^{k-1} N_i^{\top}(I_d-(I_d-\alpha H^{\top})(I_d-\alpha H))N_i \\ &= \sum_{i=0}^{k-1} N_i^{\top}(2\alpha S-\alpha^2H^{\top}H)N_i \\ &\geq \alpha(2-\alpha\beta_1)\sum_{i=0}^{k-1}N_i^{\top}SN_i, \end{align}\] where we used \(\alpha H^{\top}H\leq (2-\alpha\beta_1)S\) to get the last line. ◻
Lemma 4 (Heinz’s inequality). Let \(H\in \mathbb{R}^{d\times d}\) be such that \(S:=\frac{H+H^{\top}}{2}>0\), then \(H^{-1}+H^{-\top}\) is positive definite and \(H^{-1}+H^{-\top}\leq 2S^{-1}\). Moreover, we have \({\rm tr}(SH^{-\top})\leq d\).
Proof. First, let us prove that \(H^{-1}+H^{-\top}\) is positive definite. Take \(x\in \mathbb{R}^d\backslash\{0\}\), define \(y=H^{-1}x\) we have \[x^{\top}(H^{-1}+H^{-\top})x = 2x^{\top}H^{-\top}x = 2y^{\top}Hy = y^{\top}(H+H^{\top})y >0.\] Then, let us prove that \({\rm tr}(SH^{-\top}) \leq d\) is a consequence of \(H^{-1}+H^{-\top}\leq 2S^{-1}\): \[{\rm tr}(SH^{-\top}) = \frac{1}{2}{\rm tr}(S^{\frac{1}{2}}(H^{-1}+H^{-\top})S^{\frac{1}{2}}) \leq {\rm tr}(S^{\frac{1}{2}}S^{-1}S^{\frac{1}{2}}) = d.\] Now, observe that \[\begin{align} \left(S^{\frac{1}{2}}(H^{-1}+H^{-\top})S^{\frac{1}{2}}\right)^2 &= 2S^{\frac{1}{2}}H^{-1}SH^{-\top}S^{\frac{1}{2}} +2S^{\frac{1}{2}}H^{-\top}SH^{-1}S^{\frac{1}{2}} \\ & -\left(S^{\frac{1}{2}}(H^{-1}-H^{-\top})S^{\frac{1}{2}}\right)\left(S^{\frac{1}{2}}(H^{-1}-H^{-\top})S^{\frac{1}{2}}\right)^{\top} \\ &\leq 2S^{\frac{1}{2}}H^{-1}SH^{-\top}S^{\frac{1}{2}} +2S^{\frac{1}{2}}H^{-\top}SH^{-1}S^{\frac{1}{2}}. \end{align}\] Therefore, to conclude, it is sufficient to prove \(S^{\frac{1}{2}}H^{-1}SH^{-\top}S^{\frac{1}{2}}\leq I_d\) and \(S^{\frac{1}{2}}H^{-1}SH^{-\top}S^{\frac{1}{2}}\leq I_d\). For the former inequality, invert the matrix and use the notation \(A=\frac{H-H^{\top}}{2}\), we get \[\begin{align} (S^{\frac{1}{2}}H^{-1}SH^{-\top}S^{\frac{1}{2}})^{-1} &= S^{-\frac{1}{2}}H^{\top}S^{-1}HS^{-\frac{1}{2}} \\ &= S^{-\frac{1}{2}}(S-A)S^{-1}(S+A)S^{-\frac{1}{2}} \\ &= I_d-S^{-\frac{1}{2}}AS^{-1}AS^{-\frac{1}{2}} \\ &= I_d+\left(S^{-\frac{1}{2}}AS^{-\frac{1}{2}}\right)\left(S^{-\frac{1}{2}}AS^{-\frac{1}{2}}\right)^{\top} \\ &\geq I_d, \end{align}\] which, indeed, implies \(S^{\frac{1}{2}}H^{-1}SH^{-\top}S^{\frac{1}{2}}\leq I_d\). Then, applying the later inequality to \({\widetilde{H}}=H^{\top}\), we obtain \(S^{\frac{1}{2}}H^{-1}SH^{-\top}S^{\frac{1}{2}}\leq I_d\). This concludes the proof. ◻
Proof. Fix \(k\geq2\) and take \(c_k\in(0,1)\) such that \(c_k^2=1-\frac{1}{k}\). In particular, observe that \[c_k^{-2(k-1)}=\left(\frac{k}{k-1}\right)^{k-1}=\left(1+\frac{1}{k-1}\right)^{k-1}\leq e.\] Recall that \(Q\) is defined by \[Q=I_d-\alpha\Sigma_0^{\frac{1}{2}}H\Sigma_0^{-\frac{1}{2}} = I_d-\alpha \Sigma_0(I_d-\gamma U),\] and \({\mathcal{S}}_k\) satisfies \[\label{eq:aux95cSk} {\mathcal{S}}_k = {\rm tr}\left( \frac{1}{k}\sum_{\ell=0}^{k-1} (I_d-\gamma U)^{-\top} (I_d-Q^{\ell})^{\top}(I_d-Q^{\ell}) (I_d-\gamma U)^{-1} \right).\tag{12}\] Define \({\widetilde{Q}}=c_kQ\), we have \[c_k^{2(k-1)} \sum_{\ell=0}^{k-1} (I_d-Q^{\ell\top})(I_d-Q^{\ell}) \leq \sum_{\ell=0}^{k-1} c_k^{2\ell} (I_d-Q^{\ell\top})(I_d-Q^{\ell})\] Then, Lemma 6 yields \[\begin{align} \sum_{\ell=0}^{k-1} (I_d-Q^{\ell\top})&(I_d-Q^{\ell}) \\ &\leq \frac{1}{2i\pi c_k^{2(k-1)}} \int_{|z|=1} {\overline{z}}\left(({\overline{z}}-c_k)^{-1}I_d-({\overline{z}}I_d-{\widetilde{Q}})^{-\top}\right) \left((z-c_k)^{-1}I_d-(z I_d-{\widetilde{Q}})^{-1}\right)dz \\ &= \frac{1}{2\pi c_k^{2(k-1)}} \int_{-\pi}^{\pi} \left((e^{-i\psi}-c_k)^{-1}I_d -(e^{-i\psi} I_d-{\widetilde{Q}})^{-\top}\right) \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi} I_d-{\widetilde{Q}})^{-1}\right)d\psi \\ &\leq \frac{e}{2\pi} \int_{-\pi}^{\pi} \left((e^{-i\psi}-c_k)^{-1}I_d -(e^{-i\psi} I_d-{\widetilde{Q}})^{-\top}\right) \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi} I_d-{\widetilde{Q}})^{-1}\right)d\psi \end{align}\] In the following, we will use both the notation \(z\) or \(e^{i\psi}\), depending on the situation. This and 12 imply the following upper bound on \({\mathcal{S}}_k\) \[\label{eq:bound95cS} {\mathcal{S}}_k \leq \frac{e}{2\pi k} \int_{-\pi}^{\pi} {\left\| \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi}I_d-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{F}^{2}}d\psi.\tag{13}\] We are going to separate the latter integral into three parts corresponding to:
\({\mathcal{R}}(z)\geq1-(1-\gamma)^2\), i.e., \(|\psi|\leq\psi_{\gamma}\)
\(|{\mathcal{R}}(z)|<1-(1-\gamma)^2\), i.e., \(\psi_{\gamma}<|\psi|<\pi-\psi_{\gamma}\)
\({\mathcal{R}}(z)\leq-1+(1-\gamma)^2\), i.e., \(|\psi|\geq\pi-\psi_{\gamma}\)
where \(\mathcal{R}(z)\) is the real part of \(z\) and \(\psi_{\gamma}\) is defined by \(\psi_{\gamma}=\arccos(1-(1-\gamma)^2)\).
First step: dealing with case [case:1].
Observe that \[\begin{align} z-{\widetilde{Q}} &= (z-c_k)I_d+c_k\alpha\Sigma_0(I_d-\gamma U) \\ &= (z-c_k)\left(I_d+\frac{c_k\alpha}{|z-c_k|}\frac{{\overline{z}}-c_k}{|z-c_k|}\Sigma_0(I_d-\gamma U)\right) \\ &= (z-c_k)\left(I_d+{\widetilde{z}}\Sigma(I_d-\gamma U)\right), \end{align}\] with \({\widetilde{z}}=\frac{{\overline{z}}-c_k}{|z-c_k|}\) and \(\Sigma=\frac{c_k\alpha}{|z-c_k|}\Sigma_0\). Using Lemma 5, for any \(x\in \mathbb{C}^d\), we have \[\begin{align} \left|\left((z-c_k)^{-1}I_d-(z-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1}x\right| &= |z-c_k|^{-1}\left|\left(I_d-(I_d+{\widetilde{z}}\Sigma(I_d-\gamma U))^{-1}\right) (I_d-\gamma U)^{-1}x\right| \\ &\leq \frac{2}{1-\gamma^2}|z-c_k|^{-1}, \end{align}\] which holds only if \(-{\mathcal{R}}({\widetilde{z}})=-{\mathcal{R}}(\frac{{\overline{z}}-c_k}{|z-c_k|})\leq\frac{1-\gamma}{\sqrt2}\), that we prove as follows, \[\begin{align} -{\mathcal{R}}\left(\frac{{\overline{z}}-c_k}{|z-c_k|}\right) = \frac{c_k-{\mathcal{R}}(z)}{\sqrt{(c_k-{\mathcal{R}}(z))^2+{\mathcal{I}}(z)^2}} &\leq \frac{1-{\mathcal{R}}(z)}{\sqrt{(1-{\mathcal{R}}(z))^2+{\mathcal{I}}(z)^2}} \\ &= \frac{1-{\mathcal{R}}(z)}{\sqrt{(1-{\mathcal{R}}(z))^2+1-{\mathcal{R}}(z)^2}} \\ &= \frac{1-{\mathcal{R}}(z)}{\sqrt{2-2{\mathcal{R}}(z)}} \\ &= \sqrt{\frac{1-{\mathcal{R}}(z)}{2}} \\ &\leq \sqrt{\frac{1-(1-(1-\gamma)^2)}{2}} =\frac{1-\gamma}{\sqrt{2}}, \end{align}\] where the first line is due to \(u\mapsto\frac{u}{u^2+v^2}\) is non-decreasing for any \(v\in \mathbb{R}\), and the last one comes from \({\mathcal{R}}(z)\geq 1-(1-\gamma)^2\). Let us integrate for \(\psi\in[-\psi_{\gamma},\psi_{\gamma}]\) and use \(\|\cdot\|^2_F\leq d\|\cdot\|^2_{\rm op}\), \[\begin{align} \frac{e}{2\pi} \int_{-\psi_{\gamma}}^{\psi_{\gamma}} {\left\| \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi}I_d-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{F}^{2}}d\psi &\leq \frac{e}{2\pi} \int_{-\psi_k}^{\psi_k} {\left\| \frac{4I_d}{(1-\gamma^2)^2|e^{i\psi}-c_k|^2} \right\|_{F}^{2}}\,d\psi \\ &\leq \frac{2de}{\pi(1-\gamma^2)^2} \int_{-\pi}^{\pi} \frac{1}{|e^{i\psi}-c_k|^2}d\psi \\ &\leq \frac{4de}{(1-\gamma^2)^2(1-c_k^2)} \\ &= \frac{kde}{(1-\gamma)^2}\frac{4}{(1+\gamma)^2} \\ &\leq \frac{kde}{(1-\gamma)^2}(4-3\gamma), \end{align}\] where the third line is obtained using the residue Theorem, and the last line uses \(\frac{4}{(1+\gamma)^2}\leq 4-3\gamma\). This concludes the case [case:1].
Second step: dealing with case [case:2].
For cases [case:2] and [case:3], we will use the following inequalities \[\label{eq:case23} \begin{align} {\left\| \left((z-c_k)^{-1}I_d-(z-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{F}^{}} &\leq {\left\| (z-c_k)^{-1}I_d-(z-{\widetilde{Q}})^{-1} \right\|_{F}^{}} {\left\| (I_d-\gamma U)^{-1} \right\|_{\rm op}^{}} \\ &\leq \frac{\sqrt{d}}{1-\gamma} {\left\| (z-c_k)^{-1}I_d-(z-{\widetilde{Q}})^{-1} \right\|_{{\rm op}}^{}} \\ &\leq \frac{\sqrt{d}}{1-\gamma} \left(|z-c_k|^{-1} +{\left\| (z-{\widetilde{Q}})^{-1} \right\|_{{\rm op}}^{}}\right), \end{align}\tag{14}\] where \({\left\| \cdot \right\|_{{\rm op}, \mathbb{R}^d}^{}}\) is the operator norm restricted to vectors on \(\mathbb{R}^d\). Define \(Q_R:={\mathcal{R}}(z)-{\widetilde{Q}}={\mathcal{R}}(z)-c_k+\alpha c_k\Sigma_0(I_d-\gamma U)\), so that \(z-{\widetilde{Q}}=Q_R+i{\mathcal{I}}(z)\). Take \(x\in \mathbb{R}^d\) and \(y_1+iy_2=y=(z-{\widetilde{Q}})^{-1}x\), we have \[\mathbb{R}^d\ni x = (z-{\widetilde{Q}})y = (Q_R+i{\mathcal{I}}(z))(y_1+iy_2) = Q_Ry_1-{\mathcal{I}}(z)y_2+i(Q_Ry_2+{\mathcal{I}}(z)y_1),\] which implies \(Q_Ry_2=-{\mathcal{I}}(z)y_1\), so that we obtain \[\label{eq:aux95case2} \begin{align} |(z-{\widetilde{Q}})y|^2 &= (y_1-iy_2)^{\top}(Q_R^{\top}-i{\mathcal{I}}(z))(Q_R+i{\mathcal{I}}(z))(y_1+iy_2) \\ &= |Q_Ry_1|^2 +|Q_Ry_2|^2 +{\mathcal{I}}(z)^2|y|^2 -2{\mathcal{I}}(z)y_1^{\top}(Q_R^{\top}-Q_R)y_2 \\ &= |Q_Ry_1|^2 +{\mathcal{I}}(z)^2(2|y_1|^2+|y_2|^2) -2\alpha c_k\gamma{\mathcal{I}}(z)y_1^{\top}(\Sigma_0U-U^{\top}\Sigma_0)y_2 \\ &\geq {\mathcal{I}}(z)^2(2|y_1|^2+|y_2|^2) -\frac{8\gamma{\mathcal{I}}(z)^2}{(1+\gamma)^2}|y_1||y_2| \\ &\geq {\mathcal{I}}(z)^2(2|y_1|^2+|y_2|^2) -2{\mathcal{I}}(z)^2|y_1||y_2| \\ &\geq {\mathcal{I}}(z)^2(2|y_1|^2+|y_2|^2) -{\mathcal{I}}(z)^2\left(\frac{3}{2}|y_1|^2+\frac{2}{3}|y_2|^2\right) \\ &= {\mathcal{I}}(z)^2\left(\frac{1}{2}|y_1|^2+\frac{1}{3}|y_2|^2\right) \geq \frac{{\mathcal{I}}(z)^2}{3}|y|^2 \end{align}\tag{15}\] where we used \(|Q_Ry_2|^2={\mathcal{I}}(z)^2|y_1|^2\) and \(Q_R^{\top}-Q_R=\alpha c_k\gamma(\Sigma_0U-U^{\top}\Sigma_0)\) to get the third line; \(|{\mathcal{I}}(z)|\geq\sqrt{1-(1-(1-\gamma)^2)^2}\geq\sqrt{1-(1-(1-\gamma)^2)}=1-\gamma\), \(\alpha<\frac{2(1-\gamma)}{(1+\gamma)^2}\leq \frac{2|I(z)|}{(1+\gamma)^2}\), \(c_k\leq1\), \(\|\Sigma_0U\|_{\rm op}\leq\|\Sigma_0\|_{\rm op}\|U\|_{\rm op}\leq1\) to obtain the fourth line; \(4\gamma\leq(1+\gamma)^2\) to get the fifth line; and the Young’s inequality \(2|y_1||y_2|\leq\frac{3}{2}|y_1|^2+\frac{2}{3}|y_2|^2\) to obtain the last one. This implies \[{\left\| (z-{\widetilde{Q}})^{-1} \right\|_{\rm op}^{}} \leq \sqrt{\frac{3}{{\mathcal{I}}(z)^2}} = \frac{\sqrt{3}}{|\sin(\psi)|}\] for \(z=e^{i\psi}\) such that \(|{\mathcal{R}}(z)|\leq\gamma(2-\gamma)\). Similarly, we have \(|z-c_k|^{-1}\leq \frac{1}{|\sin(\psi)|}\). Then using the above computations and \((\sqrt3+1)^2\leq 8\) we obtain \[\begin{align} &\frac{e}{2\pi} \int_{|\psi|\in(\psi_{\gamma},\pi-\psi_{\gamma})} {\left\| \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi}I_d-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{F}^{2}}d\psi \\ &\leq \frac{8de}{\pi(1-\gamma)^2} \int_{\psi_{\gamma}}^{\pi-\psi_{\gamma}} \frac{1}{\sin(\psi)^2} d\psi \\ &\leq \frac{8de}{\pi(1-\gamma)^2} \bigl[-{\rm cotan}(\psi)\bigr]_{\psi_{\gamma}}^{\pi-\psi_{\gamma}} \\ &= \frac{16de}{\pi(1-\gamma)^2} {\rm cotan}(\psi_{\gamma}) \\ &= \frac{16de}{\pi(1-\gamma)^2} \frac{\gamma(2-\gamma)}{\sqrt{1-\gamma^2(2-\gamma)^2}} \\ &\leq \frac{16de}{\pi(1-\gamma)^2} \frac{1+(1-\gamma)}{\sqrt{(1-\gamma)^2(1+2\gamma-\gamma^2)}}\gamma \\ &\leq \frac{16de}{\sqrt{2}\pi(1-\gamma)^3} (1+(1-\gamma)) \\ &\leq \frac{4de}{(1-\gamma)^3} (1+(1-\gamma)), \end{align}\] where we used that the primitive of \(\frac{-1}{\sin^2}\) is \({\rm cotan}\), \({\rm cotan}(\arccos(a))=\frac{a}{\sqrt{1-a^2}}\) for \(a\in(0,1)\), \(\frac{\gamma}{\sqrt{1+2\gamma-\gamma^2}}\leq\frac{\gamma}{\sqrt{1+\gamma}}\leq \frac{1}{\sqrt2}\) and \(\frac{16}{\sqrt{2}\pi}\leq4\).
Third step: dealing with case [case:3].
Once again take \(x\in \mathbb{C}^d\) and \(y=(z-{\widetilde{Q}})^{-1}x\in \mathbb{C}^d\), we have \[\begin{align} |x|=|(z-{\widetilde{Q}})y| &\geq |(z-c_k+c_k\alpha\Sigma_0)y| -\alpha\gamma|\Sigma_0Uy| \\ &\geq \left(\min_{\lambda\in {\rm Sp}(\Sigma_0)} |z-c_k+c_k\alpha\lambda| -\alpha\gamma\right)|y| \\ &\geq \left(\min_{u\in[0,1]} |z-c_k+c_k\alpha u| -\alpha\gamma\right)|y| \end{align}\] Then, let us focus on the term \(|z-c_k+c_k\alpha u|\). Define \(s=1-c_k^{-1}{\mathcal{R}}(z)\in[1,1+c_k^{-1}]\), we get \[\begin{align} |z-c_k+c_k\alpha u|^2 &= ({\mathcal{R}}(z)-c_k+c_k\alpha u)^2+{\mathcal{I}}(z)^2 \\ &= c_k^2(\alpha u-s)^2+1-c_k^2(s-1)^2 \\ &= c_k^2(\alpha^2u^2-2s\alpha u+2s-1) +1 = f(u,s), \end{align}\] where \(f(u,s):= c_k^2(\alpha^2u^2+2s(1-\alpha u)-1)+1\) for \(u\in[0,1]\) and \(s\in[1,1+c_k^{-1}]\). We distinguish two cases. First, if \(\alpha u\leq1\), we have \[\min_sf(u,s) = f(u,1) = c_k^2(\alpha^2u^2+ 2(1-\alpha u)-1) +1 = c_k^2(\alpha u-1)^2+1 \geq 1,\] which implies \[|x| \geq (1-\alpha\gamma)|y| \geq \left(1-\frac{2\gamma(1-\gamma)}{(1+\gamma)^2}\right)|y| \geq \left(1-\frac{1-\gamma}{2}\right)|y| \geq \frac{|y|}{2},\] where we used the above computations, \(\alpha<\frac{2(1-\gamma)}{(1+\gamma)^2}\) and \(4\gamma\leq(1+\gamma)^2\). Second, assume \(\alpha u>1\), we have \[\begin{align} \min_sf(u,s) = f(u,1+c_k^{-1}) &= c_k^2(\alpha^2u^2+2(1+c_k^{-1})(1-\alpha u)-1)+1 \\ &= c_k^2(\alpha^2u^2 -2(1+c_k^{-1})\alpha u +2+2c_k^{-1}-1+c_k^{-2}) \\ &= c_k^2(\alpha^2u^2 -2(1+c_k^{-1})\alpha u +(1+c_k^{-1})^2) \\ &= c_k^2(\alpha u-(1+c_k^{-1}))^2 \\ &= (1-c_k(\alpha u-1))^2 \\ &\geq (1-(\alpha u-1))^2 \\ &= (2-\alpha u)^2 \geq (2-\alpha)^2, \end{align}\] where we used \(1-c_k(\alpha u-1)\geq0\), \(\alpha u-1>0\) and \(c_k\leq1\) to get the sixth line; \(\alpha<2\) and \(u\leq1\) to get the last one. This implies \[|x| \geq (2-\alpha-\gamma\alpha)|y| = (2-(1+\gamma)\alpha)|y|,\] where we have \((1+\gamma)\alpha<\frac{2(1-\gamma)}{1+\gamma}\leq 2\). In all cases, we obtain \[|(z-{\widetilde{Q}})^{-1}x| \leq \min\left(\frac{1}{2},2-(1+\gamma)\alpha\right)^{-1}|x| = \max\left(2,\frac{1}{2-(1+\gamma)\alpha}\right)|x| \leq \left(2 +\frac{1}{2-(1+\gamma)\alpha}\right)|x|\] This, 14 and \(|z-c_k|\geq\sqrt{1+c_k^2}\geq1\), since \({\mathcal{R}}(z)\leq0\), imply \[\begin{align} {\left\| \left((z-c_k)^{-1}I_d-(z-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{F}^{2}} &\leq \frac{2d}{(1-\gamma)^2} \left(|z-c_k|^{-2} +{\left\| (z-{\widetilde{Q}})^{-1} \right\|_{{\rm op}}^{2}}\right) \\ &\leq \frac{2d}{(1-\gamma)^2} \left(3 +\frac{1}{2-(1+\gamma)\alpha}\right), \end{align}\] and then \[\begin{align} \frac{e}{2\pi} \int_{|\psi|\in[\pi-\psi_{\gamma},\pi]} {\left\| \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi}I_d-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{F}^{2}}d\psi \leq \frac{2de}{(1-\gamma)^2} \left(3 +\frac{1}{2-(1+\gamma)\alpha}\right). \end{align}\]
Final step: concluding. From 13 and the three previous steps of the proof, we obtain \[\begin{align} {\mathcal{S}}_k &\leq \frac{de}{(1-\gamma)^2}(1+3(1-\gamma)) +\frac{4de}{(1-\gamma)^3k} (1+(1-\gamma)) +\frac{2de}{(1-\gamma)^2k} \left(3 +\frac{1}{2-(1+\gamma)\alpha}\right) \\ &\leq \frac{de}{(1-\gamma)^2} \left(1+ \frac{4}{k(1-\gamma)} +3(1-\gamma) +\frac{10}{k}+\frac{1}{k(1-\frac{(1+\gamma)\alpha}{2})} \right). \end{align}\] ◻
Lemma 5. Let \(\Sigma\in \mathbb{R}^{d\times d}\) be symmetric positive semi-definite, let \(U\in \mathbb{R}^{d\times d}\) be such that \({\left\| U \right\|_{\rm op}^{}}\leq1\), \(\gamma\in[0,1)\) and \(z\in \mathbb{C}\) with \(|z|=1\) and \({\mathcal{R}}(z)\geq -\frac{1-\gamma}{\sqrt{2}}\). We have, for \(x\in \mathbb{C}^d\), \[\left|\left(I_d-(I_d+z\Sigma(I_d-\gamma U))^{-1}\right) (I_d-\gamma U)^{-1}x\right| \leq \frac{2}{1-\gamma^2}|x|.\]
Proof. Define \(A=I_d-\gamma U\) and \(M=I_d+z\Sigma A\), we have \[\begin{align} \left(I_d-(I_d+z\Sigma(I_d-\gamma U))^{-1}\right) (I_d-\gamma U)^{-1} &= (I_d-M^{-1})A^{-1} \\ &= M^{-1}(M-I_d)A^{-1} \\ &= z(I_d+z\Sigma A)^{-1}\Sigma \\ &= z\Sigma(I_d+zA\Sigma)^{-1}. \end{align}\] Therefore, to conclude, it is sufficient to prove that, for an arbitrary \(x\in \mathbb{C}^d\), \[\label{eq:near95one95aux} |\Sigma(I_d+zA\Sigma)^{-1}x| = |z\Sigma(I_d+zA\Sigma)^{-1}x| \leq \frac{2}{1-\gamma^2}|x|,\tag{16}\] The remainder of the proof is dedicated to prove the latter inequality. Take \(u=(I_d+zA\Sigma)^{-1}x\) and \(r=\Sigma u\). Let us start with the subsequent observation, \[|{\overline{r}}^{\top}Ar-|r|^2| =\gamma|{\overline{r}}^{\top}Ur| \leq \gamma|r|^2,\] so that \(\frac{{\overline{r}}^{\top}Ar}{|r|^2}\) belongs to \(\overline{B}_{ \mathbb{C}}(1,\gamma)\) the closed ball of center \(1\) and radius \(\gamma\). Then, using \(x=\Sigma^{-1}r+zAr\), we have \[\begin{align} \frac{|{\overline{r}}^{\top}x|}{|r|^2} = \left| \frac{{\overline{r}}^{\top}\Sigma^{-1} r}{|r|^2} +z\frac{{\overline{r}}^{\top}A r}{|r|^2}\right| = \left| \frac{{\overline{r}}^{\top}A r}{|r|^2} +{\overline{z}}\frac{{\overline{r}}^{\top}\Sigma^{-1} r}{|r|^2} \right| \geq d_{|\cdot|}(\overline{B}_{ \mathbb{C}}(1,\gamma),-{\overline{z}} \mathbb{R}_+), \end{align}\] where we used \({\overline{r}}^{\top}\Sigma^{-1} r\geq0\), and \(d_{|\cdot|}\left(\overline{B}_{ \mathbb{C}}(1,\gamma),-{\overline{z}} \mathbb{R}_+\right)\) is the distance between the sets \(\overline{B}_{ \mathbb{C}}(1,\gamma)\) and \(-{\overline{z}} \mathbb{R}_+\). Then, using Cauchy-Schwarz’ inequality \(|{\overline{r}}^{\top}x|\leq |r||x|\), we obtain \[\begin{align} |x|\geq \frac{|{\overline{r}}^{\top}x|}{|r|} \geq d_{|\cdot|}(\overline{B}_{ \mathbb{C}}(1,\gamma),-{\overline{z}} \mathbb{R}_+)|r|. \end{align}\] It only remains to derive an appropriate lower bound for the latter distance. Let us consider two cases. First, if \({\mathcal{R}}(z)\geq0\), it is easy to check that this distance is equal to \(1-\gamma\) that is reached for \(1-\gamma\in\overline{B}_{ \mathbb{C}}(1,\gamma)\) and \(0\in {\overline{z}} \mathbb{R}_-\). Second, if \(0\geq {\mathcal{R}}(z)\geq -\frac{1-\gamma}{\sqrt2}\). we have \[\begin{align} d_{|\cdot|}\left(\overline{B}_{ \mathbb{C}}(1,\gamma),-{\overline{z}} \mathbb{R}_+\right) &= d_{|\cdot|}\left(1,-{\overline{z}} \mathbb{R}_+\right)- \gamma \\ &= \inf_{t\in \mathbb{R}_+} |1+t{\overline{z}}| -\gamma \\ &= \inf_{t\in \mathbb{R}_+} \sqrt{|1+t{\mathcal{R}}(z)|^2+t^2(1-|{\mathcal{R}}(z)|^2)} -\gamma \\ &= \inf_{t\in \mathbb{R}_+} \sqrt{1+2t{\mathcal{R}}(z)+t^2} -\gamma \\ &\geq \inf_{t\in \mathbb{R}_+} \sqrt{1-\sqrt{2}(1-\gamma)t+t^2} -\gamma \\ &= \sqrt{1-\frac{(1-\gamma)^2}{2}} -\gamma \\ &\geq 1-\frac{(1-\gamma)^2}{2}-\gamma \\ &= \frac{1-\gamma^2}{2} \end{align}\] where we used the fact that the minimum of \(t\in \mathbb{R}_+\mapsto 1-2at+t^2\) equals \(1-a^2\) for \(a\geq0\) to get the sixth line, and \(1-\frac{a}{2}\geq(1+a)^{-1}\) for \(a\in[0,1]\) to get the last one. Using the above calculations, we obtain \[|\Sigma(I_d+zA\Sigma)^{-1}x| = |r| \leq d_{|\cdot|}\left(\overline{B}_{ \mathbb{C}}(1,\gamma),-{\overline{z}} \mathbb{R}_+\right)^{-1}|x| \leq \frac{2}{1-\gamma^2}|x|,\] which is exactly Inequality 16 . This concludes the proof. ◻
Lemma 6. Let \(M\in \mathbb{R}^{d\times d}\) be a matrix with a spectrum included in the open unit disk, and \(c\in(0,1)\). We have \[\sum_{\ell=0}^{\infty} c^{2\ell}(I_d-M^{\ell\top})(I_d-M^{\ell}) = \frac{1}{2i\pi} \int_{|z|=1} z^{-1}\left((z^{-1}-c)^{-1} -(z^{-1}I_d-cM)^{-\top}\right) \left((z-c)^{-1}-(zI_d-cM)^{-1}\right)dz.\]
Proof. Since the spectral radius of \(M\) is lower than \(1\), it is power-bounded, i.e., \(\sup_{k\geq0}\|M^k\|_{\rm op}<\infty\). Therefore, the series \[F_0(z) = \sum_{\ell=0}^{\infty} c^{\ell}z^{-\ell-1}M^{\ell},\] is uniformly convergent on \(\Gamma:=\{z\in \mathbb{C}, |z|=1\}\). This implies that \((I_d-cz^{-1}M) F_0(z)=z^{-1}I_d\) and then \[F_0(z) = z^{-1}(I_d-cz^{-1}M)^{-1} = (zI_d-cM)^{-1}.\] Similarly, we obtain \[F(z) := (z-c)^{-1}-(zI_d-cM)^{-1} = \sum_{\ell=0}^{\infty} c^{\ell}z^{-\ell-1}(I_d-M^{\ell}),\] so that, we get \[\begin{align} z^{-1} F(z^{-1})^{\top}F(z) &= z^{-1}\left(\sum_{\ell=0}^{\infty} c^{\ell}z^{\ell+1}(I_d-M^{\ell})\right)^{\top} \left(\sum_{\ell=0}^{\infty} c^{\ell}z^{-\ell-1}(I_d-M^{\ell})\right) \\ &= \sum_{k,\ell\geq0} c^{k+\ell}z^{k-\ell-1}(I_d-M^k)^{\top}(I_d-M^{\ell}). \end{align}\] For similar arguments as above, the latter double series is uniformly convergent on \(\Gamma\) which allows us to interchange summation and integration as follows, \[\begin{align} \int_{|z|=1} z^{-1} F(z^{-1})^{\top}F(z)dz &= \sum_{k,\ell\geq0} c^{k+\ell}(I_d-M^k)^{\top}(I_d-M^{\ell}) \int_{|z|=1} z^{k-\ell-1}dz \\ &= 2i\pi\sum_{k,\ell\geq0} c^{k+\ell}(I_d-M^k)^{\top}(I_d-M^{\ell}), \end{align}\] where we used that \(\int_{|z|=1}z^{k-\ell-1}=2i \pi\) by Residue theorem. This concludes the proof. ◻
Proof of Theorem 1. This is a straightforward consequence of Propositions 8 and 12, with \(\beta=(1+\gamma)^2\), \(\beta_1=1+\gamma\), \(c_{\Sigma}=(1-\gamma)^{-1}\) and \(\sigma^2=\sigma_0^2\). ◻
Proof of Proposition 2. In this case, the matrices \(\Sigma_0,\Sigma_1,H,S\) are straightfoward to compute. In particular, we have \[\Sigma_0=\Sigma_1=\omega I_d\text{ and }H=S=(1-\gamma)\omega I_d.\] Moreover, we have \(b={\mathbb{E}}[R_k\varphi(X_k)]=0\) so that \(\theta^*=0\). Therefore, we have \[{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] = \omega{\mathbb{E}}\left[|{\overline{\theta}}_k|^2\right].\] For \(1\leq i\leq d\), we have \(\theta_{k,i}\) satisfies \[\theta_{k,i} = (1-d\alpha(1-\gamma)\omega B_{k,i})\theta_{k-1,i} +\alpha\sqrt{d\omega}B_{k,i}R_k,\] where \((B_{k})_{k\geq1}\) are i.i.d. \(d\)-dimensional random variables, with \(B_{1,i}\sim\)Ber\((\frac{1}{d})\) and \(\sum_{i=1}^dB_{1,i}=1\) a.e..
On the one hand, from Lemma 7, under the regime described in Proposition 2, for \(C=5.5\), \[\label{eq:sharpness95aux} {\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \gtrsim \frac{(1-e^{-C})^2|\theta_0|^2}{C\alpha(1-\gamma)k} +\frac{\sigma_0^2}{(1-\gamma)^2 k} \left(1-\frac{3-4e^{-C}+e^{-2C}}{2C}\right).\tag{17}\] On the other hand, under the same convergence regime, observe that the upper bound in Theorem 1 is equivalent to \[\begin{align} E &= \left(\left(\frac{|\theta_0|^2}{2\alpha(1-\gamma)k}\right)^{\frac{1}{2}} +\left(\frac{e\sigma_0^2}{(1-\lambda)(1-\gamma)^2 k}\right)^{\frac{1}{2}}\right)^2 \\ &\leq \frac{(1+A)|\theta_0|^2}{2\alpha(1-\gamma)k} +\frac{2(1+A^{-1})e\sigma_0^2}{(1-\gamma)^2 k}, \end{align}\] where we take \(A=2.7\). Then, we can easily check that \(1.85=\frac{1+A}{2}<11\frac{(1-e^{-C})^2}{C}\approx1.98\) and \(7.45\approx2e(1+A^{-1})< 11\left(1-\frac{3-4e^{-C}+e^{-2C}}{2C}\right)\approx 8.02\). Therefore we obtain \[{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \gtrsim 11E,\] which concludes the proof. ◻
Corollary 1. Consider the same MRP and feature functions as in Proposition 2. Take \(\alpha=\lambda\alpha_0(\gamma)\) for \(\lambda\in(0,1)\). For \(k\to\infty\), \(\gamma\to1\) and \(k(1-\gamma)\to1.25\), we have \[{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \gtrsim \frac{1}{1.25} \frac{|\theta_0-\theta^*|^2}{2\left(1-\frac{\alpha}{\alpha_1(\gamma)}\right)\alpha(1-\gamma)k}.\] Moreover, for \(\gamma\to1\) and \(k(1-\gamma)\to\infty\), we have \[{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \gtrsim \frac{1-\frac{\alpha}{\alpha_0(\gamma)}}{e} \frac{de\sigma_0^2(1+\varepsilon_{k,\gamma})}{(1-\frac{\alpha}{\alpha_0(\gamma)})(1-\gamma)^2k}.\]
Proof. Similarly as in the proof of Proposition 2, for \(k\to\infty\), \(\gamma\to1\) and \(k(1-\gamma)\to1.25\), the asymptotic inequality 17 holds for \(C=1.25\). This implies \[{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \gtrsim \frac{(1-e^{-C})^2|\theta_0|^2}{C\alpha(1-\gamma)k}\] which implies the first inequality in Corollary 1, since \(\frac{2(1-e^{-C})^2}{C}\geq\frac{1}{1.25}\).
Now consider for \(\gamma\to1\) and \(k(1-\gamma)\to\infty\). Repeating the arguments in the proof of Lemma 7, we obtain \[{\mathbb{E}}_{X\sim m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] \gtrsim \frac{d\sigma_0^2}{(1-\gamma)^2k} \sim \frac{1-\frac{\alpha}{\alpha_0(\gamma)}}{e} \frac{de\sigma_0^2(1+\varepsilon_{k,\gamma})}{(1-\frac{\alpha}{\alpha_0(\gamma)})(1-\gamma)^2k}.\] This concludes the proof. ◻
Lemma 7. Let \((Y_k)_{k\geq0}\) be a stochastic process with value in \(\mathbb{R}\) such that \(Y_0=y_0\in \mathbb{R}\) is fixed and, for \(k\geq1\) \[Y_{k} = (1-\lambda B_k)Y_{k-1} +B_kZ_k,\] for \(p\in[0,1]\) and \(\lambda\in(0,2)\), where \((B_k,Z_k)_{k\geq1}\) are i.i.d. with \(B_1\) independent of \(Z_1\), \(B_1\sim\)Ber\((p)\), \({\mathbb{E}}[Z_1]=0\) and \(\mathop{\mathrm{\mathop{\rm Var}}}(Z_1)=\sigma^2>0\). Define \({\overline{Y}}_k=\frac{1}{k}\sum_{i=0}^{k-1}Y_i\). In the regime \(k\to\infty\), \(\lambda\to0\) and \(pk\lambda\to C\), for some \(C>0\), we have \[{\mathbb{E}}\left[{\overline{Y}}_k^2\right] \gtrsim \frac{(1-e^{-C})^2y_0^2}{Cp\lambda k} +\frac{\sigma^2}{p\lambda^2 k} \left( 1-\frac{3-4e^{-C}+e^{-2C}}{2C}\right).\]
Proof of Lemma 7. Using superposition principle, we get \(Y_k=Y^b_k+Y^v_k\), with \[\begin{align} Y^b_{k} &= (1-\lambda B_k)Y^b_{k-1}, Y^b_0=y_0 \\ Y^v_{k} &= (1-\lambda B_k)Y^v_{k-1} +B_kZ_k, Y^v_0=0. \end{align}\] Moreover, using that \(Z_k\) is centered and independent with \(Y^b_k\), we get \({\mathbb{E}}[Y_k^v]=0\) and \({\mathbb{E}}\left[Y_k^bY_k^v\right]=0\). Therefore, we obtain \[{\mathbb{E}}\left[Y_k^2\right] = {\mathbb{E}}\left[(Y_k^b)^2\right] +{\mathbb{E}}\left[(Y_k^v)^2\right]\]
First step: the bias.
In this step, we only consider \(Y_k^b\). We have \[{\mathbb{E}}\left[Y^b_k\right] = p(1-\lambda){\mathbb{E}}\left[Y^b_{k-1}\right] +(1-p){\mathbb{E}}\left[Y^b_{k-1}\right] = (1-p\lambda){\mathbb{E}}\left[Y^b_{k-1}\right] = (1-p\lambda)^ky_0,\] so that we get \[{\mathbb{E}}\left[({\overline{Y}}^b_k)^2\right] \geq {\mathbb{E}}\left[{\overline{Y}}^b_k\right]^2 = \left(\frac{1}{k}\sum_{i=0}^{k-1} (1-p\lambda)^iy_0^2\right) = \frac{(1-(1-p\lambda)^k)^2y_0^2}{\lambda^2p^2k^2}.\] Therefore, for \(k\to \infty\), \(\lambda\to 0\) and \(k\lambda p\to C>0\), using \((1-p\lambda)^k\to e^{-C}\), we obtain \[{\mathbb{E}}\left[({\overline{Y}}^b_k)^2\right] \gtrsim \frac{(1-e^{-C})^2y_0^2}{C\lambda pk}.\]
Second step: the variance term.
Recall that \({\mathbb{E}}[Y^v_k]=0\). Then, for \(\lambda'=2\lambda-\lambda^2\in(0,1)\), we have \[\begin{align} {\mathbb{E}}\left[(Y^v_k)^2\right] &= \left(p(1-\lambda)^2+(1-p)\right) {\mathbb{E}}\left[(Y^v_{k-1})^2\right] +p\sigma^2 \\ &= \left(1-p(2\lambda-\lambda^2)\right) {\mathbb{E}}\left[(Y^v_{k-1})^2\right] +p\sigma^2 \\ &= p\sigma^2\sum_{i=0}^{k-1} \left(1-p\lambda'\right)^i \\ &= \frac{(1-(1-p\lambda')^k)\sigma^2}{\lambda'}. \end{align}\] Let \(({\mathcal{F}}_k)_{k\geq1}\) be the filtration associated to \((Z_k,B_k)_{k\geq1}\). Using similar arguments as in the first step, for \(1\leq i\leq j\), we get \[{\mathbb{E}}\left[Y^v_j\,|\,{\mathcal{F}}_i\right] = (1-p\lambda)^{j-i} Y^v_i.\] This implies that \[{\mathbb{E}}\left[Y^v_jY^v_i\right] = (1-p\lambda)^{j-i} {\mathbb{E}}\left[(Y^v_i)^2\right] = (1-p\lambda)^{j-i} \frac{(1-(1-p\lambda')^i)\sigma^2}{\lambda'}.\] Therefore, we obtain \[\begin{align} {\mathbb{E}}\left[({\overline{Y}}^v_k)^2\right] &= \frac{1}{k^2} \left( 2\sum_{0\leq i\leq j\leq k-1}{\mathbb{E}}\left[Y^v_jY^v_i\right] -\sum_{i=0}^{k-1}{\mathbb{E}}\left[(Y^v_i)^2\right] \right) \\ &= \frac{\sigma^2}{\lambda'k^2} \sum_{i=0}^{k-1} \left( (1-(1-p\lambda')^i) \left(2\sum_{j=i}^{k-1}(1-p\lambda)^{j-i} -1\right)\right) \\ &= \frac{\sigma^2}{\lambda'k^2} \sum_{i=0}^{k-1} \left( (1-(1-p\lambda')^i) \left(\frac{2(1-(1-p\lambda)^{k-i})}{p\lambda} -1\right)\right) \\ &= \frac{2\sigma^2}{p\lambda\lambda'k^2} \sum_{i=0}^{k-1} \left( 1 -(1-p\lambda')^i -(1-p\lambda)^{k-i} +(1-p\lambda)^{k}\left(\frac{1-p\lambda'}{1-p\lambda}\right)^{i} \right) -\frac{\sigma^2}{\lambda'k^2} \sum_{i=0}^{k-1}(1-(1-p\lambda')^i) \\ &= \frac{2\sigma^2}{p\lambda\lambda'k^2} \left(k -\frac{1-(1-p\lambda')^k}{p\lambda'} -\frac{1-(1-p\lambda)^k}{p\lambda} +(1-p\lambda)\frac{(1-p\lambda)^k-(1-p\lambda')^k}{p(\lambda'-\lambda)}\right) \\ & -\frac{\sigma^2}{\lambda'k^2} \left(k-\frac{1-(1-p\lambda')^k}{p\lambda'}\right). \end{align}\] Therefore, for \(k\to \infty\), \(\lambda\to 0\) and \(k\lambda p\to C>0\), we obtain the following asymptotic equivalent \[\begin{align} {\mathbb{E}}\left[({\overline{Y}}^v_k)^2\right] &\sim \frac{\sigma^2}{p\lambda^2 k} \left( 1-\frac{1-e^{-2C}}{2C} -\frac{1-e^{-C}}{C} +\frac{e^{-C}-e^{-2C}}{C}\right) -\frac{\sigma^2}{2\lambda k} \left(1-\frac{1-e^{-2C}}{2C}\right) \\ &= \frac{\sigma^2}{p\lambda^2 k} \left( 1-\frac{3-4e^{-C}+e^{-2C}}{2C}\right) -\frac{\sigma^2}{2\lambda k} \left(1-\frac{1-e^{-2C}}{2C}\right) \\ &\sim \frac{\sigma^2}{p\lambda^2 k} \left( 1-\frac{3-4e^{-C}+e^{-2C}}{2C}\right), \end{align}\] where we used \(\lambda'\sim2\lambda\), \((1-p\lambda)^k\sim e^{-C}\) and \((1-p\lambda')^k\sim e^{-2C}\) to get the first line, \(\lambda\to0\) and \(1-\frac{3-4e^{-C}+e^{-2C}}{2C}>0\) for \(C>0\) to get the last one.
This concludes the proof. ◻
Proof. The convergence rate is a consequence of Theorem 15 with \(\beta=(1+\gamma)^2\), \(\beta_1=1+\gamma\), \(c_{\Sigma}=(1-\gamma)^{-1}\) and \(\sigma^2=\sigma_0^2\).
Therefore, it only remains to prove the second part of the theorem. Take the Markov Process on \({\mathcal{X}}=\{1,-1\}\) such that \(X'=-X\) a.e.. Take \(m\equiv\frac{1}{2}\) the uniform probability distribution, \(d=1\) and \(\phi(x)=x\). Consider \((R_k)_{k\geq1}\) i.i.d. with \(R_1\sim{\mathcal{N}}(0,\sigma_0^2)\). For \(\alpha\geq\alpha_1(\gamma)=\frac{2}{1+\gamma}\), \(k\geq1\), we have \[\theta_k = (1-\alpha(1+\gamma))\theta_{k-1} +\alpha R_k = r^k\theta_0 +\alpha\sum_{i=0}^{k-1}r^{i}R_{k-i},\] with \(r=1-\alpha(1+\gamma)<-1\). Therefore, we obtain \[{\mathbb{E}}\left[|\theta_k|^2\right] = r^{2k}\theta_0^2 +\alpha^2\sigma_0^2\sum_{i=0}^{k-1}r^{2i} = r^{2k}\theta_0^2 +\alpha^2\sigma_0^2 \frac{r^{2k}-1}{r^2-1} \underset{k\to\infty}{\longrightarrow}+\infty.\] Similarly, we have \[{\mathbb{E}}_{m}\left[|v(X,{\overline{\theta}}_k)-v(X,\theta^*)|^2\right] = {\mathbb{E}}\left[|{\overline{\theta}}_k|^2\right] = \frac{(r^k-1)^2}{(1-r)^2k^2}|\theta_0|^2 +\frac{\alpha^2\sigma_0^2}{(1-r)^2k^2}|\theta_0|^2 \sum_{i=1}^{k-1}|r^i-1|^2 \underset{k\to\infty}{\longrightarrow}+\infty.\]
This concludes the proof. ◻
Proof of Theorem 4. This is a straightforward consequence of Proposition 13, the equality \({\mathcal{S}}_k={\rm tr}(T_k)\) and Proposition 18, with \(\beta=(1+\gamma)^2\), \(\beta_1=1+\gamma\), \(c_{\Sigma}=(1-\gamma)^{-1}\) and \(\sigma^2=\sigma_0^2\). ◻
****Proposition** 18**. Assume [hypo:iid]-[hypo:linear]. For \(Q = I_d-\alpha\Sigma_0(I_d-\gamma U)\), \(0<\alpha<\alpha_1(\gamma)\) and \(k\geq1\), define \(T_k\) by \[T_k= \frac{1}{k}\sum_{j=0}^{k-1} (I_d-\gamma U)^{-\top} (I_d-Q^j)^{\top}(I_d-Q^j) (I_d-\gamma U)^{-1}.\] we have \[{\left\| T_k \right\|_{\rm op}^{}} \leq \frac{e}{(1-\gamma)^2} \left(1 +\frac{3}{k(1-\gamma)^2} +\frac{5}{k(1-\gamma)} +3(1-\gamma) +\frac{1}{4k(1-\frac{\alpha}{\alpha_1(\gamma)})^2}\right).\]
Proof. Using similar arguments as in the beginning of the proof of Proposition 12, we have \[\label{eq:bound95Tk} {\left\| T_k \right\|_{\rm op}^{}} \leq \frac{e}{2\pi k} \int_{-\pi}^{\pi} {\left\| \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi}I_d-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{\rm op}^{2}}d\psi.\tag{18}\] Then, continuing similarly as in the proof of Proposition 12, we obtain \[\frac{e}{2\pi} \int_{-\psi_{\gamma}}^{\psi_{\gamma}} {\left\| \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi}I_d-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{\rm op}^{2}}d\psi \leq \frac{ke}{(1-\gamma)^2}(4-3\gamma),\] where we recall that \(\psi_{\gamma}\) satisfies \(\psi_{\gamma}=\arccos(1-(1-\gamma)^2)\).
It only remains to deal with the part of the integral in 18 on \([-\pi,\pi]\backslash[-\psi_{\gamma},\psi_{\gamma}]\), or more simply on \([\psi_{\gamma},\pi]\) using parity. First, for \(\psi\in[\psi_{\gamma},\pi]\), we have \[{\left\| \left((e^{i\psi}-c_k)^{-1}I_d-(e^{i\psi}I_d-{\widetilde{Q}})^{-1}\right)(I_d-\gamma U)^{-1} \right\|_{\rm op}^{2}} \leq \frac{2}{(1-\gamma)^2} \left(|e^{i\psi}-c_k|^{-2} + {\left\| (e^{i\psi}-{\widetilde{Q}})^{-1} \right\|_{\rm op}^{2}}\right).\] Let us start with the first term in the above sum. Using \(|e^{i\psi}-c_k|^2\geq {\mathcal{I}}(e^{i\psi}-c_k)^2=\sin(\psi)^2\) when \(\psi\in[\psi_{\gamma},\frac{\pi}{2}]\), we obtain \[\begin{align} 2\int_{\psi_{\gamma}}^{\frac{\pi}{2}}|e^{i\psi}-c_k|^{-2}d\psi \leq 2\int_{\psi_{\gamma}}^{\pi}\sin(\psi)^{-2}d\psi \leq\frac{\sqrt{2}(2-\gamma)}{1-\gamma} \leq \frac{\pi}{1-\gamma}, \end{align}\] where we used a similar argument as in the second step of the proof of Proposition 12 to get the second inequality. Then, when \(\psi\in[\frac{\pi}{2},\pi]\), we have \(\Re(e^{i\psi})\leq 0\) so that \(|e^{i\psi}-c_k|^2\geq {\mathcal{R}}(e^{i\psi}-c_k)^2\geq c_k^2\geq 4\) and then \[2\int_{\frac{\pi}{2}}^{\pi}|e^{i\psi}-c_k|^{-2}d\psi \leq 4\pi.\] From the above computations and 18 , we deduce \[\label{eq:bound95Tk2} {\left\| T_k \right\|_{\rm op}^{}} \leq \frac{e}{(1-\gamma)^2}(4-3\gamma) +\frac{5e}{(1-\gamma)^3k} +\frac{2e}{\pi(1-\gamma)^2k} \int_{\psi_{\gamma}}^{\pi} {\left\| (e^{i\psi}-{\widetilde{Q}})^{-1} \right\|_{\rm op}^{2}}d\psi.\tag{19}\] The remainder of the proof is inspired by the third step of the proof of Proposition 12.
First step: preliminary considerations.
Take \(z=e^{i\psi}\) with \(\psi\in[\psi_{\gamma},\pi]\). For \(x\in \mathbb{C}^d\) and \(y=(z-{\widetilde{Q}})^{-\top}x\), we have \[\begin{align} c_k^{-1}|x| = c_k^{-1}|(z-{\widetilde{Q}})^{\top}y| &= |(c_k^{-1}z-(I_d-\alpha(I_d-\gamma U^{\top})\Sigma_0))y| \\ &\geq |(c_k^{-1}z-1+\alpha\Sigma_0)y| -\alpha\gamma|U^{\top}\Sigma_0y|. \\ &\geq |(c_k^{-1}z-1+\alpha\Sigma_0)y| -\alpha\gamma|\Sigma_0y|. \end{align}\] Recall that \(\Sigma_0\) is symmetric positive definite. Let us denote \((\lambda_i)_{1\leq i\leq d}\) the eigenvalues of \(\Sigma_0\), associated with the eigenvectors \((e_i)_{1\leq i\leq d}\). Let us decompose \(y\) in the basis of eigenvectors as \(y=\sum_{i=1}^dy_ie_i\). Recall the notations \(s=1-c_k^{-1}{\mathcal{R}}(z)\) and \(f(u,s)=|z-c_k+c_k\alpha u|^2\) \[\begin{align} |(z-c_k+c_k\alpha\Sigma_0)y|^2 &= \sum_{i=1}^d |z-c_k+c_k\alpha\lambda_i|^2y_i^2 \\ &= \sum_{i=1}^d f(\lambda_i,s)y_i^2 \\ &= c_k^2\sum_{i=1}^d (\alpha^2\lambda_i^2+2s(1-\alpha \lambda_i)-1+c_k^{-2})y_i^2 \\ &= c_k^2\left(\alpha^2u^2 +2s(1-\alpha{\overline{\lambda}})-1+c_k^{-2}\right)|y|^2 \\ &\geq c_k^2\left(\alpha^2u^2 +2s(1-\alpha u)-1+c_k^{-2}\right)|y|^2 \\ &= f(u,s), \end{align}\] with \({\overline{\lambda}}:=\sum_{i=1}^d\lambda_i\frac{y_i^2}{|y|^2}\) and \(u=\sqrt{\sum_{i=1}^d\lambda_i^2\frac{y_i^2}{|y|^2}}\), where the computations to get the third line are detailed in the third step of the proof of Proposition 12, and the fifth line is obtained by Cauchy-Schwarz inequality \({\overline{\lambda}}\leq u\).
As in the third step of the proof of Proposition 12, we distinguish two cases. First, if \(\alpha u>1\), we have once again \(f(u,s)\geq (2-\alpha)^2\) and then \[\label{eq:aux95alphau} |x| \geq (2-\alpha-\gamma\alpha)|y| = (2-\alpha(1+\gamma))|y|.\tag{20}\] Only the case \(\alpha u\leq1\) remains to be dealt with. To do so, we introduce further materials in this step, starting with \(\delta=c_k^{-1}-1>0\), \(w=\alpha u\) and \(g(w,s)\) defined by \[g(w,s) = c_k^{-1}\sqrt{f(u,s)}-\gamma w = \sqrt{w^2+2s(1-w)-1+c_k^{-2}} -\gamma w = \sqrt{(w-s)^2+(2+\delta -s)(s+\delta)} -\gamma w,\] with \(s\in[(1-\gamma)^2(1+\delta)-\delta,2+\delta]\subset[(1-\gamma)^2-\delta,2+\delta]\). Using the above computations, we have \[\label{eq:aux95g} |x|\geq c_kg(w,s)|y|.\tag{21}\] Therefore, to conclude it is sufficient to obtain a convenient lower bound on \(g\). Observe that \[\begin{align} \partial_w g &= \frac{w-s}{\sqrt{(w-s)^2+(2+\delta -s)(s+\delta)}} -\gamma\text{ and } \\ \partial^2_{w,w} g &= \frac{1}{\sqrt{(w-s)^2+(2+\delta -s)(s+\delta)}} -\frac{(w-s)^2}{\left((w-s)^2+(2+\delta -s)(s+\delta)\right)^{\frac{3}{2}}} \geq 0. \end{align}\] Therefore, \(g\) is convex in \(w\). We are now in position to derive useful estimates to deal with the remaining term in 19 . In the two subsequent steps, we consider separately the case \(\Re(z)\leq \gamma\) and \(\Re(z)\in[1-(1-\gamma)^2,\gamma]\), always under the assumption \(w=\alpha u\leq 1\).
Second step: the case of \(\Re(z)\leq \gamma\).
Observe that \[g(1,s) = \sqrt{1+2\delta+\delta^2}-\gamma = 1-\gamma +\delta\text{ and }\partial_wg(1,s) = \frac{1-s}{1+\delta}-\gamma = c_k(1-s)-\gamma.\] Then, assuming \(\Re(z)\leq \gamma\), we have \(\partial_wg(1,s)\leq 0\) for \(w\in[0,1]\). Therefore, using a convex inequality, we obtain, \[\begin{align} g(w,s) &\geq g(1,s)-(1-w)\partial_wg(1,s) \\ &\geq 1-\gamma. \end{align}\] Consequently, using the latter inequality, 20 and 21 , for \(\Re(z)\leq \gamma\), we obtain \[\begin{align} {\left\| (e^{i\psi}-Q)^{-1} \right\|_{\rm op}^{-2}} &\leq \max((2-\alpha(1+\gamma))^{-2},c_k^{-2}(1-\gamma)^{-2}) \\ &\leq (2-\alpha(1+\gamma))^{-2} +c_k^{-2}(1-\gamma)^{-2}. \end{align}\] We conclude this step with the following estimate \[\int_{{\widetilde{\psi}}_{\gamma}}^{\pi} {\left\| (e^{i\psi}-Q)^{-1} \right\|_{\rm op}^{-2}} d\psi \leq \frac{\pi}{(2-\alpha(1+\gamma))^{2}} +\frac{\pi}{c_k^{2}(1-\gamma)^{2}},\] where \({\widetilde{\psi}}:=\arccos(\gamma)\).
Third step: the case of \(\gamma\leq \Re(z)\leq 1- (1-\gamma)^2\).
The minimum of \(g(\cdot,s)\) on \([0,1]\) is lower or equal to the minimum on \(\mathbb{R}\) that is reached for \(w(s)\) such that \(\partial_wg(w(s),s)=0\), i.e., \[w(s) = s+\gamma\sqrt{\frac{(2+\delta-s)(s+\delta)}{1-\gamma^2}}.\] The latter minimum then satisfies \[\begin{align} g(w(s),s) &= \sqrt{(2+\delta -s)(s+\delta)\left(\frac{\gamma^2}{1-\gamma^2}+1\right)} -\gamma\left(s+\frac{\gamma^2}{\sqrt{1-\gamma^2}}\sqrt{(2+\delta -s)(s+\delta)}\right) \\ &= \sqrt{(1-\gamma^2)(2+\delta -s)(s+\delta)} -\gamma s \\ &\geq \sqrt{(1-\gamma^2)c_k^{-1}(1+\gamma)(s+\delta)} -\gamma \sqrt{(1-\gamma)c_k^{-1}(s+\delta)} \\ &= \sqrt{(1-\gamma)c_k^{-1}(s+\delta)} \\ &= c_k^{-1}\sqrt{(1-\gamma)(1-{\mathcal{R}}(z))} \end{align}\] where the third line is obtained using \(c_k(s+\delta)=1-\Re(z)\leq 1-\gamma\) and \(c_k^{-1}=1+\delta\), so that we have \(2+\delta-s\geq 2+2\delta-c_k^{-1}(1-\gamma)=c_k^{-1}(1+\gamma)\) and \(s\leq s+\delta\leq\sqrt{c_k^{-1}(1-\gamma)(s+\delta)}\). Recall that \(|z|=1\), so that \[|z-1|^2 = (1-{\mathcal{R}}(z))^2+{\mathcal{I}}(z)^2 = (1-{\mathcal{R}}(z))^2+1-{\mathcal{R}}(z)^2 = 2(1-{\mathcal{R}}(z)).\]
Final step: getting the desired bound.
Recall that 20 holds for \(\alpha u>1\) and 21 for \(\alpha u\leq1\). Therefore, in both cases, we have \[\begin{align} {\left\| (e^{i\psi}-Q)^{-1} \right\|_{\rm op}^{-2}} &\leq \max\left(\frac{1}{(2-(1+\gamma)\alpha)^2}, \frac{1}{c_k^2g(w,s)^2}\right) \\ &\leq \frac{1}{(2-(1+\gamma)\alpha)^2} +\frac{1}{c_k^2g(w,s)^2}. \end{align}\] Using the lower bound on \(g\) obtained in the two previous steps, we obtain, for \({\widetilde{\psi}}_{\gamma}=\arccos(\gamma)\), \[\begin{align} \int_{\psi_{\gamma}}^{\pi} {\left\| (e^{i\psi}-Q)^{-1} \right\|_{\rm op}^{-2}} d\psi &\leq \frac{(\pi-\psi_{\gamma})}{(2-\alpha(1+\gamma))^{2}} +\int_{\psi_{\gamma}}^{\pi} \frac{1}{(1-\gamma)^2} +\int_{\psi_{\gamma}}^{{\widetilde{\psi}}_{\gamma}} \frac{2}{(1-\gamma)|1-z|^2} d\psi \\ &\leq \frac{\pi}{(2-\alpha(1+\gamma))^{2}} +\frac{\pi}{(1-\gamma)^2} +\frac{1}{1-\gamma} \int_{\psi_{\gamma}}^{{\widetilde{\psi}}_{\gamma}} \frac{2}{\sin(\psi)^2}d\psi \\ &\leq \frac{\pi}{(2-\alpha(1+\gamma))^{2}} +\frac{\pi}{(1-\gamma)^2} +\frac{\sqrt{2}}{(1-\gamma)^2}, \end{align}\] where the derivation of the upper bound of the integral from the second line is detailed in the second step of the proof of Proposition 12. This and 19 imply \[{\left\| T_k \right\|_{\rm op}^{}} \leq \frac{e}{(1-\gamma)^2}(4-3\gamma) +\frac{5e}{(1-\gamma)^3k} +\frac{2e}{(2-\alpha(1+\gamma))^{2}(1-\gamma)^2k} +\frac{2e}{(1-\gamma)^4k} +\frac{2\sqrt{2}e}{\pi(1-\gamma)^4k}.\] This and \(\frac{2\sqrt2}{\pi}\leq1\) lead to the desired inequality, this concludes the proof. ◻
Proof of Lemma 1. We consider \(\varphi\) as in the first case in Lemma 1 and \((\theta_k)_{k\geq0}\) the induced sequence obtained using TD(0). Similarly, we define \({\widetilde{\varphi}}\) and \(({\widetilde{\theta}}_k)_{k\geq0}\) according to the second case. We are going to prove by induction on \(k\geq0\) \[\varphi(x)^{\top}\theta_k = {\widetilde{\varphi}}(x)^{\top}{\widetilde{\theta}}_k \;\text{ for any }x\in{\mathcal{X}}.\] First for \(k=0\), we have \[{\widetilde{\varphi}}(x)^{\top}{\widetilde{\theta}}_0 = {\widetilde{\theta}}_{0,1} +{\widetilde{\varphi}}_{(-1)}(x)^{\top}{\widetilde{\theta}}_{0,(-1)} = C\theta_{0,1} +\varphi_{(-1)}(x)^{\top}\theta_{0,(-1)} = \varphi(x)^{\top}\theta_0.\] Then, for \(k\geq1\), assume that the equality holds at index \(k-1\). Observe that \({\widetilde{\varphi}}(x)^{\top}{\widetilde{\alpha}}{\widetilde{\varphi}}(y)=\alpha\varphi(x)^{\top}\varphi(y)\), so that we obtain \[\begin{align} {\widetilde{\varphi}}(x)^{\top}{\widetilde{\theta}}_k &= {\widetilde{\varphi}}(x)^{\top} \left({\widetilde{\theta}}_{k-1} -{\widetilde{\alpha}}{\widetilde{\varphi}}(X_k)\left(({\widetilde{\varphi}}(X_k)-\gamma{\widetilde{\varphi}}(X_k'))^{\top}{\widetilde{\theta}}_{k-1}-R_k\right)\right) \\ &= \varphi(x)^{\top}\theta_{k-1} -\alpha\varphi(x)^{\top}\varphi(X_k) \left((\varphi(X_k)-\gamma\varphi(X_k'))^{\top}\theta_{k-1}-R_k\right) \\ &= \varphi(x)^{\top} \left(\theta_{k-1} -\alpha\varphi(X_k) \left((\varphi(X_k)-\gamma\varphi(X_k'))^{\top}\theta_{k-1}-R_k\right)\right) \\ &= \varphi(x)^{\top}\theta_k. \end{align}\] ◻
Lemma 8. Assume [hypo:iid]-[hypo:linear] and that there exists \(\theta_{\mathbb{1}}\in \mathbb{R}^d\) such that \(v(\cdot,\theta_{\mathbb{1}})=\mathbb{1}\), where \(\mathbb{1}\) is the constant function equal to one. Then, we have \[\mu^{\top}\theta^* = {\mathbb{E}}\left[v(X,\theta^*)\right] =\frac{{\mathbb{E}}[R]}{1-\gamma}.\] In particular, if \({\mathbb{E}}[R]\neq 0\), we obtain \[|\theta^*|\geq\frac{|{\mathbb{E}}[R]|}{|\mu|(1-\gamma)} = O((1-\gamma)^{-1}).\]
Proof. Observe that \(\Sigma_0\theta_1=\mu=\Sigma_1^{\top}\theta_{\mathbb{1}}\), which implies \(\theta_{\mathbb{1}}^{\top}(\Sigma_0-\gamma\Sigma_1) =\theta_{\mathbb{1}}^{\top}H=(1-\gamma)\mu^{\top}\), so that we get \[{\mathbb{E}}\left[v(X,\theta^*)\right] = \mu^{\top}\theta^* = (1-\gamma)^{-1}\theta_{\mathbb{1}}^{\top}H\theta^* = (1-\gamma)^{-1}\theta_{\mathbb{1}}^{\top}b = (1-\gamma)^{-1}{\mathbb{E}}[R].\] Recall that \(\mu\neq 0\), otherwise \(\theta_{\mathbb{1}}\) cannot exist. The second inequality in the lemma is straightforward. ◻
Lemma 9. Under the same assumptions as Theorem 5, \(\theta^*\) is uniformly bounded with respect to \(\gamma\).
Proof. Observe that \(H\) and \(b\) write as \[H = \begin{pmatrix} (1-\gamma)^{-1} &\mu_{(-1)}^{\top}\\ \mu_{(-1)}& {\widetilde{H}}, \end{pmatrix}b = \begin{pmatrix} (1-\gamma)^{-1}{\mathbb{E}}[R]\\ {\widetilde{b}} \end{pmatrix}\] with \({\widetilde{H}}={\mathbb{E}}\left[\varphi_{(-1)}(X)(\varphi_{(-1)}(X)-\gamma \varphi_{(-1)}(X'))^{\top}\right]\) and \({\widetilde{b}}={\mathbb{E}}[R\varphi_{(-1)}(X)]\). From the first line in \(H\theta^*=b\), we obtain \[\label{eq:bound95param95trick95theta1} \theta^*_1 = {\mathbb{E}}[R]-(1-\gamma)\mu_{(-1)}^{\top}\theta^*_{(-1)}.\tag{22}\] Using this and the other lines from \(H\theta^*=b\), we get \[{\widetilde{H}}\theta^*_{(-1)} = {\widetilde{b}} -{\mathbb{E}}[R]\mu_{(-1)},\] where \({\widetilde{H}}=H-(1-\gamma)\mu_{(-1)}\mu_{(-1)}^{\top}\).
On the one hand, using similar arguments as in the proof of Theorem 7, we have \[(\theta^*_{(-1)})^{\top}{\widetilde{H}}\theta^*_{(-1)} \geq (1-\gamma(1-g)) (\theta^*_{(-1)})^{\top}{\widetilde{\Sigma}}_0\theta^*_{(-1)} \geq (1-\gamma(1-g)) {\widetilde{\omega}}|\theta^*_{(-1)}|^2,\] where \({\widetilde{\Sigma}}_0={\mathbb{E}}\left[(\varphi_{(-1)}(X)-\mu_{(-1)})(\varphi_{(-1)}(X)-\mu_{(-1)})^{\top}\right]\) and \({\widetilde{\omega}}>0\) is the smallest eigenvalue of \({\widetilde{\Sigma}}_0\) which is positive using the linear independence of the features and the fact that \(\varphi_1\) is constant.
On the other hand, we have \[(\theta^*_{(-1)})^{\top}{\widetilde{H}}\theta^*_{(-1)} = (\theta^*_{(-1)})^{\top}({\widetilde{b}}-{\mathbb{E}}[R]\mu_{(-1}) \leq |\theta^*_{(-1)}|{\mathbb{E}}[R(\varphi_{(-1)}-\mu_{(-1)})]| \leq C_R^{\frac{1}{2}}|\theta_{(-1)}|,\] where \(C_R\) is defined in Assumption [hypo:R].
Consequently, we obtain \[\label{eq:bound95param95trick95theta-1} |\theta^*_{(-1)}| \leq \frac{C_R^{\frac{1}{2}}}{{\widetilde{\omega}}(1-\gamma(1-g))} \leq \frac{C_R^{\frac{1}{2}}}{{\widetilde{\omega}}g},\tag{23}\] and then \(|\theta^*_1|\leq C_R^{\frac{1}{2}}+\frac{C_R^{\frac{1}{2}}}{{\widetilde{\omega}}}\). This concludes the uniform boundedness of \(\theta^*\).
Let us now prove the uniform boundedness of \(\sigma_0^2\) that is given by \[\begin{align} \sigma_0^2 &= \sup_{x\in\mathop{\mathrm{\mathop{\rm supp}}}m} {\mathbb{E}}\left[|(\varphi(X)-\gamma\varphi(X'))^{\top}\theta^*-R|^2\,|\,X=x\right] \\ &= \sup_{x\in\mathop{\mathrm{\mathop{\rm supp}}}m} {\mathbb{E}}\left[|\theta^*_1+(\varphi_{(-1)}(X)-\gamma\varphi_{(-1)}(X'))^{\top}\theta_{(-1)}^*-R|^2\,|\,X=x\right] \\ &= \sup_{x\in\mathop{\mathrm{\mathop{\rm supp}}}m} {\mathbb{E}}\left[| {\mathbb{E}}[R]-(1-\gamma)\mu_{(-1)}^{\top}\theta^*_{(-1)} +(\varphi_{(-1)}(X)-\gamma\varphi_{(-1)}(X'))^{\top}\theta_{(-1)}^*-R|^2\,|\,X=x\right] \\ &\leq \sup_{x\in\mathop{\mathrm{\mathop{\rm supp}}}m} 2{\mathbb{E}}\left[|{\mathbb{E}}[R]-R|^2\,|\,X=x\right] +2{\mathbb{E}}\left[ (\varphi_{(-1)}(X)-\gamma\varphi_{(-1)}(X')-(1-\gamma)\mu_{(-1)})^{\top}\theta_{(-1)}^*|^2\,|\,X=x\right] \\ &\leq 8C_R+18|\theta^*_{(-1)}|^2 \\ &\leq C_R\left(8 +\frac{18}{{\widetilde{\omega}}^2g^2}\right), \end{align}\] where we used 22 to get the third line, and 23 to obtain the last one. This concludes the proof. ◻
Proof of Theorem 5. From the inequalities stated in Lemma 12, we can apply Proposition 16 with \(\Sigma=\Sigma_0\), \(\beta=1+(1+\gamma)^2\), \(c_{\Sigma}=(1-\gamma)^{-1}\) and \(\sigma^2=\sigma_0^2\). It only remains to upper bound \({\mathcal{S}}_k\) using Proposition 19 to obtain the desired rate.
The uniform boundedness of \(\theta^*\) with respect to \(\gamma\) is given by Lemma 9. ◻
****Proposition** 19**. Under Assumptions [hypo:iid],[hypo:R], [hypo:linear95bis], the upper bound in Proposition 12 applies.
Proof. First observe that \(Q=\Sigma_0^{\frac{1}{2}}(I_d-\alpha H)\Sigma_0^{-\frac{1}{2}}\), thus it admits the same spectrum as \(I_d-\alpha H\). Moreover, using ?? , ?? we can take \(c_{\Sigma}=(1-\gamma)^{-1}\) \(\beta=1+(1+\gamma)^2\) so that ?? applies for \(\alpha<\frac{2}{\beta c_{\Sigma}} =\frac{2(1-\gamma)}{1+(1+\gamma)^2}=\alpha_2(\gamma)\). Then ?? implies that the spectrum of \(I_d-\alpha H\) is contained in the complex unit sphere. Therefore, Lemma 6 applies to \(Q\) and Inequality 13 holds.
Then, the first step of the proof of Proposition 12 can be repeated without any change. Concerning the second step, the only change occurs to obtain the fourth line in the chain of inequalities 15 : it requires that \({\left\| \Sigma_0U-U^{\top}\Sigma_0 \right\|_{\rm op}^{}}\leq 2\) is indeed satisfied under the present assumption as stated in 24 .
Therefore, there only remains the third step, i.e., for \(\Re(z)\leq -1+(1-\gamma)^2\), that we handle with a different approach using \(\gamma\geq\frac{1}{2}\). First, we have \[\alpha < \frac{2(1-\gamma)}{1+(1+\gamma)^2} \leq \frac{2(1-\gamma)}{1+\left(1+\frac{1}{2}\right)^2} = \frac{8}{13}(1-\gamma),\] then, using Inequality ?? , we get \[\begin{align} \alpha^2{\left\| \Sigma_0(I_d-\gamma U) \right\|_{\rm op}^{2}} &\leq \frac{(1-\gamma)^2}{4}{\left\| \Sigma_0(I_d-\gamma U) \right\|_{F}^{2}} \\ &\leq \frac{8^2(1-\gamma)^2}{13^2} \left((1-\gamma)^2(((1-\gamma)^{-2}+1)^2+1)+2(1+\gamma)^2\right) \\ &= \frac{8^2}{13^2}\left((1+(1-\gamma)^2)^2+(1-\gamma)^4)+2(1-\gamma^2)^2\right) \\ &\leq \frac{8^2}{13^2}\left(\frac{25}{16}+\frac{1}{16}+\frac{9}{8}\right) \leq 1.01^2. \end{align}\] Moreover, using \(-{\mathcal{R}}(z)\geq 1-(1-\gamma)^2\geq \frac{3}{4}\), we obtain \[|z-c_k|^2 = (c_k-{\mathcal{R}}(z))^2+{\mathcal{I}}(z)^2 = c_k^2-2{\mathcal{R}}(z)c_k+1 \geq c_k^2+\frac{3}{2}c_k+1.\] Therefore, the above inequalities imply that, for \(y\in \mathbb{C}^d\) with \(|y|=1\), we have \[\begin{align} |(z-{\widetilde{Q}})y| &= |\left((c_k-z)I_d -\alpha c_k\Sigma_0(I_d-\gamma U)\right)y| \\ &\geq |c_k-z||y| -\alpha c_k{\left\| \Sigma_0(I_d-\gamma U) \right\|_{\rm op}^{}}|y| \\ &\geq \sqrt{c_k^2+\frac{3}{2}c_k+1} -1.01c_k=f(c_k), \end{align}\] where \(f:x\in[0,1]\to\sqrt{x^2+\frac{3}{2}x+1}-1.01x\). We have \[f'(x) = \frac{x+\frac{3}{4}x}{\sqrt{1+\frac{3}{2}x+x^2}}-1.01 = \sqrt{\frac{x^2+\frac{3}{2}x+\frac{9}{16}}{1+\frac{3}{2}x+x^2}}-1.01 \leq 0.\] Consequently, we obtain \({\left\| (z-{\widetilde{Q}})^{-1} \right\|_{\rm op}^{}} \leq f(1)^{-1}=\left(\sqrt{\frac{7}{2}}-1.01\right)^{-1} \leq2\).
The remainder of the proof is similar to that of Proposition 12. ◻
Proof of Theorem 7. Define \({\widehat{\varphi}}=\varphi-\mu\), \({\widehat{\Sigma}}_0={\mathbb{E}}[{\widehat{\varphi}}(X){\widehat{\varphi}}(X)^{\top}]=\Sigma_0-\mu\mu^{\top}\), \({\widehat{\Sigma}}_1={\mathbb{E}}[{\widehat{\varphi}}(X){\widehat{\varphi}}(X')^{\top}]=\Sigma_1-\mu\mu^{\top}\), \({\widehat H}={\widehat{\Sigma}}_0-\gamma {\widehat{\Sigma}}_1\), \({\widehat{S}}=\frac{{\widehat H}+{\widehat H}^{\top}}{2}\) and \({\widehat b}={\mathbb{E}}[R{\widehat{\varphi}}(X)]=b-{\mathbb{E}}[R]\mu\). From Lemma 14, we can apply Proposition 8 with \(\Sigma={\widehat{\Sigma}}_0\), \(\beta=2(1+\gamma)^2\), \(\beta_1=2(1-\gamma)\), \(c_{\Sigma}=1-(1-g)\gamma\), this implies \[{\mathbb{E}}_{X\sim m}\left[|{\widehat v}(X,{\overline{\theta}}_k)-{\widehat v}(X,\theta^*)|^2\right] \leq \frac{1}{k} \left(\left(\frac{|\theta_0-{\widehat \theta}^*|^2}{2\left(1-\frac{\alpha}{{\widehat \alpha}_1(\gamma)}\right) \alpha(1-(1-g)\gamma)}\right)^{\frac{1}{2}} +\left(\frac{2{\widehat{\sigma}}_0^2{\mathcal{S}}_k}{1-\frac{\alpha}{{\widehat \alpha}_0(\gamma)}}\right)^{\frac{1}{2}}\right)^2.\] It only remains to prove that Proposition 12 holds with \(\gamma\) replaced by \((1-g)\gamma\). This is what we prove in the remainder of this proof.
Let us define \({\widetilde{U}}\) by \({\widetilde{U}}=(1-g)^{-1}{\widehat{\Sigma}}_0^{-\frac{1}{2}}{\widehat{\Sigma}}_1{\widehat{\Sigma}}_0^{-\frac{1}{2}}\), it satisfies \(\|{\widetilde{U}}\|_{\rm op}\leq 1\) by Inequality ?? . Then we obtain \[{\widehat H}={\widehat{\Sigma}}_0^{\frac{1}{2}}(I_d-(1-g)\gamma{\widetilde{U}}){\widehat{\Sigma}}_0^{\frac{1}{2}},\] which is the same structure as for TD(0) but with \(\gamma\) replaced with \((1-g)\gamma\).
The only property of \(U\) used to prove Proposition 12 was its operator norm bounded by one. Therefore, we can repeat all the proof in the case of \({\widehat H}\) with \(\gamma\) replaced by \((1-g)\gamma\).
This concludes the extension of Theorem 1 to PCTD(0) as stated in Theorem 7. The extensions of Theorems 3 and 4 works exactly the same. ◻
Lemma 10. For \(u\in[0,1)\), we have \[\int_0^{2\pi} \frac{d\theta}{|e^{-i\theta}-u|^2} = \frac{2\pi}{1-u^2}\]
Proof. Let \(G=\{z\in \mathbb{C}, |z|=1\}\), we have \[\begin{align} \int_0^{2\pi} \frac{d\theta}{|e^{-i\theta}-u|^2} &= \int_G \frac{1}{|z-u|^2} \frac{dz}{iz} \\ &= \int_G \frac{dz}{(z-u)(z^{-1}-u)iz} \\ &= \int_G \frac{dz}{i(z-u)(1-zu)}. \end{align}\] Recall that the function \(\frac{1}{i(z-u)(1-zu)}\) is holomorphic on \(D(0,1)\backslash\{u\}\) with a pole in \(u\). Therefore, we can use the Residue Theorem to get \[\int_0^{2\pi} \frac{d\theta}{|e^{-i\theta}-u|^2} = 2\pi i \;{\rm Res}_u \left(z\mapsto\frac{1}{i(z-u)(1-zu)}\right) = 2\pi i \frac{1}{i(1-u^2)} = \frac{2\pi}{1-u^2}.\] This concludes the proof. ◻
The results presented here are used to prove the results in 3.2.
Lemma 11. Assume [hypo:iid]-[hypo:linear]. Using the notations of the algorithm TD(0) from Section 1, define \(h^{\rm TD}=\varphi(X)(\varphi(X)-\gamma\varphi(X'))\) and \(S^{\rm TD}=\Sigma_0-\gamma\Sigma_1\), we have \[\begin{align} \label{eq:bound95S} (1-\gamma)\Sigma_0 &\leq S^{\rm TD} \leq (1+\gamma)\Sigma_0, \\ \label{eq:bound95HHtop} {\mathbb{E}}\left[h^{\rm TD}(h^{\rm TD})^{\top}\right] &\leq (1+\gamma)^2\Sigma_0, \\ \label{eq:bound95htoph} {\mathbb{E}}\left[(h^{\rm TD})^{\top}h^{\rm TD}\right] &\leq (1+\gamma)S^{\rm TD}, \\ \label{eq:ss0} {\mathbb{E}}\left[(h^{\rm TD}\theta^*-b^{\rm TD})(h^{\rm TD}\theta^*-b^{\rm TD})^{\top}\right] &\leq \sigma_0^2\Sigma_0. \end{align}\] {#eq: sublabel=eq:eq:bound95S,eq:eq:bound95HHtop,eq:eq:bound95htoph,eq:eq:ss0}
Proof. To get ?? , it is sufficient to observe \[S^{\rm TD} = \Sigma_0-\frac{\gamma}{2} {\mathbb{E}}\left[\varphi(X)\varphi(X')^{\top} +\varphi(X')\varphi(X)^{\top}\right],\] and use Cauchy-Schwarz inequality.
To get ?? , we compute \[\begin{align} {\mathbb{E}}\left[h^{\rm TD}(h^{\rm TD})^{\top}\right] &= {\mathbb{E}}\left[|\varphi(X)-\gamma\varphi(X')|^2\varphi(X)\varphi(X)^{\top}\right] \\ &\leq (1+\gamma)^2{\mathbb{E}}\left[\varphi(X)\varphi(X)^{\top}\right] = (1+\gamma)^2\Sigma_0. \end{align}\] Now let us prove ?? \[\begin{align} {\mathbb{E}}\left[(h^{\rm TD})^{\top}h^{\rm TD}\right] &= {\mathbb{E}}\left[|\varphi(X)|^2 (\varphi(X)-\gamma\varphi(X')) (\varphi(X)-\gamma\varphi(X'))^{\top}\right] \\ &\leq {\mathbb{E}}\left[ (\varphi(X)-\gamma\varphi(X')) (\varphi(X)-\gamma\varphi(X'))^{\top}\right] \\ &= {\mathbb{E}}\left[ (1+\gamma^2)\varphi(X)\varphi(X)^{\top} -\gamma(\varphi(X)\varphi(X')^{\top}+\varphi(X')\varphi(X))\right] \\ &= (1+\gamma^2)\Sigma_0 -\gamma(\Sigma_1+\Sigma_1^{\top}) \\ &= (1+\gamma)S^{\rm TD} -\gamma(1-\gamma)\left(\Sigma_0+\frac{\Sigma_1+\Sigma_1^{\top}}{2}\right) \\ &\leq (1+\gamma)S^{\rm TD}. \end{align}\] We conclude the proof with ?? : \[{\mathbb{E}}\left[(h^{\rm TD}\theta^*-b^{\rm TD})(h^{\rm TD}\theta^*-b^{\rm TD})^{\top}\right] = {\mathbb{E}}\left[|\delta(X,X',\theta^*)|^2\varphi(X)\varphi(X)^{\top}\right] \leq \sigma_0^2\Sigma_0.\] ◻
The results presented here are used to prove the results in 3.4.
Lemma 12. Assume [hypo:iid], [hypo:R] and [hypo:linear95bis]. We have \[\begin{align} \label{eq:bound95S95bis} (1-\gamma)\Sigma_0 &\leq S^{\rm TD} \leq (1+\gamma)\Sigma_0, \\ \label{eq:bound95HHtop95bis} {\mathbb{E}}\left[h^{\rm TD}(h^{\rm TD})^{\top}\right] &\leq ((1-\gamma)^2c_{\gamma}^2+(1+\gamma)^2)\Sigma_0, \\ \label{eq:ss095bis} {\mathbb{E}}\left[(h^{\rm TD}\theta^*-b^{\rm TD})(h^{\rm TD}\theta^*-b^{\rm TD})^{\top}\right] &\leq \sigma_0^2\Sigma_0, \\ \label{eq:Sigma0U} {\left\| \Sigma_0U-U^{\top}\Sigma_0 \right\|_{\rm op}^{}} &\leq 2, \\ \label{eq:Sima095Id-gammaU} {\left\| \Sigma_0(I_d-\gamma U) \right\|_{F}^{2}} &\leq (1-\gamma)^2((c_{\gamma}^2+1)^2+1)+2(1+\gamma)^2, \end{align}\] {#eq: sublabel=eq:eq:bound95S95bis,eq:eq:bound95HHtop95bis,eq:eq:ss095bis,eq:eq:Sigma0U,eq:eq:Sima095Id-gammaU}
Proof. The proofs of ?? and ?? are similar as the ones of ?? and ?? . To get ?? , we compute \[\begin{align} {\mathbb{E}}\left[h^{\rm TD}(h^{\rm TD})^{\top}\right] &= {\mathbb{E}}\left[|\varphi(X)-\gamma\varphi(X')|^2\varphi(X)\varphi(X)^{\top}\right] \\ &\leq ((1-\gamma)^2c_{\gamma}^2+(1+\gamma)^2)\Sigma_0, \end{align}\] where we used that \(|\varphi(X)-\gamma\varphi(X')|^2=(1-\gamma)^2c_{\gamma}^2+|\varphi_{(-1)}(X)-\gamma\varphi_{(-1)}(X')|^2 \leq (1-\gamma)^2c_{\gamma}^2+(1+\gamma)^2\).
It only remains to prove ?? . Let us define \({\widetilde{\Sigma}}_0,{\widetilde{\Sigma}}_1\in \mathbb{R}^{(d-1)\times(d-1)}\) by \[{\widetilde{\Sigma}}_0 = {\mathbb{E}}\left[(\varphi_{(-1)}(X)-\mu_{(-1)})(\varphi_{(-1)}(X)-\mu_{(-1)})^{\top}\right]\text{ and }{\widetilde{\Sigma}}_1 = {\mathbb{E}}\left[(\varphi_{(-1)}(X)-\mu_{(-1)})(\varphi_{(-1)}(X')-\mu_{(-1)})^{\top}\right].\] Define \({\widetilde{U}}={\widetilde{\Sigma}}_0^{-\frac{1}{2}}{\widetilde{\Sigma}}_1{\widetilde{\Sigma}}_0^{-\frac{1}{2}}\). Consider \[L = \begin{pmatrix} c_{\gamma} & 0\\ \mu_{(-1)} & {\widetilde{\Sigma}}_0^{\frac{1}{2}} \end{pmatrix}\text{ so that}LL^{\top}={\widetilde{\Sigma}}_0,L\begin{pmatrix} 1&0\\ 0&{\widetilde{U}} \end{pmatrix}L^{\top}={\widetilde{\Sigma}}_1,L^{\top}L = Q^{\top}{\widetilde{\Sigma}}_0Q\text{ and }U=Q\begin{pmatrix} 1&0\\ 0&{\widetilde{U}} \end{pmatrix}Q^{\top},\] where \(Q:={\widetilde{\Sigma}}_0^{-\frac{1}{2}}L\in {\mathcal{O}}( \mathbb{R}^{d-1})\). This implies that \[\begin{align} Q^{\top}(\Sigma_0U-U^{\top}\Sigma_0)Q &= L^{\top}L \begin{pmatrix} 1&0\\ 0&{\widetilde{U}} \end{pmatrix} -\begin{pmatrix} 1&0\\ 0&{\widetilde{U}}^{\top} \end{pmatrix}L^{\top}L \\ &= \begin{pmatrix} c_{\gamma}^2+|\mu_{(-1)}|^2& \mu_{(-1)}^{\top}{\widetilde{\Sigma}}_0^{\frac{1}{2}}\\ {\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}&{\widetilde{\Sigma}}_0 \end{pmatrix} \begin{pmatrix} 1&0\\ 0&{\widetilde{U}} \end{pmatrix} -\begin{pmatrix} 1&0\\ 0&{\widetilde{U}} \end{pmatrix} \begin{pmatrix} c_{\gamma}^2+|\mu_{(-1)}|^2 &\mu_{(-1)}^{\top}{\widetilde{\Sigma}}_0^{\frac{1}{2}}\\ {\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}&{\widetilde{\Sigma}}_0 \end{pmatrix} \begin{pmatrix} 1&0\\ 0&{\widetilde{U}} \end{pmatrix} \\ &= \begin{pmatrix} c_{\gamma}^2+|\mu_{(-1)}|^2 &\mu_{(-1)}^{\top}{\widetilde{\Sigma}}_0^{\frac{1}{2}}{\widetilde{U}}\\ {\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}&{\widetilde{\Sigma}}_0{\widetilde{U}} \end{pmatrix} -\begin{pmatrix} c_{\gamma}^2+|\mu_{(-1)}|^2& \mu_{(-1)}^{\top}{\widetilde{\Sigma}}_0^{\frac{1}{2}}\\ {\widetilde{U}}^{\top}{\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}&{\widetilde{U}}^{\top}{\widetilde{\Sigma}}_0 \end{pmatrix} \\ &= \begin{pmatrix} 0&\mu_{(-1)}^{\top}{\widetilde{\Sigma}}_0^{\frac{1}{2}}({\widetilde{U}}-I_d)\\ (I_d-{\widetilde{U}}^{\top}){\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}&{\widetilde{\Sigma}}_0{\widetilde{U}}-{\widetilde{U}}^{\top}{\widetilde{\Sigma}}_0 \end{pmatrix}. \\ &= \begin{pmatrix} 0&-y^{\top}\\ y &0 \end{pmatrix} +\begin{pmatrix} 0&0\\ 0&{\widetilde{\Sigma}}_0{\widetilde{U}}-{\widetilde{U}}^{\top}{\widetilde{\Sigma}}_0 \end{pmatrix}, \end{align}\] where \(y:=(I_d-{\widetilde{U}}^{\top}){\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}\). Therefore, we obtain \[\label{eq:aux95antisym} {\left\| \Sigma_0U-U^{\top}\Sigma_0 \right\|_{\rm op}^{}} \leq |y|^2 +{\left\| {\widetilde{\Sigma}}_0{\widetilde{U}}-{\widetilde{U}}^{\top}{\widetilde{\Sigma}}_0 \right\|_{\rm op}^{}}.\tag{24}\] On the one hand, we have \[\begin{align} |y|^2 \leq 2{\left\| {\widetilde{\Sigma}}_0^{\frac{1}{2}} \right\|_{\rm op}^{}}|\mu_{(-1)}| \leq {\left\| {\widetilde{\Sigma}}_0 \right\|_{\rm op}^{}}+|\mu_{(-1)}|^2 &\leq {\rm tr}({\widetilde{\Sigma}}_0)+|\mu_{(-1)}|^2 \\ &= {\mathbb{E}}\left[|\varphi_{(-1)}(X)-\mu_{(-1)}|^2\right]+\mu_{(-1)}^2 = {\mathbb{E}}\left[|\varphi_{(-1)}(X)|^2\right] \leq 1. \end{align}\] On the other hand, take \((\lambda_i,v_i)_{1\leq i\leq d-1}\) the couples of eigenvalues and eigenvectors of \({\widetilde{\Sigma}}_0\), we have \[\begin{align} {\left\| {\widetilde{\Sigma}}_0{\widetilde{U}}-{\widetilde{U}}^{\top}{\widetilde{\Sigma}}_0 \right\|_{\rm op}^{}} &= \sum_{i=1}^{d-1} \lambda_i(v_i({\widetilde{U}}^{\top}v_i)^{\top}-({\widetilde{U}}^{\top}v_i)v_i^{\top}) \\ &\leq \sum_{i=1}^{d-1} \lambda_i {\left\| v_i({\widetilde{U}}^{\top}v_i)^{\top}-({\widetilde{U}}^{\top}v_i)v_i^{\top} \right\|_{\rm op}^{}} \\ &\leq \sum_{i=1}^{d-1} \lambda_i |v_i||{\widetilde{U}}^{\top}v_i| \\ &\leq \sum_{i=1}^{d-1}\lambda_i ={\rm tr}({\widetilde{\Sigma}}_0)\leq 1. \end{align}\] where we used Lemma 13 to get the third line, \(\|{\widetilde{U}}\|_{\rm op}\leq1\) to get the last line. We conclude using 24 and the above inequalities.
Let us now prove Inequality ?? . Using similar computations as above, we have \[\begin{align} Q\Sigma_0(I_d-\gamma U)Q^{\top} = L^{\top}L \left(I_d-\gamma \begin{pmatrix} 1&0\\ 0&{\widetilde{U}} \end{pmatrix}\right) &= \begin{pmatrix} c_{\gamma}^2+|\mu_{(-1)}|^2& \mu_{(-1)}^{\top}{\widetilde{\Sigma}}_0^{\frac{1}{2}}\\ {\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}&{\widetilde{\Sigma}}_0 \end{pmatrix} \begin{pmatrix} 1-\gamma&0\\ 0&I_{d-1}-\gamma{\widetilde{U}} \end{pmatrix} \\ &= \begin{pmatrix} (1-\gamma)(c_{\gamma}^2+|\mu_{(-1)}|^2)& \mu_{(-1)}^{\top}{\widetilde{\Sigma}}_0^{\frac{1}{2}}(I_{d-1}-\gamma {\widetilde{U}})\\ (1-\gamma){\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}&{\widetilde{\Sigma}}_0(I_{d-1}-\gamma {\widetilde{U}}) \end{pmatrix}. \end{align}\] Therefore, we obtain \[\begin{align} {\left\| \Sigma_0(I_d-\gamma U)Q^{\top} \right\|_{F}^{2}} &= (1-\gamma)^2(c_{\gamma}^2+|\mu_{(-1)}|^2)^2 +\left|(I_d-\gamma {\widetilde{U}}^{\top}){\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}\right|^2 \\ &+\left|(1-\gamma){\widetilde{\Sigma}}_0^{\frac{1}{2}}\mu_{(-1)}\right|^2 +{\left\| {\widetilde{\Sigma}}_0(I_{d-1}-\gamma {\widetilde{U}}) \right\|_{F}^{2}} \\ &\leq (1-\gamma)^2(c_{\gamma}^2+1)^2 +(1+\gamma)^2 +(1-\gamma)^2 +(1+\gamma)^2 \\ &= (1-\gamma)^2((c_{\gamma}^2+1)^2+1)+2(1+\gamma)^2, \end{align}\] where we used \(\|{\widetilde{U}}\|_{\rm op},\|{\widetilde{\Sigma}}\|_{\rm op}\leq 1\) and \({\left\| {\widetilde{\Sigma}}_0(I_{d-1}-\gamma {\widetilde{U}}) \right\|_{F}^{2}} \leq(1+\gamma)^2{\rm tr}({\widetilde{\Sigma}}_0^2)\leq (1+\gamma)^2{\rm tr}({\widetilde{\Sigma}}_0)\leq (1+\gamma)^2\) since \({\rm tr}({\widetilde{\Sigma}}_0)={\mathbb{E}}[|\varphi_{(-1)}(X)|]\leq1\). ◻
Lemma 13. For \(u,v\in \mathbb{R}^d\), we have \({\left\| uv^{\top}-vu^{\top} \right\|_{\rm op}^{}}\leq |v||u|\).
Proof. It is sufficient to prove the result for \(|u|=|v|=1\). Take \(v=\lambda_1 u+\lambda_2w\), with \(\lambda_1^2+\lambda_2^2=1\), \(w\in u^{\perp}\) and \(|w|=1\). We have \[uv^{\top}-vu^{\top} = \lambda_2(uw^{\top}-wu^{\top}).\] Moreover, since \(u\perp w\), for any \(x\in \mathbb{R}^d\), we have \[|(uw^{\top}-wu^{\top})x|^2 = |w^{\top}x|^2+|u^{\top}x|^2 = \left|\Pi_{{\rm Span}(u,w)}x\right|^2 \leq |x|^2,\] where \(\Pi_{{\rm Span}(u,w)}\) is the orthogonal projection on Span\((u,w)\). Therefore, we obtain \[{\left\| uv^{\top}-vu^{\top} \right\|_{\rm op}^{}} \leq \lambda_2 {\left\| uw^{\top}-wu^{\top} \right\|_{\rm op}^{}} \leq \lambda_2 \leq 1.\] This concludes the proof. ◻
For PCTD(0), we need to inequalities stated in the following lemma.
Lemma 14. Assume [hypo:iid]-[hypo:spectral95gap]. Define \({\widehat h}=\frac{1}{2}(\varphi(X)-\varphi({\widetilde{X}})) \left(\varphi(X)-\gamma\varphi(X') -(\varphi({\widetilde{X}})-\gamma\varphi({\widetilde{X}}'))\right)^{\top}\), \({\widehat{\Sigma}}_0=\Sigma_0-\mu\mu^{\top}\), \({\widehat{\Sigma}}_1=\Sigma_1-\mu\mu^{\top}\), \({\widehat U}={\widehat{\Sigma}}_0^{-\frac{1}{2}}{\widehat{\Sigma}}_1{\widehat{\Sigma}}_0^{-\frac{1}{2}}\), \({\widehat H}={\mathbb{E}}[{\widehat h}]={\widehat{\Sigma}}_0-\gamma{\widehat{\Sigma}}_1=H-(1-\gamma)\mu\mu^{\top}\) and \({\widehat{S}}=\frac{{\widehat H}+{\widehat H}^{\top}}{2}\). we have \[\begin{align} \label{eq:bound95Uh} {\left\| U \right\|_{\rm op}^{}} &\leq 1-g \\ \label{eq:bound95Sh} (1-(1-g)\gamma){\widehat{\Sigma}}_0 &\leq {\widehat{S}} \leq (1+(1-g)\gamma){\widehat{\Sigma}}_0, \\ \label{eq:bound95HhHhtop} {\mathbb{E}}\left[{\widehat h}{\widehat h}^{\top}\right] &\leq 2(1+\gamma)^2{\widehat{\Sigma}}_0, \\ \label{eq:bound95hhhtophhh} {\mathbb{E}}\left[{\widehat h}^{\top}{\widehat h}\right] &\leq 2(1+\gamma){\widehat{S}}, \\ \label{eq:ssh0} {\mathbb{E}}\left[({\widehat h}\theta^*-{\widehat b})({\widehat h}\theta^*-{\widehat b})^{\top}\right] &\leq 2{\widehat{\sigma}}_0^2{\widehat{\Sigma}}_0. \end{align}\] {#eq: sublabel=eq:eq:bound95Uh,eq:eq:bound95Sh,eq:eq:bound95HhHhtop,eq:eq:bound95hhhtophhh,eq:eq:ssh0}
Proof. Let \(x,y\in \mathbb{R}^d\) with \(|x|=|y|=1\), define \(\theta_x={\widehat{\Sigma}}_0^{-\frac{1}{2}}x\) and \(\theta_y={\widehat{\Sigma}}_0^{-\frac{1}{2}}y\), we have \[\begin{align} x^{\top}{\widehat U}y = \theta_x^{\top}{\widehat{\Sigma}}_1\theta_y &= {\mathbb{E}}\left[{\widehat v}(X,\theta_x){\widehat v}(X',\theta_y)\right] \\ &= {\mathbb{E}}\left[{\widehat v}(X,\theta_x){\mathbb{E}}\left[{\widehat v}(X',\theta_y)\,\big\|\,X\right]\right] \\ &\leq {\mathbb{E}}\left[{\widehat v}(X,\theta_x)^2\right]^{\frac{1}{2}} {\mathbb{E}}\left[{\mathbb{E}}\left[{\widehat v}(X',\theta_y)\,\big\|\,X\right]^2\right]^{\frac{1}{2}} \\ &\leq (1-g) {\mathbb{E}}\left[{\widehat v}(X,\theta_x)^2\right]^{\frac{1}{2}} {\mathbb{E}}\left[{\widehat v}(X,\theta_y)^2\right]^{\frac{1}{2}} \\ &= (1-g) (\theta_x^{\top}{\widehat{\Sigma}}_0\theta_x)^{\frac{1}{2}} (\theta_y^{\top}{\widehat{\Sigma}}_0\theta_y)^{\frac{1}{2}} \\ &= (1-g) |x||y| =1-g, \end{align}\] which implies Inequality ?? . Using this, Inequality ?? is straightforward. Finally, the proofs of the remaining inequalities are similar as the ones of their counterparts from Lemma 11. ◻