The design of absorbing Bayesian pursuit algorithms and the formal analyses of their ε-optimality

The fundamental phenomenon that has been used to enhance the convergence speed of learning automata (LA) is that of incorporating the running maximum likelihood (ML) estimates of the action reward probabilities into the probability updating rules for selecting the actions. The frontiers of this fiel...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Pattern analysis and applications : PAA 2017-08, Vol.20 (3), p.797-808
Hauptverfasser:	Zhang, Xuan, Oommen, B. John, Granmo, Ole-Christoffer
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Bayesian analysis Computer Science Convergence Estimates Maximum likelihood estimates Optimization Pattern Recognition Theoretical Advances
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!