
AlmostReedMuller Codes Achieve Constant Rates for Random Errors
This paper considers 'δalmost ReedMuller codes', i.e., linear codes sp...
read it

On Symmetry and Initialization for Neural Networks
This work provides an additional step in the theoretical understanding o...
read it

AverageCase Information Complexity of Learning
How many bits of information are revealed by a learning algorithm for a ...
read it

On the Perceptron's Compression
We study and provide exposition to several phenomena that are related to...
read it

A Direct Sum Result for the Information Complexity of Learning
How many bits of information are required to PAC learn a class of hypoth...
read it

Learners that Leak Little Information
We study learning algorithms that are restricted to revealing little inf...
read it
Ido Nachum
is this you? claim profile