{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:45:24Z","timestamp":1773384324997,"version":"3.50.1"},"publisher-location":"Cham","reference-count":114,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030589417","type":"print"},{"value":"9783030589424","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_27","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"417-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Lossless Compression of Deep Neural Networks"],"prefix":"10.1007","author":[{"given":"Thiago","family":"Serra","sequence":"first","affiliation":[]},{"given":"Abhinav","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Srikumar","family":"Ramalingam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"27_CR1","unstructured":"Aghasi, A., Abdi, A., Nguyen, N., Romberg, J.: Net-trim: convex pruning of deep neural networks with performance guarantee. In: NeurIPS (2017)"},{"key":"27_CR2","unstructured":"Agrawal, A., Amos, B., Barratt, S., Boyd, S., Diamond, S., Kolter, Z.: Differentiable convex optimization layers. In: NeurIPS (2019)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Alvarez, A., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. (2017)","DOI":"10.1287\/ijoc.2016.0723"},{"key":"27_CR4","unstructured":"Alvarez, J., Salzmann, M.: Learning the number of neurons in deep networks. In: NeurIPS (2016)"},{"key":"27_CR5","unstructured":"Amos, B., Kolter, Z.: OptNet: differentiable optimization as a layer in neural networks. In: ICML (2017)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Anderson, R., Huchette, J., Tjandraatmadja, C., Vielma, J.: Strong mixed-integer programming formulations for trained neural networks. In: IPCO (2019)","DOI":"10.1007\/978-3-030-17953-3_3"},{"key":"27_CR7","unstructured":"Arora, R., Basu, A., Mianjy, P., Mukherjee, A.: Understanding deep neural networks with rectified linear units. In: ICLR (2018)"},{"key":"27_CR8","unstructured":"Balcan, M.F., Dick, T., Sandholm, T., Vitercik, E.: Learning to branch. In: ICML (2018)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"2159","DOI":"10.1162\/089976698300017016","volume":"10","author":"P Bartlett","year":"1998","unstructured":"Bartlett, P., Maiorov, V., Meir, R.: Almost linear VC-dimension bounds for piecewise polynomial networks. Neural Comput. 10, 2159\u20132173 (1998)","journal-title":"Neural Comput."},{"key":"27_CR10","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: ICLR (2017)"},{"key":"27_CR11","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. CoRR abs\/1811.06128 (2018)"},{"issue":"7","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Dunn, J.: Optimal classification trees. Mach. Learn. 106(7), 1039\u20131082 (2017)","journal-title":"Mach. Learn."},{"key":"27_CR13","unstructured":"Bienstock, D., Mu\u00f1oz, G., Pokutta, S.: Principled deep neural network training through linear programming. CoRR abs\/1810.03218 (2018)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Bonami, P., Lodi, A., Zarpellon, G.: Learning a classification of mixed-integer quadratic programming problems. In: CPAIOR (2018)","DOI":"10.1007\/978-3-319-93031-2_43"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Goutierre, E., Bergman, D., Rousseau, L.M.: Improving optimization bounds using machine learning: decision diagrams meet deep reinforcement learning. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33011443"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Cheng, C., N\u00fchrenberg, G., Ruess, H.: Maximum resilience of artificial neural networks. In: ATVA (2017)","DOI":"10.1007\/978-3-319-68167-2_18"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.neunet.2012.02.023","volume":"32","author":"D Ciresan","year":"2012","unstructured":"Ciresan, D., Meier, U., Masci, J., Schmidhuber, J.: Multi column deep neural network for traffic sign classification. Neural Netw. 32, 333\u2013338 (2012)","journal-title":"Neural Netw."},{"key":"27_CR18","unstructured":"Courbariaux, M., Hubara, I., Soudry, D., El-Yaniv, R., Bengio, Y.: Binarized neural networks: training deep neural networks with weights and activations constrained to +1 or -1. In: NeurIPS (2016)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Mathematics of Control, Signals and Systems (1989)","DOI":"10.1007\/BF02551274"},{"key":"27_CR20","unstructured":"Dai, H., Khalil, E.B., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: NeurIPS (2017)"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Demirovi\u0107, E., et al.: An investigation into prediction + optimisation for the knapsack problem. In: CPAIOR (2019)","DOI":"10.1007\/978-3-030-19212-9_16"},{"key":"27_CR22","unstructured":"Denton, E., Zaremba, W., Bruna, J., LeCun, Y., Fergus, R.: Exploiting linear structure within convolutional networks for efficient evaluation. In: NeurIPS (2014)"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., Rousseau, L.M.: Learning heuristics for the TSP by policy gradient. In: CPAIOR (2018)","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"27_CR24","unstructured":"Ding, J.Y., et al.: Accelerating primal solution findings for mixed integer programs based on solution prediction. CoRR abs\/1906.09575 (2019)"},{"key":"27_CR25","unstructured":"Donti, P., Amos, B., Kolter, Z.: Task-based end-to-end model learning in stochastic optimization. In: NeurIPS (2017)"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-030-01234-2_28","volume-title":"Computer Vision \u2013 ECCV 2018","author":"A Dubey","year":"2018","unstructured":"Dubey, A., Chatterjee, M., Ahuja, N.: Coreset-based neural network compression. In: Ferrari, V., Hebert, M., Sminchisescu, C., Weiss, Y. (eds.) ECCV 2018. LNCS, vol. 11211, pp. 469\u2013486. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01234-2_28"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Dutta, S., Jha, S., Sankaranarayanan, S., Tiwari, A.: Output range analysis for deep feedforward networks. In: NFM (2018)","DOI":"10.1007\/978-3-319-77935-5_9"},{"key":"27_CR28","unstructured":"Elmachtoub, A., Grigas, P.: Smart predict, then optimize. CoRR abs\/1710.08005 (2017)"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Ferber, A., Wilder, B., Dilkina, B., Tambe, M.: MIPaaL: mixed integer program as a layer. In: AAAI (2020)","DOI":"10.1609\/aaai.v34i02.5509"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A., Zarpellon, G.: Learning MILP resolution outcomes before reaching time-limit. In: CPAIOR (2019)","DOI":"10.1007\/978-3-030-19212-9_18"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Jo, J.: Deep neural networks and mixed integer linear optimization. Constraints (2018)","DOI":"10.1007\/s10601-018-9285-6"},{"key":"27_CR32","unstructured":"Frankle, J., Carbin, M.: The lottery ticket hypothesis: Finding sparse, trainable neural networks. In: ICLR (2019)"},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Galassi, A., Lombardi, M., Mello, P., Milano, M.: Model agnostic solution of CSPs via deep learning: a preliminary study. In: CPAIOR (2018)","DOI":"10.1007\/978-3-319-93031-2_18"},{"key":"27_CR34","doi-asserted-by":"crossref","unstructured":"Gambella, C., Ghaddar, B., Naoum-Sawaya, J.: Optimization models for machine learning: a survey. CoRR abs\/1901.05331 (2019)","DOI":"10.1016\/j.ejor.2020.08.045"},{"key":"27_CR35","unstructured":"Glorot, X., Bordes, A., Bengio, Y.: Deep sparse rectifier neural networks. In: AISTATS (2011)"},{"key":"27_CR36","unstructured":"Goodfellow, I., Warde-Farley, D., Mirza, M., Courville, A., Bengio, Y.: Maxout networks. In: ICML (2013)"},{"key":"27_CR37","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2018). http:\/\/www.gurobi.com"},{"key":"27_CR38","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1038\/35016072","volume":"405","author":"R Hahnloser","year":"2000","unstructured":"Hahnloser, R., Sarpeshkar, R., Mahowald, M., Douglas, R., Seung, S.: Digital selection and analogue amplification coexist in a cortex-inspired silicon circuit. Nature 405, 947\u2013951 (2000)","journal-title":"Nature"},{"key":"27_CR39","unstructured":"Han, S., et al.: DSD: regularizing deep neural networks with dense-sparse-dense training flow. arXiv preprint arXiv:1607.04381 (2016)"},{"key":"27_CR40","unstructured":"Han, S., Pool, J., Tran, J., Dally, W.: Learning both weights and connections for efficient neural network. In: NeurIPS (2015)"},{"key":"27_CR41","unstructured":"Hanin, B., Rolnick, D.: Complexity of linear regions in deep networks. In: ICML (2019)"},{"key":"27_CR42","unstructured":"Hanin, B., Rolnick, D.: Deep relu networks have surprisingly few activation patterns. In: NeurIPS (2019)"},{"key":"27_CR43","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"27_CR44","unstructured":"Herrmann, C., Bowen, R., Zabih, R.: Deep networks with probabilistic gates. CoRR abs\/1812.04180 (2018)"},{"key":"27_CR45","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/MSP.2012.2205597","volume":"29","author":"G Hinton","year":"2012","unstructured":"Hinton, G., et al.: Deep neural networks for acoustic modeling in speech recognition. IEEE Sig. Process. Mag. 29, 82\u201397 (2012)","journal-title":"IEEE Sig. Process. Mag."},{"issue":"5","key":"27_CR46","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K Hornik","year":"1989","unstructured":"Hornik, K., Stinchcombe, M., White, H.: Multilayer feed-forward networks are universal approximators. Neural Net. 2(5), 359\u2013366 (1989)","journal-title":"Neural Net."},{"key":"27_CR47","doi-asserted-by":"crossref","unstructured":"Hottung, A., Tanaka, S., Tierney, K.: Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput. Oper. Res. (2020)","DOI":"10.1016\/j.cor.2019.104781"},{"key":"27_CR48","unstructured":"Howard, A., et al.: Mobilenets: efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861 (2017)"},{"key":"27_CR49","doi-asserted-by":"crossref","unstructured":"Huang, G., Liu, Z., Maaten, L.V.D., Weinberger, K.: Densely connected convolutional networks. In: CVPR (2017)","DOI":"10.1109\/CVPR.2017.243"},{"key":"27_CR50","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: LIOn (2011)","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"27_CR51","unstructured":"Iandola, F., Han, S., Moskewicz, M., Ashraf, K., Dally, W., Keutzer, K.: Squeezenet: alexnet-level accuracy with 50x fewer parameters and $$<$$ 0.5 MB model size. arXiv preprint arXiv:1602.07360 (2016)"},{"key":"27_CR52","unstructured":"Icarte, R., Illanes, L., Castro, M., Cire, A., McIlraith, S., Beck, C.: Training binarized neural networks using MIP and CP. In: International Conference on Principles and Practice of Constraint Programming (CP) (2019)"},{"key":"27_CR53","doi-asserted-by":"crossref","unstructured":"Jaderberg, M., Vedaldi, A., Zisserman, A.: Speeding up convolutional neural networks with low rank expansions. In: BMVC (2014)","DOI":"10.5244\/C.28.88"},{"key":"27_CR54","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC \u2013 Instance-Specific Algorithm Configuration. In: ECAI (2010)"},{"key":"27_CR55","doi-asserted-by":"crossref","unstructured":"Khalil, E., Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: AAAI (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"27_CR56","unstructured":"Khalil, E., Gupta, A., Dilkina, B.: Combinatorial attacks on binarized neural networks. In: ICLR (2019)"},{"key":"27_CR57","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cuts-a review. In: TPAMI (2007)","DOI":"10.1109\/TPAMI.2007.1031"},{"key":"27_CR58","doi-asserted-by":"crossref","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3) (2014)","DOI":"10.1609\/aimag.v35i3.2460"},{"key":"27_CR59","unstructured":"Koval, V., Schlesinger, M.: Two-dimensional programming in image analysis problems. USSR Academy of Science, Automatics and Telemechanics (1976)"},{"key":"27_CR60","unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.: Imagenet classification with deep convolutional neural networks. In: NeurIPS (2012)"},{"key":"27_CR61","doi-asserted-by":"crossref","unstructured":"Kruber, M., L\u00fcbbecke, M., Parmentier, A.: Learning when to use a decomposition. In: CPAIOR (2017)","DOI":"10.1007\/978-3-319-59776-8_16"},{"key":"27_CR62","unstructured":"Kumar, A., Serra, T., Ramalingam, S.: Equivalent and approximate transformations of deep neural networks. arXiv preprint arXiv:1905.11428 (2019)"},{"issue":"11","key":"27_CR63","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"27_CR64","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521, 436\u2013444 (2015)","journal-title":"Nature"},{"key":"27_CR65","unstructured":"Li, H., Kadav, A., Durdanovic, I., Samet, H., Graf, H.: Pruning filters for efficient convnets. arXiv preprint arXiv:1608.08710 (2016)"},{"key":"27_CR66","unstructured":"Lin, C., Zhong, Z., Wei, W., Yan, J.: Synaptic strength for convolutional neural network. In: NeurIPS (2018)"},{"key":"27_CR67","unstructured":"Lin, H., Jegelka, S.: Resnet with one-neuron hidden layers is a universal approximator. In: NeurIPS (2018)"},{"key":"27_CR68","unstructured":"Liu, B., Wang, M., Foroosh, H., Tappen, M., Pensky, M.: Sparse convolutional neural networks. In: CVPR (2015)"},{"issue":"2","key":"27_CR69","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. Top 25(2), 207\u2013236 (2017)","journal-title":"Top"},{"key":"27_CR70","doi-asserted-by":"crossref","unstructured":"Lombardi, M., Milano, M.: Boosting combinatorial problem modeling with machine learning. In: IJCAI (2018)","DOI":"10.24963\/ijcai.2018\/772"},{"key":"27_CR71","unstructured":"Lomuscio, A., Maganti, L.: An approach to reachability analysis for feed-forward ReLU neural networks. CoRR abs\/1706.07351 (2017)"},{"key":"27_CR72","doi-asserted-by":"crossref","unstructured":"Luo, J.H., Wu, J., Lin, W.: Thinet: A filter level pruning method for deep neural network compression. In: ICCV (2017)","DOI":"10.1109\/ICCV.2017.541"},{"key":"27_CR73","unstructured":"Mhaskar, H., Poggio, T.: Function approximation by deep networks. CoRR abs\/1905.12882 (2019)"},{"key":"27_CR74","unstructured":"Molchanov, P., Tyree, S., Karras, T., Aila, T., Kautz, J.: Pruning convolutional neural networks for resource efficient transfer learning. arXiv preprint arXiv:1611.06440 (2016)"},{"key":"27_CR75","unstructured":"Mont\u00fafar, G.: Notes on the number of linear regions of deep neural networks. In: SampTA (2017)"},{"key":"27_CR76","unstructured":"Mont\u00fafar, G., Pascanu, R., Cho, K., Bengio, Y.: On the number of linear regions of deep neural networks. In: NeurIPS (2014)"},{"key":"27_CR77","unstructured":"Nair, V., Hinton, G.: Rectified linear units improve restricted boltzmann machines. In: ICML (2010)"},{"key":"27_CR78","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Kasiviswanathan, S., Ryzhyk, L., Sagiv, M., Walsh, T.: Verifying properties of binarized deep neural networks. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.12206"},{"key":"27_CR79","unstructured":"Pascanu, R., Mont\u00fafar, G., Bengio, Y.: On the number of response regions of deep feedforward networks with piecewise linear activations. In: ICLR (2014)"},{"key":"27_CR80","unstructured":"Paszke, A., et al.: Automatic differentiation in pytorch. In: NeurIPS Workshops (2017)"},{"key":"27_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-01237-3_19","volume-title":"Computer Vision \u2013 ECCV 2018","author":"B Peng","year":"2018","unstructured":"Peng, B., Tan, W., Li, Z., Zhang, S., Xie, D., Pu, S.: Extreme network compression via filter group approximation. In: Ferrari, V., Hebert, M., Sminchisescu, C., Weiss, Y. (eds.) ECCV 2018. LNCS, vol. 11212, pp. 307\u2013323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01237-3_19"},{"key":"27_CR82","unstructured":"Raghu, M., Poole, B., Kleinberg, J., Ganguli, S., Dickstein, J.: On the expressive power of deep neural networks. In: ICML (2017)"},{"key":"27_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-319-46493-0_32","volume-title":"Computer Vision \u2013 ECCV 2016","author":"M Rastegari","year":"2016","unstructured":"Rastegari, M., Ordonez, V., Redmon, J., Farhadi, A.: XNOR-Net: Imagenet classification using binary convolutional neural networks. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9908, pp. 525\u2013542. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46493-0_32"},{"key":"27_CR84","unstructured":"Ryu, M., Chow, Y., Anderson, R., Tjandraatmadja, C., Boutilier, C.: CAQL: Continuous action Q-learning. CoRR abs\/1909.12397 (2019)"},{"key":"27_CR85","doi-asserted-by":"crossref","unstructured":"Say, B., Wu, G., Zhou, Y.Q., Sanner, S.: Nonlinear hybrid planning with deep net learned transition models and mixed-integer linear programming. In: IJCAI (2017)","DOI":"10.24963\/ijcai.2017\/104"},{"key":"27_CR86","doi-asserted-by":"crossref","unstructured":"Serra, T., Ramalingam, S.: Empirical bounds on linear regions of deep rectifier networks. In: AAAI (2020)","DOI":"10.1609\/aaai.v34i04.6016"},{"key":"27_CR87","unstructured":"Serra, T., Tjandraatmadja, C., Ramalingam, S.: Bounding and counting linear regions of deep neural networks. In: ICML (2018)"},{"key":"27_CR88","unstructured":"Serra, T.: On defining design patterns to generalize and leverage automated constraint solving (2012)"},{"key":"27_CR89","unstructured":"Singh, G., Gehr, T., P\u00fcschel, M., Vechev, M.: Robustness certification with refinement. In: ICLR (2019)"},{"key":"27_CR90","unstructured":"Sutskever, I., Vinyals, O., Le, Q.: Sequence to sequence learning with neural networks. In: NeurIPS (2014)"},{"key":"27_CR91","doi-asserted-by":"crossref","unstructured":"Szegedy, C., Liu, W., Jia, Y., Sermanet, P., Reed, S., Anguelov, D., Erhan, D., Vanhoucke, V., Rabinovich, A.: Going deeper with convolutions. In: CVPR (2015)","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"27_CR92","doi-asserted-by":"crossref","unstructured":"Tan, Y., Delong, A., Terekhov, D.: Deep inverse optimization. In: CPAIOR (2019)","DOI":"10.1007\/978-3-030-19212-9_36"},{"key":"27_CR93","unstructured":"Tang, Y., Agrawal, S., Faenza, Y.: Reinforcement learning for integer programming: learning to cut. CoRR abs\/1906.04859 (2019)"},{"key":"27_CR94","unstructured":"Tang, Z., Peng, X., Li, K., Metaxas, D.: Towards efficient u-nets: a coupled and quantized approach. In: TPAMI (2019)"},{"key":"27_CR95","unstructured":"Telgarsky, M.: Benefits of depth in neural networks. In: COLT (2016)"},{"key":"27_CR96","unstructured":"Tjeng, V., Xiao, K., Tedrake, R.: Evaluating robustness of neural networks with mixed integer programming. In: ICLR (2019)"},{"key":"27_CR97","doi-asserted-by":"crossref","unstructured":"Tung, F., Mori, G.: Clip-q: Deep network compression learning by in-parallel pruning-quantization. In: CVPR (2018)","DOI":"10.1109\/CVPR.2018.00821"},{"key":"27_CR98","unstructured":"Veit, A., Belongie, S.: Convolutional networks with adaptive computation graphs. CoRR abs\/1711.11503 (2017)"},{"issue":"11","key":"27_CR99","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M Wainwright","year":"2005","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: Map estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Trans. Inf. Theory 51(11), 3697\u20133717 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR100","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/B:STCO.0000021412.33763.d5","volume":"14","author":"M Wainwright","year":"2004","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Stat. Comput. 14, 143\u2013166 (2004). https:\/\/doi.org\/10.1023\/B:STCO.0000021412.33763.d5","journal-title":"Stat. Comput."},{"key":"27_CR101","unstructured":"Wang, W., Sun, Y., Eriksson, B., Wang, W., Aggarwal, V.: Wide compression: tensor ring nets. In: CVPR (2018)"},{"key":"27_CR102","unstructured":"Wen, W., Wu, C., Wang, Y., Chen, Y., Li, H.: Learning structured sparsity in deep neural networks. In: NeurIPS (2016)"},{"key":"27_CR103","unstructured":"Werner, T.: A linear programming approach to max-sum problem: a review. Technical Report CTU-CMP-2005-25, Center for Machine Perception (2005)"},{"key":"27_CR104","unstructured":"Wong, E., Kolter, J.Z.: Provable defenses against adversarial examples via the convex outer adversarial polytope. In: ICML (2018)"},{"key":"27_CR105","doi-asserted-by":"crossref","unstructured":"Wu, J., Leng, C., Wang, Y., Hu, Q., Cheng, J.: Quantized convolutional neural networks for mobile devices. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.521"},{"key":"27_CR106","unstructured":"Xiao, K., Tjeng, V., Shafiullah, N., Madry, A.: Training for faster adversarial robustness verification via inducing ReLU stability. ICLR (2019)"},{"key":"27_CR107","doi-asserted-by":"crossref","unstructured":"Xu, H., Koenig, S., Kumar, T.S.: Towards effective deep learning for constraint satisfaction problems. In: CP (2018)","DOI":"10.1007\/978-3-319-98334-9_38"},{"key":"27_CR108","doi-asserted-by":"crossref","unstructured":"Xue, Y., van Hoeve, W.J.: Embedding decision diagrams into generative adversarial networks. In: CPAIOR (2019)","DOI":"10.1007\/978-3-030-19212-9_41"},{"key":"27_CR109","doi-asserted-by":"crossref","unstructured":"Ye, Z., Say, B., Sanner, S.: Symbolic bucket elimination for piecewise continuous constrained optimization. In: CPAIOR (2018)","DOI":"10.1007\/978-3-319-93031-2_42"},{"key":"27_CR110","doi-asserted-by":"crossref","unstructured":"Yu, R., et al.: NISP: pruning networks using neuron importance score propagation. In: CVPR (2018)","DOI":"10.1109\/CVPR.2018.00958"},{"key":"27_CR111","doi-asserted-by":"crossref","unstructured":"Yu, X., Yu, Z., Ramalingam, S.: Learning strict identity mappings in deep residual networks. In: CVPR (2018)","DOI":"10.1109\/CVPR.2018.00466"},{"key":"27_CR112","doi-asserted-by":"crossref","unstructured":"Zhang, X., Zou, J., Ming, X., He, K., Sun, J.: Efficient and accurate approximations of nonlinear convolutional networks. In: CVPR (2015)","DOI":"10.1109\/CVPR.2015.7298809"},{"key":"27_CR113","doi-asserted-by":"crossref","unstructured":"Zhao, C., Ni, B., Zhang, J., Zhao, Q., Zhang, W., Tian, Q.: Variational convolutional neural network pruning. In: CVPR (2019)","DOI":"10.1109\/CVPR.2019.00289"},{"key":"27_CR114","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-46493-0_40","volume-title":"Computer Vision \u2013 ECCV 2016","author":"H Zhou","year":"2016","unstructured":"Zhou, H., Alvarez, J.M., Porikli, F.: Less is more: towards compact CNNs. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9908, pp. 662\u2013677. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46493-0_40"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T01:08:44Z","timestamp":1668820124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":114,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}