By Topic

On some convergence properties of 'learning with a probabilistic teacher' algorithms (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Satisfactory proof does not yet exist for the consistency of "learning with a probabilistic teacher" estimators, which are a class of randomized decision-directed estimators for adaptive multihypothesis decision making. Since a number of computer simulations described in the published literature indicate that the algorithms are convergent, we take as our starting point the assumption that this is generally true and develop an equation for use in determining for general distributions whether convergence is to the true parameter value. Using a numerical solution, we show that for the example of two one-dimensional Gaussian hypotheses and one unknown mean (the example appearing in the paper introducing the algorithm), if the estimator is convergent, convergence is to the true parameter value. Our formulation should be of help in constructing a more complete solution to the convergence problem and may be of use in investigating the consistency of other adaptive decision-making algorithms.

Published in:

Information Theory, IEEE Transactions on  (Volume:21 ,  Issue: 6 )