Strong growth and Goldstein subgradients in piecewise smooth optimization

arXiv:2608.20642 2026 Optimization 1 ideas extracted · analyzed Sep 1, 2026

What the math gives to ML

The paper studies Goldstein subgradients, formed by convexifying gradients in a neighborhood rather than evaluating only the current nonsmooth gradient. Its transferable asset is a practical optimizer primitive for piecewise-smooth objectives: neighborhood gradient averaging can produce a smaller and more stable descent direction near activation boundaries, while geometrically shrinking the neighborhood is reported to produce approximately linear convergence on generic examples. The direct neural-network experiment is a sampled minimum-norm Goldstein update for ReLU or max-affine networks, combined with restarts and a geometric radius schedule.

Ideas from this paper

Unverified 2026

Sampled Goldstein optimizer

Replace the single backpropagated subgradient of a piecewise-smooth network loss by a minimum-norm convex combination of gradients evaluated at nearby parameter perturbations. Shrink the perturbation radius geometrically and restart the schedule when the sampled Goldstein direction becomes small, following the paper's INGD motivation.

Useful6/10
Difficulty6/10
Novelty6/10
Paper: Strong growth and Goldstein subgradients in piecewise smooth optimization arXiv:2608.20642