55 citations · 100 across the 3 of their papers we have counts for
3 papers
math.LO2014
Upper-Bounding Proof Length with the Busy Beaver
Gustavo Lacerda
Consider a short theorem, i.e. one that can be written down using just a few symbols. Can its shortest proof be arbitrarily long? We answer this question in the negative. Inspired…
cs.AI2012★ 45 cited
Discovering Cyclic Causal Models by Independent Components Analysis
Gustavo Lacerda, Peter L. Spirtes, Joseph Ramsey +1
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, continuous-…
stat.ML2012★ 55 cited
Causal discovery of linear acyclic models with arbitrary distributions
Patrik O. Hoyer, Aapo Hyvarinen, Richard Scheines +4
An important task in data analysis is the discovery of causal relationships between observed variables. For continuous-valued data, linear acyclic causal models are commonly used t…