QN Optimization with Hessian Sample
Joy Azzam, Daniel Henderson, Benjamin Ong, Allan Struthers

TL;DR
This paper introduces a novel Quasi-Newton optimization method that incorporates curvature samples generated via SIMD-parallel forward-mode AD, enabling efficient handling of indefinite Hessian approximations and negative curvature without filtering.
Contribution
It presents a new approach to integrate Hessian samples directly into QN updates, allowing exploitation of negative curvature and improving optimization of smooth functions.
Findings
Incorporates Hessian samples into QN updates without filtering.
Handles indefinite Hessian approximations and negative curvature.
Preliminary evaluation of sample selection strategies conducted.
Abstract
This article explores how to effectively incorporate curvature information generated using SIMD-parallel forward-mode Algorithmic Differentiation (AD) into unconstrained Quasi-Newton (QN) minimization of a smooth objective function, . Specifically, forward-mode AD can be used to generate block Hessian samples whenever the gradient is evaluated. Block QN algorithms then update approximate inverse Hessians, , with these Hessian samples. Whereas standard line-search based BFGS algorithms carefully filter and correct secant-based approximate curvature information to maintain positive definite approximations, our algorithms directly incorporate Hessian samples to update indefinite inverse Hessian approximations without filtering. The sampled directions supplement the standard QN two-dimensional trust-region sub-problem to generate a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Advanced Optimization Algorithms Research · Advanced Image Processing Techniques
