English

Adaptive Sampling Quasi-Newton Methods for Derivative-Free Stochastic Optimization

Optimization and Control 2019-10-31 v1 Machine Learning

Abstract

We consider stochastic zero-order optimization problems, which arise in settings from simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients of a stochastic function using finite differences within a common random number framework. We employ modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations. We provide preliminary numerical experiments to illustrate potential performance benefits of the proposed method.

Keywords

Cite

@article{arxiv.1910.13516,
  title  = {Adaptive Sampling Quasi-Newton Methods for Derivative-Free Stochastic Optimization},
  author = {Raghu Bollapragada and Stefan M. Wild},
  journal= {arXiv preprint arXiv:1910.13516},
  year   = {2019}
}

Comments

7 pages, NeurIPS workshop

R2 v1 2026-06-23T11:58:51.672Z