Sparse Inverse Covariance Estimation for Causal Inference in Process Data Analytics
Bibliographic record
Abstract
Causal analysis plays a vital role in determining the underlying relationship among the variables in a system from the data. In this article, the sparse inverse covariance (SIC) estimation is coupled with likelihood score, and a two-step approach is proposed to address the problem of causal analysis. The estimation of SIC matrix for undirected sparse network reconstruction is performed with the$L_{0}$-norm constraint in the framework of greedy sparse simplex (GSS) algorithm. Furthermore, the GSS algorithm is suitably modified to incorporate the additional constraint of positive semidefiniteness of the inverse covariance matrix. To determine the causal direction among the variables, the likelihood score is computed for the associated variables in the reconstructed network in the second step. The efficacy of the proposed approach for causal analysis is illustrated using numerical examples and an industrial application on prediction of flooding and weeping in a deethanizer column associated with a fluid catalytic cracking unit. From these studies, it is observed that the proposed approach is able to recover causal connections accurately in both cases. Furthermore, the probable reasons for the occurrence of flooding and weeping phenomena in an industrial deethanizer unit are also inferred from the identified causal network.
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.023 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.004 |
| 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".