1997
DOI: 10.1109/78.558480
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of tracking algorithms for single layer threshold networks in the presence of random drift

Abstract: This paper analyzes the behavior of a variety of tracking algorithms for single-layer threshold networks in the presence of random drift. We use a system identification model to model a target network where weights slowly change and a tracking network. Tracking algorithms are divided into conservative and nonconservative algorithms. For a random drift rate of , we find upper bounds for the generalization error of conservative algorithms that are O(2=3) and for nonconservative algorithms that are O(). Bounds ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1997
1997
2008
2008

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…Unfortunately, when the dynamic of the process under investigation is faster than the tracking ability of the JIT classifier, last acquired samples are already obsolete and the JIT classifiers may lead to unsatisfactory results (in feedforward neural-network-based classifiers, we will update weights online, at each instant of time, to cope with such fast evolution, as suggested in [15]). …”
Section: Algorithm 3: Jit Adaptive Classifiersmentioning
confidence: 98%
See 1 more Smart Citation
“…Unfortunately, when the dynamic of the process under investigation is faster than the tracking ability of the JIT classifier, last acquired samples are already obsolete and the JIT classifiers may lead to unsatisfactory results (in feedforward neural-network-based classifiers, we will update weights online, at each instant of time, to cope with such fast evolution, as suggested in [15]). …”
Section: Algorithm 3: Jit Adaptive Classifiersmentioning
confidence: 98%
“…A time adaptive self-organizing map (SOM), automatically adjusting the network parameters to work both in stationary and nonstationary environments, is presented in [11]; Carpenter et al [12] propose a fuzzy ARTMAP as a nonparametric probability estimator for nonstationary pattern recognition problems and [13] a probabilistic neural network for classifying patterns characterized by time-varying distributions. In [14], an online tracking of analog neurons subject to slowly drifting weights is proposed, while Kuh [15] provides a comparison of tracking algorithms for single-layer threshold networks in presence of random drifts.…”
Section: Introductionmentioning
confidence: 99%
“…The knowledge-based modality assumes instead that some a priori information about the process (but not the model) is available, e.g., derived from data samples based on causal analysis [4] [6]. The identification of the time instant associated with the loss in stationarity allows the designer to take actions, e.g., by updating the classifier network weights to track the process evolution [7] or retraining the classifier [8] [9] exactly when needed.…”
Section: Introductionmentioning
confidence: 99%
“…To make the analysis tractable, this section discusses a number of assumptions that are used in the analysis of Section 4. 0 the drift rate 7 > 0 is small and can be neglected 0 the noise v ( k ) has small variance so that g(s(k) + (see discussion in [4]). …”
Section: Assumptionsmentioning
confidence: 98%