European Workshop on Probabilistic Graphical Models最新文献

筛选
英文 中文
Graphical Representations for Algebraic Constraints of Linear Structural Equations Models 线性结构方程模型代数约束的图形表示
European Workshop on Probabilistic Graphical Models Pub Date : 2022-08-01 DOI: 10.48550/arXiv.2208.00926
T. V. Ommen, M. Drton
{"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}
引用次数: 0
Highly Efficient Structural Learning of Sparse Staged Trees 稀疏分级树的高效结构学习
European Workshop on Probabilistic Graphical Models Pub Date : 2022-06-14 DOI: 10.48550/arXiv.2206.06970
Manuele Leonelli, Gherardo Varando
{"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}
引用次数: 6
Discovery and density estimation of latent confounders in Bayesian networks with evidence lower bound 具有证据下界的贝叶斯网络中潜在混杂因素的发现和密度估计
European Workshop on Probabilistic Graphical Models Pub Date : 2022-06-11 DOI: 10.48550/arXiv.2206.05490
Kiattikun Chobtham, A. Constantinou
{"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}
引用次数: 1
Approximate Inference for Stochastic Planning in Factored Spaces 因子空间中随机规划的近似推理
European Workshop on Probabilistic Graphical Models Pub Date : 2022-03-23 DOI: 10.48550/arXiv.2203.12139
Zhennan Wu, R. Khardon
{"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}
引用次数: 0
Learning Parameters in Canonical Models Using Weighted Least Squares 基于加权最小二乘的典型模型参数学习
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_24
Krzysztof Nowak, Marek J Druzdzel
{"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}
引用次数: 2
Learning Gated Bayesian Networks for Algorithmic Trading 学习门控贝叶斯网络的算法交易
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_4
M. Bendtsen, J. Peña
{"title":"Learning Gated Bayesian Networks for Algorithmic Trading","authors":"M. Bendtsen, J. Peña","doi":"10.1007/978-3-319-11433-0_4","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_4","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"44 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":"122103441","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}
引用次数: 7
From Information to Evidence in a Bayesian Network 从贝叶斯网络中的信息到证据
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_3
A. Mrad, V. Delcroix, S. Piechowiak, P. Leicester
{"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}
引用次数: 3
Learning Marginal AMP Chain Graphs under Faithfulness 忠实度下边际AMP链图的学习
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_25
J. Peña
{"title":"Learning Marginal AMP Chain Graphs under Faithfulness","authors":"J. Peña","doi":"10.1007/978-3-319-11433-0_25","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_25","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"91 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":"130741303","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}
引用次数: 9
Mixture of Polynomials Probability Distributions for Grouped Sample Data 组合样本数据的多项式混合概率分布
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_9
B. Cobb
{"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}
引用次数: 2
On SPI-Lazy Evaluation of Influence Diagrams 影响图的SPI-Lazy评价
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_7
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}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书