scientific article; zbMATH DE number 3992716
From MaRDI portal
Publication:4720608
zbMath0613.62107MaRDI QIDQ4720608
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global convergencemeasurement errorsmoving averageRobbins-Monro methodstationary ARMA processKiefer- Wolfowitz procedurerandomly varying truncations
Related Items (32)
On two numerical problems in applied probability : discretization of Stochastic Differential Equations and optimization of an expectation depending on a parameter ⋮ Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds ⋮ Value iteration and adaptive dynamic programming for data-driven adaptive optimal control design ⋮ A combined algorithm for identification and approximation ⋮ On the ergodicity properties of some adaptive MCMC algorithms ⋮ Coupling importance sampling and multilevel Monte Carlo using sample average approximation ⋮ On asymptotic properties of a constant-step-size sign-error algorithm for adaptive filtering ⋮ On robustness of the Robbins-Monro method for parallel processing ⋮ Limit theorems for some adaptive MCMC algorithms with subgeometric kernels ⋮ Trajectory averaging for stochastic approximation MCMC algorithms ⋮ Asymptotic behavior of truncated stochastic approximation procedures ⋮ Recursive estimation in a class of models of deformation ⋮ Optimizing Adaptive Importance Sampling by Stochastic Approximation ⋮ Importance sampling and statistical Romberg method ⋮ Truncated stochastic approximation with moving bounds: convergence ⋮ A computational framework for empirical Bayes inference ⋮ On H-valued Robbins-Monro processes ⋮ Markovian stochastic approximation with expanding projections ⋮ Adaptive Monte Carlo variance reduction for Lévy processes with two-time-scale stochastic approximation ⋮ Q-learning algorithms with random truncation bounds and applications to effective parallel computing ⋮ Almost sure convergence of randomly truncated stochastic algorithms under verifiable condi\-tions ⋮ Rate of convergence of truncated stochastic approximation procedures with moving bounds ⋮ Improved results on the robustness of stochastic approximation algorithms ⋮ Robust adaptive importance sampling for normal random vectors ⋮ Liquidity Costs: A New Numerical Methodology and an Empirical Study ⋮ Unconstrained recursive importance sampling ⋮ Convergence of Markovian Stochastic Approximation with Discontinuous Dynamics ⋮ Continuous-Time Robust Dynamic Programming ⋮ Stochastic Recursive Inclusions in Two Timescales with Nonadditive Iterate-Dependent Markov Noise ⋮ Convergence analysis of dynamic stochastic approximation ⋮ Stochastic gradient algorithm with random truncations ⋮ On adaptive Markov chain Monte Carlo algorithms
This page was built for publication:
