A Sampling Technique of Proving Lower Bounds for Noisy Computations.
Chinmoy DuttaJaikumar RadhakrishnanPublished in: CoRR (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- upper and lower bounds
- lower and upper bounds
- randomly generated problems
- optimal cost
- quadratic assignment problem
- noisy data
- np hard
- optimal solution
- noise free
- linear programming relaxation
- online algorithms
- data sets
- worst case
- image registration
- learning theory
- class imbalance
- special case
- imbalanced data
- lower bounding
- neural network