Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates
The episode discusses a paper presenting algorithms for linear contextual bandits that achieve optimal performance with very few parameter updates. The hosts explore two methods, BLCE-G and BLCE, which balance theoretical tightness with computational efficiency. They also cover an extension to generalized linear models (BGLE), concluding that these practical solutions make advanced AI systems more accessible.