Fetching the paper…
Reading the bibliography…
In this paper, we analyze several methods for approximating gradients of noisy functions using only function values.
Stochastic estimation of the maximum of a regression function
Jack C Kiefer and Jacob Wolfowitz · 1952
Earlier work this paper cites.
Unconstrained minimization algorithms without computation of derivatives
Michael J D Powell · 1974
Earlier work this paper cites.
Introduction to Optimization (1987)
Boris T Polyak · 1987
Earlier work this paper cites.
On the global convergence of trust region algorithms using inexact gradient information
Richard G Carter · 1991
Earlier work this paper cites.
On the convergence of derivative-free methods for unconstrained optimization
Andrew R Conn, Katya Scheinberg, and Philippe L Toint · 1997
Earlier work this paper cites.
A derivative free optimization algorithm in practice
Andrew R Conn, Katya Scheinberg, and Philippe L Toint · 1998
Earlier work this paper cites.
Adaptive stochastic approximation by the simultaneous perturbation method
James C Spall · 2000
Earlier work this paper cites.
Benchmarking Optimization Software with Performance Profiles
Elizabeth D Dolan and Jorge J Moré · 2002
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham D Flaxman, Adam Tauman Kalai, and H Brendan McMahan · 2005
Earlier work this paper cites.
Introduction to stochastic search and optimization: estimation, simulation, and control
James C Spall · 2005
Earlier work this paper cites.
Numerical Optimization, Second Edition
Jorge Nocedal and Stephen J Wright · 2006
Earlier work this paper cites.
The NEWUOA software for unconstrained optimization without derivatives
Michael J D Powell · 2006
Earlier work this paper cites.
Stochastic simulation - algorithms and analysis
Søren Asmussen and Peter W. Glynn · 2007
Earlier work this paper cites.
On lower bounds for tail probabilities
Valentin V Petrov · 2007
Earlier work this paper cites.
Geometry of interpolation sets in derivative free optimization
Andrew R Conn, Katya Scheinberg, and Luis N Vicente · 2008
Earlier work this paper cites.
Introduction to Derivative-free Optimization
Andrew R Conn, Katya Scheinberg, and Luis N Vicente · 2008
Earlier work this paper cites.
ORBIT: optimization by radial basis function interpolation in trust-regions
Stefan M Wild, Rommel G Regis, and Christine A Shoemaker · 2008
Earlier work this paper cites.
Benchmarking derivative-free optimization algorithms
Jorge J Moré and Stefan M Wild · 2009
Cited alongside, same era.
Estimating computational noise
Jorge J Moré and Stefan M Wild · 2011
Cited alongside, same era.
Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
Afonso Bandeira, Katya Scheinberg, and Luis N Vicente · 2012
Cited alongside, same era.
Sample size selection in optimization methods for machine learning
Richard H Byrd, Gillian M Chin, Jorge Nocedal, and Yuchen Wu · 2012
Cited alongside, same era.
Query complexity of derivative-free optimization
Kevin G Jamieson, Robert Nowak, and Ben Recht · 2012
Cited alongside, same era.
More test examples for nonlinear programming codes
Klaus Schittkowski · 2012
Cited alongside, same era.
An optimal algorithm for bandit and zero-order convex optimization with two-point feedback
Ohad Shamir · 2017
Later among the works it cites.
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
Coralia Cartis and Katya Scheinberg · 2018
Later among the works it cites.
Optimizing simulations with noise-tolerant structured exploration
Krzysztof Choromanski, Atil Iscen, Vikas Sindhwani, Jie Tan, and Erwin Coumans · 2018
Later among the works it cites.
Structured evolution with compact architectures for scalable policy optimization
Krzysztof Choromanski, Mark Rowland, Vikas Sindhwani, Richard E Turner, and Adrian Weller · 2018
Later among the works it cites.
Global convergence of policy gradient methods for the linear quadratic regulator
Maryam Fazel, Rong Ge, Sham M Kakade, and Mehran Mesbahi · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Algorithms for minimization without derivatives
Richard P Brent · 2013
Cited alongside, same era.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Cited alongside, same era.
Natural evolution strategies
Daan Wierstra, Tom Schaul, Tobias Glasmachers, Yi Sun, Jan Peters, and Jürgen Schmidhuber · 2014
Cited alongside, same era.
Optimal rates for zero-order convex optimization: The power of two function evaluations
John C Duchi, Michael I Jordan, Martin J Wainwright, and Andre Wibisono · 2015
Cited alongside, same era.
Trust region policy optimization
John Schulman, Sergey Levine, Pieter Abbeel, Michael Jordan, and Philipp Moritz · 2015
Cited alongside, same era.
An introduction to matrix concentration inequalities
Joel A Tropp · 2015
Cited alongside, same era.
Later among the works it cites.
Zeroth-order stochastic variance reduction for nonconvex optimization
Sijia Liu, Bhavya Kailkhura, Pin-Yu Chen, Paishun Ting, Shiyu Chang, and Lisa Amini · 2018
Later among the works it cites.
A derivative-free trust-region algorithm for the optimization of functions smoothed via gaussian convolution using adaptive multiple importance sampling
Alvaro Maggiar, Andreas Wächter, Irina S Dolinskaya, and Jeremy Staum · 2018
Later among the works it cites.
On sampling rates in simulation-based recursions
Raghu Pasupathy, Peter Glynn, Soumyadip Ghosh, and Fatemeh S Hashemi · 2018
Later among the works it cites.
Geometrically coupled monte carlo sampling
Mark Rowland, Krzysztof Choromanski, François Chalus, Aldo Pacchiano, Tamas Sarlós, Turner Richard E, and Adrian Weller · 2018
Later among the works it cites.
Astro-df: A class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
Sara Shashaani, Fatemeh S Hashemi, and Raghu Pasupathy · 2018
Later among the works it cites.
Stochastic cubic regularization for fast nonconvex optimization
Nilesh Tripuraneni, Mitchell Stern, Chi Jin, Jeffrey Regier, and Michael I Jordan · 2018
Later among the works it cites.
Derivative-free optimization of noisy functions via quasi-newton methods
Albert S Berahas, Richard H Byrd, and Jorge Nocedal · 2019
Closest in time.
Global convergence rate analysis of a generic line search algorithm with noise
Albert S Berahas, Liyuan Cao, and Katya Scheinberg · 2019
Closest in time.
Adaptive sampling quasi-newton methods for derivative-free stochastic optimization
Raghu Bollapragada and Stefan M Wild · 2019
Closest in time.
Derivative-free optimization methods
Jeffrey Larson, Matt Menickelly, and Stefan M Wild · 2019
Closest in time.
An accelerated directional derivative method for smooth stochastic convex optimization
Pavel Dvurechensky, Eduard Gorbunov, and Alexander Gasnikov · 2020
Closest in time.
A stochastic line search method with expected complexity analysis
Courtney Paquette and Katya Scheinberg · 2020
Closest in time.