The covering problem and μ-dependent adaptive algorithms
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 42 (10) , 2616-2627
- https://doi.org/10.1109/78.324728
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Weak convergence and local stability properties of fixed step size recursive algorithmsIEEE Transactions on Information Theory, 1993
- A Provably Convergent Perceptron-Like Algorithm for Learning Hypercubic Decision RegionsPublished by Elsevier ,1991
- Neural net algorithms that learn in polynomial time from examples and queriesIEEE Transactions on Neural Networks, 1991
- Nonlinear Digital FiltersPublished by Springer Nature ,1990
- Adaptive Algorithms and Stochastic ApproximationsPublished by Springer Nature ,1990
- A comparison of two quantized state adaptive algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Adaptive filtering with binary reinforcementIEEE Transactions on Information Theory, 1984
- Analysis of recursive stochastic algorithmsIEEE Transactions on Automatic Control, 1977
- Techniques for Adaptive Equalization of Digital Communication SystemsBell System Technical Journal, 1966
- Stochastic Estimation of the Maximum of a Regression FunctionThe Annals of Mathematical Statistics, 1952