Skip to main content
Figure 5 | Fixed Point Theory and Algorithms for Sciences and Engineering

Figure 5

From: Learning without loss

Figure 5

Time series of \(\mathtt {RRR\_err}\), the distance between constraint sets A and B, for three runs of the algorithm on the \(m=6\) LEDM instance. As \(\mathtt {RRR\_err}\) is analogous to loss, we see that RRR has no trouble negotiating many local minima in the course of finding solutions

Back to article page