Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Roberto Gheda

dblp:438/7426 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.912025
Collaborative and Confidential Junction Trees for Hybrid Bayesian Networks · NeurIPS 2025
Cryptographic protocols and secure computation
secure inference
0.912025
Collaborative and Confidential Junction Trees for Hybrid Bayesian Networks · NeurIPS 2025
Cryptographic protocols and secure computation
secure multiparty computation
0.912025
Collaborative and Confidential Junction Trees for Hybrid Bayesian Networks · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
junction tree inference
0.312025
Collaborative and Confidential Junction Trees for Hybrid Bayesian Networks · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

belief propagation · 1.7secure multiparty computation · 0.9secure multi-party computation · 0.9
YearPublicationVenuePosition
2025 Collaborative and Confidential Junction Trees for Hybrid Bayesian Networks
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.4x under purely discrete scenarios.
Roberto Gheda, Abele Malan, Thiago S. Guzella, Carlo Lancia, Robert Birke, Lydia Y. Chen
NeurIPS1