{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:23:20Z","timestamp":1740165800525,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hong Kong Research Grants Council","award":["17246416"],"award-info":[{"award-number":["17246416"]}]},{"DOI":"10.13039\/501100003802","name":"University Research Committee of The University of Hong Kong","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003802","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tnnls.2019.2928379","type":"journal-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T19:45:21Z","timestamp":1565379921000},"page":"1-7","source":"Crossref","is-referenced-by-count":2,"title":["Deep Model Compression and Inference Speedup of Sum-Product Networks on Tensor Trains"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8966-8570","authenticated-orcid":false,"given":"Ching-Yun","family":"Ko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3376-5037","authenticated-orcid":false,"given":"Cong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuolun","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuke","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7381-2630","authenticated-orcid":false,"given":"Kim","family":"Batselier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ngai","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.06.033"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0035-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.356"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247816"},{"key":"ref31","article-title":"Network trimming: A data-driven neuron pruning approach towards efficient deep architectures","author":"hu","year":"2016","journal-title":"arXiv 1607 03250"},{"key":"ref30","first-page":"2285","article-title":"Compressing neural networks with the hashing trick","author":"chen","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2618381"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/765568.765570"},{"key":"ref35","first-page":"3239","article-title":"Discriminative learning of sum-product networks","author":"gens","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref34","first-page":"1","article-title":"Merging strategies for sum-product networks: From trees to graphs","author":"rahman","year":"2016","journal-title":"Proc UAI"},{"key":"ref10","first-page":"4547","article-title":"Learning graph-structured sum-product networks for probabilistic semantic maps","author":"zheng","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971217"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2018.00060"},{"key":"ref12","first-page":"873","article-title":"Learning the structure of sum-product networks","author":"gens","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23525-7_21"},{"key":"ref14","first-page":"433","article-title":"A unified approach for learning the parameters of sum-product networks","author":"zhao","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2017.8280810"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref18","article-title":"Analysis and design of convolutional networks via hierarchical tensor decompositions","author":"cohen","year":"2017","journal-title":"arXiv 1705 02302"},{"key":"ref19","first-page":"1","article-title":"Expressive power of recurrent neural networks","author":"khrulkov","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref28","first-page":"164","article-title":"Second order derivatives for network pruning: Optimal brain surgeon","author":"hassibi","year":"1993","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.07.015"},{"key":"ref27","first-page":"598","article-title":"Optimal brain damage","author":"lecun","year":"1990","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2465955"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2016.2586853"},{"key":"ref29","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","author":"han","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66182-7_21"},{"key":"ref8","article-title":"Sum-product networks for sequence labeling","author":"ratajczak","year":"2018","journal-title":"arXiv 1807 02324"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854292"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2011.6130310"},{"key":"ref9","first-page":"1","article-title":"Deep spatial affordance hierarchy: Spatial knowledge representation for planning in large-scale environments","author":"pronobis","year":"2017","journal-title":"Proc ICAPS Workshop Plan Robot"},{"journal-title":"Probabilistic Graphical Models Principles and Techniques","year":"2009","author":"koller","key":"ref1"},{"key":"ref20","article-title":"Speeding-up convolutional neural networks using fine-tuned CP-decomposition","author":"lebedev","year":"2014","journal-title":"arXiv 1412 6553"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2771264"},{"key":"ref21","first-page":"442","article-title":"Tensorizing neural networks","author":"novikov","year":"2015","journal-title":"Proc 28th Int Conf Neural Inf Process Syst"},{"journal-title":"Fundamentals of Statistical Signal Processing Volume II Detection Theory","year":"1993","author":"kay","key":"ref42"},{"key":"ref24","first-page":"3123","article-title":"BinaryConnect: Training deep neural networks with binary weights during propagations","author":"courbariaux","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","article-title":"Fast and accurate tensor completion with total variation regularized tensor trains","author":"ko","year":"2018","journal-title":"arXiv 1804 06128"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref26","first-page":"1","article-title":"Deep compression: Compressing deep neural network with pruning, trained quantization and Huffman coding","author":"han","year":"2016","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_32"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/6104215\/08793233.pdf?arnumber=8793233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:19:33Z","timestamp":1651079973000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8793233\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/tnnls.2019.2928379","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2019]]}}}