The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The least mean fourth (LMF) adaptive algorithm and its family
Abstract
New steepest descent algorithms for adaptive filtering and have been devised which allow error minimization in the mean fourth and mean sixth, etc., sense. During adaptation, the weights undergo exponential relaxation toward their optimal solutions. Time constants have been derived, and surprisingly they turn out to be proportional to the time constants that would have been obtained if the steepest descent least mean square (LMS) algorithm of Widrow and Hoff had been used. The new gradient algorithms are insignificantly more complicated to program and to compute than the LMS algorithm. Their general form isW_{j+1} = W_{j} + 2 \mu K \epsilon_{j}^{2K-1}X_{j},whereW_{j}is the present weight vector,W_{j+1}is the next weight vector,\epsilon_{j}is the present error,X_{j}is the present input vector,\muis a constant controlling stability and rate of convergence, and2Kis the exponent of the error being minimized. Conditions have been derived for weight-vector convergence of the mean and of the variance for the new gradient algorithms. The behavior of the least mean fourth (LMF) algorithm is of special interest. In comparing this algorithm to the LMS algorithm, when both are set to have exactly the same time constants for the weight relaxation process, the LMF algorithm, under some circumstances, will have a substantially lower weight noise than the LMS algorithm. It is possible, therefore, that a minimum mean fourth error algorithm can do a better job of least squares estimation than a mean square error algorithm. This intriguing concept has implications for all forms of adaptive algorithms, whether they are based on steepest descent or otherwise.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adaptive noise cancelling: Principles and applications
Widrow, B., Glover, J. R., McCool, J. M., Kaunitz, J., Williams, C. S., Hearn, R. H., Zeidler, J. R., Eugene Dong, Jr., & Goodlin, R. C. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.10036 · Cited by 3,939
Self-citationWidrow, B., Mantey, P. E., Griffiths, L. J., & Goode, B. B. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.6092 · Cited by 1,051
Self-citationFast, recursive-least-squares transversal filters for adaptive filtering
Cioffi, J., & Kailath, T. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164334 · Cited by 730
Lattice filters for adaptive processing
Friedlander, B. (1982) · Proceedings of the IEEE · doi:10.1109/proc.1982.12407 · Cited by 520
Widrow, B., Mantey, P., Griffiths, L., & Goode, B. (1967) · The Journal of the Acoustical Society of America · doi:10.1121/1.2144028 · Cited by 415
Self-citationRecursive least squares ladder estimation algorithms
Lee, D., Morf, M., & Friedlander, B. (1981) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1981.1085020 · Cited by 138
Second-order convergence analysis of stochastic adaptive linear filtering
Macchi, O., & Eweda, E. (1983) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1983.1103120 · Cited by 135
Non-mean-square error criteria
Sherman, S. (1958) · IEEE Transactions on Information Theory · doi:10.1109/tit.1958.1057451 · Cited by 105
Convergence in distribution of LMS-type adaptive parameter estimates
Bitmead, R. R. (1983) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1983.1103143 · Cited by 46
Cited by
30 years of adaptive neural networks: perceptron, Madaline, and backpropagation
Widrow, B., & Lehr, M. A. (1990) · Proceedings of the IEEE · doi:10.1109/5.58323 · Cited by 2,242
Self-citationNew criteria for blind deconvolution of nonminimum phase systems (channels)
Shalvi, O., & Weinstein, E. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.52478 · Cited by 863
Metadata
- Authors
- Walach, E., & Widrow, B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1984-03
- Volume
- 30
- Issue
- 2
- Pages
- 275-283
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2097488004
- Cited by
- 568
- References
- 9
- FWCI
- 3.36
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The least mean fourth (LMF) adaptive algorithm and its family. https://app.cochat.ai/papers/10.1109/tit.1984.1056886
- The paper
- Walach, E., & Widrow, B. (1984). The least mean fourth (LMF) adaptive algorithm and its family. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1984.1056886
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.