On Almost-Sure Bounds for the LMS Algorithm.
Michael A. KouritzinPublished in: IEEE Trans. Inf. Theory (1994)
Keyphrases
- experimental evaluation
- worst case
- detection algorithm
- dynamic programming
- learning algorithm
- theoretical analysis
- preprocessing
- error bounds
- significant improvement
- objective function
- optimization algorithm
- cost function
- computational cost
- segmentation algorithm
- high accuracy
- improved algorithm
- clustering method
- neural network
- search space
- expectation maximization
- computational complexity
- e learning
- upper and lower bounds
- average case
- matching algorithm
- ant colony optimization
- np hard
- k means