Implementing Linear Bandits in Off-the-Shelf SQLite - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Implementing Linear Bandits in Off-the-Shelf SQLite

Résumé

The linear multi-armed bandit is a reinforcement learning model that is largely used for sequential decision making in applications such as online advertising and recommender systems. We show that LinUCB, a well-known cumulative reward maximization algorithm for linear bandits, can be implemented in off-the-shelf SQLite. Additionally, our empirical study shows that, when dealing with small bandit data, our SQLite implementation is faster than an implementation in off-the-shelf Python. We believe that our findings open the door for many promising research directions on the topic of in-DBMS federated learning because (i) in the federated learning paradigm, many data owners contribute to the same learning task while locally storing their small data, and (ii) SQLite is a DBMS embedded in billions of devices, hence being able to implement federated learning on top of SQLite is of great practical interest.
Fichier non déposé

Dates et versions

hal-03547303 , version 1 (28-01-2022)

Identifiants

  • HAL Id : hal-03547303 , version 1

Citer

Radu Ciucanu, Marta Soare, Sihem Amer-Yahia. Implementing Linear Bandits in Off-the-Shelf SQLite. EDBT 2022: International Conference on Extending Database Technology, Short paper, Mar 2022, Edinburgh (online), United Kingdom. pp.388-392. ⟨hal-03547303⟩
121 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More