Wepresent an orchestration of the computations such that theoutcome isaccompanied withaproofofcorrectness thatcanbeverifiedwith substantially less computational resources than it takes to run the computations fromscratch withstate-of-the-art algorithms. Specifically,weadopt analgebraic proof system developed incomputational complexity theory,inwhich theproof is represented by a polynomial; evaluating the polynomial at a random point amounts to a verification of the proof with probabilistic guarantees.

The most well-known work in the reward shaping domain is the potential-based reward shaping (PBRS) method [12], which is the first to show that policy invariance can be guaranteed if the shaping reward function is in the form of the difference of potential values.

Alternatively, the spectral kernels are defined in the spectral domain [2,13,14]. Nonetheless, when modeling graph-structured data, prior kernels face severalchallenges.