The paper closes the gap between the Point-SAGA upper bound and the previous PIFO lower bound, proving Ω((n + √(κn)) log(1/ε)) queries are necessary for strongly convex finite sums.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization
The paper closes the gap between the Point-SAGA upper bound and the previous PIFO lower bound, proving Ω((n + √(κn)) log(1/ε)) queries are necessary for strongly convex finite sums.