2000 character limit reached
On the Kolmogorov Complexity of Binary Classifiers
Published 28 Jan 2022 in cs.CC | (2201.12374v2)
Abstract: We provide tight upper and lower bounds on the expected minimum Kolmogorov complexity of binary classifiers that are consistent with labeled samples. The expected size is not more than complexity of the target concept plus the conditional entropy of the labels given the sample.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.