A combinatorial conjecture from PAC-Bayesian machine learning

06/02/2020
by   M. Younsi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2023

A proof of the Prelov conjecture

In this paper we present a complete proof of a conjecture due to V. V. P...
research
06/02/2022

A Multiset Version of Even-Odd Permutations Identity

In this paper, we give a new bijective proof of a multiset analogue of e...
research
04/18/2023

Searching for ribbons with machine learning

We apply Bayesian optimization and reinforcement learning to a problem i...
research
08/20/2018

PAC-learning is Undecidable

The problem of attempting to learn the mapping between data and labels i...
research
10/15/2017

Nivat's conjecture holds for sums of two periodic configurations

Nivat's conjecture is a long-standing open combinatorial problem. It con...
research
06/04/2016

Distance Metric Ensemble Learning and the Andrews-Curtis Conjecture

Motivated by the search for a counterexample to the Poincaré conjecture ...
research
02/08/2020

Towards a combinatorial characterization of bounded memory learning

Combinatorial dimensions play an important role in the theory of machine...

Please sign up or login with your details

Forgot password? Click here to reset