Efficient Correlation Matching for Fitting Discrete Multivariate Distributions with Arbitrary Marginals and Normal-Copula Dependence
Bibliographic record
Abstract
A popular approach for modeling dependence in a finite-dimensional random vector X with given univariate marginals is via a normal copula that fits the rank or linear correlations for the bivariate marginals of X. In this approach, known as the NORTA method, the normal distribution function is applied to each coordinate of a vector Z of correlated standard normals to produce a vector U of correlated uniform random variables over (0,1); then X is obtained by applying the inverse of the target marginal distribution function for each coordinate of U. The fitting requires finding the appropriate correlation ρ between any two given coordinates of Z that would yield the target rank or linear correlation r between the corresponding coordinates of X. This root-finding problem is easy to solve when the marginals are continuous but not when they are discrete. In this paper, we provide a detailed analysis of this root-finding problem for the case of discrete marginals. We prove key properties of r and of its derivative as a function of ρ. It turns out that the derivative is easier to evaluate than the function itself. Based on that, we propose and compare alternative methods for finding or approximating the appropriate ρ. The case of discrete distributions with unbounded support is covered as well. In our numerical experiments, a derivative-supported method is faster and more accurate than a state-of-the-art, nonderivative-based method. We also characterize the asymptotic convergence rate of the function r (as a function of ρ) to the continuous-marginals limiting function, when the discrete marginals converge to continuous distributions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.026 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".