in this talk, we discuss a few simple and optimal methods for solving stochastic variational inequalities (vi). a prominent application of our algorithmic developments is the stochastic policy evaluation problem in reinforcement learning. prior investigations in the literature focused on temporal difference (td) learning by employing nonsmooth finite time analysis motivated by stochastic subgradient descent leading to certain limitations. these encompass the requirement of analyzing a modified td algorithm that involves projection to an a-priori defined euclidean ball, achieving a non-optimal convergence rate and no clear way of deriving the beneficial effects of parallel implementation. our approach remedies these shortcomings in the broader context of stochastic vis and in particular when it comes to stochastic policy evaluation. we developed a variety of simple td learning type algorithms motivated by its original version that maintain its simplicity, while offering distinct advantages from a non-asymptotic analysis point of view. we first provide an improved analysis of the standard td algorithm that can benefit from parallel implementation. then we present versions of a conditional td algorithm (ctd), that involves periodic updates of the stochastic iterates, which reduce the bias and therefore exhibit improved iteration complexity. this brings us to the fast td (ftd) algorithm which combines elements of ctd and our newly developed stochastic operator extrapolation method. for a novel index resetting stepsize policy ftd exhibits the best known convergence rate. we also devised a robust version of the algorithm that is particularly suitable for discounting factors close to 1.