Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Citations Over TimeTop 14% of 2018 papers

Abstract

We propose an online algorithm for sequential learning in the contextual multiarmed bandit setting. Our approach is to partition the context space and, then, optimally combine all of the possible mappings between the partition regions and the set of bandit arms in a data-driven manner. We show that in our approach, the best mapping is able to approximate the best arm selection policy to any desired degree under mild Lipschitz conditions. Therefore, we design our algorithm based on the optimal adaptive combination and asymptotically achieve the performance of the best mapping as well as the best arm selection policy. This optimality is also guaranteed to hold even in adversarial environments since we do not rely on any statistical assumptions regarding the contexts or the loss of the bandit arms. Moreover, we design an efficient implementation for our algorithm using various hierarchical partitioning structures, such as lexicographical or arbitrary position splitting and binary trees (BTs) (and several other partitioning examples). For instance, in the case of BT partitioning, the computational complexity is only log-linear in the number of regions in the finest partition. In conclusion, we provide significant performance improvements by introducing upper bounds (with respect to the best arm selection policy) that are mathematically proven to vanish in the average loss per round sense at a faster rate compared to the state of the art. Our experimental work extensively covers various scenarios ranging from bandit settings to multiclass classification with real and synthetic data. In these experiments, we show that our algorithm is highly superior to the state-of-the-art techniques while maintaining the introduced mathematical guarantees and a computationally decent scalability.

Related Papers

• → A fine-grained load balancing technique for improving partition-parallel-based ontology matching approaches(2016)8 cited
• → Relaxation of constraints in lexicographic multiobjective programming problems(2014)7 cited
• → Full Tree-Based Encoding Technique for Dynamic XML Labeling Schemes(2012)5 cited
• An Optimistic-Based Partition-Processing Approach for Distributed Shared Memory Systems(2002)
• Susquehanna Chorale Spring Concert "Roots and Wings"(2017)