JSTOR Daily

Unconstrained Convex Minimization in Relative Scale

This is a preview. Log in through your library . Abstract In this paper, we present a new approach to constructing schemes for unconstrained convex minimization, which computes approximate solutions ...
JSTOR Daily

Empirical risk minimization is optimal for the convex aggregation problem

This is a preview. Log in through your library . Abstract Let F be a finite model of cardinality M and denote by conv(F) its convex hull. The problem of convex aggregation is to construct a procedure ...
NPR

With Discovery, 3 Scientists Chip Away At An Unsolvable Math Problem

Jennifer McLoud-Mann had almost come to believe that her last two years of work had been for naught. "It had gotten to the point, where we hadn't found anything," she said. "And I was starting to ...
Quanta Magazine

Statistics Postdoc Tames Decades-Old Geometry Problem

To the surprise of experts in the field, a postdoctoral statistician has solved one of the most important problems in high-dimensional convex geometry. In the mid-1980s, the mathematician Jean ...
Quanta Magazine

Pentagon Tiling Proof Solves Century-Old Math Problem

A French mathematician has completed the classification of all convex pentagons, and therefore all convex polygons, that tile the plane. One of the oldest problems in geometry asks which shapes tile ...