Provable Bounds for Learning Some Deep Representations. Arora, S., Bhaskara, A., Ge, R., & Ma, T. arXiv.org, cs.LG, 2013. abstract bibtex We give algorithms with provable guarantees that learn a class of deep nets in the generative model view popularized by Hinton and others. Our generative model is an \$n\$ node multilayer neural net that has degree at most \$n$^\gamma\$ for some \$γ<1\$ and each edge has a random edge weight in \$[-1,1]\$. Our algorithm learns {\em almost all} networks in this class with polynomial running time. The sample complexity is quadratic or cubic depending upon the details of the model. The algorithm uses layerwise learning. It is based upon a novel idea of observing correlations among features and using these to infer the underlying edge structure via a global graph recovery procedure. The analysis of the algorithm reveals interesting structure of neural networks with random edge weights.}, location = {}, keywords = {}
@Article{Arora2013,
author = {Arora, Sanjeev and Bhaskara, Aditya and Ge, Rong and Ma, Tengyu},
title = {Provable Bounds for Learning Some Deep Representations},
journal = {arXiv.org},
volume = {cs.LG},
number = {},
pages = {},
year = {2013},
abstract = {We give algorithms with provable guarantees that learn a class of deep nets in the generative model view popularized by Hinton and others. Our generative model is an \$n\$ node multilayer neural net that has degree at most \$n$^{{\gamma}\$ for some \$\gamma \<1\$ and each edge has a random edge weight in \$[-1,1]\$. Our algorithm learns {\em almost all} networks in this class with polynomial running time. The sample complexity is quadratic or cubic depending upon the details of the model. The algorithm uses layerwise learning. It is based upon a novel idea of observing correlations among features and using these to infer the underlying edge structure via a global graph recovery procedure. The analysis of the algorithm reveals interesting structure of neural networks with random edge weights.},
location = {},
keywords = {}}
}
Downloads: 0
{"_id":"PNubQMiK65xak2r3t","bibbaseid":"arora-bhaskara-ge-ma-provableboundsforlearningsomedeeprepresentations-2013","authorIDs":[],"author_short":["Arora, S.","Bhaskara, A.","Ge, R.","Ma, T."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Arora"],"firstnames":["Sanjeev"],"suffixes":[]},{"propositions":[],"lastnames":["Bhaskara"],"firstnames":["Aditya"],"suffixes":[]},{"propositions":[],"lastnames":["Ge"],"firstnames":["Rong"],"suffixes":[]},{"propositions":[],"lastnames":["Ma"],"firstnames":["Tengyu"],"suffixes":[]}],"title":"Provable Bounds for Learning Some Deep Representations","journal":"arXiv.org","volume":"cs.LG","number":"","pages":"","year":"2013","abstract":"We give algorithms with provable guarantees that learn a class of deep nets in the generative model view popularized by Hinton and others. Our generative model is an \\$n\\$ node multilayer neural net that has degree at most \\$n$^\\gamma\\$ for some \\$γ<1\\$ and each edge has a random edge weight in \\$[-1,1]\\$. Our algorithm learns {\\em almost all} networks in this class with polynomial running time. The sample complexity is quadratic or cubic depending upon the details of the model. The algorithm uses layerwise learning. It is based upon a novel idea of observing correlations among features and using these to infer the underlying edge structure via a global graph recovery procedure. The analysis of the algorithm reveals interesting structure of neural networks with random edge weights.}, location = {}, keywords = {}","bibtex":"@Article{Arora2013,\nauthor = {Arora, Sanjeev and Bhaskara, Aditya and Ge, Rong and Ma, Tengyu}, \ntitle = {Provable Bounds for Learning Some Deep Representations}, \njournal = {arXiv.org}, \nvolume = {cs.LG}, \nnumber = {}, \npages = {}, \nyear = {2013}, \nabstract = {We give algorithms with provable guarantees that learn a class of deep nets in the generative model view popularized by Hinton and others. Our generative model is an \\$n\\$ node multilayer neural net that has degree at most \\$n$^{{\\gamma}\\$ for some \\$\\gamma \\<1\\$ and each edge has a random edge weight in \\$[-1,1]\\$. Our algorithm learns {\\em almost all} networks in this class with polynomial running time. The sample complexity is quadratic or cubic depending upon the details of the model. The algorithm uses layerwise learning. It is based upon a novel idea of observing correlations among features and using these to infer the underlying edge structure via a global graph recovery procedure. The analysis of the algorithm reveals interesting structure of neural networks with random edge weights.}, \nlocation = {}, \nkeywords = {}}\n\n}","author_short":["Arora, S.","Bhaskara, A.","Ge, R.","Ma, T."],"key":"Arora2013","id":"Arora2013","bibbaseid":"arora-bhaskara-ge-ma-provableboundsforlearningsomedeeprepresentations-2013","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://gist.githubusercontent.com/stuhlmueller/a37ef2ef4f378ebcb73d249fe0f8377a/raw/6f96f6f779501bd9482896af3e4db4de88c35079/references.bib","creationDate":"2020-01-27T02:13:34.299Z","downloads":0,"keywords":[],"search_terms":["provable","bounds","learning","deep","representations","arora","bhaskara","ge","ma"],"title":"Provable Bounds for Learning Some Deep Representations","year":2013,"dataSources":["hEoKh4ygEAWbAZ5iy"]}