Gouverneur, A., Rodríguez-Gálvez, B., Oechtering, T. J., & Skoglund, M. (2024). Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems.
Chicago Style (17th ed.) CitationGouverneur, Amaury, Borja Rodríguez-Gálvez, Tobias J. Oechtering, and Mikael Skoglund. Chained Information-Theoretic Bounds and Tight Regret Rate for Linear Bandit Problems. 2024.
MLA (9th ed.) CitationGouverneur, Amaury, et al. Chained Information-Theoretic Bounds and Tight Regret Rate for Linear Bandit Problems. 2024.
Warning: These citations may not always be 100% accurate.