modern learning algorithms such as deep neural networks operate in regimes that defy the traditional statistical learning theory. neural networks architectures often contain more parameters than training samples. despite their huge complexity, the generalization error achieved on real data is small. in this talk, we aim to study the generalization properties of algorithms in high dimensions. interestingly, we show that algorithms in high dimensions require a small bias for good generalization. we show that this is indeed the case for deep neural networks in the over-parametrized regime. in addition, we provide lower bounds on the generalization error in various settings for any algorithm. we calculate such bounds using random matrix theory (rmt). we will review the connection between deep neural networks and rmt and existing results. these bounds are particularly useful when the analytic evaluation of standard performance bounds is not possible due to the complexity and nonlinearity of the model. the bounds can serve as a benchmark for testing performance and optimizing the design of actual learning algorithms. (joint work with ofer zeitouni)