2 citations · 3 across the 8 of their papers we have counts for
8 papers
Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance
Donald Kougang-Yombi, Jan Hązła
We study relationships between worst-case and random-noise properties of error correcting codes. More concretely, we consider connections between minimum distance, list decoding ra…
Learning High-Degree Parities: The Crucial Role of the Initialization
Emmanuel Abbe, Elisabetta Cornacchia, Jan Hązła +1
Parities have become a standard benchmark for evaluating learning algorithms. Recent works show that regular neural networks trained by gradient descent can efficiently learn degre…
A Quantitative Version of More Capable Channel Comparison
Donald Kougang-Yombi, Jan Hązła
This paper introduces a quantitative generalization of the ``more capable'' comparison of broadcast channels, which is termed ``more capable with advantage''. Some basic properties…
Optimal list decoding from noisy entropy inequality
Jan Hązła
A noisy entropy inequality for boolean functions by Samorodnitsky is applied to binary codes. It is shown that a binary code that achieves capacity on the binary erasure channel ad…
An initial alignment between neural network and target is needed for gradient descent to learn
Emmanuel Abbe, Elisabetta Cornacchia, Jan Hązła +1
This paper introduces the notion of ``Initial Alignment'' (INAL) between a neural network at initialization and a target function. It is proved that if a network and a Boolean targ…
Regularization by Misclassification in ReLU Neural Networks
Elisabetta Cornacchia, Jan Hązła, Ido Nachum +1
We study the implicit bias of ReLU neural networks trained by a variant of SGD where at each step, the label is changed with probability to a random label (label smoothing bein…
Intransitive dice tournament is not quasirandom
Elisabetta Cornacchia, Jan Hązła
We settle a version of the conjecture about intransitive dice posed by Conrey, Gabbard, Grant, Liu and Morrison in 2016 and Polymath in 2017. We consider generalized dice with …
Almost-Reed--Muller Codes Achieve Constant Rates for Random Errors
Emmanuel Abbe, Jan Hązła, Ido Nachum
This paper considers '-almost Reed-Muller codes', i.e., linear codes spanned by evaluations of all but a fraction of monomials of degree at most . It is shown that for an…