Some greedy algorithms for sparse polynomial chaos expansions

Ricardo Baptista, Valentin Stolbunov, Prasanth B. Nair

Abstract: Highlights•We consider the problem of efficiently learning sparse polynomial chaos expansions.•A novel parallelization strategy is proposed.•A randomized greedy algorithm is developed to handle large-scale problems.•A detailed theoretical analysis is carried out to evaluate the proposed algorithms.