Consistent Second-Order Conic Integer Programming for Learning Bayesian Networks

Bayesian Networks (BNs) represent conditional probability relations among a set of random variables (nodes) in the form of a directed acyclic graph (DAG), and have found diverse applications in knowledge discovery. We study the problem of learning the sparse DAG structure of a BN from continuous obs...

Full description

Saved in:
Bibliographic Details
Published inJournal of machine learning research Vol. 24
Main Authors Küçükyavuz, Simge, Shojaie, Ali, Manzour, Hasan, Wei, Linchuan, Wu, Hao-Hsiang
Format Journal Article
LanguageEnglish
Published United States 2023
Subjects
Online AccessGet more information

Cover

Loading…
Abstract Bayesian Networks (BNs) represent conditional probability relations among a set of random variables (nodes) in the form of a directed acyclic graph (DAG), and have found diverse applications in knowledge discovery. We study the problem of learning the sparse DAG structure of a BN from continuous observational data. The central problem can be modeled as a mixed-integer program with an objective function composed of a convex quadratic loss function and a regularization penalty subject to linear constraints. The optimal solution to this mathematical program is known to have desirable statistical properties under certain conditions. However, the state-of-the-art optimization solvers are not able to obtain provably optimal solutions to the existing mathematical formulations for medium-size problems within reasonable computational times. To address this difficulty, we tackle the problem from both computational and statistical perspectives. On the one hand, we propose a concrete early stopping criterion to terminate the branch-and-bound process in order to obtain a near-optimal solution to the mixed-integer program, and establish the consistency of this approximate solution. On the other hand, we improve the existing formulations by replacing the linear "big- " constraints that represent the relationship between the continuous and binary indicator variables with second-order conic constraints. Our numerical results demonstrate the effectiveness of the proposed approaches.
AbstractList Bayesian Networks (BNs) represent conditional probability relations among a set of random variables (nodes) in the form of a directed acyclic graph (DAG), and have found diverse applications in knowledge discovery. We study the problem of learning the sparse DAG structure of a BN from continuous observational data. The central problem can be modeled as a mixed-integer program with an objective function composed of a convex quadratic loss function and a regularization penalty subject to linear constraints. The optimal solution to this mathematical program is known to have desirable statistical properties under certain conditions. However, the state-of-the-art optimization solvers are not able to obtain provably optimal solutions to the existing mathematical formulations for medium-size problems within reasonable computational times. To address this difficulty, we tackle the problem from both computational and statistical perspectives. On the one hand, we propose a concrete early stopping criterion to terminate the branch-and-bound process in order to obtain a near-optimal solution to the mixed-integer program, and establish the consistency of this approximate solution. On the other hand, we improve the existing formulations by replacing the linear "big- " constraints that represent the relationship between the continuous and binary indicator variables with second-order conic constraints. Our numerical results demonstrate the effectiveness of the proposed approaches.
Author Shojaie, Ali
Wei, Linchuan
Manzour, Hasan
Wu, Hao-Hsiang
Küçükyavuz, Simge
Author_xml – sequence: 1
  givenname: Simge
  surname: Küçükyavuz
  fullname: Küçükyavuz, Simge
  organization: Department of Industrial Engineering and Management Sciences, Northwestern University
– sequence: 2
  givenname: Ali
  surname: Shojaie
  fullname: Shojaie, Ali
  organization: Department of Biostatistics, University of Washington
– sequence: 3
  givenname: Hasan
  surname: Manzour
  fullname: Manzour, Hasan
  organization: Department of Industrial and Systems Engineering, University of Washington
– sequence: 4
  givenname: Linchuan
  surname: Wei
  fullname: Wei, Linchuan
  organization: Department of Industrial Engineering and Management Sciences, Northwestern University
– sequence: 5
  givenname: Hao-Hsiang
  surname: Wu
  fullname: Wu, Hao-Hsiang
  organization: Department of Management Science, National Yang Ming Chiao Tung University
