Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 568

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

Walach, E., Widrow, B.·1984·IEEE Transactions on Information Theory

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.1984.1056886

Cites

9 of 9 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 9 references

Cited by

See all 568

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.