On a Stochastic Approximation Method
From MaRDI portal
Publication:5832444
DOI10.1214/aoms/1177728716zbMath0059.13203OpenAlexW1972711404WikidataQ59650390 ScholiaQ59650390MaRDI QIDQ5832444
Publication date: 1954
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177728716
Related Items
Efficient Robbins–Monro procedure for multivariate binary data, On a new stopping rule for stochastic approximation, Attaining specified reliability in component design: a stochastic approximation approach, Stochastic algorithms for self-consistent calculations of electronic structures, A Bayesian stochastic approximation method, A fully stochastic second-order trust region method, Asymptotic properties of a sequential estimator of expectation in the presence of trend, A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks, Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization, On the choice of step size in the Robbins-Monro procedure, Unnamed Item, Normal approximation and large deviations for the Robbins-Monro Process, Solving deterministic problems by stochastic approximation, Sensitivity analysis of stationary performance measures for Markov chains, A dynamic method of moments, Application of stochastic approximation to the tracking of a stochastic non-linear dynamic system†, Extremum seeking under stochastic noise and applications to mobile sensors, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, Importance accelerated Robbins-Monro recursion with applications to parametric confidence limits, Unnamed Item, Zeroth-order optimization with orthogonal random directions, Computing highly accurate confidence limits from discrete data using importance sampling, Deep limits of residual neural networks, On the rate of convergence of the Robbins-Monro method, No-regret learning for repeated non-cooperative games with lossy bandits, Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality, Central limit theorems for stochastic gradient descent with averaging for stable manifolds, Distributed optimal frequency control under communication packet loss in multi-agent electric energy systems, Distributed stochastic compositional optimization problems over directed networks, A limit theorem for the Robbins-Monro approximation, Penalty methods with stochastic approximation for stochastic nonlinear programming, Moderate deviations for a class of recursions, Fully-sequential procedures in nonlinear design problems, Sequential Designs for Binary Data with the Purpose to Maximize the Probability of Response, On a continuous analogue of the stochastic difference equation \(X_ n\) = rho X//(n-1) + \(B_ n\)., A sparsity preserving stochastic gradient methods for sparse regression, Iterated least squares in multiperiod control, Unnamed Item, Why random reshuffling beats stochastic gradient descent, Asymptotic Statistical Results: Theory and Practice, On variance reduction for stochastic smooth convex optimization with multiplicative noise, Asymptotic optimality for consensus-type stochastic approximation algorithms using iterate averaging, Optimization Methods for Large-Scale Machine Learning, Unnamed Item, An invariance principle for the Robbins-Monro process in a Hilbert space, Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization, Stochastic approximation, Unnamed Item, Unnamed Item, Analysis and design of decision-directed learning schemes using stochastic approximation, Stepwise BAN estimators for exponential families with multivariate normal applications, Asymptotic behavior for the Robbins–Monro process, A stochastic Newton-Raphson method, Scalable estimation strategies based on stochastic approximations: classical results and new insights, Variations of the robbins—monro procedure for estimating ED(p)in the logit model, Martingales and the Robbins-Monro procedure in \(D[0,1\)], Up-and-Down Designs for Selecting the Dose with Maximum Success Probability, Stochastic approximation algorithms for superquantiles estimation, Efficient recursive estimation. Application to estimating the parameters of a covariance function, Optimization via simulation: A review, Isotonic estimation in stochastic approximation, How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths, Complete convergence of stochastic approximation algorithm in ℝdunder random noises, Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures, Lower error bounds for the stochastic gradient descent optimization algorithm: sharp convergence rates for slowly and fast decaying learning rates, System identification from noise-corrupted measurements, Über ein Problem der stochastischen Approximation und ein Matrixsummierungsverfahren für Zahlenfolgen, A new sequential approximation method, Unnamed Item, Strong representation of an adaptive stochastic approximation procedure, An Optimizing Up-and-Down Design, Convergence Rate of Incremental Gradient and Incremental Newton Methods, Adaptive designs for quantal dose-response experiments with false answers, Application of multiple Fourier series to identification of multivariable non-stationary systems, Stochastic Algorithms for the Estimation of an Optimal Solution of a LP Problem. Convergence and Central Limit Theorem, Robust Power Management via Learning and Game Design, On a stochastic approximation procedure based on averaging, Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions, Asymptotic Results of Stochastic Decomposition for Two-Stage Stochastic Quadratic Programming, An orthogonal series estimate of time-varying regression, Fundamental design principles for reinforcement learning algorithms, Asymptotic behaviour of a class of stochastic approximation procedures, Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization, On a continuous time stochastic approximation problem
