scispace - formally typeset
Open AccessJournal ArticleDOI

Multivariate stochastic approximation using a simultaneous perturbation gradient approximation

James C. Spall
- 01 Mar 1992 - 
- Vol. 37, Iss: 3, pp 332-341
Reads0
Chats0
TLDR
The paper presents an SA algorithm that is based on a simultaneous perturbation gradient approximation instead of the standard finite-difference approximation of Keifer-Wolfowitz type procedures that can be significantly more efficient than the standard algorithms in large-dimensional problems.
Abstract
The problem of finding a root of the multivariate gradient equation that arises in function minimization is considered. When only noisy measurements of the function are available, a stochastic approximation (SA) algorithm for the general Kiefer-Wolfowitz type is appropriate for estimating the root. The paper presents an SA algorithm that is based on a simultaneous perturbation gradient approximation instead of the standard finite-difference approximation of Keifer-Wolfowitz type procedures. Theory and numerical experience indicate that the algorithm can be significantly more efficient than the standard algorithms in large-dimensional problems. >

read more

Content maybe subject to copyright    Report






Citations
More filters
Proceedings ArticleDOI

Applying model reference adaptive search to American-style option pricing

TL;DR: A randomized optimization algorithm called model reference adaptive search (MRAS) is applied to pricing American-style options by parameterizing the early exercise boundary to achieve stochastic optimization results on Brownian motion and Merton jump-diffusion processes.
Journal Article

Gradients without Backpropagation

TL;DR: This work presents a method to compute gradients based solely on the directional derivative that one can compute exactly and efficiently via the forward mode, and calls this formulation the forward gradient, an unbiased estimate of the gradient that can be evaluated in a single forward run of the function.

A framework for the benchmarking of OD estimation and prediction algorithms

TL;DR: In this article, the authors describe the development of a common evaluation and benchmarking platform that has been developed within the framework of the European Union COST Action MULTITUDE.

Optimal Multilevel Feedback Policies for ABR Flow Control using Two Timescale SPSA

TL;DR: Numerical experiments demonstrate fast convergence even in the presence of significant delays and large number of parametrized policy levels with numerically efficient two timescale simultaneous perturbation stochastic approximation algorithm.
Journal ArticleDOI

Learning to Collude in a Pricing Duopoly

TL;DR: In this paper, a price algorithm based on simultaneous-perturbation stochastic-approximation and mathematically proved that if implemented independently by two price-setting firms in a duopoly, prices will converge to those that maximize the firms' joint revenue in case this is profitable for both firms, and to a Nash equilibrium otherwise.
References
More filters
Journal ArticleDOI

Stochastic Estimation of the Maximum of a Regression Function

TL;DR: In this article, the authors give a scheme whereby, starting from an arbitrary point, one obtains successively $x_2, x_3, \cdots$ such that the regression function converges to the unknown point in probability as n \rightarrow \infty.
Journal ArticleDOI

Multidimensional Stochastic Approximation Methods

TL;DR: In this paper, a multidimensional stochastic approximation scheme is presented, and conditions are given for these schemes to converge a.s.p.s to the solutions of $k-stochastic equations in $k$ unknowns.
Journal ArticleDOI

Accelerated Stochastic Approximation

TL;DR: In this article, the Robbins-Monro procedure and the Kiefer-Wolfowitz procedure are considered, for which the magnitude of the $n$th step depends on the number of changes in sign in $(X_i - X_{i - 1})$ for n = 2, \cdots, n.