First Page | Document Content | |
---|---|---|
Date: 2018-02-06 15:06:57 | Oracle Complexity of Second-Order Methods for Finite-Sum Problems A. Proofs A.1. Auxiliary Lemmas The following lemma was essentially proven in (Lan, 2015; Nesterov, 2013), but we provide a proof for completeness: LemmaAdd to Reading ListSource URL: proceedings.mlr.pressDownload Document from Source WebsiteFile Size: 297,55 KBShare Document on Facebook |