2 papers
cs.LG2022
Efficient Kernel UCB for Contextual Bandits
Houssam Zenati, Alberto Bietti, Eustache Diemert +3
In this paper, we tackle the computational efficiency of kernelized UCB algorithms in contextual bandits. While standard methods require a O(CT^3) complexity where T is the horizon…
cs.LG2022
Lessons from the AdKDD'21 Privacy-Preserving ML Challenge
Eustache Diemert, Romain Fabre, Alexandre Gilotte +6
Designing data sharing mechanisms providing performance and strong privacy guarantees is a hot topic for the Online Advertising industry. Namely, a prominent proposal discussed und…