Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization.

Norman Huang Allan Borodin

Published in: ISAAC (2014)

Keyphrases

orders of magnitude
learning algorithm
computationally expensive
computational complexity
worst case
times faster
objective function
lower bound
evolutionary algorithm
computational cost
upper bound
machine learning algorithms
error bounds
theoretical guarantees
direct optimization
generalization error bounds