A detailed comparative analysis of μ lower bound algorithms.
Andrea FabriziClement RoosJean-Marc BiannicPublished in: ECC (2014)
Keyphrases
- comparative analysis
- lower bound
- upper bound
- worst case
- learning algorithm
- computational complexity
- optimization problems
- computationally efficient
- orders of magnitude
- recently developed
- search algorithm
- computational cost
- objective function
- reinforcement learning
- times faster
- data sets
- average case
- semi quantitative