On the Sample Complexity of Privately Learning Axis-Aligned Rectangles Uri Stemmer

Neural Information Processing Systems 

That is, existing constructions either require sample complexity that grows linearly with log |X|, or else it grows super linearly with the dimension (d.