Soroush Ghandi

dblp:341/3542 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2026
0009-0000-6852-3092ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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.

Artificial intelligence
1 paper
Trustworthy machine learning · 50% Kernel, tree and ensemble methods · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
ensemble diversity
0.712023
Toward Robust Uncertainty Estimation with Random Activation Functions · AAAI 2023
Machine learning › Trustworthy machine learning › uncertainty estimation › model uncertainty
ensemble uncertainty
0.712023
Toward Robust Uncertainty Estimation with Random Activation Functions · AAAI 2023
Machine learning › Kernel, tree and ensemble methods › ensemble learning
neural network ensemble
0.712023
Toward Robust Uncertainty Estimation with Random Activation Functions · AAAI 2023
Machine learning › Trustworthy machine learning
uncertainty estimation
0.712023
Toward Robust Uncertainty Estimation with Random Activation Functions · AAAI 2023

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

random activation functions · 0.7expectation-maximization · 0.7
YearPublicationVenuePosition
2026 Evaluating Static and Dynamic Approaches for Assessing Trustworthiness in Medical Risk Factor Forecasting
Ana Krstevska, Rianne Margaretha Schouten, Soroush Ghandi, Mykola Pechenizkiy, Mitja Lustrek
AIME (1)3
2025 Imposing Constraints in Probabilistic Circuits via Gradient Optimization
Soroush Ghandi, Benjamin Quost, Cassio P. de Campos
IDA1
2025 Soft learning probabilistic circuits
abstract
Probabilistic Circuits (PCs) are prominent tractable probabilistic models, allowing for a wide range of exact inferences. This paper focuses on a main algorithm for training PCs, LearnSPN, arguably a gold standard due to its efficiency, performance, and ease of use, in particular for tabular data. We show that LearnSPN is a greedy likelihood maximizer under mild assumptions. While inferences in PCs may use the entire circuit structure for processing queries, LearnSPN applies a hard method for learning PCs, propagating at each sum node a data point through one and only one of the children/edges as in a hard clustering process. We propose a new learning procedure named SoftLearn, that induces a PC using a soft clustering process. We investigate the effect of this learning-inference compatibility in PCs. Our experiments show that SoftLearn outperforms LearnSPN in many situations, yielding better likelihoods and arguably better samples. We also analyze comparable tractable models to highlight the differences between soft/hard learning and model querying.
Soroush Ghandi, Benjamin Quost, Cassio P. de Campos
Int. J. Approx. Reason.1
2024 Probabilistic Circuits with Constraints via Convex Optimization
Soroush Ghandi, Benjamin Quost, Cassio P. de Campos
ECML/PKDD (3)1
2023 Toward Robust Uncertainty Estimation with Random Activation Functions
abstract
Deep neural networks are in the limelight of machine learning with their excellent performance in many data-driven applications. However, they can lead to inaccurate predictions when queried in out-of-distribution data points, which can have detrimental effects especially in sensitive domains, such as healthcare and transportation, where erroneous predictions can be very costly and/or dangerous. Subsequently, quantifying the uncertainty of the output of a neural network is often leveraged to evaluate the confidence of its predictions, and ensemble models have proved to be effective in measuring the uncertainty by utilizing the variance of predictions over a pool of models. In this paper, we propose a novel approach for uncertainty quantification via ensembles, called Random Activation Functions (RAFs) Ensemble, that aims at improving the ensemble diversity toward a more robust estimation, by accommodating each neural network with a different (random) activation function. Extensive empirical study demonstrates that RAFs Ensemble outperforms state-of-the-art ensemble uncertainty quantification methods on both synthetic and real-world datasets in a series of regression tasks.
Yana Stoyanova, Soroush Ghandi, Maryam Tavakol
AAAI2