High-dimensional Contextual Bandit Problem without Sparsity
Published in Advances in Neural Information Processing Systems (NeurIPS), 2023
This paper addresses high-dimensional contextual bandit problems without sparsity assumptions. We provide theoretical guarantees and practical algorithms for contextual bandits in high-dimensional settings where traditional sparsity assumptions do not hold.
Recommended citation: Komiyama, J., & Imaizumi, M. (2023). “High-dimensional Contextual Bandit Problem without Sparsity.” In Advances in Neural Information Processing Systems (NeurIPS 2023).
Recommended citation: Komiyama, J., & Imaizumi, M. (2023). "High-dimensional Contextual Bandit Problem without Sparsity." In Advances in Neural Information Processing Systems (NeurIPS 2023).
Download Paper