Skip to main content

🏢 Alan Turing Institute

Strategic Linear Contextual Bandits
·1349 words·7 mins· loading · loading
AI Theory Optimization 🏢 Alan Turing Institute
Strategic agents gaming recommender systems is solved by a novel mechanism that incentivizes truthful behavior while minimizing regret, offering a solution to a key challenge in online learning.
Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
·344 words·2 mins· loading · loading
AI Theory Optimization 🏢 Alan Turing Institute
Algorithm RESET achieves optimal switching regret simultaneously across all segmentations, offering efficiency and parameter-free operation.
Bandits with Abstention under Expert Advice
·2058 words·10 mins· loading · loading
AI Generated Machine Learning Reinforcement Learning 🏢 Alan Turing Institute
The Confidence-Rated Bandits with Abstentions (CBA) algorithm significantly improves reward bounds for prediction with expert advice by strategically leveraging an abstention action.