Poincaré Bases Extend Gradient Sensitivity Analysis Beyond Polynomials
A Sturm--Liouville chaos basis makes derivative information orthogonal, improving Sobol index estimation on toy and flood models with small designs.
Underlying Paper
Gradient-enhanced global sensitivity analysis with Poincar{\'e} chaos expansions
Spectral methods, also known as chaos expansions, are widely used in global sensitivity analysis (GSA), as they leverage orthogonal bases of L2 spaces to efficiently compute Sobol' indices, particularly in data-scarce settings. When derivatives of the model are available, a desirable property, both for modeling and GSA purposes, is for the derivatives of the basis functions to also form an orthogonal basis. We demonstrate that the only basis satisfying this property is the one associated with weighted Poincar{\'e} inequalities and Sturm--Liouville eigenvalue problems, which we call Poincar{\'e} basis. We also show that under certain conditions the Poincar{\'e} basis achieves the same convergence rate as the best polynomial approximation for classes of smooth functions. We then introduce a comprehensive framework for gradient-enhanced GSA that integrates recent advances both in the construction of the expansion - with gradient-enhanced regression - and in the construction of weights for derivative-based sensitivity analysis. Furthermore, the proposed methodology is applicable to a broad class of probability measures and various choices of weights. We illustrate its efficiency on a challenging flood modeling case study, where Sobol' indices are accurately estimated using limited data.
Global sensitivity analysis often has to work in the regime where model evaluations are expensive and the input distribution is not one of the few cases handled cleanly by classical polynomial chaos. Derivatives can help, but they create a compatibility problem: a basis that is orthogonal for function approximation need not have derivatives that are also orthogonal in the right weighted space. This paper argues that the compatible choice is not an arbitrary polynomial family but the basis induced by weighted Poincaré inequalities and one-dimensional Sturm--Liouville eigenproblems.
Core Contribution
The central result is a characterization: under the paper's assumptions, the only basis whose derivatives also form an orthogonal basis is the Poincaré basis associated with a weighted Poincaré inequality. That gives the authors a principled replacement for standard polynomial chaos when the measure is nonstandard or when derivative-based sensitivity information is available.
The contribution is both theoretical and algorithmic. The paper defines Poincaré chaos expansions, or PoinCE, and a weighted variant, wPoinCE. It then connects them to two gradient-enhanced estimation schemes: an averaged derivative expansion and a combined regression using both model values and gradients. The point is not merely to add gradients to a regression design, but to choose basis functions whose derivative structure matches the sensitivity quantities being estimated.
Figure 2 shows the construction at the basis-function level: for uniform and truncated exponential measures, the finite-element estimates track the analytic Poincaré functions, while the weighted choice changes the shapes relative to the unweighted case.
Technical Approach
For each input variable, the method solves a one-dimensional weighted Sturm--Liouville problem to obtain basis functions adapted to the marginal distribution and derivative weight. Tensor-product chaos expansions are then built from these one-dimensional bases, with total-degree truncation used in the experiments. The implementation described in the paper uses UQLab, finite-element approximations for the spectral problem, Latin hypercube experimental designs, and LARS sparse regression with leave-one-out model selection.
The paper compares several estimators. Plain PoinCE and wPoinCE use only model evaluations. PoinCE-der-aggr and wPoinCE-der-aggr use averaged derivative expansions. PoinCE-comb-regr and wPoinCE-comb-regr solve a combined regression problem using both model values and gradients. The evaluation tracks three quantities: an validation error combining function and derivative mismatch, an validation error, and total Sobol indices computed from the expansion.
A useful detail is the treatment of gradient cost. If gradients are available at no extra cost, the derivative-enhanced methods get a direct advantage. If gradients are approximated by finite differences, one gradient evaluation costs roughly model evaluations, so the fair comparison shifts to larger model-only designs. The authors explicitly discuss both views rather than reporting a single favorable setting.
Results and Analysis
The first experiment is a four-dimensional interaction toy model with independent uniform inputs, total degree , and experimental design sizes from 25 to 200. In the unweighted case, both derivative-based expansions reduce the error relative to value-only PoinCE, and their total Sobol index estimates for and converge toward the reference dotted lines as the design grows. In the weighted case, wPoinCE-comb-regr is visibly stronger in error, while the total Sobol estimates are similar across the weighted variants once the design is large enough.
The paper's more informative comparison is the error, because changes with the weight. Figure 5 shows a clear advantage for the weighted construction on the toy model, especially for the combined gradient regression at larger design sizes.
The flood-cost model tests the method on a less polynomial-friendly setting. The model has eight independent inputs and a cost function based on maximal annual overflow and dyke maintenance cost. Several marginals are nonstandard for classical polynomial chaos, including truncated and triangular distributions, so the Poincaré basis is a better fit to the problem statement than a fixed Wiener--Askey family. The authors report the same pattern: derivative-based methods outperform value-only PoinCE in the unweighted case, and in the weighted case wPoinCE-comb-regr gives the best reported behavior. When gradient cost is counted as model evaluations, the advantage narrows, which is the right caveat for practitioners whose simulators do not provide adjoints or analytic gradients.
Limitations
The evidence supports the paper's claim that Poincaré bases are a coherent way to combine chaos expansions, derivatives, and Sobol index estimation. The strongest part is the mathematical characterization of the basis. The empirical case is more modest: two numerical studies, finite-element basis approximations, and comparisons under assumptions about gradient availability. For users with cheap gradients and nonstandard input measures, the method is attractive. For users who must estimate gradients by finite differences in high dimension, the cost accounting may erase much of the gain.
Evidence Box
moderateKey Claims
- •Poincaré bases are the unique chaos bases with orthogonal derivative bases under the stated assumptions
- •Weighted Poincaré chaos expansions adapt gradient-enhanced GSA to nonstandard probability measures
- •Combined value-gradient regression improves Sobol index estimation in small-design regimes
- •Weighted bases can reduce L² error compared with unweighted PoinCE and classical PCE
Key Results
- •Toy interaction model evaluated with d=4, total degree p=8, and ED sizes 25, 50, 100, and 200
- •Each Sobol index, L²(µ), and H¹(µ,w) estimate uses 30 bootstrap replicates
- •Flood model uses d=8 inputs, making one finite-difference gradient cost comparable to 8 model evaluations
- •Fair-cost comparisons match gradient ED sizes 20 and 40 against model-only ED sizes 160 and 320 in the flood setting
Limitations & Caveats
- •Empirical validation limited to one toy model and one flood-cost case study
- •Gradient advantage depends on whether derivatives are available cheaply or require finite differences
- •Weighted Poincaré bases for some flood-model marginals are justified numerically rather than by closed-form conditions
- •Finite-element construction of the basis adds approximation and implementation complexity