{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:24:03Z","timestamp":1754486643420,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1527371, CCF- 1302518"],"award-info":[{"award-number":["CCF-1527371, CCF- 1302518"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Investigator Award, Simons Collaboration Grant, ONR- N00014-16-1-2329"],"award-info":[{"award-number":["Investigator Award, Simons Collaboration Grant, ONR- N00014-16-1-2329"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055482","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"1057-1066","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Provable learning of noisy-OR networks"],"prefix":"10.1145","author":[{"given":"Sanjeev","family":"Arora","sequence":"first","affiliation":[{"name":"Princeton University, USA"}]},{"given":"Rong","family":"Ge","sequence":"additional","affiliation":[{"name":"Duke University, USA"}]},{"given":"Tengyu","family":"Ma","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}]},{"given":"Andrej","family":"Risteski","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"288","volume-title":"ICML (2)","author":"Sanjeev Arora AGH","year":"2013","unstructured":"{ AGH + 13} Sanjeev Arora , Rong Ge , Yonatan Halpern , David M Mimno , Ankur Moitra , David Sontag , Yichen Wu , and Michael Zhu . A practical algorithm for topic modeling with provable guarantees . In ICML (2) , pages 280\u2013 288 , 2013 . {AGH + 13} Sanjeev Arora, Rong Ge, Yonatan Halpern, David M Mimno, Ankur Moitra, David Sontag, Yichen Wu, and Michael Zhu. A practical algorithm for topic modeling with provable guarantees. In ICML (2), pages 280\u2013288, 2013."},{"issue":"1","key":"e_1_3_2_2_2_1","first-page":"2773","article-title":"Tensor decompositions for learning latent variable models","volume":"15","author":"Animashree Anandkumar AGH","year":"2014","unstructured":"{ AGH + 14} Animashree Anandkumar , Rong Ge , Daniel Hsu , Sham M Kakade , and Matus Telgarsky . Tensor decompositions for learning latent variable models . Journal of Machine Learning Research , 15 ( 1 ): 2773 \u2013 2832 , 2014 . {AGH + 14} Animashree Anandkumar, Rong Ge, Daniel Hsu, Sham M Kakade, and Matus Telgarsky. Tensor decompositions for learning latent variable models. Journal of Machine Learning Research, 15(1):2773\u20132832, 2014.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.49"},{"key":"e_1_3_2_2_4_1","first-page":"149","volume-title":"Proceedings of The 28th Conference on Learning Theory","author":"Arora Sanjeev","year":"2015","unstructured":"{AGMM15} Sanjeev Arora , Rong Ge , Tengyu Ma , and Ankur Moitra . Simple, efficient , and neural algorithms for sparse coding . In Proceedings of The 28th Conference on Learning Theory , pages 113\u2013 149 , 2015 . {AGMM15} Sanjeev Arora, Rong Ge, Tengyu Ma, and Ankur Moitra. Simple, efficient, and neural algorithms for sparse coding. In Proceedings of The 28th Conference on Learning Theory, pages 113\u2013149, 2015."},{"key":"e_1_3_2_2_5_1","volume-title":"Springer","author":"Chickering David Maxwell","year":"1996","unstructured":"{Chi96} David Maxwell Chickering . Learning bayesian networks is np-complete. In Learning from data, pages 121\u2013130 . Springer , 1996 . {Chi96} David Maxwell Chickering. Learning bayesian networks is np-complete. In Learning from data, pages 121\u2013130. Springer, 1996."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0707001"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746616"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422439"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1127647"},{"key":"e_1_3_2_2_10_1","volume-title":"Citeseer","author":"Halpern Yoni","year":"2013","unstructured":"{HS13} Yoni Halpern and David Sontag . Unsupervised learning of noisy-or bayesian networks. In Uncertainty in Artificial Intelligence, page 272 . Citeseer , 2013 . {HS13} Yoni Halpern and David Sontag. Unsupervised learning of noisy-or bayesian networks. In Uncertainty in Artificial Intelligence, page 272. Citeseer, 2013."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002828"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007665907178"},{"key":"e_1_3_2_2_13_1","first-page":"2363","volume-title":"Advances in Neural Information Processing Systems","author":"Jernite Yacine","year":"2013","unstructured":"{ JHS13} Yacine Jernite , Yonatan Halpern , and David Sontag . Discovering hidden variables in noisy-or networks using quartet tests . In Advances in Neural Information Processing Systems , pages 2355\u2013 2363 , 2013 . { JHS13} Yacine Jernite, Yonatan Halpern, and David Sontag. Discovering hidden variables in noisy-or networks using quartet tests. In Advances in Neural Information Processing Systems, pages 2355\u20132363, 2013."},{"key":"e_1_3_2_2_14_1","volume-title":"Relative perturbation theory. iii. more bounds on eigenvalue variation. Linear algebra and its applications, 266:337\u2013345","author":"Li Ren-Cang","year":"1997","unstructured":"{Li97} Ren-Cang Li . Relative perturbation theory. iii. more bounds on eigenvalue variation. Linear algebra and its applications, 266:337\u2013345 , 1997 . {Li97} Ren-Cang Li. Relative perturbation theory. iii. more bounds on eigenvalue variation. Linear algebra and its applications, 266:337\u2013345, 1997."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089547989629849X"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896298506"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1056\/NEJM198208193070803"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060645"},{"key":"e_1_3_2_2_19_1","volume-title":"October","author":"Ma T.","year":"2016","unstructured":"{MSS16} T. Ma , J. Shi , and D. Steurer . Polynomial-time Tensor Decompositions with Sum-of-Squares. ArXiv e-prints , October 2016 . {MSS16} T. Ma, J. Shi, and D. Steurer. Polynomial-time Tensor Decompositions with Sum-of-Squares. ArXiv e-prints, October 2016."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4809(91)90020-W"},{"key":"e_1_3_2_2_21_1","volume-title":"DTIC Document","author":"Smolensky Paul","year":"1986","unstructured":"{Smo86} Paul Smolensky . Information processing in dynamical systems: Foundations of harmony theory. Technical report , DTIC Document , 1986 . {Smo86} Paul Smolensky. Information processing in dynamical systems: Foundations of harmony theory. Technical report, DTIC Document, 1986."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932678"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055482","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":22,"alternative-id":["10.1145\/3055399.3055482","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055482","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}