Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring.
Junpei KomiyamaJunya HondaHiroshi NakagawaPublished in: NIPS (2015)
Keyphrases
- worst case
- lower bound
- optimal solution
- objective function
- dynamic programming
- competitive ratio
- k means
- cost function
- detection algorithm
- expectation maximization
- np hard
- computational complexity
- regret bounds
- upper bound
- optimal cost
- search space
- locally optimal
- probabilistic model
- branch and bound algorithm
- preprocessing
- strongly np hard
- randomized algorithm
- confidence bounds
- genetic algorithm
- lower and upper bounds
- exhaustive search
- finite number
- single machine
- monte carlo
- least squares
- scheduling problem
- learning algorithm