Why the edge exists
On a quadratic loss, gradient descent is stable only when the learning rate times the relevant curvature stays below 2. Deep networks do something stranger: sharpness can rise to that boundary, oscillate, and still make long-run progress.
Mirror descent changes the ruler
Mirror descent replaces Euclidean distance with a geometry induced by a mirror map. In the paper's experiments, this means the relevant curvature is the top eigenvalue of an effective Hessian, where the optimizer's local metric rescales the landscape.
What the experiments show
The full-batch GD run is the cleanest EoS reproduction. Several stochastic, adaptive, and mirror-descent variants sharpen early or spike past the edge, but they often settle below the normalized edge rather than hovering there.
That makes the main result deliberately cautious: non-GD mirror descent routines may not train at EoS as often as full-batch GD on the same MLP and CIFAR-10 setup.