We, then, theoretically prove that the minimization of the above function acts to minimize an upper bound of the network's square error.
In contrast, the above function tends to infinity as z approaches 0; thus, it is not bounded and the singularity is not removable (in this case, it is known as a simple pole).
The above function exists almost everywhere for.
The above function indicates that is inlier if, otherwise outlier.
The encoding optimization module is based on the above function.
The above function is not among these, since its derivative is discontinuous.
The proof will be finished if the above function satisfies the inequalities (3.38).
Thus, the above function ψ is introduced also for solutions of (2.21) and (2.22).
It is easy to obtain the decision threshold in terms of the above function: (22).
Differentiating the above function with respect to G and setting it to zero, we have (61).
The above function U ( r, f ) is called a logarithmic-type function of T ( r, f ).
