The algorithm by Ferson et al. is surprisingly fast: An NP-hard optimization problem solvable in almost linear time with high probability.
Michal CernýOndrej SokolMiroslav RadaPublished in: CoRR (2019)
Keyphrases
- worst case
- learning algorithm
- high accuracy
- optimization algorithm
- expectation maximization
- tree structure
- improved algorithm
- np hard
- theoretical analysis
- objective function
- times faster
- experimental evaluation
- dynamic programming
- special case
- search space
- selection algorithm
- recognition algorithm
- convergence rate
- linear programming
- computational complexity
- particle swarm optimization
- data structure
- high efficiency
- estimation algorithm
- randomized algorithm
- simulated annealing
- np complete
- maximum likelihood
- neural network
- image sequences
- least squares
- probabilistic model
- computational cost
- lower bound
- preprocessing
- optimal solution