Year: 2021

Abstract:
This paper considers a novel multi-agent linear stochastic approximation algorithm driven by Markovian noise and general consensus-type interaction, in which each agent evolves according to its local stochastic approximation process which depends on the information from its neighbors. The interconnection structure among the agents is described by a time-varying directed graph. While the convergence of consensus-based stochastic approximation algorithms when the interconnection among the agents is described by doubly stochastic matrices (at least in expectation) has been studied, less is known about the case when the interconnection matrix is simply stochastic. For any uniformly strongly connected graph sequences whose associated interaction matrices are stochastic, the paper derives finite-time bounds on the mean-square error, defined as the deviation of the output of the algorithm from the unique equilibrium point of the associated ordinary differential equation. For the case of interconnection matrices being stochastic, the equilibrium point can be any unspecified convex combination of the local equilibria of all the agents in the absence of communication. Both the cases with constant and time-varying step-sizes are considered. In the case when the convex combination is required to be a straight average and interaction between any pair of neighboring agents may be uni-directional, so that doubly stochastic matrices cannot be implemented in a distributed manner, the paper proposes a push-type distributed stochastic approximation algorithm and provides its finite-time bounds for the performance by leveraging the analysis for the consensus-type algorithm with stochastic matrices.

heading: 1 INTRODUCTION
text: The use of reinforcement learning (RL) to obtain policies that describe solutions to a Markov decision process (MDP) in which an autonomous agent interacting with an unknown environment aims to optimize its long term reward is now standard Sutton & Barto (1998). Multi-agent or distributed reinforcement learning is useful when a team of agents interacts with an unknown environment or system and aims to collaboratively accomplish tasks involving distributed decision-making. Distributed here implies that agents exchange information only with their neighbors according to a certain communication graph. Recently, many distributed algorithms for multi-agent RL have been proposed and analyzed (Zhang et al., 2019). The basic result in such works is of the type that if the graph describing the communication among the agents is bi-directional (and hence can be represented by a doubly stochastic matrix), then an algorithm that builds on traditional consensus algorithms converges to a solution in terms of policies to be followed by the agents that optimize the sum of the utility functions of all the agents; further, both finite and infinite time performance of such algorithms can be characterized (Doan et al., 2019; Zhang et al., 2018b).
This paper aims to relax the assumption of requiring bi-directional communication among agents in a distributed RL algorithm. This assumption is arguably restrictive and will be violated due to reasons such as packet drops or delays, differing privacy constraints among the agents, heterogeneous capabilities among the agents in which some agents may be able to communicate more often or with more power than others, adversarial attacks, or even sophisticated resilient consensus algorithms being used to construct the distributed RL algorithm. A uni-directional communication graph can be represented through a (possibly time-varying) stochastic – which may not be doubly stochastic – matrix being used in the algorithm. As we discuss in more detail below, relaxing the assumption of a doubly stochastic matrix to simply a stochastic matrix in the multi-agent and distributed RL algorithms that have been proposed in the literature, however, complicates the proofs of their convergence and finite time performance characterizations. The main result in this paper is to provide a finite time bound on the mean-square error for a multi-agent linear stochastic approximation algorithm in which the agents interact over a time-varying directed graph characterized by a stochastic matrix. This paper, thus, extends the applicability of distributed and multi-agent RL
algorithms presented in the literature to situations such as those mentioned above where bidirectional communication at every time step cannot be guaranteed. As we shall see, this extension is technically challenging and requires new proof techniques that may be of independent interest.
Related Work (See Appendix B for more related work) Many distributed reinforcement learning algorithms have now been proposed in the literature. In this setting, each agent can receive information only from its neighbors, and no single agent can solve the problem alone or by ‘taking the lead’. A backbone of almost all distributed RL algorithms proposed in the literature is the consensus-type interaction among the agents, dating back at least to Tsitsiklis (1984). Many works have analyzed asymptotic convergence of such RL algorithms using ODE methods (Zhang & Zavlanos, 2019; Zhang et al., 2018b; Suttle et al., 2020; Zhang et al., 2018a). This can be viewed as an application of ideas from distributed stochastic approximation (Kushner & Yin, 1987; Stanković et al., 2010; Huang, 2012; Stanković & Stanković, 2016; Bianchi et al., 2013; Stanković et al., 2016). Finite-time performance guarantees for distributed RL have also been provided in works, most notably in Doan et al. (2019; 2021); Wang et al. (2020); Zhang et al. (2021); Sun et al. (2020); Zeng et al. (2020).
The assumption that is the central concern of this paper and is made in all the existing finite-time analyses for distributed RL algorithms is that the consensus interaction is characterized by doubly stochastic matrices (Doan et al., 2019; 2021; Wang et al., 2020; Zhang et al., 2021; Sun et al., 2020; Zeng et al., 2020) at every time step, or at least in expectation, i.e., W1 = 1 and 1>E(W ) = 1> (Bianchi et al., 2013). Intuitively, doubly stochastic matrices imply symmetry in the communication graph, which almost always requires bidirectional communication graphs. More formally, the assumption of doubly stochastic matrices is restrictive since distributed construction of a doubly stochastic matrix needs to either invoke algorithms such as the Metropolis algorithm (Xiao et al., 2005) which requires bi-directional communication of each agent’s degree information; or to utilize an additional distributed algorithm (Gharesifard & Cortés, 2012) which significantly increases the complexity of the whole algorithm design. Doubly stochastic matrices in expectation can be guaranteed via so-called broadcast gossip algorithms which still requires bi-directional communication for convergence (Bianchi et al., 2013). In a realistic network, especially with mobile agents such as autonomous vehicles, drones, or robots, uni-directional communication is inevitable due to various reasons such as asymmetric communication and privacy constraints, non-zero communication failure probability between any two agents at any given time, and application of resilient consensus in the presence of adversary attacks (Vaidya et al., 2012; LeBlanc et al., 2013), all leading to an interaction among the agents characterized by a stochastic matrix, which may further be timevarying. The problem of design of distributed RL algorithms with time-varying stochastic matrices and characterizing either their asymptotic convergence or finite time analysis remains open.
As a step towards solving this problem, we propose a novel distributed stochastic approximation algorithm and provide its convergence analyses when a time-dependent stochastic matrix is being used due to uni-directional communication in a dynamic network. One of the first guarantees to be lost as the assumption of doubly stochastic matrices is removed is that the algorithm converges to a “policy” that maximizes the sum of reward functions of all the agents. Instead, the convergence is to a set of policies that optimize a convex combination of the network-wise accumulative reward, with the exact combination depending on the limit product of the infinite sequence of stochastic matrices. Nonetheless, by defining the error as the deviation of the output of the algorithm from the eventual equilibrium point, we derive finite-time bounds on the mean-square error. We consider both the cases with constant and time-varying step sizes. In the important special case where the goal is to optimize the average of the individual accumulative rewards of all the agents, we provide a distributed stochastic approximation algorithm, which builds on the push-sum idea (Kempe et al., 2003) that has been used to solve distributed averaging problem over strongly connected graphs, and characterize its finite-time performance. Thus, this paper provides the first distributed algorithm that can be applied (e.g., in Temporal difference (TD) learning, see Appendix D) to converge to the policy maximizing the team objective of the sum of the individual utility functions over time-varying, unidirectional, communication graphs, and characterizes the finite-time bounds on the mean-square error of the algorithm output from the equilibrium point under appropriate assumptions.
Technical Innovation and Contributions There are two main technical challenges in removing the assumption of doubly stochastic matrices being used in the analysis of distributed stochastic approximation algorithms. The first is in the direction of finite-time analysis. For distributed RL algorithms, finite-time performance analysis essentially boils down to two parts, namely bounding the consensus error and bounding the “single-agent” mean-square error. For the case when consensus
interaction matrices are all doubly stochastic, the consensus error bound can be derived by analyzing the square of the 2-norm of the deviation of the current state of each agent from the average of the states of the agents. With consensus in the presence of doubly stochastic matrices, the average of the states of the agents remains invariant. Thus, it is possible to treat the average value as the state of a fictitious agent to derive the mean-square consensus error bound with respect to the limiting point. More formally, this process relies on two properties of a doubly stochastic matrix W , namely that (1) 1>W = 1>, and (2) if xt+1 = Wxt, then ‖xt+1 − (1>xt+1)1‖2 ≤ σ2(W )‖xt − (1>xt)1‖2 where σ2(W ) denotes the second largest singular value of W (which is strictly less than one if W is irreducible). Even if the doubly stochastic matrix is time-varying (denoted by Wt), property (1) still holds and property (2) can be generalized as in Nedić et al. (2018). Thus, the square of the 2-norm ‖xt − (1>xt)1‖22 is a quadratic Lyapunov function for the average consensus processes. Doubly stochastic matrices in expectation can be treated in the same way by looking at the expectation. This is the core on which all the existing finite-time analyses of distributed RL algorithms are based.
However, if each consensus interaction matrix is stochastic, and not necessarily doubly stochastic, the above two properties may not hold. In fact, it is well known that quadratic Lyapunov functions for general consensus processes xt+1 = Stxt, with St being stochastic, do not exist (Olshevsky & Tsitsiklis, 2008). This breaks down all the existing analyses and provides the first technical challenge that we tackle in this paper. Specifically, we appeal to the idea of quadratic comparison functions for general consensus processes. This was first proposed in Touri (2012) and makes use of the concept of “absolute probability sequences”. We provide a general analysis methodology and results that subsume the existing finite-time analyses for single-timescale distributed linear stochastic approximation and TD learning as special cases (see Appendix D).
The second technical challenge arises from the fact that with stochastic matrices, the distributed RL algorithms may not converge to the policies that maximize the average of the utility functions of the agents. To regain this property, we propose a new algorithm that utilizes a push-sum protocol for consensus. However, finite-time analysis for such a push-based distributed algorithm is challenging. Almost all, if not all, the existing push-based distributed optimization works build on the analysis in Nedić & Olshevsky (2014); however, that analysis assumes that a convex combination of the entire history of the states of each agent (and not merely the current state of the agent) is being calculated. This assumption no longer holds in our case. To obtain a direct finite-time error bound without this assumption, we propose a new approach to analyze our push-based distributed algorithm by leveraging our consensus-based analyses to establish direct finite-time error bounds for stochastic approximation. Specifically, we tailor an “absolute probability sequence” for the pushbased stochastic approximation algorithm and exploit its properties. Such properties have never been found in the existing literature and may be of independent interest for analyzing any push-sum based distributed algorithm.
We now list the main contributions of our work. We propose a novel consensus-based distributed linear stochastic approximation algorithm driven by Markovian noise in which each agent evolves according to its local stochastic approximation process and the information from its neighbors. We assume only a (possibly time-varying) stochastic matrix being used during the consensus phase, which is a more practical assumption when only unidirectional communication is possible among agents. We establish both convergence guarantees and finite-time bounds on the mean-square error, defined as the deviation of the output of the algorithm from the unique equilibrium point of the associated ordinary differential equation. The equilibrium point can be an “uncontrollable” convex combination of the local equilibria of all the agents in the absence of communication. We consider both the cases of constant and time-varying step-sizes. Our results subsume the existing results on convergence and finite-time analysis of distributed RL algorithms that assume doubly stochastic matrices and bi-directional communication as special cases. In the case when the convex combination is required to be a straight average and interaction between any pair of neighboring agents may be uni-directional, we propose a push-type distributed stochastic approximation algorithm and establish its finite-time performance bound. It is worth emphasizing that it is straightforward to extend our algorithm from the straight average point to any pre-specified convex combination. Since it is well known that TD algorithms can be viewed as a special case of linear stochastic approximation (Tsitsiklis & Roy, 1997), our distributed linear stochastic approximation algorithms and their finitetime bounds can be applied to TD algorithms in a straight-forward manner; (see distributed TD(λ) in Appendix D).
Notation We use Xt to represent that a variable X is time-dependent and t ∈ {0, 1, 2, . . .} is the discrete time index. The ith entry of a vector x will be denoted by xi and, also, by (x)i when convenient. The ijth entry of a matrixAwill be denoted by aij and, also, by (A)ij when convenient. We use 1n to denote the vectors in Rn whose entries all equal to 1’s, and I to denote the identity matrix, whose dimension is to be understood from the context. Given a set S with finitely many elements, we use |S| to denote the cardinality of S. We use d·e to denote the ceiling function. A vector is called a stochastic vector if its entries are nonnegative and sum to one. A square nonnegative matrix is called a row stochastic matrix, or simply stochastic matrix, if its row sums all equal one. Similarly, a square nonnegative matrix is called a column stochastic matrix if its column sums all equal one. A square nonnegative matrix is called a doubly stochastic matrix if its row sums and column sums all equal one. The graph of an n × n matrix is a direct graph with n vertices and a directed edge from vertex i to vertex j whenever the ji-th entry of the matrix is nonzero. A directed graph is strongly connected if it has a directed path from any vertex to any other vertex. For a strongly connected graph G, the distance from vertex i to another vertex j is the length of the shortest directed path from i to j; the longest distance among all ordered pairs of distinct vertices i and j in G is called the diameter of G. The union of two directed graphs, Gp and Gq , with the same vertex set, written Gp ∪Gq , is meant the directed graph with the same vertex set and edge set being the union of the edge set of Gp and Gq . Since this union is a commutative and associative binary operation, the definition extends unambiguously to any finite sequence of directed graphs.

