Trajectory growth lower bounds for random sparse deep ReLU networks.
Ilan PriceJared TannerPublished in: ICMLA (2021)
Keyphrases
- lower bound
- upper bound
- high dimensional
- social networks
- network structure
- objective function
- np hard
- computer networks
- lower and upper bounds
- random instances
- lower bounding
- sparse coding
- branch and bound algorithm
- scale free networks
- trajectory data
- compressive sensing
- upper and lower bounds
- branch and bound
- sparse representation
- worst case
- scheduling problem