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 .
The Robbins–Monro algorithm, first described by Robbins and Monro in 1951, presents a strategy for resolving root-finding issues where the function is represented as an anticipated result. The equation possesses a singular solution at .