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

Zehang Richard Li

dblp:220/5745 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

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

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian graphical model
0.412019
Bayesian Joint Spike-and-Slab Graphical Lasso · ICML 2019
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
gaussian graphical model
0.412019
Bayesian Joint Spike-and-Slab Graphical Lasso · ICML 2019
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › sparse bayesian learning
spike-and-slab prior
0.412019
Bayesian Joint Spike-and-Slab Graphical Lasso · ICML 2019

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

group lasso · 0.4graphical lasso · 0.4fused lasso · 0.4EM algorithm · 0.4
YearPublicationVenuePosition
2019 Bayesian Joint Spike-and-Slab Graphical Lasso
abstract
In this article, we propose a new class of priors for Bayesian inference with multiple Gaussian graphical models. We introduce Bayesian treatments of two popular procedures, the group graphical lasso and the fused graphical lasso, and extend them to a continuous spike-and-slab framework to allow self-adaptive shrinkage and model selection simultaneously. We develop an EM algorithm that performs fast and dynamic explorations of posterior modes. Our approach selects sparse models efficiently and automatically with substantially smaller bias than would be induced by alternative regularization procedures. The performance of the proposed methods are demonstrated through simulation and two real data examples.
Zehang Richard Li, Tyler H. McCormick, Samuel J. Clark
ICML1