English
Related papers

Related papers: A combinatorial conjecture from PAC-Bayesian machi…

200 papers

Transfer learning has received a lot of attention in the machine learning community over the last years, and several effective algorithms have been developed. However, relatively little is known about their theoretical properties,…

Machine Learning · Statistics 2014-05-13 Anastasia Pentina , Christoph H. Lampert

The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…

Operator Algebras · Mathematics 2008-04-16 Mihai Popa

This paper generalizes an important result from the PAC-Bayesian literature for binary classification to the case of ensemble methods for structured outputs. We prove a generic version of the \Cbound, an upper bound over the risk of models…

Machine Learning · Statistics 2015-06-16 François Laviolette , Emilie Morvant , Liva Ralaivola , Jean-Francis Roy

We obtain new partial results supporting the spectral set conjecture in dimension 1.

Classical Analysis and ODEs · Mathematics 2007-05-23 I. Laba

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

Combinatorics · Mathematics 2023-09-12 Bernd S. W. Schröder

We prove two multivariate $q$-binomial identities conjectured by Bousseau, Brini and van Garrel [Geom. Topol. 28 (2024), 393-496, arXiv:2011.08830] which give generating series for Gromov-Witten invariants of two specific log Calabi-Yau…

Classical Analysis and ODEs · Mathematics 2024-10-11 Christian Krattenthaler

The main goal of this article is to convince you, the reader, that supervised learning in the Probably Approximately Correct (PAC) model is closely related to -- of all things -- bipartite matching! En-route from PAC learning to bipartite…

Machine Learning · Computer Science 2025-05-06 Shaddin Dughmi

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

Computational Complexity · Computer Science 2007-05-23 Luca Trevisan

We report the results of our empirical investigations on the Bateman-Horn conjecture. This conjecture, in its commonly known form, produces rather large deviations when the polynomials involved are not monic. We propose a modified version…

Number Theory · Mathematics 2019-06-11 Weixiong Li

We present a method for proving q-series identities by combinatorial telescoping, in the sense that one can transform a bijection or a classification of combinatorial objects into a telescoping relation. We shall illustrate this method by…

Combinatorics · Mathematics 2010-09-17 William Y. C. Chen , Qing-Hu Hou , Lisa H. Sun

In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Ap\'ery-like numbers modulo $p^3$, where $p$ is an odd prime.

Number Theory · Mathematics 2021-12-07 Zhi-Hong Sun

We present a comprehensive study of multilayer neural networks with binary activation, relying on the PAC-Bayesian theory. Our contributions are twofold: (i) we develop an end-to-end framework to train a binary activated deep neural…

Machine Learning · Computer Science 2020-02-05 Gaël Letarte , Pascal Germain , Benjamin Guedj , François Laviolette

Our paper deals about identities involving Bell polynomials. Some identities on Bell polynomials derived using generating function and successive derivatives of binomial type sequences. We give some relations between Bell polynomials and…

Combinatorics · Mathematics 2008-06-24 Miloud Mihoubi

We give positive answer to two conjectures posed by M. E. H Ismail in his monograph [Classical and quantum orthogonal polynomials in one variable, Cambridge University Press, 2005].

Classical Analysis and ODEs · Mathematics 2022-03-29 K. Castillo , D. Mbouna

We give a short proof of the inner product conjecture for the symmetric Macdonald polynomials of type $A_{n-1}$. As a special case, the corresponding constant term conjecture is also proved.

q-alg · Mathematics 2008-02-03 Katsuhisa Mimachi

In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated…

Number Theory · Mathematics 2007-09-14 George Grossman , Aklilu Zeleke , Akalu Tefera

We prove that Anderson's conjecture on symmetric sequencings and Bailey's conjecture on 2-sequencings hold for sufficiently large groups. In addition, we discuss extensions of partial harmonious sequences and partial R-sequencings. Several…

Combinatorics · Mathematics 2025-11-25 Mohammad Javaheri

For earlier considered our sequence A166944 in [4] we prove three statements of its connection with twin primes. We also give a sufficient condition for the infinity of twin primes and pose several new conjectures; among them we propose a…

Number Theory · Mathematics 2010-01-11 Vladimir Shevelev

We extend the digital binomial identity as given by Nguyen el al. to an identity in an arbitrary base $b$, by introducing the $b-$ary binomial coefficients. We then study the properties of these coefficients such as orthogonality, a link to…

Combinatorics · Mathematics 2017-05-11 Lin Jiu , Christophe Vignat

We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kur\c{s}ung\"oz. We also present some related polynomial and $q$-series…

Combinatorics · Mathematics 2019-03-05 Ali K. Uncu