1 code implementation • 15 Oct 2019 • Guy Holtzman, Adam Soffer, Dan Vilenchik
The taxing computational effort that is involved in solving some high-dimensional statistical problems, in particular problems involving non-convex optimization, has popularized the development and analysis of algorithms that run efficiently (polynomial-time) but with no general guarantee on statistical consistency.
