Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael A. Lehr

dblp:46/332 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 87% Learning theory · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
backpropagation
0.011990
30 years of adaptive neural networks: perceptron, Madaline, and backpropagation · Proc. IEEE 1990
Machine learning › Deep learning architectures and training
feedforward neural network
0.011990
30 years of adaptive neural networks: perceptron, Madaline, and backpropagation · Proc. IEEE 1990
Machine learning › Learning theory › online learning
online learning rule
0.011990
30 years of adaptive neural networks: perceptron, Madaline, and backpropagation · Proc. IEEE 1990

Methods — techniques the papers use, named apart from their topics

perceptron rule · 0.0madaline rules · 0.0least-mean-square · 0.0gradient descent · 0.0
YearPublicationVenuePosition
1993 Adaptive neural networks and their applications
abstract
Fundamental developments in feedforward artificial neural networks from the past 30 years are reviewed. the central theme of this article is a description of the history, origination, operating characteristics, and basic theory of several supervised neural network training algorithms including the Perceptron rule, the LMS algorithm, three Madaline rules, and the backpropagation technique. These methods were developed independently, but with the perspective of history they can all be related to each other. the concept which underlies these algorithms is the “minimal disturbance principle,” which suggests that during training it is advisable to inject new information into a network in a manner which disturbs stored information to the smallest extent possible. In the utilization of present-day rule-based expert systems, decision rules must always be known for the application of interest. Sometimes there are no rules, however. the rules are either not explicit or they simply do not exist. For such applications, trainable expert systems might be usable. Rather than working with decision rules, an adaptive expert system might observe the decisions made by a human expert. Looking over the expert's shoulders, an adaptive system can learn to make similar decisions to those of the human. Trainable expert systems have been used in the laboratory for real-time control of a “broom-balancing system.” © 1993 John Wiley & Sons, Inc.
Bernard Widrow, Michael A. Lehr
Int. J. Intell. Syst.2
1990 30 years of adaptive neural networks: perceptron, Madaline, and backpropagation
abstract
Fundamental developments in feedforward artificial neural networks from the past thirty years are reviewed. The history, origination, operating characteristics, and basic theory of several supervised neural-network training algorithms (including the perceptron rule, the least-mean-square algorithm, three Madaline rules, and the backpropagation technique) are described. The concept underlying these iterative adaptation algorithms is the minimal disturbance principle, which suggests that during training it is advisable to inject new information into a network in a manner that disturbs stored information to the smallest extent possible. The two principal kinds of online rules that have developed for altering the weights of a network are examined for both single-threshold elements and multielement networks. They are error-correction rules, which alter the weights of a network to correct error in the output response to the present input pattern, and gradient rules, which alter the weights of a network during each pattern presentation by gradient descent with the objective of reducing mean-square error (averaged over all training patterns).>
Bernard Widrow, Michael A. Lehr
Proc. IEEE2