On the status of learnability inside $\mathsf{TC}^0$
The main thing missing from your list is the beautiful 2006 paper of Klivans and Sherstov.  They show there that PAC-learning even depth-2 threshold circuits is as hard as solving the approximate shortest vector problem.