All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Decentralized Asynchronous Non-convex Stochastic Optimization on Directed Graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00363763" target="_blank" >RIV/68407700:21230/23:00363763 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/TCNS.2023.3242043" target="_blank" >https://doi.org/10.1109/TCNS.2023.3242043</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TCNS.2023.3242043" target="_blank" >10.1109/TCNS.2023.3242043</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Decentralized Asynchronous Non-convex Stochastic Optimization on Directed Graphs

  • Original language description

    We consider a decentralized stochastic optimization problem over a network of agents, modeled as a directed graph: Agents aim to asynchronously minimize the average of their individual losses (possibly non-convex), each one having access only to a noisy estimate of the gradient of its own function. We propose an asynchronous distributed algorithm for such a class of problems. The algorithm combines stochastic gradients with tracking in an asynchronous push-sum framework and obtains a sublinear convergence rate, matching the rate of the centralized stochastic gradient descent applied to the nonconvex minimization. Our experiments on a non-convex image classification task using convolutional neural network validate the convergence of our proposed algorithm across different number of nodes and graph connectivity percentages.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2023

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IEEE Transactions on Control of Network Systems

  • ISSN

    2325-5870

  • e-ISSN

    2372-2533

  • Volume of the periodical

    10

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    9

  • Pages from-to

    1796-1804

  • UT code for WoS article

    001130821600020

  • EID of the result in the Scopus database

    2-s2.0-85148444791