heading: 2 DISTRIBUTED LINEAR STOCHASTIC APPROXIMATION
text: Consider a network consisting of N agents. For the purpose of presentation, we label the agents from 1 through N . The agents are not aware of such a global labeling, but can differentiate between their neighbors. The neighbor relations among the N agents are characterized by a time-dependent directed graph Gt = (V, Et) whose vertices correspond to agents and whose directed edges (or arcs) depict neighbor relations, where V = {1, . . . , N} is the vertex set and Et = V × V is the edge set at time t. Specifically, agent j is an in-neighbor of agent i at time t if (j, i) ∈ Et, and similarly, agent k is an out-neighbor of agent i at time t if (i, k) ∈ Et. Each agent can send information to its out-neighbors and receive information from its in-neighbors. Thus, the directions of edges represent the directions of information flow. For convenience, we assume that each agent is always an in- and out-neighbor of itself, which implies that Gt has self-arcs at all vertices for all time t. We use N it and N i−t to denote the in- and out-neighbor set of agent i at time t, respectively, i.e., N it = {j ∈ V : (j, i) ∈ Et}, N i−t = {k ∈ V : (i, k) ∈ Et}. It is clear that N it and N i−t are nonempty as they both contain index i. We propose the following distributed linear stochastic approximation over a time-varying neighbor graph sequence {Gt}. Each agent i has control over a random vector θit which is updated by
θit+1 = ∑ j∈N it wijt θ j t + αt ( A(Xt) ∑ j∈N it wijt θ j t + b i(Xt) ) , i ∈ V, t ∈ {0, 1, 2, . . .}, (1)
where wijt are consensus weights, αt is the step-size at time t, A(Xt) is a random matrix and b i(Xt) is a random vector, both generated based on the Markov chain {Xt} with state spaces X . It is worth noting that the update of each agent only uses its in-neighbors’ information and thus is distributed.
Remark 1 The work of Kushner & Yin (1987) considers a different consensus-based networked linear stochastic approximation as follows:
θit+1 = ∑ j∈N it wijt θ j t + αt ( A(Xt)θ i t + b i(Xt) ) , i ∈ V, t ∈ {0, 1, 2, . . .}, (2)
whose state form is Θt+1 = WtΘt+αtΘtA(Xt)>+αtB(Xt), and mainly focuses on asymptotically weakly convergence for the fixed step-size case (i.e., αt = α for all t). Under the similar set of conditions, with its condition (C3.4’) being a stochastic analogy for Assumption 6, Theorem 3.1 in Kushner & Yin (1987) shows that equation 2 has a limit which can be verified to be the same as θ∗, the limit of equation 1. How to apply the finite-time analysis tools in this paper to equation 2 has so far eluded us. The two updates equation 1 and equation 2 are analogous to the “combine-thenadapt” and “adapt-then-combine” diffusion strategies in distributed optimization (Chen & Sayed, 2012).
We impose the following assumption on the weights wijt which has been widely adopted in consensus literature (Jadbabaie et al., 2003; Olfati-Saber et al., 2007; Nedić & Liu, 2017).
Assumption 1 There exists a constant β > 0 such that for all i, j ∈ V and t, wijt ≥ β whenever j ∈ N it . For all i ∈ V and t, ∑ j∈N it wijt = 1.
Let Wt be the N × N matrix whose ijth entry equals wijt if j ∈ N it and zero otherwise. From Assumption 1, each Wt is a stochastic matrix that is compliant with the neighbor graph Gt. Since each agent i is always assumed to be an in-neighbor of itself, all diagonal entries of Wt are positive. Thus, if Gt is strongly connected, Wt is irreducible and aperiodic. To proceed, define
Θt =  (θ 1 t ) >
... (θNt ) >
 , B(Xt) =  (b 1(Xt)) >
