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

Mehrzad Saremi

dblp:255/7127 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0002-5340-4784ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
1.012026
Neural Network Parameter-optimization of Gaussian Pre-marginalized Directed Acyclic Graphs · J. Mach. Learn. Res. 2026
Machine learning › Probabilistic and Bayesian machine learning
causal inference
1.012026
Neural Network Parameter-optimization of Gaussian Pre-marginalized Directed Acyclic Graphs · J. Mach. Learn. Res. 2026
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
directed acyclic graph
1.012026
Neural Network Parameter-optimization of Gaussian Pre-marginalized Directed Acyclic Graphs · J. Mach. Learn. Res. 2026
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › bayesian network
gaussian bayesian networks
1.012026
Neural Network Parameter-optimization of Gaussian Pre-marginalized Directed Acyclic Graphs · J. Mach. Learn. Res. 2026
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
1.012026
Neural Network Parameter-optimization of Gaussian Pre-marginalized Directed Acyclic Graphs · J. Mach. Learn. Res. 2026
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
marginalization
1.012026
Neural Network Parameter-optimization of Gaussian Pre-marginalized Directed Acyclic Graphs · J. Mach. Learn. Res. 2026

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

neural network parameter optimization · 1.0feedforward neural network · 1.0causal identifiability · 1.0
YearPublicationVenuePosition
2026 Neural Network Parameter-optimization of Gaussian Pre-marginalized Directed Acyclic Graphs
abstract
Finding the parameters of a latent variable causal model is central to causal inference and causal identification. In this article, we show that existing graphical structures that are used in causal inference are not stable under marginalization of Gaussian Bayesian networks, and present a graphical structure that faithfully represents margins of Gaussian Bayesian networks. We present the first duality between parameter optimization of a latent variable model and training a feed-forward neural network in the parameter space of the assumed family of distributions. Based on this observation, we develop an algorithm for parameter optimization of these graphical structures using the observational distribution. Then, we provide conditions for causal effect identifiability in the Gaussian setting. We propose a meta-algorithm that checks whether a causal effect is identifiable or not. Moreover, we lay a grounding for generalizing the duality between a neural network and a causal model from the Gaussian to other distributions.
Mehrzad Saremi
J. Mach. Learn. Res.1
2022 Reconstruction of Gene Regulatory Networks Using Multiple Datasets
abstract
MOTIVATION: Laboratory gene regulatory data for a species are sporadic. Despite the abundance of gene regulatory network algorithms that employ single data sets, few algorithms can combine the vast but disperse sources of data and extract the potential information. With a motivation to compensate for this shortage, we developed an algorithm called GENEREF that can accumulate information from multiple types of data sets in an iterative manner, with each iteration boosting the performance of the prediction results. RESULTS: The algorithm is examined extensively on data extracted from the quintuple DREAM4 networks and DREAM5's Escherichia coli and Saccharomyces cerevisiae networks and sub-networks. Many single-dataset and multi-dataset algorithms were compared to test the performance of the algorithm. Results show that GENEREF surpasses non-ensemble state-of-the-art multi-perturbation algorithms on the selected networks and is competitive to present multiple-dataset algorithms. Specifically, it outperforms dynGENIE3 and is on par with iRafNet. Also, we argued that a scoring method solely based on the AUPR criterion would be more trustworthy than the traditional score. AVAILABILITY: The Python implementation along with the data sets and results can be downloaded from github.com/msaremi/GENEREF.
Mehrzad Saremi, Maryam Amirmazlaghani
IEEE ACM Trans. Comput. Biol. Bioinform.1