Collaborative and Confidential Junction Trees for Hybrid Bayesian Networks
Roberto Gheda, Abele Malan, Thiago S. Guzella, Carlo Lancia, Robert Birke, Lydia Y. Chen
Abstract
Bayesian Network models are a powerful tool to collaboratively optimize production processes in various manufacturing industries. When interacting, collaborating parties must preserve their business secrets by maintaining the confidentiality of their model structures and parameters. While most realistic industry scenarios involve hybrid settings, handling both discrete and continuous data, current state-of-the-art methods for collaborative and confidential inference only support discrete data and have high communication costs. In a centralized setting, Junction Trees enable efficient inference even in hybrid scenarios without discretizing continuous variables, but no extension for collaborative and confidential scenarios exists. To address this research gap, we introduce Hybrid CCJT , the first framework for confidential multiparty inference in hybrid domains with semi-honest, non-colluding adversaries, comprising: (i) a method to construct a strongly-rooted Junction Tree across collaborating parties through a novel construct of interface cliques; and, (ii) a protocol for confidential inference built upon multiparty computation primitives comprising a one-time alignment phase and a belief propagation system for combining the inference results across the Junction Tree cliques. Extensive evaluation on nine datasets shows that Hybrid CCJT improves the predictive accuracy of continuous target variables by 32% on average compared to the state-of-the-art, while reducing communication costs by a median 10 . 4 × under purely discrete scenarios.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on1
Related papers
- ORQ: Complex Analytics on Private Data with Strong Security GuaranteesEli Baum, Sam Buxbaum, Nitin Mathai, Muhammad Faisal et al.SOSP 2025 · 4 citations
- Secret-Shared Joins with Multiplicity from Aggregation TreesSaikrishna Badrinarayanan, Sourav Das, Gayathri Garimella, Srinivasan Raghuraman et al.CCS 2022 · 9 citations
- Workload-aware Materialization for Efficient Variable Elimination on Bayesian NetworksÇigdem Aslay, Martino Ciaperoni, Aristides Gionis, Michael MathioudakisICDE 2021 · 4 citations
- DiBS: Differentiable Bayesian Structure LearningLars Lorch, Jonas Rothfuss, Bernhard Schölkopf, Andreas KrauseNeurIPS 2021 · 144 citations
- A Sample Efficient Conditional Independence Test in the Presence of DiscretizationBoyang Sun, Yu Yao, Xinshuai Dong, Zongfang Liu et al.ICML 2025
