In this paper, we study the lower complexity bounds for finite-sum
optimization problems, where the objective is the average of $n$ individual
component functions. We consider Proximal Incremental First-order (PIFO)
algorithms which have access to the gradient and proximal oracles for