Optimal Regret for Single Index Bandits
DGX agentarXiv:2605.09454v1 Announce Type: cross Abstract: We study the extit{single-index bandit} problem, where rewards depend on an unknown one-dimensional projection of high-dimensional contexts through an