2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.LG2019★ 2 cited
Algorithmic Probability-guided Supervised Machine Learning on Non-differentiable Spaces
Santiago Hernández-Orozco, Hector Zenil, Jürgen Riedel +3
We show how complexity theory can be introduced in machine learning to help bring together apparently disparate areas of current research. We show that this new approach requires l…
cs.LO2015★ 1 cited
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value
Santiago Hernández-Orozco, Francisco Hernández-Quiroz, Hector Zenil +1
We show that strategies implemented in automatic theorem proving involve an interesting tradeoff between execution speed, proving speedup/computational time and usefulness of infor…