Tom F. Sterkenburg

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 7

Top Topics

Statistical Learning

Boolean Functions

Uniform Convergence

Empirical Risk Minimization

Top Venues

Theory Comput. Syst.

Rev. Symb. Log.

Publications

Tom F. Sterkenburg
Statistical learning theory and Occam's razor: The argument from empirical risk minimization. CoRR (2023)
Tom F. Sterkenburg
On characterizations of learnability with computable learners. CoRR (2022)
Tom F. Sterkenburg, Rianne de Heide
On the Truth-convergence of Open-Minded Bayesianism. Rev. Symb. Log. 15 (1) (2022)
Tom F. Sterkenburg
On characterizations of learnability with computable learners. COLT (2022)
Tom F. Sterkenburg, Peter D. Grünwald
The no-free-lunch theorems of supervised learning. CoRR (2022)
Erik Quaeghebeur, Chris Wesseling, Emma Beauxis-Aussalet, Teresa Piovesan, Tom F. Sterkenburg
The CWI World Cup Competition: Eliciting Sets of Acceptable Gambles. ISIPTA (2017)
Tom F. Sterkenburg
A Generalized Characterization of Algorithmic Probability. Theory Comput. Syst. 61 (4) (2017)
George Barmpalias, Tom F. Sterkenburg
On the number of infinite sequences with trivial initial segment complexity. Theor. Comput. Sci. 412 (52) (2011)