---
res:
  bibo_abstract:
  - "Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate
    with each other, over time, in order to minimize/maximize a global\r\nobjective.
    In the presence of unreliable communication networks, the\r\nAge-of-Information
    (AoI), which measures the freshness of data received, may be\r\nlarge and hence
    hinder algorithmic convergence. In this paper, we study the\r\nconvergence of
    general distributed gradient-based optimization algorithms in\r\nthe presence
    of communication that neither happens periodically nor at\r\nstochastically independent
    points in time. We show that convergence is\r\nguaranteed provided the random
    variables associated with the AoI processes are\r\nstochastically dominated by
    a random variable with finite first moment. This\r\nimproves on previous requirements
    of boundedness of more than the first moment.\r\nWe then introduce stochastically
    strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness
    for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that
    describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing
    with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically
    dominated by a\r\nrandom variable with finite $p$-th moment. In combination with
    our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges
    in the presence of AoI, if $\\alpha(n)$ is summable.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Adrian
      foaf_name: Redder, Adrian
      foaf_surname: Redder
      foaf_workInfoHomepage: http://www.librecat.org/personId=52265
    orcid: https://orcid.org/0000-0001-7391-4688
  - foaf_Person:
      foaf_givenName: Arunselvan
      foaf_name: Ramaswamy, Arunselvan
      foaf_surname: Ramaswamy
      foaf_workInfoHomepage: http://www.librecat.org/personId=66937
    orcid: https://orcid.org/ 0000-0001-7547-8111
  - foaf_Person:
      foaf_givenName: Holger
      foaf_name: Karl, Holger
      foaf_surname: Karl
      foaf_workInfoHomepage: http://www.librecat.org/personId=126
  dct_date: 2022^xs_gYear
  dct_language: eng
  dct_title: Distributed gradient-based optimization in the presence of dependent  aperiodic
    communication@
...