Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds.
Amos BeimelHaim KaplanYishay MansourKobbi NissimThatchaphol SaranurakUri StemmerPublished in: STOC (2022)
Keyphrases
- lower bound
- objective function
- lower and upper bounds
- theoretical analysis
- upper bound
- times faster
- optimization problems
- orders of magnitude
- running times
- neural network
- online algorithms
- algorithms require
- computationally efficient
- worst case
- significant improvement
- search algorithm
- learning algorithm
- machine learning