An α-No-Regret Algorithm For Graphical Bilinear Bandits.
Geovani RizkIgor ColinAlbert ThomasRida LarakiYann ChevaleyrePublished in: CoRR (2022)
Keyphrases
- preprocessing
- worst case
- k means
- learning algorithm
- detection algorithm
- probabilistic model
- similarity measure
- matching algorithm
- dynamic programming
- experimental evaluation
- computational cost
- np hard
- search space
- high accuracy
- linear programming
- theoretical analysis
- optimization algorithm
- computational complexity
- times faster
- multi armed bandit
- online algorithms
- improved algorithm
- confidence bounds
- recognition algorithm
- tree structure
- segmentation algorithm
- simulated annealing
- cost function