Lower Bounds for Parallel and Randomized Convex OptimizationDownload PDFOpen Website

2019 (modified: 06 Nov 2022)COLT 2019Readers: Everyone
Abstract: We study the question of whether parallelization in the exploration of the feasible set can be used to speed up convex optimization, in the local oracle model of computation. We show that the answe...
0 Replies

Loading