Integer programming for learning directed acyclic graphs from nonidentifiable Gaussian models

DOI10.1093/BIOMET/ASAF032MaRDI QIDQ6929464zbMATH OpenFDO

Authors Tong Xu, Armeen Taeb, Simge Küçükyavuz, Ali Shojaie

Publication date 17 September 2025

Published in Biometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/BIOMET/ASAF032

zbMATH Keywords

Bayesian networkidentifiabilitymixed-integer programmingstructural equation model

Mathematics Subject Classification ID

Graph theory (05C99) Bayesian inference (62F15) Probabilistic graphical models (62H22)

Cites work

• \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
• 10.1162/153244303321897717
• A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Bayesian network learning via topological order
• Bayesian network structure learning with integer programming: polytopes, facets and complexity
• Causation, prediction, and search
• Certifiably optimal sparse inverse covariance estimation
• Consistency guarantees for greedy permutation-based causal inference algorithms
• Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
• Estimating high-dimensional directed acyclic graphs with the PC-algorithm
• Geometry of the faithfulness assumption in causal inference
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Ideal formulations for constrained convex optimization problems with indicator variables
• Identifiability of Gaussian structural equation models with equal error variances
• Integer linear programming for the Bayesian network structure learning problem
• On causal discovery with an equal-variance assumption
• On the acyclic subgraph polytope
• On the convex hull of convex quadratic optimization problems with indicators
• On the convexification of constrained quadratic optimization problems with indicator variables
• Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
• Polyhedral aspects of score equivalence in Bayesian network structure learning
• SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
• Sparse inverse covariance estimation with the graphical lasso

Cited in

(1)

• An asymptotically optimal coordinate descent algorithm for learning Bayesian networks from Gaussian models

This page was built for publication: Integer programming for learning directed acyclic graphs from nonidentifiable Gaussian models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6929464)