... (bN (Xt)) >  . Then, the N linear stochastic recursions in equation 1 can be combined and written as
Θt+1 = WtΘt + αtWtΘtA(Xt) > + αtB(Xt), t ∈ {0, 1, 2, . . .}. (3)
The goal of this section is to characterize the finite-time performance of equation 1, or equivalently equation 3, with the following standard assumptions, which were adopted e.g. in Srikant & Ying (2019); Doan et al. (2019).
Assumption 2 There exists a matrix A and vectors bi, i ∈ V , such that
lim t→∞ E[A(Xt)] = A, lim t→∞
E[bi(Xt)] = b i, i ∈ V.
Define bmax = maxi∈V supx∈X ‖bi(x)‖2 < ∞ and Amax = supx∈X ‖A(x)‖2 < ∞. Then, ‖A‖2 ≤ Amax and ‖bi‖2 ≤ bmax, i ∈ V .
Assumption 3 Given a positive constant α, we use τ(α) to denote the mixing time of the Markov chain {Xt} for which ‖E[A(Xt)−A|X0 = X]‖2 ≤ α, ∀X, ∀t ≥ τ(α),‖E[bi(Xt)− bi|X0 = X]‖2 ≤ α, ∀X, ∀t ≥ τ(α), ∀i ∈ V. The Markov chain {Xt} mixes at a geometric rate, i.e., there exists a constant C such that τ(α) ≤ −C logα.
Assumption 4 All eigenvalues of A have strictly negative real parts, i.e., A is a Hurwitz matrix. Then, there exists a symmetric positive definite matrix P , such that A>P + PA = −I . Let γmax and γmin be the maximum and minimum eigenvalues of P , respectively.
Assumption 5 The step-size sequence {αt} is positive, non-increasing, and satisfies ∑∞ t=0 αt =∞
and ∑∞ t=0 α 2 t <∞.
To state our first main result, we need the following concepts.
Definition 1 A graph sequence {Gt} is uniformly strongly connected if there exists a positive integer L such that for any t ≥ 0, the union graph∪t+L−1k=t Gk is strongly connected. If such an integer exists, we sometimes say that {Gt} is uniformly strongly connected by sub-sequences of length L.
Remark 2 Two popular joint connectivity definitions in consensus literature are “B-connected” (Nedić et al., 2009) and “repeatedly jointly strongly connected” (Cao et al., 2008). A graph sequence {Gt} is B-connected if there exists a positive integer B such that the union graph ∪(k+1)B−1t=kB Gt is strongly connected for each integer k ≥ 0. Although the uniformly strongly connectedness looks more restrictive compared with B-connectedness at first glance, they are in fact equivalent. To see this, first it is easy to see that if {Gt} is uniformly strongly connected, {Gt} must
be B-connected; now supposing {Gt} is B-connected, for any fix t, the union graph ∪t+2B−1k=t Gk must be strongly connected, and thus {Gt} is uniformly strongly connected by sub-sequences of length 2B. Thus, the two definitions are equivalent. It is also not hard to show that the uniformly strongly connectedness is equivalent to “repeatedly jointly strongly connectedness” provided the graphs under consideration all have self-arcs at all vertices, as “repeatedly jointly strongly connectedness” is defined upon “graph composition”.
Definition 2 Let {Wt} be a sequence of stochastic matrices. A sequence of stochastic vectors {πt} is an absolute probability sequence for {Wt} if π>t = π>t+1Wt for all t ≥ 0.
This definition was first introduced by Kolmogorov (Kolmogoroff, 1936). It was shown by Blackwell (Blackwell, 1945) that every sequence of stochastic matrices has an absolute probability sequence. In general, a sequence of stochastic matrices may have more than one absolute probability sequence; when the sequence of stochastic matrices is “ergodic”, it has a unique absolute probability sequence (Nedić & Liu, 2017). It is easy to see that when Wt is a fixed irreducible stochastic matrix W , πt is simply the normalized left eigenvector of W for eigenvalue one. More can be said.
Lemma 1 Suppose that Assumption 1 holds. If {Gt} is uniformly strongly connected, then there exists a unique absolute probability sequence {πt} for the matrix sequence {Wt} and a constant πmin ∈ (0, 1) such that πit ≥ πmin for all i and t.
Let 〈θ〉t = ∑N i=1 π i tθ i t, which is a column vector and convex combination of all θ i t. It is easy to see that 〈θ〉t = (π>t Θt)> = Θ>t πt. From Definition 2 and equation 3, we have π>t+1Θt+1 = π>t+1WtΘt +αtπ > t+1WtΘtA(Xt) >+αtπ > t+1B(Xt) = π > t Θt +αtπ > t ΘtA(Xt) >+αtπ > t+1B(Xt), which implies that
〈θ〉t+1 = 〈θ〉t + αtA(Xt)〈θ〉t + αtB(Xt)>πt+1. (4)
Asymptotic performance of equation 1 with any uniformly strongly connected neighbor graph sequence is characterized by the following two theorems.
Theorem 1 Suppose that Assumptions 1, 2 and 5 hold. Let {θit}, i ∈ V , be generated by equation 1. If {Gt} is uniformly strongly connected, then limt→∞ ‖θit − 〈θ〉t‖2 = 0 for all i ∈ V .
Theorem 1 only shows that all the sequences {θit}, i ∈ V , generated by equation 1 will finally reach a consensus, but not necessarily convergent or bounded. To guarantee the convergence of the sequences, we further need the following assumption, whose validity is discussed in Remark 3.
Assumption 6 The absolute probability sequence {πt} for the stochastic matrix sequence {Wt} has a limit, i.e., there exists a stochastic vector π∞ such that limt→∞ πt = π∞.
Theorem 2 Suppose that Assumptions 1–6 hold. Let {θit}, i ∈ V , be generated by equation 1 and θ∗ be the unique equilibrium point of the ODE
θ̇ = Aθ + b, b = N∑ i=1 πi∞b i, (5)
whereA and bi are defined in Assumption 2 and π∞ is defined in Assumption 6. If {Gt} is uniformly strongly connected, then all θit will converge to θ ∗ both with probability 1 and in mean square.
Remark 3 Though Assumption 6 may look restrictive at first glance, simple simulations show that the sequences {θit}, i ∈ V , do not converge if the assumption does not hold. It is worth emphasizing that the existence of π∞ does not imply the existence of limt→∞Wt, though the converse is true. Indeed, the assumption subsumes various cases including (a) all Wt are doubly stochastic matrices, and (b) all Wt share the same left eigenvector for eigenvalue 1, which may arise from the scenario when the number of in-neighbors of each agent does not change over time (Olshevsky & Tsitsiklis, 2013). An important implication of Assumption 6 is when the consensus interaction among the agents, characterized by {Wt}, is replaced by resilient consensus algorithms such as Vaidya et al. (2012); LeBlanc et al. (2013) in order to attenuate the effect of unknown malicious
agents, the resulting dynamics of non-malicious agents, in general, will not converge, because the resulting interaction stochastic matrices among the non-malicious agents depend on the state values transmitted by the malicious agents, which can be arbitrary, and thus the resulting stochastic matrix sequence, in general, does not have a convergent absolute probability sequence; of course, in this case, the trajectories of all the non-malicious agents will still reach a consensus as long as the step-size is diminishing, as implied by Theorem 1. Further discussion on Assumption 6 can be found in Appendix C.
We now study the finite-time performance of the proposed distributed linear stochastic approximation equation 1 for both fixed and time-varying step-size cases. Its finite-time performance is characterized by the following theorem.
Let ηt = ‖πt − π∞‖2 for all t ≥ 0. From Assumption 6, ηt converges to zero as t→∞.
Theorem 3 Let the sequences {θit}, i ∈ V , be generated by equation 1. Suppose that Assumptions 1–4, 6 hold and {Gt} is uniformly strongly connected by sub-sequences of length L. Let qt and mt be the unique integer quotient and remainder of t divided by L, respectively. Let δt be the diameter of ∪t+L−1k=t Gk, δmax = maxt≥0 δt, and
= ( 1 +
2bmax Amax − πminβ 2L 2δmax
) (1 + αAmax)
2L − 2bmax Amax (1 + αAmax) L, (6)
where 0 < α < min{K1, log 2Amaxτ(α) , 0.1 K2γmax }.
1) Fixed step-size: Let αt = α for all t ≥ 0. For all t ≥ T1, N∑ i=1 πitE [∥∥θit − θ∗∥∥22] ≤ 2 qt N∑ i=1 πimtE [∥∥θimt − 〈θ〉mt∥∥22]+ C1(1− 0.9αγmax )t−T1 + C2
+ γmax γmin 2αζ4 t−T1∑ k=0 ηt+1−k ( 1− 0.9α γmax )k . (7)
2) Time-varying step-size: Let αt = α0t+1 with α0 ≥ γmax 0.9 . For all t ≥ LT2,
N∑ i=1 πitE [∥∥θit − θ∗∥∥22] ≤ 2 qt−T2 N∑ i=1 πiLT2+mtE [∥∥θiLT2+mt − 〈θ〉LT2+mt∥∥22]
+ C3 ( α0
qt−1 2 + αd qt−12 eL
) + 1
t
( C4 log 2 ( t α0 ) + C5 t∑ k=LT2 ηk + C6 ) . (8)
Here T1, T2,K1,K2, C1 − C6 are finite constants whose definitions are given in Appendix A.1.
Since πit is uniformly bounded below by πmin ∈ (0, 1) from Lemma 1, it is easy to see that the above bound holds for each individual E[‖θit− θ∗‖22]. To better understand the theorem, we provide the following remark.
Remark 4 In Appendix E.2.1, we show that both and (1 − 0.9αγmax ) lie in the interval (0, 1). It is easy to show that is monotonically increasing for δmax and L, monotonically decreasing for β and πmin. Also, limt→∞ ∑t−T1 k=0 ηt+1−k(1 − 0.9α γmax )k ≤ limt→∞ γmax0.9α [ηd t−T12 e + η1(1 − 0.9α γmax ) t−T1 2 ] = 0. Therefore, the summands in the finite-time bound equation 7 for the fixed step-size case are exponentially decaying except for the constant C2, which implies that lim supt→∞ ∑N i=1 π i tE[‖θit− θ∗‖22] ≤ C2, providing a constant limiting bound. From Appendix A, C2 is monotonically increasing for γmax, δmax, bmax and L, and monotonically decreasing for γmin, πmin and β. In Appendix E.2.2, we show that limt→∞ 1t ∑t k=1 ηk = 0, which implies that the finite-time bound equation 8 for the time-varying step-size case converges to zero as t → ∞. We next comment on 0.1 in the inequality defining α. Actually, we can replace 0.1 with any constant c ∈ (0, 1), which will affect the value of and the feasible set of α, with the latter becoming 0 < α < min{K1, log 2Amaxτ(α) , c K2γmax }. Thus,
the smaller the value of c is, the smaller is the feasible set of α, though the feasible set is always nonempty. For convenience, we simply pick c = 0.1 in this paper; that is why we also have 0.9 in equation 7. Lastly, we comment on α0 in the time-varying step-size case. We set α0 ≥ γmax0.9 for the purpose of getting a cleaner expression of the finite-time bound. For α0 < γmax0.9 , our approach still works, but will yield a more complicated expression. The same is true for Theorem 5.
Technical Challenge and Proof Sketch As described in the introduction, the key challenge of analyzing the finite-time performance of the distributed stochastic approximation equation 1 lies in the condition that the consensus-based interaction matrix is time-varying and stochastic (not necessarily doubly stochastic). To tackle this, we appeal to the absolute probability sequence πt of the time-varying interaction matrix sequence and introduce the quadratic Lyapunov comparison function ∑N i=1 π i tE[‖θit − θ∗‖22]. Then, using the inequality ∑N i=1 π i tE[‖θit − θ∗‖22] ≤
2 ∑N i=1 π
i tE[‖θit − 〈θ〉t‖22] + 2E[‖〈θ〉t − θ∗‖22], the next step is to find the finite-time bounds of∑N
i=1 π i tE[‖θit−〈θ〉t‖22] and E[‖〈θ〉t−θ∗‖22], respectively. The latter term is essentially the “singleagent” mean-square error. Our main analysis contribution here is to bound the former term for both fixed and time-varying step-size cases.

