[18] Carl Edward Rasmussen and Christopher K. I. Williams. Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning). The MIT Press, 2005. ISBN 026218253X.
[19] Payam Dibaseinia and Saurabh Sinha. Sergio: A single-cell expression simulator guided by gene regulatory networks. Cell systems, 2020.
[20] Karen Sachs, Omar Perez, Dana Pe'er, Douglas Lauffenburger, and Garry Nolan. Causal protein-signaling networks derived from multiparameter single-cell data. Science, pages 523-9, 2005.
[21] Siyuan Guo, Viktor Tóth, Bernhard Schölkopf, and Ferenc Huszár. Causal de finetti: On the identification of invariant causal structure in exchangeable data. arXiv preprint arXiv:2203.15756, 2022.
[22] Bernhard Schölkopf, Dominik Janzing, Jonas Peters, Eleni Sgouritsa, Kun Zhang, and Joris Mooij. On causal and anticausal learning. In Proceedings of the International Conference on Machine Learning (ICML), ICML'12, pages 459-466, Madison, WI, USA, 2012. Omnipress. ISBN 9781450312851.
[23] Dominik Janzing and Bernhard Schölkopf. Causal inference using the algorithmic markov condition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 56:5168-5194, 2010.
[24] Jan Lemeire and Dominik Janzing. Replacing causal faithfulness with algorithmic independence of conditionals. *Minds and Machines*, 23, 2013.
[25] Alexander Marx and Jilles Vreeken. Identifiability of cause and effect using regularized regression. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, 2019.
[26] Osman Mian, Alexander Marx, and Jilles Vreeken. Discovering fully oriented causal networks. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2021.
[27] David Kaltenpoth and Jilles Vreeken. We are not your real parents: Telling causal from confounded using MDL. CoRR, abs/1901.06950, 2019. URL http://arxiv.org/abs/1901.06950.
[28] Ming Li and Paul Vitányi. An introduction to Kolmogorov complexity and its applications. Springer Science & Business Media, 2009.
[29] Peter Grünwald. The Minimum Description Length Principle. MIT Press, 2007.
[30] Niranjan Srinivas, Andreas Krause, Sham Kakade, and Matthias Seeger. Information-theoretic regret bounds for gaussian process optimization in the bandit setting. IEEE Transactions on Information Theory - TIT, 58:3250-3265, 05 2012. doi: 10.1109/TIT.2011.2182033.
[31] Sham M. Kakade, Matthias W. Seeger, and Dean P. Foster. Worst-case bounds for gaussian process models. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Proceedings of the Conference on Neural Information Processing Systems (NeurIPS), volume 18. MIT Press, 2005. URL https://proceedings.neurips.cc/paper/2005/file/952c3ff98a6acdc36497d839e31aa57c-Paper.pdf.
[32] Alain Hauser and Peter Buhlmann. Two optimal strategies for active learning of causal models from interventional data. International Journal of Approximate Reasoning, 55(4):926-939, jun 2014. doi: 10.1016/j.ijar.2013.11.007. URL https://doi.org/10.1016%2Fj.ijar.2013.11.007.
[33] David Maxwell Chickering. Optimal structure identification with greedy search. Journal of Machine Learning Research, 3:507-554, 2002.
[34] Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In Proceedings of the Conference on Neural Information Processing Systems (NeurIPS), NIPS'07, page 1177-1184, Red Hook, NY, USA, 2007. Curran Associates Inc. ISBN 9781605603520.