A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement
Yun Kuen Cheung, Richard Cole

TL;DR
This paper presents a unified analysis framework for asynchronous coordinate descent and tatonnement, improving bounds and extending understanding of asynchronous iterative algorithms in convex optimization and economic market models.
Contribution
It introduces a common amortized analysis framework for asynchronous coordinate descent and applies it to tatonnement, providing new bounds and convergence results.
Findings
Improved bounds for cyclic coordinate descent.
First analysis of parallel asynchronous stochastic coordinate descent.
Convergence of asynchronous tatonnement in market models.
Abstract
This paper concerns asynchrony in iterative processes, focusing on gradient descent and tatonnement, a fundamental price dynamic. Gradient descent is an important class of iterative algorithms for minimizing convex functions. Classically, gradient descent has been a sequential and synchronous process, although distributed and asynchronous variants have been studied since the 1980s. Coordinate descent is a commonly studied version of gradient descent. In this paper, we focus on asynchronous coordinate descent on convex functions of the form , where is a smooth convex function, and each is a univariate and possibly non-smooth convex function. Such functions occur in many data analysis and machine learning problems. We give new…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Advanced Bandit Algorithms Research · Markov Chains and Monte Carlo Methods
