A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs.
Chloé RouyerDirk van der HoevenNicolò Cesa-BianchiYevgeny SeldinPublished in: NeurIPS (2022)
Keyphrases
- online learning
- high accuracy
- k means
- computational cost
- preprocessing
- times faster
- cost function
- particle swarm optimization
- minimum spanning tree
- computational complexity
- detection algorithm
- objective function
- search space
- significant improvement
- np hard
- dynamic programming
- optimization algorithm
- matching algorithm
- graph structure
- simulated annealing
- probabilistic model
- experimental evaluation
- graph isomorphism
- finding the shortest path
- graph construction
- machine learning
- graph matching
- optimal solution
- bayesian networks
- similarity measure
- genetic algorithm