Squeezing the Arimoto-Blahut algorithm for faster convergence.
Yaming YuPublished in: IEEE Trans. Inf. Theory (2010)
Keyphrases
- faster convergence
- global optimum
- experimental evaluation
- dynamic programming
- probabilistic model
- preprocessing
- detection algorithm
- optimization algorithm
- theoretical analysis
- computationally efficient
- learning algorithm
- simulated annealing
- times faster
- worst case
- computational cost
- computational complexity
- optimal solution
- maximum likelihood
- particle swarm optimization
- k means
- clustering method
- matching algorithm
- reinforcement learning
- convergence rate
- similarity measure
- estimation algorithm
- clustering algorithm