Performance of a Distributed Stochastic Approximation Algorithm
نویسندگان
چکیده
منابع مشابه
A stochastic approximation algorithm for stochastic semidefinite programming
Motivated by applications to multi-antenna wireless networks, we propose a distributed and asynchronous algorithm for stochastic semidefinite programming. This algorithm is a stochastic approximation of a continoustime matrix exponential scheme regularized by the addition of an entropy-like term to the problem’s objective function. We show that the resulting algorithm converges almost surely to...
متن کاملPerformance Evaluation of Simultaneous Perturbation Stochastic Approximation Algorithm for Solving Stochastic Transportation Network Analysis Problems
Stochastic optimization has become one of the important modeling approaches in the transportation network analysis. For example, for traffic assignment problems based on stochastic simulation, it is necessary to use a mathematical algorithm that iteratively seeks out the optimal and/or suboptimal solution because an analytical (closed-form) objective function is not available. Therefore, there ...
متن کاملA Functional Approximation Based Distributed Learning Algorithm
Scalable machine learning over big data stored on a cluster of commodity machines with significant communication costs has become important in recent years. In this paper we give a novel approach to the distributed training of linear classifiers (involving smooth losses and L2 regularization) that is designed to reduce communication costs. At each iteration, the nodes minimize approximate objec...
متن کاملDistributed Stochastic Approximation with Local Projections
We propose a distributed version of a stochastic approximation scheme constrained to remain in the intersection of a finite family of convex sets. The projection to the intersection of these sets is also computed in a distributed manner and a ‘nonlinear gossip’ mechanism is employed to blend the projection iterations with the stochastic approximation using multiple time scales.
متن کاملConvergence of a Stochastic Approximation Version of the Em Algorithm
SUMMARY The Expectation-Maximization (EM) algorithm is a powerful computational technique for locating maxima of functions. It is widely used in statistics for maximum likelihood or maximum a posteriori estimation in incomplete data models. In certain situations however, this method is not applicable because the expectation step cannot be performed in closed{form. To deal with these problems, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2275131