Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions

Abstract

To minimize the average of a set of log-convex functions, the stochastic Newton method iteratively updates its estimate using subsampled versions of the full objective's gradient and Hessian. We contextualize this optimization problem as sequential Bayesian inference on a latent state-space model with a discriminatively-specified observation process. Applying Bayesian filtering then yields a novel optimization algorithm that considers the entire history of gradients and Hessians when forming an update. We establish matrix-based conditions under which the effect of older observations diminishes over time, in a manner analogous to Polyak's heavy ball momentum. We illustrate various aspects of our approach with an example and review other relevant innovations for the stochastic Newton method.

References in corpus (6)

• A Stochastic Gradient Method with an Exponential Convergence Rate for Finite Training Sets
• New insights and perspectives on the natural gradient method
• Convergence rates of sub-sampled Newton methods
• Sub-sampled Newton Methods with Non-uniform Sampling
• Efficient Second Order Online Learning by Sketching
• Sketching, Embedding, and Dimensionality Reduction for Information Spaces