Follow the Perturbed Leader for Linear Bandits: sqrt{T} Regret over General Convex Sets
DGX agentarXiv:2610.17818v1 Announce Type: new Abstract: We give the first adversarial linear bandit algorithm based on Follow-the-Perturbed-Leader (FTPL) that achieves sqrt{T} regret over general convex actio