Explicit SoS Lower Bounds from High-Dimensional Expanders.
Irit DinurYuval FilmusPrahladh HarshaMadhur TulsianiPublished in: ITCS (2021)
Keyphrases
- lower bound
- high dimensional
- upper bound
- branch and bound algorithm
- upper and lower bounds
- branch and bound
- low dimensional
- optimal solution
- worst case
- dimensionality reduction
- similarity search
- objective function
- high dimensional data
- nearest neighbor
- np hard
- high dimensionality
- parameter space
- data points
- metric space
- vc dimension
- high dimensional problems
- optimal cost
- multi dimensional
- sample complexity
- feature space
- sparse data
- lower bounding
- set of randomly generated instances