Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema (Q2018557)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
scientific article

    Statements

    Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema (English)
    0 references
    24 March 2015
    0 references
    Given a continuously differentiable function \(f=f (\theta)\), \(\theta \in \mathbb{R}^n\), the problem is to determine a solution \(\hat{\theta}\) of the equation \(\nabla f (\theta)=0\). Having an estimate of the gradient \(\nabla f (\theta)\), for the iterative computation of a zero of the gradient, a standard stochastic gradient procedure is considered. Under certain assumptions on the additive noise term and the function \(f\), results on the almost sure convergence and convergence rate are provided. The results are illustrated by means of examples from principle component analysis and maximum likelihood estimation.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    stochastic gradient methods
    0 references
    convergence almost sure
    0 references
    convergence rate
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references