An estimate of the number of samples to convergence for critic algorithms

被引：0
|
作者：
Hrycej, T [1 ]
机构：
[1] DaimlerChrysler AG, Res Ctr Ulm, D-89013 Ulm, Germany
来源：
IJCNN 2000: PROCEEDINGS OF THE IEEE-INNS-ENNS INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOL III | 2000年
关键词：
D O I：
10.1109/IJCNN.2000.861308
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Simplified critic based neurocontrol algorithms are analyzed for expected number of samples to convergence. It is shown that there is a fundamental difference in the complexity behavior between the batch and the incremental algorithm, and between the algorithm using and not using an explicit plant model. The batch algoritm using plant model is superior to other variants.
引用
收藏
页码：227 / 232
页数：6
相关论文
共 50 条
  • [1] USING RELIABILITY-ANALYSIS TO ESTIMATE THE NUMBER OF GENERATIONS TO CONVERGENCE IN GENETIC ALGORITHMS
    CHAKRABORTY, UK
    DASTIDAR, DG
    INFORMATION PROCESSING LETTERS, 1993, 46 (04) : 199 - 209
  • [2] An analysis on convergence and convergence rate estimate of genetic algorithms in noisy environments
    Li, Jun-Hua
    Li, Ming
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2011, 39 (08): : 1898 - 1902
  • [3] ESTIMATE OF THE RATE OF CONVERGENCE OF RECURSIVE ROBUST IDENTIFICATION ALGORITHMS
    KULCHITSKIY, OY
    MOZGOVOI, AE
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 1994, 32 (02) : 33 - 38
  • [4] An analysis on convergence and convergence rate estimate of elitist genetic algorithms in noisy environments
    Li, Jun-hua
    Li, Ming
    OPTIK, 2013, 124 (24): : 6780 - 6785
  • [5] On the number of iterations for convergence of CoSaMP and Subspace Pursuit algorithms
    Satpathi, Siddhartha
    Chakraborty, Mrityunjoy
    APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2017, 43 (03) : 568 - 576
  • [6] Minimum number of generations required for convergence of Genetic Algorithms
    Gibbs, Matthew S.
    Maier, Holger R.
    Dandy, Graeme C.
    Nixon, John B.
    2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 565 - +
  • [7] Optimal deterministic group testing algorithms to estimate the number of defectives
    Bshouty, Nader H.
    Haddad-Zaknoon, Catherine A.
    THEORETICAL COMPUTER SCIENCE, 2021, 874 (874) : 46 - 58
  • [8] Calculation of the number of samples needed to estimate the species richness of a taxocene
    Sukhanov, V. V.
    RUSSIAN JOURNAL OF MARINE BIOLOGY, 2016, 42 (03) : 276 - 278
  • [9] Calculation of the number of samples needed to estimate the species richness of a taxocene
    V. V. Sukhanov
    Russian Journal of Marine Biology, 2016, 42 : 276 - 278
  • [10] Determining the Number of Samples Required to Estimate Entropy in Natural Sequences
    Back, Andrew D.
    Angus, Daniel
    Wiles, Janet
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (07) : 4345 - 4352
12345