{"id":"https://openalex.org/W4416250657","doi":"https://doi.org/10.1109/ijcnn64981.2025.11228155","title":"Pruning Everything, Everywhere, All at Once","display_name":"Pruning Everything, Everywhere, All at Once","publication_year":2025,"publication_date":"2025-06-30","ids":{"openalex":"https://openalex.org/W4416250657","doi":"https://doi.org/10.1109/ijcnn64981.2025.11228155"},"language":null,"primary_location":{"id":"doi:10.1109/ijcnn64981.2025.11228155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11228155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087755735","display_name":"Gustavo Henrique do Nascimento","orcid":"https://orcid.org/0000-0003-2379-7553"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gustavo Henrique do Nascimento","raw_affiliation_strings":["Universidade de S&#x00E3;o Paulo,Escola Polit&#x00E9;cnica,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade de S&#x00E3;o Paulo,Escola Polit&#x00E9;cnica,Brazil","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098921604","display_name":"Ian Pons","orcid":"https://orcid.org/0009-0006-0834-5515"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ian Pons","raw_affiliation_strings":["Universidade de S&#x00E3;o Paulo,Escola Polit&#x00E9;cnica,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade de S&#x00E3;o Paulo,Escola Polit&#x00E9;cnica,Brazil","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069264027","display_name":"Anna Helena Reali Costa","orcid":"https://orcid.org/0000-0001-7309-4528"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anna Helena Reali Costa","raw_affiliation_strings":["Universidade de S&#x00E3;o Paulo,Escola Polit&#x00E9;cnica,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade de S&#x00E3;o Paulo,Escola Polit&#x00E9;cnica,Brazil","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112859940","display_name":"Artur Jord\u00e3o","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Artur Jordao","raw_affiliation_strings":["Universidade de S&#x00E3;o Paulo,Escola Polit&#x00E9;cnica,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade de S&#x00E3;o Paulo,Escola Polit&#x00E9;cnica,Brazil","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5087755735"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18235523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.6129000186920166,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.6129000186920166,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.15360000729560852,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.048700001090765,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6283000111579895},{"id":"https://openalex.org/keywords/flops","display_name":"FLOPS","score":0.5817999839782715},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5647000074386597},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5365999937057495},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.44999998807907104},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.3797999918460846},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3666999936103821},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.35429999232292175}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6355999708175659},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6283000111579895},{"id":"https://openalex.org/C3826847","wikidata":"https://www.wikidata.org/wiki/Q188768","display_name":"FLOPS","level":2,"score":0.5817999839782715},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.579800009727478},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5647000074386597},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5365999937057495},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5088000297546387},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.44999998807907104},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3666999936103821},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.35429999232292175},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C97385483","wikidata":"https://www.wikidata.org/wiki/Q16954980","display_name":"Deep belief network","level":3,"score":0.34139999747276306},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3181000053882599},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C2779227376","wikidata":"https://www.wikidata.org/wiki/Q6505497","display_name":"Layer (electronics)","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C2984842247","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep neural networks","level":3,"score":0.2597000002861023},{"id":"https://openalex.org/C122280245","wikidata":"https://www.wikidata.org/wiki/Q620622","display_name":"Kernel method","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2538999915122986},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn64981.2025.11228155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11228155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1638081485","https://openalex.org/W2194775991","https://openalex.org/W2897295818","https://openalex.org/W3034674511","https://openalex.org/W3107057812","https://openalex.org/W3131135472","https://openalex.org/W4213080446","https://openalex.org/W4223440121","https://openalex.org/W4312690709","https://openalex.org/W4312900176","https://openalex.org/W4389104738","https://openalex.org/W4390189971","https://openalex.org/W4402727786","https://openalex.org/W4402753755","https://openalex.org/W4402753996","https://openalex.org/W4404781961","https://openalex.org/W4404853161"],"related_works":[],"abstract_inverted_index":{"Deep":[0],"learning":[1],"stands":[2],"as":[3,12,101],"the":[4,13,79,114,127,130,141,144,160,174,218],"modern":[5],"paradigm":[6],"for":[7],"solving":[8],"cognitive":[9],"tasks.":[10],"However,":[11],"problem":[14],"complexity":[15,42],"increases,":[16],"models":[17,38,157,236],"grow":[18],"deeper":[19],"and":[20,27,43,77,84,113,170,179,186,221,229,241,244],"computationally":[21],"prohibitive,":[22],"hindering":[23],"advancements":[24],"in":[25,36,49,267],"real-world":[26],"resource-constrained":[28],"applications.":[29],"Extensive":[30],"studies":[31],"reveal":[32],"that":[33,139,158,181],"pruning":[34,66,95,112,188],"structures":[35,68,97],"these":[37],"efficiently":[39],"reduces":[40],"model":[41,100],"improves":[44,208],"computational":[45],"efficiency.":[46],"Successful":[47],"strategies":[48],"this":[50,75,152],"sphere":[51],"include":[52],"removing":[53],"neurons":[54,83],"(i.e.,":[55],"filters,":[56],"heads)":[57],"or":[58,210],"layers,":[59],"but":[60],"not":[61],"both":[62],"together.":[63],"Therefore,":[64],"simultaneously":[65],"different":[67,96],"remains":[69],"an":[70,246],"open":[71],"problem.":[72],"To":[73],"fill":[74],"gap":[76],"leverage":[78],"benefits":[80],"of":[81,94,176,193,227],"eliminating":[82],"layers":[85],"at":[86],"once,":[87],"we":[88,172,223,259],"propose":[89],"a":[90,99,213,225,264],"new":[91,265],"method":[92,120],"capable":[93],"within":[98],"follows.":[102],"Given":[103],"two":[104],"candidate":[105],"subnetworks":[106],"(pruned":[107],"models),":[108],"one":[109,128],"from":[110,116],"layer":[111,185],"other":[115],"neuron":[117],"pruning,":[118],"our":[119,177,205,234,261],"decides":[121],"which":[122],"to":[123,134,239,256],"choose":[124],"by":[125,254],"selecting":[126],"with":[129],"highest":[131],"representation":[132],"similarity":[133],"its":[135],"parent":[136],"(the":[137],"network":[138],"generates":[140],"subnetworks)":[142],"using":[143],"Centered":[145],"Kernel":[146],"Alignment":[147],"(CKA)":[148],"metric.":[149],"Iteratively":[150],"repeating":[151],"process":[153],"provides":[154],"highly":[155],"sparse":[156],"preserve":[159],"original":[161],"predictive":[162],"ability.":[163],"Throughout":[164],"extensive":[165],"experiments":[166],"on":[167,217],"standard":[168],"architectures":[169],"benchmarks,":[171],"confirm":[173],"effectiveness":[175],"approach":[178,206],"show":[180],"it":[182,209],"outperforms":[183],"state-of-the-art":[184,200],"filter":[187],"techniques.":[189],"At":[190],"high":[191],"levels":[192],"Floating":[194],"Point":[195],"Operations":[196],"(FLOPs)":[197],"reduction,":[198],"most":[199],"methods":[201],"degrade":[202],"accuracy,":[203],"whereas":[204],"either":[207],"experiences":[211],"only":[212],"minimal":[214],"drop.":[215],"Notably,":[216],"popular":[219],"ResNet56":[220],"ResNet110,":[222],"achieve":[224],"milestone":[226],"86.37%":[228],"95.82%":[230],"FLOPs":[231],"reduction.":[232],"Besides,":[233],"pruned":[235],"obtain":[237],"robustness":[238],"adversarial":[240],"out-of-distribution":[242],"samples":[243],"take":[245],"important":[247],"step":[248],"towards":[249],"GreenAI,":[250],"reducing":[251],"carbon":[252],"emissions":[253],"up":[255],"83.31%.":[257],"Overall,":[258],"believe":[260],"work":[262],"opens":[263],"chapter":[266],"pruning.":[268],"Code":[269],"is":[270],"available":[271],"at:":[272],"https://github.com/NascimentoG/PruningEverything.":[273]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-14T00:00:00"}