BackLink https://www.ncbi.nlm.nih.gov/pubmed/39027423$$D View this record in MEDLINE/PubMed
BookMark eNo1j8tKxDAYRrMYcW6-guQFCrm1SZZavAwUZ0BnPaTJ31K1SUkiMm9vxXF1ON_iwLdGCx88LNCKlpwVQvByidYpvRNCZcmqa7TkmjApGF-hQx18GlIGn_Er2OBdsY8OIp73weKdz9DPdoihj2YcB9_jLkTcgIn-V-7NGdJgPH6B_B3iR9qiq858Jri5cIOOjw9v9XPR7J929V1TTKySuZC2ZU4SS6yjM6tWOWcI5aCIILpjoJUGYB3VLRhOVSmtUlrQzhLdWtBsg27_utNXO4I7TXEYTTyf_q-xH4xLTEU
ContentType Journal Article
DBID NPM
DatabaseName PubMed
DatabaseTitle PubMed
DatabaseTitleList PubMed
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
DeliveryMethod no_fulltext_linktorsrc
Discipline Computer Science
ExternalDocumentID 39027423
Genre Journal Article
GroupedDBID .4S
.DC
29K
2WC
5GY
8US
8VB
AAKMM
AAKPC
AALFJ
AAWTV
AAYFX
ABDBF
ABIVO
ACIPV
ACM
ACUHS
ADBSK
ADL
ADPZR
AEBYY
AEMOZ
AENEX
AENSD
AFWIH
AFWXC
AHQJS
AIKLT
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ARCSS
ASPBG
AVWKF
B0M
BDXCO
CAG
CCLIF
COF
CS3
D-I
DU5
E3Z
EAP
EBR
EBS
EBU
ECS
EDO
EJD
EMK
EPL
EST
ESX
F5P
FEDTE
FRP
GUFHI
HGAVV
I-F
I07
J9A
K1G
LHSKQ
M~E
NPM
OK1
P2P
QWB
RNS
TH9
TR2
TUS
W7O
XJT
XSB
ZL0
~8M
ID FETCH-LOGICAL-p267t-7cb2d70c0cd1d706b8dda013e80409f2e989ee2f19bea31857c88941fc09bce92
ISSN 1532-4435
IngestDate Wed Feb 19 02:09:02 EST 2025
IsPeerReviewed true
IsScholarly true
Keywords Bayesian networks
directed acyclic graphs
Mixed-integer conic programming
consistency
early stopping criterion
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p267t-7cb2d70c0cd1d706b8dda013e80409f2e989ee2f19bea31857c88941fc09bce92
PMID 39027423
ParticipantIDs pubmed_primary_39027423
PublicationCentury 2000
PublicationDate 2023-00-00
PublicationDateYYYYMMDD 2023-01-01
PublicationDate_xml – year: 2023
  text: 2023-00-00
PublicationDecade 2020
PublicationPlace United States
PublicationPlace_xml – name: United States
PublicationTitle Journal of machine learning research
PublicationTitleAlternate J Mach Learn Res
PublicationYear 2023
SSID ssj0017526
Score 2.4500616
Snippet Bayesian Networks (BNs) represent conditional probability relations among a set of random variables (nodes) in the form of a directed acyclic graph (DAG), and...
SourceID pubmed
SourceType Index Database
Title Consistent Second-Order Conic Integer Programming for Learning Bayesian Networks
URI https://www.ncbi.nlm.nih.gov/pubmed/39027423
Volume 24
hasFullText
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ3ZS8MwHMfDpiC-eN8HefBNIm2aNcmjiiIeU1DRt5GmqU5dN3AT9K8351bE4fHSlqR0I582Tb-_C4AdkvEoYxFDBEc5IgJLxKlUiMZCFCxhqbQW3YtmenJLTu8b97XaacVradDP9uTHt3El_6Gq2zRXEyX7B7LDi-oGfaz56q0mrLe_YmyrbWpMZd_o5t0yR5cmk6YJ42tLK_aZmN4r54LVCT6T50ENORDvysZQNp0v-OuYlWrHOlyqUGHiYddnCBoqyWfG3H5waI3u1B0_v4u3gRWnr9udh-Hdc_3YfRLOJLL_0h7J4eWH_jn7GhQVL6E71fa6gXwc-GavUOCkolCESRUjQlxakjDrusjpCqRex1JKuLMe_9z7JU926KqDuv5iMCVQjW7j7Um0YQvvDf_JNJgK53_5nrDrips5MOOHGe47uvOgpsoFMBuKbUA_9y6CqxFsWIUNLWzoYcMKbKhhwwAbBtgwwF4Ct8dHN4cnyJfDQD2c0j6iMsM5jWQk81jv04zluTAqNtMTMS-w4owrhYuYZ0qYoHgqGeMkLmTEM6k4XgYTZbdUqwDyxCyt00hiGhPKGiLlDUpjUywV5yQRa2DFjUmr53KetMJorY_t2QDTI_ibYLLQD5na0iu2frZtYXwCYGBCDw
linkProvider National Library of Medicine
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Consistent+Second-Order+Conic+Integer+Programming+for+Learning+Bayesian+Networks&rft.jtitle=Journal+of+machine+learning+research&rft.au=K%C3%BC%C3%A7%C3%BCkyavuz%2C+Simge&rft.au=Shojaie%2C+Ali&rft.au=Manzour%2C+Hasan&rft.au=Wei%2C+Linchuan&rft.date=2023-01-01&rft.issn=1532-4435&rft.volume=24&rft_id=info%3Apmid%2F39027423&rft_id=info%3Apmid%2F39027423&rft.externalDocID=39027423
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-4435&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-4435&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-4435&client=summon