A first claimed lower bound and near-optimal algorithm for row-stochastic decentralized optimization, with a flawed lower-bound proof.
Penalized likelihood regression for generalized linear models with non-quadratic penalties
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks
A first claimed lower bound and near-optimal algorithm for row-stochastic decentralized optimization, with a flawed lower-bound proof.