AI Paper Atlas

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

JMLR 2024 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms

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 changedWhereMeasuredEffect
use twin lattice ordering with coherence principle instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation scenario A, p=8computation time (s): 17 -> 4Improved
use twin lattice ordering with coherence principle instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation scenario A, p=8number of fitted models: 580 -> 273Improved
use twin lattice ordering with coherence principle instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation scenario A, p=20computation time (s): 2102 -> 379Improved
use twin lattice ordering with coherence principle instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation scenario A, p=20number of fitted models: 27356 -> 10212Improved
use twin lattice ordering with coherence principle instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation scenario B, p=20computation time (s): 2226 -> 452Improved
use twin lattice ordering with coherence principle instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation scenario B, p=20number of fitted models: 26961 -> 10300Improved
use twin lattice ordering instead of model inclusion latticestepwise 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 latticeImproved
use twin lattice ordering instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation (160 datasets)relative number of fitted models: between 37% and 54% of the models fitted under the naive implementationImproved
use twin lattice ordering instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation scenario A, p=20sTPR (%): 51.67 -> 70.00Improved
use twin lattice ordering instead of model inclusion latticestepwise backward elimination for pdRCON models · Simulation scenario B, p=20sTPR (%): 39.38 -> 54.38Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy