{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T04:46:20Z","timestamp":1776141980834,"version":"3.50.1"},"reference-count":68,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:00:00Z","timestamp":1653609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>It is hard to directly deploy deep learning models on today\u2019s smartphones due to the substantial computational costs introduced by millions of parameters. To compress the model, we develop an \u21130-based sparse group lasso model called MobilePrune which can generate extremely compact neural network models for both desktop and mobile platforms. We adopt group lasso penalty to enforce sparsity at the group level to benefit General Matrix Multiply (GEMM) and develop the very first algorithm that can optimize the \u21130 norm in an exact manner and achieve the global convergence guarantee in the deep learning context. MobilePrune also allows complicated group structures to be applied on the group penalty (i.e., trees and overlapping groups) to suit DNN models with more complex architectures. Empirically, we observe the substantial reduction of compression ratio and computational costs for various popular deep learning models on multiple benchmark datasets compared to the state-of-the-art methods. More importantly, the compression models are deployed on the android system to confirm that our approach is able to achieve less response delay and battery consumption on mobile phones.<\/jats:p>","DOI":"10.3390\/s22114081","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T02:30:06Z","timestamp":1653964206000},"page":"4081","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["MobilePrune: Neural Network Compression via \u21130 Sparse Group Lasso on the Mobile System"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5526-0921","authenticated-orcid":false,"given":"Yubo","family":"Shao","sequence":"first","affiliation":[{"name":"Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaikai","family":"Zhao","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Indiana University at Bloomington, Bloomington, IN 47405, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwen","family":"Cao","sequence":"additional","affiliation":[{"name":"Department of Computer Graphics, Purdue University, West Lafayette, IN 47907, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhehao","family":"Peng","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingang","family":"Peng","sequence":"additional","affiliation":[{"name":"Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing 100190, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pan","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yijie","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Indiana University at Bloomington, Bloomington, IN 47405, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8236-6609","authenticated-orcid":false,"given":"Jianzhu","family":"Ma","sequence":"additional","affiliation":[{"name":"Institute for Artificial Intelligence, Peking University, Beijing 100871, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"key":"ref_1","unstructured":"Frankle, J., and Carbin, M. (2019, January 6\u20139). The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks. Proceedings of the 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA. Available online: https:\/\/arxiv.org\/abs\/1803.03635."},{"key":"ref_2","unstructured":"Hassibi, B., and Stork, D. (1993). Second order derivaties for network prunning: Optimal brain surgeon. Advances in Neural Information Processing Systems 5 (NIPS 1992), Morgan Kaufmann Publishers Inc."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/72.572092","article-title":"An iterative pruning algorithm for feedforward neural networks","volume":"8","author":"Castellano","year":"1997","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_4","unstructured":"Han, S., Pool, J., Tran, J., and Dally, W. (2015). Learning both Weights and Connections for Efficient Neural Network. Advances in Neural Information Processing Systems 28, Curran Associates, Inc."},{"key":"ref_5","unstructured":"Chetlur, S., Woolley, C., Vandermersch, P., Cohen, J., Tran, J., Catanzaro, B., and Shelhamer, E. (2014). cuDNN: Efficient Primitives for Deep Learning. arXiv."},{"key":"ref_6","unstructured":"Ding, X., Ding, G., Guo, Y., Han, J., and Yan, C. (2019, January 9\u201315). Approximated oracle filter pruning for destructive cnn width optimization. Proceedings of the 36th International Conference on Machine Learning, PMLR 97, Long Beach, CA, USA."},{"key":"ref_7","unstructured":"Neklyudov, K., Molchanov, D., Ashukha, A., and Vetrov, D.P. (2017). Structured Bayesian Pruning via Log-Normal Multiplicative Noise. Advances in Neural Information Processing Systems 30, Curran Associates, Inc."},{"key":"ref_8","unstructured":"Louizos, C., Welling, M., and Kingma, D.P. (May, January 30). Learning Sparse Neural Networks through L_0 Regularization. Proceedings of the International Conference on Learning Representations, Vancouver, BC, Canada."},{"key":"ref_9","unstructured":"Louizos, C., Ullrich, K., and Welling, M. (2017, January 4\u20139). Bayesian compression for deep learning. Proceedings of the Advances in Neural Information Processing Systems, Long Beach, CA, USA."},{"key":"ref_10","unstructured":"Liu, Z.G., Whatmough, P.N., and Mattina, M. (2020). Sparse Systolic Tensor Array for Efficient CNN Hardware Acceleration. arXiv."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/LCA.2020.2979965","article-title":"Systolic Tensor Array: An Efficient Structured-Sparse GEMM Accelerator for Mobile CNN Inference","volume":"19","author":"Liu","year":"2020","journal-title":"IEEE Comput. Archit. Lett."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10107-015-0894-1","article-title":"Sparse learning via Boolean relaxations","volume":"151","author":"Pilanci","year":"2015","journal-title":"Math. Prog."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Pauphilet, J., and Parys, B.V. (2019). Sparse Regression: Scalable algorithms and empirical performance. arXiv.","DOI":"10.1214\/19-STS701"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression Shrinkage and Selection Via the Lasso","volume":"58","author":"Tibshirani","year":"1994","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","article-title":"Regularization and variable selection via the Elastic Net","volume":"67","author":"Zou","year":"2005","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","article-title":"Variable selection via nonconcave penalized likelihood and its oracle properties","volume":"96","author":"Fan","year":"2001","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","article-title":"Nearly unbiased variable selection under minimax concave penalty","volume":"38","author":"Zhang","year":"2010","journal-title":"Ann. Stat."},{"key":"ref_18","unstructured":"Hazimeh, H., and Mazumder, R. (2018). Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms. arXiv."},{"key":"ref_19","unstructured":"Guo, Y., Yao, A., and Chen, Y. (2016). Dynamic Network Surgery for Efficient DNNs. Advances in Neural Information Processing Systems 29, Curran Associates, Inc."},{"key":"ref_20","unstructured":"Ding, X., Ding, G., Zhou, X., Guo, Y., Han, J., and Liu, J. (2019). Global Sparse Momentum SGD for Pruning Very Deep Neural Networks. Advances in Neural Information Processing Systems 32, Curran Associates, Inc."},{"key":"ref_21","unstructured":"Xiao, X., Wang, Z., and Rajasekaran, S. (2019). AutoPrune: Automatic Network Pruning by Regularizing Auxiliary Parameters. Advances in Neural Information Processing Systems 32, Curran Associates, Inc."},{"key":"ref_22","unstructured":"Alvarez, J.M., and Salzmann, M. (2016). Learning the Number of Neurons in Deep Networks. Advances in Neural Information Processing Systems 29, Curran Associates, Inc."},{"key":"ref_23","unstructured":"Liu, B., Wang, M., Foroosh, H., Tappen, M., and Penksy, M. (2015, January 7\u201312). Sparse Convolutional Neural Networks. Proceedings of the Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Boston, MA, USA. Available online: https:\/\/ieeexplore.ieee.org\/document\/7298681."},{"key":"ref_24","unstructured":"Wen, W., Wu, C., Wang, Y., Chen, Y., and Li, H. (2016, January 5\u201310). Learning Structured Sparsity in Deep Neural Networks. Proceedings of the Advances in Neural Information Processing Systems, Barcelona, Spain. Available online: https:\/\/arxiv.org\/abs\/1608.03665."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"106385","DOI":"10.1109\/ACCESS.2019.2933032","article-title":"Structured Pruning of Convolutional Neural Networks via L1 Regularization","volume":"7","author":"Yang","year":"2019","journal-title":"IEEE Access"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Yang, H., Gui, S., Zhu, Y., and Liu, J. (2020). Automatic Neural Network Compression by Sparsity-Quantization Joint Learning: A Constrained Optimization-based Approach. arXiv.","DOI":"10.1109\/CVPR42600.2020.00225"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ye, S., Zhang, K., Tang, J., Wen, W., Fardad, M., and Wang, Y. (2018). A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multipliers. arXiv.","DOI":"10.1007\/978-3-030-01237-3_12"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"He, Y., Liu, P., Wang, Z., Hu, Z., and Yang, Y. (2019, January 15\u201320). Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration. Proceedings of the Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, CA, USA.","DOI":"10.1109\/CVPR.2019.00447"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ren, A., Zhang, T., Ye, S., Li, J., Xu, W., Qian, X., Lin, X., and Wang, Y. (2019, January 13\u201317). ADMM-NN: An Algorithm-Hardware Co-Design Framework of DNNs Using Alternating Direction Methods of Multipliers. Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS \u201919), Providence, RI, USA.","DOI":"10.1145\/3297858.3304076"},{"key":"ref_30","unstructured":"Lafferty, J.D., Williams, C.K.I., Shawe-Taylor, J., Zemel, R.S., and Culotta, A. (2010). Moreau-Yosida Regularization for Grouped Tree Structure Learning. Advances in Neural Information Processing Systems 23, Curran Associates, Inc."},{"key":"ref_31","unstructured":"Collins, M.D., and Kohli, P. (2014). Memory Bounded Deep Convolutional Networks. arXiv."},{"key":"ref_32","unstructured":"Li, H., Kadav, A., Durdanovic, I., Samet, H., and Graf, H.P. (2017, January 24\u201326). Pruning Filters for Efficient ConvNets. Proceedings of the International Conference on Learning Representations, Toulon, France."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Liu, Z., Li, J., Shen, Z., Huang, G., Yan, S., and Zhang, C. (2017, January 22\u201329). Learning efficient convolutional networks through network slimming. Proceedings of the IEEE International Conference on Computer Vision, Venice, Italy.","DOI":"10.1109\/ICCV.2017.298"},{"key":"ref_34","unstructured":"PMLR: Proceedings of Machine Learning Research, Precup, D., and Teh, Y.W. (2017, January 6\u201311). Combined Group and Exclusive Sparsity for Deep Neural Networks. Proceedings of the 34th International Conference on Machine Learning, Sydney, NSW, Australia."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.neucom.2017.02.029","article-title":"Group sparse regularization for deep neural networks","volume":"241","author":"Scardapane","year":"2017","journal-title":"Neurocomputing"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Liu, Z.G., Whatmough, P.N., Zhu, Y., and Mattina, M. (2022, January 2\u20136). S2TA: Exploiting Structured Sparsity for Energy-Efficient Mobile CNN Acceleration. Proceedings of the 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), Seoul, Korea.","DOI":"10.1109\/HPCA53966.2022.00049"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","article-title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","volume":"146","author":"Bolte","year":"2014","journal-title":"Math. Program."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","article-title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","volume":"2","author":"Beck","year":"2009","journal-title":"Siam J. Imaging Sci."},{"key":"ref_39","unstructured":"Dai, B., Zhu, C., Guo, B., and Wipf, D. (2018, January 10\u201315). Compressing Neural Networks using the Variational Information Bottleneck. Proceedings of the 35th International Conference on Machine Learning (ICML 2018), Stockholm, Sweden."},{"key":"ref_40","unstructured":"Touretzky, D.S. (1990). Optimal Brain Damage. Advances in Neural Information Processing Systems 2, Morgan-Kaufmann."},{"key":"ref_41","unstructured":"Zeng, W., and Urtasun, R. (2022, May 24). MLPrune: Multi-Layer Pruning for Automated Neural Network Compression. Available online: https:\/\/openreview.net\/forum?id=r1g5b2RcKm."},{"key":"ref_42","unstructured":"Wang, C., Grosse, R., Fidler, S., and Zhang, G. (2019, January 9\u201315). EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasis. Proceedings of the Proceedings of the 36th International Conference on Machine Learning, Long Beach, CA, USA."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","article-title":"The mnist database of handwritten digit images for machine learning research","volume":"29","author":"Deng","year":"2012","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_44","unstructured":"Zagoruyko, S. (2022, May 24). 92.45% on CIFAR-10 in Torch. Available online: http:\/\/torch.ch\/blog\/2015\/07\/30\/cifar.html."},{"key":"ref_45","unstructured":"Zhang, G., Wang, C., Xu, B., and Grosse, R. (2019, January 6\u20139). Three Mechanisms of Weight Decay Regularization. Proceedings of the International Conference on Learning Representations, New Orleans, LA, USA."},{"key":"ref_46","unstructured":"Krizhevsky, A., Nair, V., and Hinton, G. (2022, May 24). CIFAR-10 (Canadian Institute for Advanced Research). Available online: http:\/\/www.cs.toronto.edu\/~kriz\/cifar.html."},{"key":"ref_47","first-page":"3","article-title":"Tiny ImageNet Visual Recognition Challenge","volume":"7","author":"Le","year":"2015","journal-title":"CS 231N"},{"key":"ref_48","unstructured":"Simonyan, K., and Zisserman, A. (2015, January 7\u20139). Very Deep Convolutional Networks for Large-Scale Image Recognition. Proceedings of the International Conference on Learning Representations, San Diego, CA, USA."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/1964897.1964918","article-title":"Activity Recognition Using Cell Phone Accelerometers","volume":"12","author":"Kwapisz","year":"2011","journal-title":"SIGKDD Explor. Newsl."},{"key":"ref_50","unstructured":"(2022, May 24). WISDM: Wireless Sensor Data Mining. Available online: https:\/\/www.cis.fordham.edu\/wisdm\/dataset.php."},{"key":"ref_51","unstructured":"Anguita, D., Ghio, A., Oneto, L., Parra, X., and Reyes-Ortiz, J. (2013, January 24\u201326). A Public Domain Dataset for Human Activity Recognition using Smartphones. Proceedings of the 21th international European symposium on artificial neural networks, computational intelligence and machine learning, Bruges, Belgium."},{"key":"ref_52","unstructured":"(2022, May 24). Human Activity Recognition Using Smartphones Data Set. Available online: https:\/\/archive.ics.uci.edu\/ml\/datasets\/human+activity+recognition+using+smartphones."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Reiss, A., and Stricker, D. (2012, January 18\u201322). Introducing a New Benchmarked Dataset for Activity Monitoring. Proceedings of the 2012 16th International Symposium on Wearable Computers, Newcastle, UK.","DOI":"10.1109\/ISWC.2012.13"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Reiss, A., and Stricker, D. (2012, January 6\u20138). Creating and Benchmarking a New Dataset for Physical Activity Monitoring. PETRA \u201912, Proceedings of the 5th International Conference on PErvasive Technologies Related to Assistive Environments, Crete, Greece.","DOI":"10.1145\/2413097.2413148"},{"key":"ref_55","unstructured":"(2022, May 24). PAMAP2 Physical Activity Monitoring Data Set. Available online: https:\/\/archive.ics.uci.edu\/ml\/datasets\/PAMAP2+Physical+Activity+Monitoring."},{"key":"ref_56","unstructured":"(2022, May 24). Google Colab. Available online: https:\/\/research.google.com\/colaboratory\/faq.html."},{"key":"ref_57","unstructured":"(2022, May 24). Pytorch Mobile. Available online: https:\/\/pytorch.org\/mobile\/android\/."},{"key":"ref_58","unstructured":"(2022, May 24). Profile Battery Usage with Batterystats and Battery Historian. Available online: https:\/\/developer.android.com\/topic\/performance\/power\/setup-battery-historian."},{"key":"ref_59","unstructured":"Shawe-Taylor, J., Zemel, R.S., Bartlett, P.L., Pereira, F., and Weinberger, K.Q. (2011). Efficient Methods for Overlapping Group Lasso. Advances in Neural Information Processing Systems 24, Curran Associates, Inc."},{"key":"ref_60","unstructured":"Zeng, J., Lau, T.T.K., Lin, S.B., and Yao, Y. (2019, January 9\u201315). Global convergence of block coordinate descent in deep learning. Proceedings of the 36th International Conference on Machine Learning, ICML 2019, Long Beach, CA, USA. Available online: https:\/\/arXiv:1803.00225."},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Bao, C., Ji, H., Quan, Y., and Shen, Z. (2014, January 23\u201328). L0 norm based dictionary learning by proximal methods with global convergence. Proceedings of the Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA.","DOI":"10.1109\/CVPR.2014.493"},{"key":"ref_62","unstructured":"Lau, T.T.K., Zeng, J., Wu, B., and Yao, Y. (April, January 3). A Proximal Block Coordinate Descent Algorithm for Deep Neural Network Training. Proceedings of the 6th International Conference on Learning Representations, ICLR 2018\u2014Workshop Track Proceedings, Vancouver, BC, Canada. Available online: arxiv.org\/abs\/1803.09082."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","article-title":"On the convergence of the proximal algorithm for nonsmooth functions involving analytic features","volume":"116","author":"Attouch","year":"2009","journal-title":"Math. Program."},{"key":"ref_64","unstructured":"Bach, F.R., Mairal, J., and Ponce, J. (2008). Convex Sparse Matrix Factorizations. arXiv."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Shomron, G., and Weiser, U. (2020, January 17\u201321). Non-Blocking Simultaneous Multithreading: Embracing the Resiliency of Deep Neural Networks. Proceedings of the 2020 53rd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO), Athens, Greece. Available online: arxiv.org\/abs\/2004.09309.","DOI":"10.1109\/MICRO50266.2020.00032"},{"key":"ref_66","unstructured":"Wang, Z., and Oates, T. (2015). Imaging Time-Series to Improve Classification and Imputation. arXiv."},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Tamilarasi, P., and Rani, R. (2020, January 11\u201313). Diagnosis of Crime Rate against Women using k-fold Cross Validation through Machine Learning. Proceedings of the 2020 Fourth International Conference on Computing Methodologies and Communication (ICCMC), Erode, India.","DOI":"10.1109\/ICCMC48092.2020.ICCMC-000193"},{"key":"ref_68","unstructured":"Brownlee, J. (2022, May 24). Understand the Impact of Learning Rate on Neural Network Performance. Available online: https:\/\/machinelearningmastery.com\/understand-the-dynamics-of-learning-rate-on-deep-learning-neural-networks."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/11\/4081\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:20:14Z","timestamp":1760138414000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/11\/4081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,27]]},"references-count":68,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,6]]}},"alternative-id":["s22114081"],"URL":"https:\/\/doi.org\/10.3390\/s22114081","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,27]]}}}