Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/118830
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Data Science and Artificial Intelligenceen_US
dc.contributorDepartment of Computingen_US
dc.creatorZhou, Yen_US
dc.creatorWu, Xen_US
dc.creatorWu, Jen_US
dc.creatorFeng, Len_US
dc.creatorTan, KCen_US
dc.date.accessioned2026-05-20T06:39:23Z-
dc.date.available2026-05-20T06:39:23Z-
dc.identifier.urihttp://hdl.handle.net/10397/118830-
dc.descriptionThe Thirty-ninth Annual Conference on Neural Information Processing Systems, NeurIPS 2025, San Diego, USA, Dec 01 2025en_US
dc.language.isoenen_US
dc.publisherOpenReview.neten_US
dc.rightsCC BY 4.0 (https://creativecommons.org/licenses/by/4.0/)en_US
dc.rightsThe following publication Zhou, Y., Wu, X., Wu, J., Feng, L., & Tan, K. C. (2026). Hm3: Hierarchical multi-objective model merging for pretrained models. In The Thirty-ninth Annual Conference on Neural Information Processing Systems is available at https://openreview.net/forum?id=JeP0lpusYw.en_US
dc.titleHM3 : hierarchical multi-objective model merging for pretrained modelsen_US
dc.typeConference Paperen_US
dcterms.abstractModel merging is a technique that combines multiple large pretrained models into a single model, enhancing performance and broadening task adaptability without original data or additional training. However, most existing model merging methods focus primarily on exploring the parameter space, merging models with identical architectures. Despite its potential, merging in the architecture space remains in its early stages due to the vast search space and challenges related to layer compatibility. This paper designs a hierarchical model merging framework named HM3, formulating a bilevel multi-objective model merging problem across both parameter and architecture spaces. At the parameter level, HM3 integrates existing merging methods to quickly identify optimal parameters. Based on these, an actor-critic strategy with efficient policy discretization is employed at the architecture level to explore inference paths with Markov property in the layer-granularity search space for reconstructing these optimal models. By training reusable policy and value networks, HM3 learns Pareto optimal models to provide customized solutions for various tasks. Experimental results on language and vision tasks demonstrate that HM3 outperforms methods focusing solely on the parameter or architecture space.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationThe Thirty-ninth Annual Conference on Neural Information Processing Systems, NeurIPS 2025, San Diego, USA, Dec 01 2025, https://openreview.net/forum?id=JeP0lpusYwen_US
dcterms.issued2025-
dc.relation.conferenceNeural Information Processing Systems [NeurIPS]en_US
dc.description.validate202605 bcchen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumbera4427a-
dc.identifier.SubFormID52773-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis work was partially supported by National Natural Science Foundation of China under Grant U21A20512 and in part by the Research Grants Council of the Hong Kong SAR under Grant No. C5052-23G, Grant PolyU 15229824, Grant PolyU 15218622, and Grant PolyU 15215623. This work was also partially supported the Research Grants Council of the Hong Kong SAR (Grant No. PolyU15217424, PolyU25216423), and The Hong Kong Polytechnic University (Project IDs: P0043563). This work was also in part by the Natural Science Foundation of Chongqing (Innovation and Development Joint Fund) under Grant CSTB2025NSCO-LZX0014.en_US
dc.description.pubStatusUnpublishen_US
dc.description.oaCategoryCCen_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
29077_HM3_Hierarchical_Multi_O.pdf867.53 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.