This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of : it employs random models with accuracy guaranteed with a sufficiently large prefixed probability and deterministic inexact function evaluations within a prescribed level of accuracy. Without assuming unbiased estimators, the expected number of iterations is O( _1^ - 2 ) or O( _1^ - 3/2 ) when searching for a first-order critical point using a second or third order model, respectively, and of O( max [ _1^ - 3/2, _2^ - 3 ] ) when seeking for second-order critical points with a third order model, in which _j,j 1,2, is the j th-order tolerance. These results match the worst-case optimal complexity for the deterministic counterpart of the method. Preliminary numerical tests for first-order optimality in the context of nonconvex binary classification in imaging, with and without Artifical Neural Networks (ANNs), are presented and discussed.