An Optimal Algorithm for Online Unconstrained Submodular Maximization.
Tim RoughgardenJoshua R. WangPublished in: CoRR (2018)
Keyphrases
- objective function
- dynamic programming
- worst case
- optimal solution
- learning algorithm
- detection algorithm
- k means
- preprocessing
- theoretical analysis
- significant improvement
- np hard
- globally optimal
- probabilistic model
- cost function
- segmentation algorithm
- input data
- online learning
- expectation maximization
- computationally efficient
- online algorithms
- convergence rate
- real time
- improved algorithm
- clustering method
- high accuracy
- computational cost
- genetic algorithm
- neural network