Fetching the paper…
Reading the bibliography…
Recently directed acyclic graph (DAG) structure learning is formulated as a constrained continuous optimization problem with continuous acyclicity constraints and was solved iteratively through subproblem optimization.
Probabilistic reasoning in intelligent systems: networks of plausible inference
Judea Pearl · 1988
Earlier work this paper cites.
The theory and applications of harmonic integrals
William Vallance Douglas Hodge · 1989
Earlier work this paper cites.
On the limited memory BFGS method for large scale optimization
Dong C Liu and Jorge Nocedal · 1989
Earlier work this paper cites.
Algorithms and Data Structures: With Applications to Graphics and Geometry
Jurg Nievergelt and Klaus H. Hinrichs · 1993
Earlier work this paper cites.
Bayesian graphical models for discrete data
David Madigan, Jeremy York, and Denis Allard · 1995
Earlier work this paper cites.
Computation, Causation, and Discovery
Peter Spirtes, Clark N Glymour, and Richard Scheines · 1999
Earlier work this paper cites.
Being bayesian about network structure
Nir Friedman and Daphne Koller · 2000
Earlier work this paper cites.
On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
Dong-Hui Li and Masao Fukushima · 2001
Earlier work this paper cites.
Optimal structure identification with greedy search
David Maxwell Chickering · 2002
Earlier work this paper cites.
Large-sample learning of Bayesian networks is NP-hard
David Maxwell Chickering, David Heckerman, and Christopher Meek · 2004
Earlier work this paper cites.
Exact Bayesian structure discovery in Bayesian networks
Mikko Koivisto and Kismat Sood · 2004
Earlier work this paper cites.
Finding optimal models for small gene networks
Sascha Ott, Seiya Imoto, and Satoru Miyano · 2004
Earlier work this paper cites.
Causal protein-signaling networks derived from multiparameter single-cell data
Karen Sachs, Omar Perez, Dana Peer, Douglas A Lauffenburger, and Garry P Nolan · 2005
Earlier work this paper cites.
Finding optimal Bayesian networks by dynamic programming
Ajit P. Singh and Andrew W. Moore · 2005
Earlier work this paper cites.
A simple approach for finding the globally optimal Bayesian network structure
Tomi Silander and Petri Myllymaki · 2006
Earlier work this paper cites.
Learning graphical model structure using l1-regularization paths
Mark Schmidt, Alexandru Niculescu-Mizil, Kevin Murphy, et al · 2007
Earlier work this paper cites.
Model selection and estimation in the gaussian graphical model
Ming Yuan and Yi Lin · 2007
Earlier work this paper cites.
Digraphs: theory, algorithms and applications
Jørgen Bang-Jensen and Gregory Z Gutin · 2008
Earlier work this paper cites.
Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
Marco Grzegorczyk and Dirk Husmeier · 2008
Cited alongside, same era.
Structure learning of Bayesian networks using constraints
Cassio P. de Campos, Zhi Zeng, and Qiang Ji · 2009
Cited alongside, same era.
Extended bayesian information criteria for gaussian graphical models
Rina Foygel and Mathias Drton · 2010
Cited alongside, same era.
Learning Bayesian network structure using LP relaxations
Tommi Jaakkola, David Sontag, Amir Globerson, and Marina Meila · 2010
Cited alongside, same era.
Bayesian network learning with cutting planes
James Cussens · 2011
Cited alongside, same era.
Statistical ranking and combinatorial hodge theory
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, and Yinyu Ye · 2011
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba · 2015
Later among the works it cites.
Lek-Heng Lim · 2015
Later among the works it cites.
Bayesian structure learning in sparse Gaussian graphical models
Abdolreza Mohammadi, Ernst C Wit, et al · 2015
Later among the works it cites.
Learning bayesian networks with thousands of variables
Mauro Scanagatta, Cassio P de Campos, Giorgio Corani, and Marco Zaffalon · 2015
Later among the works it cites.
Polyhedral aspects of score equivalence in Bayesian network structure learning
James Cussens, David Haws, and Milan Studenỳ · 2016
Later among the works it cites.
Structure learning in Bayesian networks of a moderate size by efficient sampling
Ru He, Jin Tian, and Huaiqing Wu · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Causal discovery with reinforcement learning
Shengyu Zhu and Zhitang Chen · 2011
Cited alongside, same era.
The helmholtz-hodge decomposition—a survey
Harsh Bhatia, Gregory Norgard, Valerio Pascucci, and Peer-Timo Bremer · 2012
Cited alongside, same era.
Structured learning of Gaussian graphical models
Karthik Mohan, Mike Chung, Seungyeop Han, Daniela Witten, Su-In Lee, and Maryam Fazel · 2012
Cited alongside, same era.
Partial order MCMC for structure discovery in Bayesian networks
Teppo Niinimaki, Pekka Parviainen, and Mikko Koivisto · 2012
Cited alongside, same era.
Ordering-based search: A simple and effective algorithm for learning bayesian networks
Marc Teyssier and Daphne Koller · 2012
Cited alongside, same era.
L0-penalized maximum likelihood for sparse directed acyclic graphs
Sara Van de Geer and Peter Bühlmann · 2013
Cited alongside, same era.
Later among the works it cites.
Automatic differentiation in PyTorch
Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer · 2017
Later among the works it cites.
A million variables and more: the fast greedy equivalence search algorithm for learning high-dimensional graphical causal models, with an application to functional magnetic resonance images
Joseph Ramsey, Madelyn Glymour, Ruben Sanchez-Romero, and Clark Glymour · 2017
Later among the works it cites.
Generalized score functions for causal discovery
Biwei Huang, Kun Zhang, Yizhu Lin, Bernhard Schölkopf, and Clark Glymour · 2018
Later among the works it cites.
Dags with no tears: Continuous optimization for structure learning
Xun Zheng, Bryon Aragam, Pradeep K Ravikumar, and Eric P Xing · 2018
Later among the works it cites.
On causal discovery with an equal-variance assumption
Wenyu Chen, Mathias Drton, and Y Samuel Wang · 2019
Later among the works it cites.
Gradient-based neural dag learning
Sébastien Lachapelle, Philippe Brouillard, Tristan Deleu, and Simon Lacoste-Julien · 2019
Later among the works it cites.
Masked gradient-based causal structure learning
Ignavier Ng, Zhuangyan Fang, Shengyu Zhu, Zhitang Chen, and Jun Wang · 2019
Later among the works it cites.
Dag-gnn: Dag structure learning with graph neural networks
Yue Yu, Jie Chen, Tian Gao, and Mo Yu · 2019
Later among the works it cites.
On the Role of Sparsity and DAG Constraints for Learning Linear DAGs
Ignavier Ng, AmirEmad Ghassami, and Kun Zhang · 2020
Later among the works it cites.
Learning dags without imposing acyclicity
Gherardo Varando · 2020
Later among the works it cites.
Dags with no fears: A closer look at continuous optimization for learning bayesian networks
Dennis Wei, Tian Gao, and Yue Yu · 2020
Later among the works it cites.
Learning sparse nonparametric DAGs
Xun Zheng, Chen Dan, Bryon Aragam, Pradeep Ravikumar, and Eric P. Xing · 2020
Later among the works it cites.