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

DOI10.1007/S10044-016-0535-1zbMATH Open1425.68361DBLPjournals/paa/ZhangOG17OpenAlexW2309123164WikidataQ60327694 ScholiaQ60327694MaRDI QIDQ2337586FDOQ2337586

Authors: Xuan Zhang, B. John Oommen, Ole-Christoffer Granmo 

Publication date: 20 November 2019

Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11250/2436428

Recommendations

• On ε-Optimality of the Pursuit Learning Algorithm
• Discretized pursuit learning automata
• Absorbing and Ergodic Discretized Two-Action Learning Automata
• On conditional optimality of a class of learning automata in random environments
• epsilon -optimal discretized linear reward-penalty learning automata

zbMATH Keywords

\(\varepsilon\)-optimality of LA\textit{beta} distributionBayesian pursuit algorithms (BPA)discretized Bayesian pursuit algorithms (DBPA)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Cites Work

• Learning Automata - A Survey
• Discretized pursuit learning automata
• Graph partitioning using learning automata
• Absorbing and Ergodic Discretized Two-Action Learning Automata
• On ε-Optimality of the Pursuit Learning Algorithm

Cited In (2)

• On ε-Optimality of the Pursuit Learning Algorithm
• Pioneering approaches for enhancing the speed of hierarchical LA by \textit{ordering} the actions

This page was built for publication: The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \(\varepsilon\)-optimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337586)