5227fa9a19dce7ba113f50a405dcaf09-AuthorFeedback.pdf

We believe that verifying whether or not a given26 network is in GP is actually computationally hard (See also related proofs on hardness of checking the Restricted27 Isometry property). There is an easy solution: an arbitrarily small random perturbation of the weights will create a28 GPnetworkalmostsurely.