A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits.
Jiafan HeTianhao WangYifei MinQuanquan GuPublished in: CoRR (2022)
Keyphrases
- single pass
- learning algorithm
- preprocessing
- k means
- worst case
- computational complexity
- detection algorithm
- dynamic programming
- matching algorithm
- probabilistic model
- pruning strategy
- high efficiency
- computationally efficient
- improved algorithm
- times faster
- linear complexity
- linear space
- high accuracy
- cost function
- simulated annealing
- recognition algorithm
- highly efficient
- significant improvement
- theoretical analysis
- expectation maximization
- particle swarm optimization
- path planning
- closed form
- convergence rate
- upper bound
- np hard
- decision trees