3 problems

0 votes0 replies0 views
Conjectured optimality of unaccelerated asynchronous SGD rates
Optimality conjecture. By analogy with existing lower bounds, the optimization terms in the convex and strongly convex guarantees are the best unaccelerated rates one could hope fo…
Conjectureopenasynchronous-algorithms lower-bounds stochastic-optimizationarXiv posted 2 days ago
0 votes0 replies0 views
The scheduled-asynchronous algorithm's convergence-rate conjecture
Let Algorithm denote the scheduled-asynchronous distributed algorithm for optimal power flow, and let $n$ denote the iteration count. Convergence-rate conjecture. Based on the bipa…
Conjectureopenasynchronous-algorithms distributed-optimization optimal-power-flowarXiv posted 2 days ago
0 votes0 replies0 views
Strengthening asynchronous solver convergence results for high-variance row sizes
Consider asynchronous iterative solvers for linear systems whose matrices have highly variable row sizes. The analysis in this paper does not effectively cover this situation. Conj…
Conjectureopenasynchronous-algorithms iterative-methods numerical-linear-algebraarXiv posted 2 days ago

Conjectured optimality of unaccelerated asynchronous SGD rates