Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds.
Amos BeimelHaim KaplanYishay MansourKobbi NissimThatchaphol SaranurakUri StemmerPublished in: CoRR (2021)
Keyphrases
- lower bound
- worst case
- learning algorithm
- computational cost
- upper bound
- optimization problems
- machine learning
- objective function
- theoretical analysis
- dynamic environments
- data sets
- special case
- memory requirements
- times faster
- machine learning algorithms
- significant improvement
- computational complexity
- data streams
- optimal solution
- data mining