Accelerating Linear Bandits with Persistent Candidate Sets
DGX agentarXiv:2610.13407v1 Announce Type: new Abstract: Exhaustive optimistic scoring can make action selection costly in linear bandits with a large fixed set of K actions, requiring O(K) score evaluations p