Inferring large graphs using l1-penalized likelihood

v1v2v3 (latest)

Inferring large graphs using l1-penalized likelihood

8 July 2015

Magali Champion

Matthieu Vignes

ArXiv (abs)PDF HTML

Papers citing "Inferring large graphs using l1-penalized likelihood"

6 / 6 papers shown

Title
A Stochastic Variance-Reduced Coordinate Descent Algorithm for Learning Sparse Bayesian Network from Discrete High-Dimensional Data Nazanin Shajoonnezhad Amin Nikanjam 52 3 0 21 Aug 2021
D'ya like DAGs? A Survey on Structure Learning and Causal Discovery M. Vowels Necati Cihan Camgöz Richard Bowden CML 147 305 0 03 Mar 2021
DAGs with NO TEARS: Continuous Optimization for Structure Learning Xun Zheng Bryon Aragam Pradeep Ravikumar Eric Xing NoLa CML OffRL 111 952 0 04 Mar 2018
Mode jumping MCMC for Bayesian variable selection in GLMM A. Hubin G. Storvik 67 29 0 21 Apr 2016
Mapping Energy Landscapes of Non-Convex Learning Problems M. Pavlovskaia Kewei Tu Song-Chun Zhu 32 5 0 02 Oct 2014
Penalized Estimation of Directed Acyclic Graphs From Discrete Data J. Gu Fei Fu Qing Zhou CML 108 42 0 10 Mar 2014