Fast Bayesian inference of Sparse Networks with automatic sparsity determination
Structure learning of Gaussian graphical models typically involves careful tuning of penalty parameters, which balance the tradeoff between data fidelity and graph sparsity. Unfortunately, this tuning is often a “black art” requiring expert experience or brute-force search. It is therefore tempting...
Saved in:
Main Authors: | Yu, Hang, Wu, Songwei, Xin, Luyin, Dauwels, Justin |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://jmlr.org/papers/v21/18-514.html https://hdl.handle.net/10356/149090 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
NEW ADVANCES IN BAYESIAN INFERENCE FOR GAUSSIAN PROCESS AND DEEP GAUSSIAN PROCESS MODELS
by: YU HAIBIN
Published: (2020) -
Graphical models and variational Bayesian inference for financial networks
by: Xin, Luyin
Published: (2019) -
Reconciliation of statistical and spatial sparsity for robust visual classification
by: Cheng, Hao, et al.
Published: (2023) -
Forward basis selection for pursuing sparse representations over a dictionary
by: Yuan, X.-T., et al.
Published: (2014) -
NEW ADVANCES ON BAYESIAN AND DECISION-THEORETIC APPROACHES FOR INTERACTIVE MACHINE LEARNING
by: HOANG TRONG NGHIA
Published: (2015)