In non-convex optimization, what is the term for a point where the gradient is zero but is not a local extremum?

Saddle point

In high-dimensional spaces, saddle points are much more common than local minima. Many modern optimization algorithms are designed to escape these points efficiently to continue descending toward a minimum.