Pith. sign in

REVIEW 2 cited by

Deep Model Reassembly

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.17409 v2 pith:LHZ56XF4 submitted 2022-10-24 cs.CV cs.AI

classification cs.CVcs.AI
keywords derymodelblocksconstraintsnetworksdeepequivalencefirst
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we explore a novel knowledge-transfer task, termed as Deep Model Reassembly (DeRy), for general-purpose model reuse. Given a collection of heterogeneous models pre-trained from distinct sources and with diverse architectures, the goal of DeRy, as its name implies, is to first dissect each model into distinctive building blocks, and then selectively reassemble the derived blocks to produce customized networks under both the hardware resource and performance constraints. Such ambitious nature of DeRy inevitably imposes significant challenges, including, in the first place, the feasibility of its solution. We strive to showcase that, through a dedicated paradigm proposed in this paper, DeRy can be made not only possibly but practically efficiently. Specifically, we conduct the partitions of all pre-trained networks jointly via a cover set optimization, and derive a number of equivalence set, within each of which the network blocks are treated as functionally equivalent and hence interchangeable. The equivalence sets learned in this way, in turn, enable picking and assembling blocks to customize networks subject to certain constraints, which is achieved via solving an integer program backed up with a training-free proxy to estimate the task performance. The reassembled models, give rise to gratifying performances with the user-specified constraints satisfied. We demonstrate that on ImageNet, the best reassemble model achieves 78.6% top-1 accuracy without fine-tuning, which could be further elevated to 83.2% with end-to-end training. Our code is available at https://github.com/Adamdad/DeRy

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Yourself: Class-Incremental Semantic Segmentation with Language-Inspired Bootstrapped Disentanglement

    cs.CV 2025-08 conditional novelty 6.0 of 10

    A language-guided bootstrapped disentanglement framework reduces class and background entanglement in continual semantic segmentation, improving state-of-the-art on VOC and ADE20k.

  2. Linear Representation Transferability Hypothesis: Leveraging Small Models to Steer Large Models

    cs.LG 2025-05 conditional novelty 5.0 of 10

    An affine map trained on The Pile transfers steering vectors from Gemma-2B to Gemma-9B and reproduces much of the large model's native steering behavior.

Pith tools