# On Parallel or Distributed Asynchronous Iterations with Unbounded Delays and Possible Out of Order Messages or Flexible Communication for Convex Optimization Problems and Machine Learning

arXiv: https://arxiv.org/abs/2210.04626 · HTML: https://mlsanity.com/paper/2210.04626/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 33 references that are in the map.
- First posted on arXiv 5 Oct 2022.

## Builds on (most cited first, 4 of 4)

- [ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates](https://mlsanity.com/paper/1506.02396/) (2015)
- [A Distributed Flexible Delay-tolerant Proximal Gradient Algorithm](https://mlsanity.com/paper/1806.09429/) (2018)
- [A programmable actuator for combined motion and connection and its application to modular robot](https://mlsanity.com/paper/1904.09889/) (2019)
- [Datom: A Deformable modular robot for building self-reconfigurable programmable matter](https://mlsanity.com/paper/2005.03402/) (2020)

## Abstract (arXiv)

We describe several features of parallel or distributed asynchronous iterative algorithms such as unbounded delays, possible out of order messages or flexible communication. We concentrate on the concept of macroiteration sequence which was introduced in order to study the convergence or termination of asynchronous iterations. A survey of asynchronous iterations for convex optimization problems is also presented. Finally, a new result of convergence for parallel or distributed asynchronous iterative algorithms with flexible communication for convex optimization problems and machine learning is proposed.