Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning | NSF Public Access Repository

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Citation Details

Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning

Award ID(s):: 1845032

PAR ID:: 10504908

Author(s) / Creator(s):: Karbasi, Amin and

Publisher / Repository:: Proceedings of the 40th International Conference on Machine Learning

Date Published:: 2023-12-01

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Conference Paper:
The DOI is not currently available.