A class of learning/estimation algorithms using nominal values: Asymptotic analysis and applications
DOI10.1023/A:1004622313930zbMATH Open1009.62069MaRDI QIDQ1579641FDOQ1579641
Authors: K. Yin, G. Yin, Bing Liu, E. K. Boukas 
Publication date: 11 January 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
- On universal estimators in learning theory
- scientific article; zbMATH DE number 2128090
- Asymptotic behaviour of a learning algorithm
- On adaptive estimators in statistical learning theory
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Learning theory estimates with observations from general stationary stochastic processes
- Statistical learning based on Markovian data maximal deviation inequalities and learning rates
- Approximating distributions in stochastic learning
estimationlearningkernel functionmonitoringstochastic approximationsindustrial processespassive strategy
Applications of statistics in engineering and industry; control charts (62P30) Learning and adaptive systems in artificial intelligence (68T05) Stochastic approximation (62L20)
Cites Work
- A Stochastic Approximation Method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Budget-Dependent Convergence Rate of Stochastic Approximation
- Rates of Convergence for a Class of Global Stochastic Optimization Algorithms
- Passive stochastic approximation
- Nonparametric sequential estimation of zeros and extrema of regression functions
- Asymptotically optimal rate of convergence of smoothed stochastic recursive algorithms
- Passive stochastic approximation with constant step size and window width
Cited In (1)
This page was built for publication: A class of learning/estimation algorithms using nominal values: Asymptotic analysis and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579641)
