no code implementations • 26 Feb 2016 • Christos Papadimitrou, Samantha Petti, Santosh Vempala
We study the rate of convergence, finding that while linear convergence to the correct function can be achieved for any threshold using a fixed set of primitives, for quadratic convergence, the size of the primitives must grow as the threshold approaches 0 or 1.
