Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
DGX agentarXiv:2508.08420v3 Announce Type: replace Abstract: We consider the problem of online regret minimization in linear bandits with access to prior observations (offline data) from the underlying bandit