3 code implementations • 10 Jul 2014 • Aaron J. Defazio, Tibério S. Caetano, Justin Domke
Recent advances in optimization theory have shown that smooth strongly convex finite sums can be minimized faster than by treating them as a black box "batch" problem.
no code implementations • NeurIPS 2012 • Aaron J. Defazio, Tiberio S. Caetano
We consider the case where the structure of the graph to be reconstructed is known to be scale-free.
