Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability.
Aadirupa SahaAkshay KrishnamurthyPublished in: CoRR (2021)
Keyphrases
- highly efficient
- computationally expensive
- learning algorithm
- worst case
- computationally efficient
- orders of magnitude
- dynamic programming
- theoretical analysis
- approximately optimal
- computationally demanding
- parallel architectures
- exhaustive search
- context sensitive
- efficient implementation
- times faster
- benchmark datasets
- machine learning algorithms
- significant improvement
- data structure
- data mining algorithms
- lower bound
- computational complexity
- single pass
- highly scalable
- efficient solutions
- linear space
- data mining
- algorithmic solutions
- efficient algorithms for computing
- neural network