Optimistic No-regret Algorithms for Discrete Caching.
Naram MhaisenAbhishek SinhaGeorgios S. PaschosGeorgios IosifidisPublished in: CoRR (2022)
Keyphrases
- worst case
- orders of magnitude
- continuous domains
- combinatorial optimization
- computational complexity
- lower bound
- query processing
- significant improvement
- computational cost
- computationally efficient
- regret minimization
- neural network
- times faster
- benchmark datasets
- online learning
- simulated annealing
- bayesian networks
- search engine
- learning algorithm
- machine learning