Tight performance bounds in the worst-case analysis of feed-forward networks.
Anne BouillardEric ThierryPublished in: Discret. Event Dyn. Syst. (2016)
Keyphrases
- worst case analysis
- worst case
- average case
- lower bound
- upper bound
- linear programming relaxation
- np hard
- greedy algorithm
- generalization error bounds
- approximation algorithms
- greedy heuristic
- vc dimension
- lower and upper bounds
- machine learning
- sample size
- computational complexity
- np hardness
- optimal solution
- objective function