arxiv
PublishedJuly 1, 2026 at 4:00 AM
—neutral
Contextual Slate GLM Bandits with Limited Adaptivity
Publisher summary· verbatim
arXiv:2606.31449v1 Announce Type: new Abstract: We investigate the contextual slate bandit problem with generalized linear rewards under limited adaptivity. At each round, the learner is presented with $N$ sets of items, where each item is represented by a $d$-dimensional feature vector. The learner
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivDiffusion-warm sampling of the XY model enables fast thermalization at scale11harxivBLUEX v2: Benchmarking LLMs on Open-Ended Questions from Brazilian University Entrance Exams11harxivSurprise as a Signal for Plasticity and Metacognition11harxiv3D HAMSTER: Bridging Planning and Control in Hierarchical Vision Language Action Models through 3D Trajectory Guidance11hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