Copula Active Subspaces I: A Score-Covariance Method for Reduced-Order Non-Gaussian Density Estimation
stat.ME, stat.CO, stat.ML
Submitted: 2026-09-28
Updated: 2026-10-01
Comments: 26 pages, 5 figures; supplementary materials 15 pages. Submitted to the SIAM/ASA Journal on Uncertainty Quantification. Code: https://github.com/joshuawchen/copula_active_subspaces (tag v1.0-part1). v2: Theorem 2.2 stated as the bound of Zahm et al. with a short proof, relation of Stage 1 to score ratio matching, corrected normalizer range in Appendix G
Code: https://github.com/joshuawchen/copula
License: http://creativecommons.org/licenses/by/4.0/
The gist: In Bayesian inference problems with non-Gaussian observation noise, the posterior is only as accurate as the noise density, and gradient-based samplers need that density and its gradient evaluable
Terminology
Abstract
In Bayesian inference problems with non-Gaussian observation noise, the posterior is only as accurate as the noise density, and gradient-based samplers need that density and its gradient evaluable pointwise, whether from an explicit expression or from code, and without an inner solve. We propose Copula Active Subspaces (CAS) to represent this noise density. A componentwise rank transform isolates the noise law's dependence in its copula, and a rank- r reduction keeps only the directions along which that dependence varies. These directions are the leading eigenvectors of the copula score covariance:= Cov π(grad c Z), which is what makes the reduction a copula active subspace. Because vanishes when the coordinates are independent, these are directions of dependence, which the covariance of the data need not identify. From this construction follow a Gaussian-reference KL divergence bound with the explicit constant 2, minimized over all rank- r reductions by exactly this eigenspace; a diagnostic for the error the reduction leaves behind, computable from the samples alone; and, from Hermite score matching, a reduced log-density and gradient in closed form, with the truncation orders and the Stage-2 regularization constants chosen on validation samples. The reduction replaces a d-dimensional density estimation problem by an r-dimensional one. On a d=20 noise law and a Bayesian inference problem with that noise, CAS lowers noise KL divergence more than fivefold and posterior KL divergence more than sevenfold against Gaussian-copula, product-of-marginals, and PCA-subspace baselines, and lowers noise KL divergence by factors of about 3.5 and 2.7 on two further d=20 examples.
Sources
Related papers
- Doubly robust inference via calibration
- Bayesian Empirical Bayes: Simultaneous Inference from Probabilistic Symmetries
- Optimal Watermark Localization in Mixed-Source Large Language Model Texts
- Flexible Nonparametric Inference for Causal Effects under the Front-Door Model
- A Greedy PDE Router for Blending Neural Operators and Classical Methods
- Policy Learning with Weak Signals