An Estimate of the Number of Samples to Convergence for Critic Algorithms.
Tomas HrycejPublished in: IJCNN (3) (2000)
Keyphrases
- computational complexity
- theoretical analysis
- run times
- execution times
- significant improvement
- data sets
- small number
- computationally efficient
- machine learning algorithms
- orders of magnitude
- times faster
- convergence rate
- space complexity
- high dimensional
- np hard
- benchmark datasets
- memory requirements
- data structure
- learning algorithm