- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes EGS, a class-wise gradient-based specification for learnware identification and reuse. It uses gradient responses of a shared network to characterize learnware capabilities and matches specifications to select learnwares for new tasks. The paper also provides theoretical analyses, alongside experiments on image and text classification benchmarks.
Critical strengths
- The paper is clearly structured and provides explicit assumptions and detailed proofs for its theoretical results.
- The experiments cover image and text benchmarks, including reuse beyond original functionality, few-shot tasks, and corrupted learnwares.
Critical weaknesses
Weakness 1: The substantive advance of EGS over the existing PAVE specification and the motivation underlying its design have not been sufficiently established.
EGS and PAVE [1] are closely related in their use of signals induced by tasks or models in a shared model to characterize capabilities. EGS uses the class-wise one-step gradient responses of a shared network on the data used to construct the specification. PAVE uses the parameter changes of a public pre-trained model after multi-step adaptation on the corresponding data. Moreover, PAVE has been validated in capability characterization settings that include large language models, whereas EGS has primarily been evaluated on ResNet110 and TF-IDF-based classification models. From this perspective, under experiments with controlled models, tasks, and computational resources, the shared network and one-step gradient responses used by EGS are merely simplifications of the public pre-trained model and multi-step adaptation used by PAVE. However, in the limitations on page 31, the authors state, "Unlike PAVE (Shi et al., 2026), EGS does not rely on large-scale pre-trained foundation models or task-specific adaptation, making direct comparison under our controlled experimental protocol less informative." This does not establish a substantive contribution of EGS beyond the existing PAVE framework. The incremental contribution is limited to the class-wise construction of the specification, but similar ideas have already been adopted by prior works [2,3].
Meanwhile, the motivation that "under a limited specification size, distribution matching may discard class-conditional and task-relevant predictive information" does not adequately distinguish different issues. An exact KME with a characteristic kernel preserves information about the distribution it embeds. The absence of class information or information about model behavior from a marginal distribution representation is a different limitation from the compression error introduced by a finite reduced set. In Figure 1, class-wise distribution matching already substantially narrows the gap to gradient matching: under the smallest budget, CRKME and EGS retain 81.7% and 87.2% of the full-data linear probe performance, respectively. This result does not justify attributing all gains over RKME based on marginal distributions to the gradient mechanism, nor does it support a broad dismissal of distribution-matching specifications. Furthermore, "tight budgets" are primarily defined by the number of prototypes, whereas, with the probing network and number of classes fixed, the storage required by the final EGS gradient specification does not vary directly with the number of proxy prototypes. The paper does not establish a comparison under matched actual storage budgets and therefore does not sufficiently substantiate its motivation centered on tight storage budgets.
Weakness 2: The theoretical analysis lacks a substantive connection to the EGS specification, while missing key baselines and discrepancies between the paper and the supplied implementation leave its effectiveness claims insufficiently validated.
The theory establishes generalization guarantees for learnware identification and reuse, with a selection cost logarithmic in the number of candidates. It further explains performance saturation through dock coverage and specification distortion. However, the authors do not derive these key properties from the proposed EGS construction. Similar analyses would remain applicable to other specifications satisfying the same conditions. The theoretical contribution therefore lacks a substantive connection to the specification contribution: the theory neither explains why EGS is effective nor establishes its advantages over existing specifications.
The experiments do not sufficiently bridge this gap either. In addition to PAVE, Linear Proxy [4] and RNCME [5] are both directly relevant to the paper's emphasis on model functionality or predictive information. However, although the former is cited, it is not included as an experimental baseline. The latter is neither discussed nor compared against. Without these directly relevant competing methods, the current results are insufficient to establish the added value of EGS over existing specifications that account for model functionality.
The supplied implementation also shows apparent discrepancies with the specification construction and class matching described in the paper, as detailed in the Questions below. These discrepancies need to be clarified to establish whether the reported results correspond to the proposed EGS method and support the mechanism claimed by the authors.
References
[1] Hao-Yu Shi, Zhi-Hao Tan, Zi-Chen Zhao, Yang Yu, and Zhi-Hua Zhou. A Study on PAVE Specification for Learnware. ICLR, 2026.
[2] Peng Tan, Hai-Tian Liu, Zhi-Hao Tan, and Zhi-Hua Zhou. Handling Learnwares from Heterogeneous Feature Spaces with Explicit Label Exploitation. NeurIPS, 2024.
[3] Jian-Dong Liu, Zhi-Hao Tan, and Zhi-Hua Zhou. Identifying and Reusing Learnwares Across Different Label Spaces. IJCAI, 2025.
[4] Lan-Zhe Guo, Zhi Zhou, Yu-Feng Li, and Zhi-Hua Zhou. Identifying Useful Learnwares for Heterogeneous Label Spaces. ICML, 2023.
[5] Zi-Yu Mao and Ming Li. Identifying Learnwares via Reduced Neural Conditional Mean Embedding. ICML, 2026.
Questions for authors
-
How are the submitted models' predictions incorporated into the implementation of Eq. (2)? The default
objective="distribution"branch computes class-wise RFF mean embeddings, while thebehaviorbranch uses fixed uniform targets. Which branch and configuration were used to produce the reported results? -
How is the partial one-to-one matching constraint in Eq. (5) enforced in the experiments? The provided matching routine independently takes class-wise minima and permits multiple user classes to select the same local class. Were the results obtained with this routine or with the constrained matching procedure described in the paper?
-
The AI use statement says, "Generative AI tools were used solely to aid and polish the writing of this paper." Some portions of the submitted code give the impression of AI-assisted development, although this cannot be established from code style alone. Could the authors clarify whether generative AI was also used to assist with code development? (This question is for clarification only and is not a reason for my low rating.)