
Tight bounds on the Fourier growth of bounded functions on the hypercube
We give tight bounds on the degree ℓ homogenous parts f_ℓ of a bounded f...
read it

A lower bound for essential covers of the cube
Essential covers were introduced by Linial and Radhakrishnan as a model ...
read it

On the Communication Complexity of KeyAgreement Protocols
Keyagreement protocols whose security is proven in the random oracle mo...
read it

Slicing the hypercube is not easy
We prove that at least Ω(n^0.51) hyperplanes are needed to slice all edg...
read it

A Theory of Universal Learning
How quickly can a given class of concepts be learned from examples? It i...
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

On the CovarianceHessian Relation in Evolution Strategies
We consider Evolution Strategies operating only with isotropic Gaussian ...
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

On Communication Complexity of Classification Problems
This work introduces a model of distributed learning in the spirit of Ya...
read it

Learners that Leak Little Information
We study learning algorithms that are restricted to revealing little inf...
read it

On weak εnets and the Radon number
We show that the Radon number characterizes the existence of weak nets i...
read it

On the Theoretical Capacity of Evolution Strategies to Statistically Learn the Landscape Hessian
We study the theoretical capacity to statistically learn local landscape...
read it
Amir Yehudayoff
is this you? claim profile