Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure.

Matthew S. Brennan Guy Bresler Wasim Huleihel

Published in: COLT (2018)

Keyphrases

lower bound
mathematical programming
objective function
cutting plane
evolutionary algorithm
data sets
optimization problems
np complete
learning theory
linear programming
randomly generated problems
sparse data
combinatorial optimization
hierarchical structure
upper bound
reinforcement learning
feature selection