The Robbins–Monro algorithm, introduced in 1951 by Herbert Robbins and Sutton Monro, presented a methodology for solving a root finding problem, where the function is represented as an expected value. Assume that we have a function , and a constant , such that the equation  has a unique root at .
A root-finding approach was introduced by Robbins and Monro in 1951, which involves solving problems where a function is expressed as an expected outcome. The equation has a distinct solution at .