=== Overview === 

 The section Overview tries to give a formal derivation of the Algorithm. Tough I am not an expert in the field the foregoing part of the article was easy to understand for me. Bringing the the section Overview to the same didadactic level would be an asset. The questions i have: How can I see that the equation is still redundant and what does the term redundant mean in this context? How does one come to the idea of defining A(x->x') as the specified minimum function?  

 Some other proposals for improvements: The meaning of the variable x' seems to be different from the one in the section intuition. Would it be an option to use another notation? Furthermore, the section repeats the definition of the algorithm in the previous section. However, at the same time it lists the steps of skipping samples to mitigate correlations. I suggest to put the complete list of steps into the previous section. Then, a proper name for the section Overview could e.g. be Formal Derivation.  

 Sorry, I am new to wikipedia and do not want to poke your text. Please let me know if you wish me to do some of the mentioned improvements.  
 —  21:07, 03 December 2012