{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T07:42:07Z","timestamp":1765438927616,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031434143"},{"type":"electronic","value":"9783031434150"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43415-0_4","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T08:01:51Z","timestamp":1694851311000},"page":"52-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Voting from\u00a0Nearest Tasks: Meta-Vote Pruning of\u00a0Pre-trained Models for\u00a0Downstream Tasks"],"prefix":"10.1007","author":[{"given":"Haiyan","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guodong","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengqi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"4_CR1","unstructured":"Bai, Y., Wang, H., Tao, Z., Li, K., Fu, Y.: Dual lottery ticket hypothesis. arXiv preprint arXiv:2203.04248 (2022)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., He, K.: Exploring simple siamese representation learning. arXiv preprint arXiv:2011.10566 (2020)","DOI":"10.1109\/CVPR46437.2021.01549"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Chin, T.W., Ding, R., Zhang, C., Marculescu, D.: Towards efficient model compression via learned global ranking. In: 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1515\u20131525 (2020)","DOI":"10.1109\/CVPR42600.2020.00159"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: a large-scale hierarchical image database. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition, pp. 248\u2013255 (2009). https:\/\/doi.org\/10.1109\/CVPR.2009.5206848","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"4_CR5","unstructured":"Devries, T., Taylor, G.W.: Improved regularization of convolutional neural networks with cutout. arXiv: 1708.04552 (2017)"},{"key":"4_CR6","unstructured":"Dosovitskiy, A., et al.: An image is worth 16x16 words: transformers for image recognition at scale. In: International Conference on Learning Representations (2021). https:\/\/openreview.net\/forum?id=YicbFdNTTy"},{"key":"4_CR7","unstructured":"Finn, C., Abbeel, P., Levine, S.: Model-agnostic meta-learning for fast adaptation of deep networks. In: ICML (2017)"},{"key":"4_CR8","unstructured":"Frankle, J., Carbin, M.: The lottery ticket hypothesis: Training pruned neural networks. arXiv: 1803.03635 (2018)"},{"key":"4_CR9","unstructured":"Goyal, S., Choudhury, A.R., Raje, S., Chakaravarthy, V., Sabharwal, Y., Verma, A.: Power-bert: accelerating bert inference via progressive word-vector elimination. In: International Conference on Machine Learning, pp. 3690\u20133699. PMLR (2020)"},{"key":"4_CR10","unstructured":"Griffin, G., Holub, A., Perona, P.: Caltech-256 object category dataset (2007)"},{"key":"4_CR11","unstructured":"Han, S., Mao, H., Dally, W.J.: Deep compression: compressing deep neural networks with pruning, trained quantization and huffman coding. In: International Conference on Learning Representations (ICLR) (2016)"},{"key":"4_CR12","unstructured":"Han, S., Pool, J., Tran, J., Dally, W.: Learning both weights and connections for efficient neural network. arXiv: 1506.02626 (2015)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"He, Y., Liu, P., Zhu, L., Yang, Y.: Meta filter pruning to accelerate deep convolutional neural networks. arXiv: 1904.03961 (2019)","DOI":"10.1109\/CVPR42600.2020.00208"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Hou, L., Pang, R.Y., Zhou, T., Wu, Y., Song, X., Song, X., Zhou, D.: Token dropping for efficient bert pretraining. arXiv preprint arXiv:2203.13240 (2022)","DOI":"10.18653\/v1\/2022.acl-long.262"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"547","DOI":"10.5169\/seals-266450","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: Etude de la distribution florale dans une portion des alpes et du jura. Bull. Soc. Vaud. Sci. Nat. 37, 547\u2013579 (1901). https:\/\/doi.org\/10.5169\/seals-266450","journal-title":"Bull. Soc. Vaud. Sci. Nat."},{"key":"4_CR17","unstructured":"Krizhevsky, A., Hinton, G.: Learning multiple layers of features from tiny images. University of Toronto, Tech. rep. (2009)"},{"key":"4_CR18","unstructured":"Li, H., Kadav, A., Durdanovic, I., Samet, H., Graf, H.: Pruning filters for efficient convnets. arXiv: 1608.08710 (2017)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Li, Y., Gu, S., Zhang, K., Gool, L., Timofte, R.: Dhp: Differentiable meta pruning via hypernetworks. arXiv: 2003.13683 (2020)","DOI":"10.1007\/978-3-030-58598-3_36"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Lin, S., Ji, R., Li, Y., Wu, Y., Huang, F., Zhang, B.: Accelerating convolutional networks via global & dynamic filter pruning. In: IJCAI (2018)","DOI":"10.24963\/ijcai.2018\/336"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Liu, L., Zhou, T., Long, G., Jiang, J., Yao, L., Zhang, C.: Prototype propagation networks (ppn) for weakly-supervised few-shot learning on category graph. arXiv preprint arXiv:1905.04042 (2019)","DOI":"10.24963\/ijcai.2019\/418"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Liu, L., Zhou, T., Long, G., Jiang, J., Zhang, C.: Attribute propagation network for graph zero-shot learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 4868\u20134875 (2020)","DOI":"10.1609\/aaai.v34i04.5923"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Z., et al.: Metapruning: Meta learning for automatic neural network channel pruning. 2019 IEEE\/CVF International Conference on Computer Vision (ICCV), pp. 3295\u20133304 (2019)","DOI":"10.1109\/ICCV.2019.00339"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Liu, Z., Li, J., Shen, Z., Huang, G., Yan, S., Zhang, C.: Learning efficient convolutional networks through network slimming. In: 2017 IEEE International Conference on Computer Vision (ICCV), pp. 2755\u20132763 (2017)","DOI":"10.1109\/ICCV.2017.298"},{"key":"4_CR25","unstructured":"Louizos, C., Welling, M., Kingma, D.P.: Learning sparse neural networks through l0 regularization. arXiv: 1712.01312 (2018)"},{"key":"4_CR26","unstructured":"Malach, E., Yehudai, G., Shalev-Shwartz, S., Shamir, O.: Proving the lottery ticket hypothesis: Pruning is all you need. In: ICML (2020)"},{"issue":"11","key":"4_CR27","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/219717.219748","volume":"38","author":"GA Miller","year":"1995","unstructured":"Miller, G.A.: Wordnet: a lexical database for English. Commun. ACM 38(11), 39\u201341 (1995)","journal-title":"Commun. ACM"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Molchanov, P., Mallya, A., Tyree, S., Frosio, I., Kautz, J.: Importance estimation for neural network pruning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 11264\u201311272 (2019)","DOI":"10.1109\/CVPR.2019.01152"},{"key":"4_CR29","unstructured":"Molchanov, P., Tyree, S., Karras, T., Aila, T., Kautz, J.: Pruning convolutional neural networks for resource efficient inference. arXiv preprint arXiv:1611.06440 (2016)"},{"key":"4_CR30","unstructured":"Nguyen, C., Hassner, T., Seeger, M., Archambeau, C.: Leep: a new measure to evaluate transferability of learned representations. In: International Conference on Machine Learning, pp. 7294\u20137305. PMLR (2020)"},{"key":"4_CR31","unstructured":"Nichol, A., Achiam, J., Schulman, J.: On first-order meta-learning algorithms. arXiv: 1803.02999 (2018)"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Nilsback, M.E., Zisserman, A.: Automated flower classification over a large number of classes. In: 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing, pp. 722\u2013729. IEEE (2008)","DOI":"10.1109\/ICVGIP.2008.47"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Pan, Z., Zhuang, B., Liu, J., He, H., Cai, J.: Scalable vision transformers with hierarchical pooling. In: Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp. 377\u2013386 (2021)","DOI":"10.1109\/ICCV48922.2021.00043"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Parkhi, O.M., Vedaldi, A., Zisserman, A., Jawahar, C.: Cats and dogs. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 3498\u20133505. IEEE (2012)","DOI":"10.1109\/CVPR.2012.6248092"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Pedersen, T., Patwardhan, S., Michelizzi, J., et al.: Wordnet: Similarity-measuring the relatedness of concepts. In: AAAI, vol. 4, pp. 25\u201329 (2004)","DOI":"10.3115\/1614025.1614037"},{"key":"4_CR36","unstructured":"Savarese, P.H.P., Silva, H., Maire, M.: Winning the lottery with continuous sparsification. arXiv: 1912.04427 (2020)"},{"key":"4_CR37","unstructured":"Sun, T., et al.: Learning sparse sharing architectures for multiple tasks. arXiv: 1911.05034 (2020)"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Tan, Y., Liu, Y., Long, G., Jiang, J., Lu, Q., Zhang, C.: Federated learning on non-iid graphs via structural knowledge sharing. arXiv preprint arXiv:2211.13009 (2022)","DOI":"10.1609\/aaai.v37i8.26187"},{"key":"4_CR39","unstructured":"Tan, Y., Long, G., Ma, J., Liu, L., Zhou, T., Jiang, J.: Federated learning from pre-trained models: a contrastive learning approach. arXiv preprint arXiv:2209.10083 (2022)"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Tang, Y., et al.: Patch slimming for efficient vision transformers. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 12165\u201312174 (2022)","DOI":"10.1109\/CVPR52688.2022.01185"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Tian, H., Liu, B., Yuan, X., Liu, Q.: Meta-learning with network pruning. arXiv: 2007.03219 (2020)","DOI":"10.1007\/978-3-030-58529-7_40"},{"key":"4_CR42","unstructured":"Touvron, H., Cord, M., Douze, M., Massa, F., Sablayrolles, A., J\u00e9gou, H.: Training data-efficient image transformers & distillation through attention. In: International Conference on Machine Learning, pp. 10347\u201310357. PMLR (2021)"},{"key":"4_CR43","unstructured":"Touvron, H., Cord, M., Douze, M., Massa, F., Sablayrolles, A., Jegou, H.: Training data-efficient image transformers & distillation through attention. In: International Conference on Machine Learning, vol. 139, pp. 10347\u201310357 (July 2021)"},{"key":"4_CR44","unstructured":"Wah, C., Branson, S., Welinder, P., Perona, P., Belongie, S.: The caltech-ucsd birds-200-2011 dataset (2011)"},{"key":"4_CR45","doi-asserted-by":"crossref","unstructured":"Wu, Z., Palmer, M.: Verb semantics and lexical selection. arXiv preprint cmp-lg\/9406033 (1994)","DOI":"10.3115\/981732.981751"},{"key":"4_CR46","unstructured":"Yang, K., et al.: Adversarial auto-augment with label preservation: a representation learning principle guided approach. arXiv preprint arXiv:2211.00824 (2022)"},{"key":"4_CR47","unstructured":"Yang, K., Zhou, T., Tian, X., Tao, D.: Identity-disentangled adversarial augmentation for self-supervised learning. In: International Conference on Machine Learning, pp. 25364\u201325381. PMLR (2022)"},{"key":"4_CR48","unstructured":"Yang, Y., Zhou, T., Jiang, J., Long, G., Shi, Y.: Continual task allocation in meta-policy network via sparse prompting. arXiv preprint arXiv:2305.18444 (2023)"},{"key":"4_CR49","unstructured":"Ye, M., Wu, L., Liu, Q.: Greedy optimization provably wins the lottery: logarithmic number of winning tickets is enough. arXiv: 2010.15969 (2020)"},{"key":"4_CR50","doi-asserted-by":"crossref","unstructured":"Yu, F., Huang, K., Wang, M., Cheng, Y., Chu, W., Cui, L.: Width & depth pruning for vision transformers. In: AAAI Conference on Artificial Intelligence (AAAI), vol. 2022 (2022)","DOI":"10.1609\/aaai.v36i3.20222"},{"key":"4_CR51","unstructured":"Yu, S., et al.: Unified visual transformer compression. In: International Conference on Learning Representations (2022). https:\/\/openreview.net\/forum?id=9jsZiUgkCZP"},{"key":"4_CR52","unstructured":"Yuan, G., et al.: Mest: Accurate and fast memory-economic sparse training framework on the edge. In: Advances in Neural Information Processing Systems 34 (2021)"},{"key":"4_CR53","unstructured":"Zhao, H., Zhou, T., Long, G., Jiang, J., Zhang, C.: Extracting local reasoning chains of deep neural networks. Trans. Mach. Learn. Res. (2022). https:\/\/openreview.net\/forum?id=RP6G787uD8"},{"key":"4_CR54","unstructured":"Zhao, H., Zhou, T., Long, G., Jiang, J., Zhang, C.: Does continual learning equally forget all parameters? arXiv preprint arXiv:2304.04158 (2023)"},{"key":"4_CR55","unstructured":"Zhu, M., Tang, Y., Han, K.: Vision transformer pruning. arXiv preprint arXiv:2104.08500 (2021)"},{"key":"4_CR56","unstructured":"Zhuang, T., Zhang, Z., Huang, Y., Zeng, X., Shuang, K., Li, X.: Neuron-level structured pruning using polarization regularizer. In: NeurIPS (2020)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43415-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T05:49:52Z","timestamp":1730094592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43415-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434143","9783031434150"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43415-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Our study utilizes only publicly available models and data widely used in the deep learning community. As such, we believe that our work is not associated with any potential ethical implications regarding the collection and processing of personal data or the inference of personal information. Our proposed method aims to improve the efficiency of applying large pre-trained models to downstream tasks and is not related to any use in policing or military settings. We are committed to maintaining the highest ethical standards in our research, and we have taken all necessary measures to ensure that our work complies with the ethical principles and values of the research community. Additionally, we want to emphasize that our research is intended for the betterment of society and is not intended to cause any harm.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statement"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","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":"196","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":"0","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":"24% - 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.63","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":"4.5","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)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}