João Silva, Tianyi Jiang, Troy Butler, Harri Hakula, Timothy Wildey
We lifted 1 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| CU-Denver-UQ/Iterative-DCI | canonical | 0 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| rejection_sampling | Not yet run | CU-Denver-UQ/Iterative-DCI/iDCI-paper/Example-1-Linear/IterativeDCI_Paper_Example1.py pointer only (licence: LGPL-2.1) · get_code("0bdd2f3fe387c86f") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Data-consistent inversion (DCI) constructs probability measures whose push-forward distributions agree with observed data, while iterative data-consistent inversion (iDCI) extends this framework to generalized stochastic inverse problems by enforcing multiple push-forward constraints sequentially. Although iDCI avoids the direct approximation of high-dimensional joint densities, its relationship to the original joint DCI solution has remained unclear. In this work, we establish this relationship through copula theory. Using Sklar's theorem, we derive a factorization of the DCI update into separate marginal and dependence transformations and show that the discrepancy remaining after convergence of the iDCI algorithm is entirely characterized by the copulas associated with the observed and predicted joint distributions. This characterization motivates a copula-transformed iDCI solution, and we prove that an exact copula transformation recovers the original DCI solution. We further establish convergence results for approximate copula transformations under converging sequences of reference measures and progressively enriched feasible sets. Numerical examples demonstrate how the geometry induced by the quantity-of-interest map governs the importance of the copula transformation, illustrate an adaptive reference-measure refinement strategy for improving computational accuracy under a fixed sampling budget, and demonstrate the progressive refinement of generalized stochastic inverse problems through heterogeneous, asynchronously acquired experiments.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2609.02832")
get_code_for_paper("2609.02832")
have("2609.02832")
Connect an agent — have() is free.