Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits.
Gergely NeuGábor BartókPublished in: CoRR (2015)
Keyphrases
- preprocessing
- learning algorithm
- computational cost
- theoretical analysis
- computationally efficient
- improved algorithm
- dynamic programming
- relative importance
- objective function
- optimal solution
- significant improvement
- detection algorithm
- similarity measure
- weighting scheme
- experimental evaluation
- np hard
- cost function
- k means
- matching algorithm
- feature weighting
- optimization algorithm
- linear programming
- high accuracy
- worst case
- segmentation algorithm
- expectation maximization
- knn
- nearest neighbour
- computational complexity