Globally Optimal Learning for Structured Elliptical Losses

1 code implementation • NeurIPS 2019 • Yoav Wald, Nofar Noy, Gal Elidan, Ami Wiesel

The core of the difficulty is the non-convexity of the objective function, implying that standard optimization algorithms may converge to sub-optimal critical points.

regression