heading: 3 PUSH-SA
text: The preceding section shows that the limiting state of consensus-based distributed stochastic approximation depends on π∞, which leads to a convex combination of the local equilibria of all the agents in the absence of communication, but the convex combination is in general “uncontrollable”. Note that this convex combination will correspond to a convex combination of the network-wise accumulative rewards in applications such as distributed TD learning. In an important case when the convex combination is desired to be the straight average, the existing literature e.g. Doan et al. (2019; 2021) relies on doubly stochastic matrices whose corresponding π∞ = (1/N)1N . As mentioned in the introduction, doubly stochastic matrices implicitly require bi-directional communication between any pair of neighboring agents; see e.g. gossiping (Boyd et al., 2006) and the Metropolis algorithm (Xiao et al., 2005). A popular method to achieve the straight average target while allowing uni-directional communication between neighboring agents is to appeal to the idea so-called “pushsum” (Kempe et al., 2003), which was tailored for solving the distributed averaging problem over directed graphs and has been applied to distributed optimization (Nedić & Olshevsky, 2014). In this section, we will propose a push-based distributed stochastic approximation algorithm tailored for uni-directional communication and establish its finite-time error bound.
Each agent i has control over three variables, namely yit, θ̃ i t and θ i t, in which y i t is scalar-valued with initial value 1, θ̃it can be arbitrarily initialized, and θ i 0 = θ̃ i 0. At each time t ≥ 0, each agent i sends its weighted current values ŵjit y i t and ŵ ji t (θ̃ i t + αtA(Xt)θt + αtb
i(Xt)) to each of its current out-neighbors j ∈ N i−t , and updates its variables as follows: yit+1 = ∑ j∈N it ŵijt y j t , y i 0 = 1, θ̃it+1 = ∑ j∈N it ŵijt [ θ̃jt + αt ( A(Xt)θ j t + b j(Xt) )] ,
θit+1 = θ̃it+1 yit+1 , θi0 = θ̃ i 0,
(9)
where ŵijt = 1/|N j− t |. It is worth noting that the algorithm is distributed yet requires that each agent be aware of the number of its out-neighbors.
Asymptotic performance of equation 9 with any uniformly strongly connected neighbor graph sequence is characterized by the following theorem.
Theorem 4 Suppose that Assumptions 2–5 hold. Let {θit}, i ∈ V , be generated by equation 9 and θ∗ be the unique equilibrium point of the ODE
θ̇ = Aθ + 1
N N∑ i=1 bi, (10)
where A and bi are defined in Assumption 2. If {Gt} is uniformly strongly connected, then θit will converge to θ∗ in mean square for all i ∈ V .
In this section, we define 〈θ̃〉t = 1N ∑N i=1 θ̃ i t and 〈θ〉t = 1N ∑N i=1 θ i t. To help understand these definitions, let Ŵt be the N × N matrix whose ij-th entry equals ŵijt if j ∈ N it , otherwise equals zero. It is easy to see that each Ŵt is a column stochastic matrix whose diagonal entries are all positive. Then, πt = 1N 1N for all t ≥ 0 can be regarded as an absolute probability sequence of {Ŵt}. Thus, the above two definitions are intuitively consistent with 〈θ〉t in the previous section. Finite-time performance of equation 9 with any uniformly strongly connected neighbor graph sequence is characterized by the following theorem.
Let µt = ‖A(Xt)(〈θ〉t − 〈θ̃〉t)‖2. In Appendix E.3, we show that ‖〈θ〉t − 〈θ̃〉t‖2 converges to zero as t→∞, so does µt.
Theorem 5 Suppose that Assumptions 2–4 hold and {Gt} is uniformly strongly connected by subsequences of length L. Let {θit}, i ∈ V , be generated by equation 9 with αt = α0t+1 and α0 ≥ γmax 0.9 . Then, there exists a nonnegative ̄ ≤ (1− 1 NNL ) 1 L such that for all t ≥ T̄ ,
N∑ i=1 E [∥∥θit+1 − θ∗∥∥22] ≤ C7̄t + C8 (α0̄ t2 + αd t2 e)+ C9αt
+ 1
t
( C10 log 2 ( t α0 ) + C11 t∑ k=T̄ µk + C12 ) , (11)
where T̄ and C7 − C12 are finite constants whose definitions are given in Appendix A.2.
In Appendix E.3, we show that limt→∞ 1t ∑t k=1 µk = 0, which implies that the finite-time bound equation 11 converges to zero as t→∞. It is worth mentioning that the theorem does not consider the fixed step-size case, as our current analysis approach cannot be directly applied for this case.
Proof Sketch and Technical Challenge Using the inequality ∑N i=1 E[‖θit+1 − θ∗‖22] ≤
2 ∑N i=1 E[‖θit+1 − 〈θ̃〉t‖22] + 2NE[‖〈θ̃〉t − θ∗‖22], our goal is to derive the finite-time bounds of∑N
i=1 E[‖θit+1−〈θ̃〉t‖22] and E[‖〈θ̃〉t− θ∗‖22], respectively. Although this looks similar to the proof of Theorem 3, the derivation is quite different. First, the iteration of 〈θ̃〉t is a single-agent SA plus a disturbance term 〈θ〉t − 〈θ̃〉t, so we cannot directly apply the existing single-agent SA finitetime analyses to bound E[‖〈θ̃〉t − θ∗‖22]; instead, we have to show that 〈θ〉t − 〈θ̃〉t will diminish and quantify the diminishing “speed”. Second, both the proof of showing diminishing 〈θ〉t − 〈θ̃〉t and derivation of bounding ∑N i=1 E[‖θit+1 − 〈θ̃〉t‖22] involve a key challenge: to prove the sequence {θit} generated from the Push-SA equation 9 is bounded almost surely. To tackle this, we introduce a novel way to constructing an absolute probability sequence for the Push-SA as follows. From equation 9, θit+1 = ∑N j=1 w̃ ij t [θ j t + αtA(Xt)
θjt yjt + αt bj(Xt) yjt ], where w̃ijt = (ŵ ij t y j t )/(
∑N k=1 ŵ ik t y k t ).
We show that each matrix W̃t = [w̃ ij t ] is stochastic, and there exists a unique absolute probability sequence {π̃t} for the matrix sequence {W̃t} such that π̃it ≥ π̃min for all i ∈ V and t ≥ 0, with the constant π̃min ∈ (0, 1). Most importantly, we show two critical properties of {W̃t} and {π̃t}, namely limt→∞(Πts=0W̃s) = 1 N 1N1 > N and π̃it yit
= 1N for all i, j ∈ V and t ≥ 0, which have never been reported in the literature though push-sum based algorithms have been extensively studied.

