On entropic convergence of algorithms in terms of domain partitions.
Anatol SlissenkoPublished in: CoRR (2016)
Keyphrases
- stochastic approximation
- computational cost
- learning algorithm
- orders of magnitude
- domain specific
- computationally efficient
- theoretical analysis
- data structure
- iterative algorithms
- times faster
- computational efficiency
- domain independent
- benchmark datasets
- worst case
- recently developed
- data clustering
- graph theory
- domain knowledge
- significant improvement