Dynamically Choosing the Candidate Algorithm with Ostasos in Online Optimization.
Weirong ChenJiaqi ZhengHaoyu YuPublished in: INFOCOM (2021)
Keyphrases
- cost function
- times faster
- experimental evaluation
- dynamic programming
- optimization algorithm
- optimal solution
- computational complexity
- preprocessing
- k means
- objective function
- optimization process
- improved algorithm
- worst case
- real time
- expectation maximization
- optimization method
- matching algorithm
- clustering method
- learning algorithm
- detection algorithm
- theoretical analysis
- particle swarm optimization
- simulated annealing
- computational cost
- ant colony optimization
- online learning
- combinatorial optimization
- image sequences
- optimization model
- candidate set
- optimization criteria
- stochastic gradient
- passive aggressive