Non-standard methods to evaluate large and structured sums of products - especially ones involving moderately-exponential-time algorithms - have great prospects to significantly advance the state of the art in algorithm theory and computational statistics. The group's mission is to implement this vision in a prototyping manner by studying (a) algorithm theory of computing sums of products, (b) sums of products in computational statistics, and (c) applications in science and technology.