Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
arXiv:2506.13163v3 Announce Type: replace
Abstract: We study the Logistic Contextual Slate Bandit problem, where, at each round, an agent selects a slate of $N$ items from an exponentially large set (of size $2^{\Omega(N)}$) of candidate slates provid…