heading: 4 CONCLUDING REMARKS
text: In this paper, we have established both asymptotic and non-asymptotic analyses for a consensusbased distributed linear stochastic approximation algorithm over uniformly strongly connected graphs, and proposed a push-based variant for coping with uni-directional communication. Both algorithms and their analyses can be directly applied to TD learning. One limitation of our finitetime bounds is that they involve quite a few constants which are well defined and characterized but whose values are not easy to compute. Future directions include leveraging the analyses for resilience in the presence of malicious agents and extending the tools to more complicated RL.

Review summaries:
This paper studies the problem of distributed linear stochastic approximation for a group of agents over time-varying directed communication networks (to be more specific, the setup is decentralized). The authors propose two decentralized algorithms, (1) consensus-based linear stochastic approximation using row-stochastic mixing matrices (Eq. (1)), and (2) a push-sum type algorithm using column-stochastic mixing matrices (Eq. (9)). They further provide results on the asymptotic and finite-time mean-square errors to the equilibrium point of the (proper) ODE for each proposed algorithm.

An interesting submission dealing with distributed stochastic approximation driven by Markovian noise, in which the communication topologies considered among agents are captured by a stochastic matrix (in contrast to the doubly stochastic matrix studied in the related literature). Both asymptotic and finite-time error bounds are established and it was shown that the algorithm converges to some unspecified convex combination of the equilibrium points of local tasks. This paper finally proposes a push-type distributed stochastic approximation algorithm and provides its finite-time bounds for the performance by leveraging the analysis for the consensus-type algorithm with stochastic matrices. All analysis and error bounds are directly applicable to distributed TD algorithms.  

This paper studies multi-agent distributed optimization under general consensus-type interactions between agents. The main contribution of the paper is to study linear stochastic approximation in a multi-agent setup without using bi-directional communication among agents. Non-asymptotic upper bounds on the associated error function, in a mean squared sense, are derived. 

This paper addresses a consensus problem in stochastic approximation, which has application to policy iteration in reinforcement learning. Specifically, the authors address the case where the interaction graph between agents is stochastic, but not doubly stochastic. Under certain assumptions, the authors prove convergence of their proposed algorithm in a certain sense.