Many applications require minimizing a family of optimization problems indexed by some hyperparameter $λ\in Λ$ to obtain an entire solution path. Traditional approaches proceed by discretizing $Λ$ and solving a series of optimization problems. We propose an alternative approach that parameterizes the solution path with a set of basis functions and solves a \emph{single} stochastic optimization problem to learn the entire solution path. Our method offers substantial complexity improvements over discretization. When using constant-step size SGD, the uniform error of our learned solution path relative to the true path exhibits linear convergence to a constant related to the expressiveness of the basis. When the true solution path lies in the span of the basis, this constant is zero. We also prove stronger results for special cases common in machine learning: When $λ\in [-1, 1]$ and the solution path is $ν$-times differentiable, constant step-size SGD learns a path with $ε$ uniform error after at most $O(ε^{\frac{1}{1-ν}} \log(1/ε))$ iterations, and when the solution path is analytic, it only requires $O\left(\log^2(1/ε)\log\log(1/ε)\right)$. By comparison, the best-known discretization schemes in these settings require at least $O(ε^{-1/2})$ discretization points (and even more gradient calls). Finally, we propose an adaptive variant of our method that sequentially adds basis functions and demonstrates strong numerical performance through experiments.