We study distributed methods for online prediction and stochastic optimization. Our approach is iterative: in each round nodes first perform local computations and then communicate in order to aggregate information and synchronize their decision variables. Synchronization is accomplished through the use of a distributed averaging protocol. When an exact distributed averaging protocol is used, it is known that the optimal regret bound of \(\mathcal{O}({\sqrt{m}})\) can be achieved using the distributed mini-batch algorithm of Dekel et al.(2012), where \(m\) is the total number of samples processed across the network. We focus on methods using approximate distributed averaging protocols and show that the optimal regret bound can also be achieved in this setting. In particular, we propose a gossip-based optimization method which achieves the optimal regret bound. The amount of communication required depends on the network topology through the second largest eigenvalue of the transition matrix of a random walk on the network. In the setting of stochastic optimization, the proposed gossip-based approach achieves nearly-linear scaling: the optimization error is guaranteed to be no more than \(\epsilon\) after \(\mathcal{O}({ \frac{1}{n \epsilon^2} })\) rounds, each of which involves \(\mathcal{O}({\log n})\) gossip iterations, when \(n\) nodes communicate over a well-connected graph.