An approach to obtaining a parsimonious polynomial model from time series is proposed. An optimal minimal nonuniform time series embedding schema is used to obtain a time delay kernel. This scheme recursively optimizes an objective functional that eliminates a maximum number of false nearest neighbors between successive state space reconstruction cycles. A polynomial basis is then constructed from this time delay kernel. A sparse model from this polynomial basis is obtained by solving a regularized least squares problem. The constraint satisfaction problem is made computationally tractable by keeping the ratio between the number of constraints to the number of variables small by using fewer samples spanning all regions of the reconstructed state space. This helps the structure selection process from an exponentially large combinatorial search space. A forward stagewise algorithm is then used for fast discovery of the optimization path. Results are presented for the Mackey-Glass system.