Greedy relaxations of the sparsest permutation algorithm.
Wai-Yin LamBryan AndrewsJoseph D. RamseyPublished in: UAI (2022)
Keyphrases
- dynamic programming
- times faster
- cost function
- expectation maximization
- preprocessing
- computational cost
- learning algorithm
- detection algorithm
- high accuracy
- np hard
- experimental evaluation
- greedy algorithms
- locally optimal
- computationally efficient
- theoretical analysis
- segmentation algorithm
- classification algorithm
- greedy strategy
- hill climbing
- selection algorithm
- convergence rate
- greedy algorithm
- neural network
- optimal solution
- optimization algorithm
- computational complexity
- particle swarm optimization
- search space
- k means