Currently I'm looking into possibilities to prove that a trained neural network (based on a regression task) performs well on the whole sample space based on statements made from test set metrics. In other words, I want to make sure that there is no sample or region of samples out there, where the network performs badly on, assuming that the sample space is finite.

Are there any well established approaches for this?

  • $\begingroup$ cross-validation perhaps? $\endgroup$
    – Nikos M.
    Aug 22, 2020 at 6:24
  • $\begingroup$ CV would probably take a long time in order to make a reliably probabilistic statement about future errors made by the model right? How about looking at the normal distribution produced by the errors on the test set and making a statement like "The probability of a prediction error above x is y%"? $\endgroup$
    – GI Homer
    Aug 22, 2020 at 7:43

2 Answers 2


A definitive and deterministic answer regarding the existence of adversarial samples is only possible by checking the entire sample space, which you said is finite and hence feasible but maybe too computationally expensive.

I would suggest to generate a grid of samples over the entire space to get a somewhat representative subspace and evaluating the model on it. As you suggested, the normal error distribution out of that whould give you a more or less reliable probabilistic statement on future model errors, depending on the size of the subspace I guess.

However, I also am curious if there is a better way to evaluate ones model reliability.


The easiest way to check whether a neural network performs well or not is by going through an explainable approach.

This library : https://github.com/datamllab/xdeep

Will easily show where exactly your neural network is looking at with barely any added compute power or time. The process also requires very few lines of code!

For more details look into Explainable AI!

An example image of birds is given below:

enter image description here


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.