On ε-Optimality of the Pursuit Learning Algorithm
From MaRDI portal
Recommendations
- The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \(\varepsilon\)-optimality
- 10.1162/153244303768966102
- Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models
- Attaining the Chebyshev bound for optimal learning: a numerical algorithm
- On boundedness of Q-learning iterates for stochastic shortest path problems
- Optimal learning under robustness and time-consistency
- Bayesian learning, smooth approximate optimal behavior, and convergence to \({\varepsilon}\)-Nash equilibrium
Cites work
- A new approach to the design of reinforcement schemes for learning automata
- A Stochastic Approximation Method
- An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata
- Clustering the wireless ad hoc networks: a distributed learning automata approach
- Discretized pursuit learning automata
- scientific article; zbMATH DE number 5848604 (Why is no real title available?)
- scientific article; zbMATH DE number 1972910 (Why is no real title available?)
- Learning Automata - A Survey
- Learning Optimal Discriminant Functions through a Cooperative Game of Automata
- Probability Inequalities for Sums of Bounded Random Variables
- Stochastic comparisons of order statistics from heterogeneous populations, with applications in reliability
- Stochastic ordering of classical discrete distributions
Cited in
(2)
This page was built for publication: On ε-Optimality of the Pursuit Learning Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165495)
