Research map / Learning theory and algorithms / Combinatorial and search optimization
Exploration of the Search Space of Gaussian Graphical Models for Paired Data
Alberto Roverato, Dung Ngoc Nguyen
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use twin lattice ordering with coherence principle instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation scenario A, p=8 | computation time (s): 17 -> 4 | Improved |
| use twin lattice ordering with coherence principle instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation scenario A, p=8 | number of fitted models: 580 -> 273 | Improved |
| use twin lattice ordering with coherence principle instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation scenario A, p=20 | computation time (s): 2102 -> 379 | Improved |
| use twin lattice ordering with coherence principle instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation scenario A, p=20 | number of fitted models: 27356 -> 10212 | Improved |
| use twin lattice ordering with coherence principle instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation scenario B, p=20 | computation time (s): 2226 -> 452 | Improved |
| use twin lattice ordering with coherence principle instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation scenario B, p=20 | number of fitted models: 26961 -> 10300 | Improved |
| use twin lattice ordering instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation (160 datasets) | relative computation time: between 16% and 20% of the time required by the procedure on the model inclusion lattice | Improved |
| use twin lattice ordering instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation (160 datasets) | relative number of fitted models: between 37% and 54% of the models fitted under the naive implementation | Improved |
| use twin lattice ordering instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation scenario A, p=20 | sTPR (%): 51.67 -> 70.00 | Improved |
| use twin lattice ordering instead of model inclusion lattice | stepwise backward elimination for pdRCON models · Simulation scenario B, p=20 | sTPR (%): 39.38 -> 54.38 | Improved |
Closest papers by meaning
- Simultaneous Inference for Pairwise Graphical Models with Generalized Score Matching (JMLR 2020 · similarity 0.86)
- The Multiple Quantile Graphical Model (NeurIPS 2016 · similarity 0.86)
- Learning Gaussian DAG Models without Condition Number Bounds (ICML 2025 · similarity 0.86)
- The Search Problem in Mixture Models (JMLR 2018 · similarity 0.86)
- Learning partial correlation graphs and graphical models by covariance queries (JMLR 2021 · similarity 0.86)
- A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models (ICML 2018 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
