Optimal Regret Algorithm for Pseudo-1d Bandit Convex Optimization.
Aadirupa SahaNagarajan NatarajanPraneeth NetrapalliPrateek JainPublished in: CoRR (2021)
Keyphrases
- convex optimization
- dynamic programming
- worst case
- primal dual
- optimal solution
- regret bounds
- image processing
- np hard
- objective function
- learning algorithm
- cost function
- pairwise
- computational complexity
- multi armed bandit
- object recognition
- linear programming
- total variation
- image segmentation
- global convergence
- convex formulation