Tom Sterkenburg
- Full Name
- T.F. Sterkenburg
- Function(s)
- Researcher - Unknown
- T.F.Sterkenburg@cwi.nl
- Telephone
- +31 20 592 4387
- Room
- L131
- Department(s)
- Machine Learning
Publications
-
Sterkenburg, T.F, & Grünwald, P.D. (2021). The no-free-lunch theorems of supervised learning. Synthese. doi:10.1007/s11229-021-03233-1
-
Sterkenburg, T.F, & de Heide, R. (2021). On the truth-convergence of open-minded Bayesianism. The Review of Symbolic Logic, 1–37. doi:http://dx.doi:10.1017/S1755020321000022
-
Sterkenburg, T.F. (2018, January 18). Universal prediction : a philosophical investigation.
-
Sterkenburg, T.F. (2017). A generalized characterization of algorithmic probability. Theory of Computing Systems, 61(4), 1337–1352. doi:10.1007/s00224-017-9774-9
-
Quaeghebeur, E, Wesseling, C.C, Beauxis-Aussalet, E.M.A.L, Piovesan, T, & Sterkenburg, T.F. (2017). The CWI World Cup Competition: Eliciting Sets of Acceptable Gambles. In Proceedings of Machine Learning Research (pp. 277–288).
-
Sterkenburg, T.F. (2016). Solomonoff Prediction and Occam's Razor. Philosophy of Science, 83(4), 459–479. doi:10.1086/687257
-
Quaeghebeur, E, Wesseling, C.C, Beauxis-Aussalet, E.M.A.L, Piovesan, T, & Sterkenburg, T.F. (2015). Eliciting sets of acceptable gambles — The CWI World Cup Competition. In T Augustin, S Doria, E Miranda, & E Quaeghebeur (Eds.), Proceedings of International Symposium on Imprecise Probability: Theories and Applications 2015 (ISIPTA 9). Aracne editrice Int.le S.r.l.
-
Romeijn, J.W, Sterkenburg, T.F, & Grünwald, P.D. (2012). Good Listeners, Wise Crowds and Parasitic Experts. Analyse & Kritik, 34(2), 399–408.