{"title":"Graphical Representations for Algebraic Constraints of Linear Structural Equations Models","authors":"T. V. Ommen, M. Drton","doi":"10.48550/arXiv.2208.00926","DOIUrl":"https://doi.org/10.48550/arXiv.2208.00926","url":null,"abstract":"The observational characteristics of a linear structural equation model can be effectively described by polynomial constraints on the observed covariance matrix. However, these polynomials can be exponentially large, making them impractical for many purposes. In this paper, we present a graphical notation for many of these polynomial constraints. The expressive power of this notation is investigated both theoretically and empirically.","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"461 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125810912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Highly Efficient Structural Learning of Sparse Staged Trees","authors":"Manuele Leonelli, Gherardo Varando","doi":"10.48550/arXiv.2206.06970","DOIUrl":"https://doi.org/10.48550/arXiv.2206.06970","url":null,"abstract":"Several structural learning algorithms for staged tree models, an asymmetric extension of Bayesian networks, have been defined. However, they do not scale efficiently as the number of variables considered increases. Here we introduce the first scalable structural learning algorithm for staged trees, which searches over a space of models where only a small number of dependencies can be imposed. A simulation study as well as a real-world application illustrate our routines and the practical use of such data-learned staged trees.","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127781186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Discovery and density estimation of latent confounders in Bayesian networks with evidence lower bound","authors":"Kiattikun Chobtham, A. Constantinou","doi":"10.48550/arXiv.2206.05490","DOIUrl":"https://doi.org/10.48550/arXiv.2206.05490","url":null,"abstract":"Discovering and parameterising latent confounders represent important and challenging problems in causal structure learning and density estimation respectively. In this paper, we focus on both discovering and learning the distribution of latent confounders. This task requires solutions that come from different areas of statistics and machine learning. We combine elements of variational Bayesian methods, expectation-maximisation, hill-climbing search, and structure learning under the assumption of causal insufficiency. We propose two learning strategies; one that maximises model selection accuracy, and another that improves computational efficiency in exchange for minor reductions in accuracy. The former strategy is suitable for small networks and the latter for moderate size networks. Both learning strategies perform well relative to existing solutions.","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127952163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximate Inference for Stochastic Planning in Factored Spaces","authors":"Zhennan Wu, R. Khardon","doi":"10.48550/arXiv.2203.12139","DOIUrl":"https://doi.org/10.48550/arXiv.2203.12139","url":null,"abstract":"Stochastic planning can be reduced to probabilistic inference in large discrete graphical models, but hardness of inference requires approximation schemes to be used. In this paper we argue that such applications can be disentangled along two dimensions. The first is the direction of information flow in the idealized exact optimization objective, i.e., forward vs. backward inference. The second is the type of approximation used to compute this objective, e.g., Belief Propagation (BP) vs. mean field variational inference (MFVI). This new categorization allows us to unify a large amount of isolated efforts in prior work explaining their connections and differences as well as potential improvements. An extensive experimental evaluation over large stochastic planning problems shows the advantage of forward BP over several algorithms based on MFVI. An analysis of practical limitations of MFVI motivates a novel algorithm, collapsed state variational inference (CSVI), which provides a tighter approximation and achieves comparable planning performance with forward BP.","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133604863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Learning Parameters in Canonical Models Using Weighted Least Squares","authors":"Krzysztof Nowak, Marek J Druzdzel","doi":"10.1007/978-3-319-11433-0_24","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_24","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124888579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"From Information to Evidence in a Bayesian Network","authors":"A. Mrad, V. Delcroix, S. Piechowiak, P. Leicester","doi":"10.1007/978-3-319-11433-0_3","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_3","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133086297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mixture of Polynomials Probability Distributions for Grouped Sample Data","authors":"B. Cobb","doi":"10.1007/978-3-319-11433-0_9","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_9","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"46 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133457031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rafael Cabañas, A. Cano, Manuel Gómez-Olmedo, A. Madsen
{"title":"On SPI-Lazy Evaluation of Influence Diagrams","authors":"Rafael Cabañas, A. Cano, Manuel Gómez-Olmedo, A. Madsen","doi":"10.1007/978-3-319-11433-0_7","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_7","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124301150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}