All reports by Author Ran Raz:

__
TR19-071
| 14th May 2019
__

Sumegha Garg, Ran Raz, Avishay Tal#### Time-Space Lower Bounds for Two-Pass Learning

Sumegha Garg, Ran Raz, Avishay Tal

A line of recent works showed that for a large class of learning problems, any learning algorithm requires either super-linear memory size or a super-polynomial number of samples [Raz16,KRT17,Raz17,MM18,BOGY18,GRT18]. For example, any algorithm for learning parities of size $n$ requires either a memory of size $\Omega(n^{2})$ or an exponential number ... more >>>