%0 Journal Article %1 noauthororeditor %A Poggio, Tomaso %A Mhaskar, Hrushikesh %A Rosasco, Lorenzo %A Miranda, Brando %A Liao, Qianli %D 2017 %K bounds complexity generalization learning probability sampling stable stats theory %T Why and When Can Deep-but Not Shallow-networks Avoid the Curse of Dimensionality: A Review %U http://cbmm.mit.edu/sites/default/files/publications/art%253A10.1007%252Fs11633-017-1054-2.pdf

@article{noauthororeditor, added-at = {2019-05-24T12:05:48.000+0200}, author = {Poggio, Tomaso and Mhaskar, Hrushikesh and Rosasco, Lorenzo and Miranda, Brando and Liao, Qianli}, biburl = {https://www.bibsonomy.org/bibtex/2788c315007e3b5f933c76c4483ea3cfe/kirk86}, description = {IJAC-2016-11-271.dvi}, interhash = {99e38247d0adfb5f03c3fb72f78d657e}, intrahash = {788c315007e3b5f933c76c4483ea3cfe}, keywords = {bounds complexity generalization learning probability sampling stable stats theory}, timestamp = {2019-05-24T12:05:48.000+0200}, title = {Why and When Can Deep-but Not Shallow-networks Avoid the Curse of Dimensionality: A Review}, url = {http://cbmm.mit.edu/sites/default/files/publications/art%253A10.1007%252Fs11633-017-1054-2.pdf}, year = 2017 }