The purpose of this note is to be a single point of reference for all the facts I find useful about each of the three function classes. A lot of the properties of each that are leveraged when analyzing the convergence rates of iterative optimizers on them are similar to each other, and I think it’s worth listing them all here in one place so that I (and the reader) can understand

  • What the general “shape” of a property is
  • How it changes as we move between the classes
  • Optionally, what it buys us for rate analysis.
    I’m hoping this note will also help build intuition about which properties are worth taking as starting definitions of the function class.

The Starting Point: First-Order Approximation Error

As with most things optimization, we open with the first-order Taylor approximation to a function. Here, we explicitly compute the error between the true function value (at some ) and its approximation (at some ).

Each of the three classes makes a claim about :

  1. Convexity - : The tangent plane always lies below the function, which should sit well with our image of convex functions.
  2. strongly convex - : The gap between the tangent plane and the function grows quadratically, a stronger lower-bound than the convexity function. This should induce an image of a function growing much quicker than a convex one.
  3. smooth - : While convexity tells you how bad the Taylor approximation is, smoothness gives you a picture of how good it can be, since the error is lesser than some quadratic (it’s still quadratic, but it’s something).
    Thus, for an smooth, strongly-convex function, we have something like the following:

Hessian Properties

ClassHessian Condition
Convex
strongly convex
smooth
Convex + smooth
strongly convex + smooth
Proofs for these properties starting from the gradient-geometry definitions can be found [[hessian-1here]].

Gradient Geometry

For all the gradient-geometry properties, we work with the following inner product:

Each of the following properties can be arrived at by starting from the Taylor Deviation definitions.
Convexity:

Swapping and , we get

Adding those two gives us or

-Strong Convexity:

Swapping and , we get

Adding and simplifying gives us

smoothness
A similar procedure as the above two, with the corresponding smoothness deviation bound gives us

Gradient Growth Bounds

For each of these, we can start with the gradient geometry properties and make statements about how the gradient norm difference grows with growth in input-space:

Strong Convexity:
A simple application of Cauchy-Schwartz gives us

And thus, we have that .

Unfortunately, for the convex case all we end up getting following the same procedure is that the gradient-change norm is greater than zero, which is obviously true.

Even worse, for the smooth case, there is no bound we can arrive at, since a (legal) application of Cauchy-Schwartz to the gradient-geometry inequality would give us , which is worse than the obviously true bound.
Clearly, we need some other property to use as the starting point for proving a meaningful gradient growth bound for smooth functions.

We’ll leverage the fact that the Taylor deviation bound for smooth functions is actually a two-sided bound:1

Or equivalently, that for any .2
Applying the Fundamental Theorem of Calculus to the gradients:

where . Taking the norm of both sides and applying Jensen’s inequality gives us

Footnotes

  1. Generally we don’t worry about the lower-bound because often, we work with functions that are at-least convex as well (on top of being smooth), and so the lower-bound on is , which is tighter than what smoothness alone gives us. However, in this case, we want to prove something that holds for all smooth functions, and so we cannot use a convexity lower bound.

  2. So we’re actually starting from the Hessian bound on smooth functions.