Pages that link to "Item:Q2220572"

The following pages link to Some greedy algorithms for sparse polynomial chaos expansions (Q2220572):

Displaying 10 items.

• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions (Q349012) (← links)
• Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
• An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion (Q1988232) (← links)
• Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling (Q2060149) (← links)
• Compressive sensing adaptation for polynomial chaos expansions (Q2214527) (← links)
• Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (Q2309799) (← links)
• Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions (Q3176252) (← links)
• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark (Q4995117) (← links)
• A novel sparse polynomial chaos expansion technique with high adaptiveness for surrogate modelling (Q6072781) (← links)
• An active sparse polynomial chaos expansion approach based on sequential relevance vector machine (Q6120140) (← links)