1951
DOI: 10.1214/aoms/1177729586
|View full text |Cite
|
Sign up to set email alerts
|

A Stochastic Approximation Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

5
3,038
1
17

Year Published

1998
1998
2020
2020

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 7,168 publications
(3,273 citation statements)
references
References 0 publications
5
3,038
1
17
Order By: Relevance
“…Step size was equal to the greater of two values, 25/n or 0.5 Hz, where n was the number of steps accumulated since the beginning of the test session (Robbins and Monro 1951;Levitt 1970). Tracks were allowed to continue for a minimum of 15 reversals in target frequency until two stability criteria were met: (1) the absolute difference in mean frequency between the final four reversals and the four preceding reversals was less than 5 Hz, and (2) the standard deviation of the frequency of the final eight reversals was less than 5 Hz.…”
Section: Behavioral Experimentsmentioning
confidence: 99%
“…Step size was equal to the greater of two values, 25/n or 0.5 Hz, where n was the number of steps accumulated since the beginning of the test session (Robbins and Monro 1951;Levitt 1970). Tracks were allowed to continue for a minimum of 15 reversals in target frequency until two stability criteria were met: (1) the absolute difference in mean frequency between the final four reversals and the four preceding reversals was less than 5 Hz, and (2) the standard deviation of the frequency of the final eight reversals was less than 5 Hz.…”
Section: Behavioral Experimentsmentioning
confidence: 99%
“…The one used in this paper was inspired by the work of Atchadé (2006). It uses a Robbins-Monro type algorithm, widely used to calculate numerical solutions of differential equations (Robbins & Monro 1951).…”
Section: A2 Gaussian Proposal Covariance Matrix Adjustmentmentioning
confidence: 99%
“…Now, we interpret the operator k M as the expectation operator over k if k is given as a random integer which is distributed uniformly from 1 to M. Therefore, stochastic approximation [10] is applicable to the optimization of CSTRESS. Consequently, CSTRESS is minimized by repeating the following update equation:…”
Section: Linear Gmamentioning
confidence: 99%
“…In this paper, we propose a new stochastic gradient algorithm named "global mapping analysis" (GMA), which solves both the classical linear MDS [8], [9] and a non-linear MDS known as ALSCAL [5] efficiently. By using stochastic approximation [10], the computational cost of each update in the gradient descent is linear to the number of objects. So, GMA is expected to be efficient if the number of objects is large.…”
Section: Introductionmentioning
confidence: 99%