2812e5cf6d8f21d69c91dddeefb792a7-Reviews.html

The analysis for Hogwild algorithm seems to be new as well, but I didn't go through the proof of that part. Significance: The new analysis supporting asynchronous update when features are sparse, will be an interesting message to the community. However as the assumption in Eq.(2) excludes many interesting problems, I don't think it will have a large impact. Q2: Please summarize your review in 1-2 sentences The paper suggests an analysis showing that the optimal bounds can be achieved by their suggested algorithm up to some factors, where the algorithm is claimed to have linear speedup with the number of cores and to benefit from the sparsity of input features. However, its applicability seems to be limited due to a rather restrictive assumption it is based upon, which makes the suggested method sensitive to the choices of stepsizes, and the other assumption on asynchronous update delays.