2000 character limit reached
A combinatorial conjecture from PAC-Bayesian machine learning
Published 2 Jun 2020 in stat.ML, cs.LG, and math.CO | (2006.01387v2)
Abstract: We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine learning.
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.