paper-with-me

Papers

An Asynchronous Decentralised Optimisation Algorithm for Nonconvex Problems

2025-07-30 · Behnam Mafakheri, Jonathan H. Manton, Iman Shames arxiv

In this paper, we consider nonconvex decentralised optimisation and learning over a network of distributed agents. We develop an ADMM algorithm based on the Randomised Block Coordinate Douglas-Rachford splitting method which enables agents in the network to distributedly and asynchronously compute a set of first-order stationary solutions of the problem. To the best of our knowledge, this is the first decentralised and asynchronous algorithm for solving nonconvex optimisation problems with convergence proof. The numerical examples demonstrate the efficiency of the proposed algorithm for distributed Phase Retrieval and sparse Principal Component Analysis problems.

📄 PDF Abstract BibTeX arXiv:2507.22311

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Asynchronous Stochastic Proximal Methods for Nonconvex Nonsmooth Optimization

2018-02-24 · Rui Zhu, Di Niu, Zongpeng Li

We study stochastic algorithms for solving nonconvex optimization problems with a convex yet possibly nonsmooth regularizer, which find wide applications in many practical machine learning applications. However, compared…

Privacy-Preserving Distributed Optimisation using Stochastic PDMM

2023-12-13 · Sebastian O. Jordan, Qiongxiu Li, Richard Heusdens

Privacy-preserving distributed processing has received considerable attention recently. The main purpose of these algorithms is to solve certain signal processing tasks over a network in a decentralised fashion without r…

Privacy Preserving

Asynchronous Delay-Aware Accelerated Proximal Coordinate Descent for Nonconvex Nonsmooth Problems

2019-02-05 · Ehsan Kazemi, Liqiang Wang

Nonconvex and nonsmooth problems have recently attracted considerable attention in machine learning. However, developing efficient methods for the nonconvex and nonsmooth optimization problems with certain performance gu…

The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM

2016-12-01 · NeurIPS 2016 12 · Damek Davis, Brent Edmunds, Madeleine Udell

We introduce the Stochastic Asynchronous Proximal Alternating Linearized Minimization (SAPALM) method, a block coordinate stochastic proximal-gradient method for solving nonconvex, nonsmooth optimization problems. SAPALM…

NeurOptimisation: The Spiking Way to Evolve

2025-07-11 · Jorge Mario Cruz-Duarte, El-Ghazali Talbi arxiv

The increasing energy footprint of artificial intelligence systems urges alternative computational models that are both efficient and scalable. Neuromorphic Computing (NC) addresses this challenge by empowering event-dri…