Lacasse's conjecture on the PAC-Bayesian combinatorial sum
Statement
Let be defined by
and
Lacasse's conjecture. For every ,
This conjecture arose from numerical evidence in the study of combinatorial sums appearing in refined PAC-Bayesian bounds for majority-vote classifiers. Its status is not resolved in the supplied source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.