LiteGuard: Efficient Task-Agnostic Model Fingerprinting with Enhanced Generalization
Guang Yang, Ziye Geng, Yihang Chen, Changqing Luo

TL;DR
LiteGuard is a novel, efficient task-agnostic model fingerprinting method that enhances generalization and reduces computational costs by using checkpoint-based model augmentation and lightweight local verifiers.
Contribution
It introduces checkpoint-based model augmentation and local verifiers to improve generalization and efficiency over prior methods like MetaV.
Findings
Outperforms MetaV in generalization across five tasks.
Reduces computational cost significantly.
Mitigates overfitting through local verifier design.
Abstract
Task-agnostic model fingerprinting has recently gained increasing attention due to its ability to provide a universal framework applicable across diverse model architectures and tasks. The current state-of-the-art method, MetaV, ensures generalization by jointly training a set of fingerprints and a neural-network-based global verifier using two large and diverse model sets: one composed of pirated models (i.e., the protected model and its variants) and the other comprising independently trained models. However, publicly available models are scarce in many real-world domains, and constructing such model sets requires intensive training and massive computational resources, posing a significant barrier to deployment. Reducing the number of models can alleviate the overhead, but increases the risk of overfitting, a problem further exacerbated by MetaV's entangled design, in which all…
Peer Reviews
Decision·ICLR 2026 Poster
1. Well-identified practical bottleneck (generalization vs. efficiency trade-off). The authors clearly articulate that the core limitation of existing task-agnostic fingerprinting, especially MetaV, lies in its dependence on large and diverse model collections to achieve generalization. This observation grounds the work in a genuine real-world constraint: publicly available models are scarce, and constructing them is resource-intensive. The authors convincingly motivate the need for a lightweig
1. Limited theoretical understanding of generalization improvement. Section 4 provides a parameter-count argument suggesting that reduced entanglement mitigates overfitting, but it stops short of a quantitative or theoretical treatment. There is no analysis of how checkpoint diversity or modularity affects the variance or bias of fingerprint representations, nor are there experiments correlating parameter scale with test AUC. As a result, the claim of “enhanced generalization” remains empirical
1. This paper is well structured and easy to follow. 2. The empirical results are strong and the experiment design is fair. It shows a large margin of improvement given by the proposed method compared to the baselines. 3. Very rich experimental results. It considered both scenarios with and without obfuscation methods. 4. Ablation studies are also well designed and convincing.
1. The novelty of this paper is relatively weak. Independently optimizing different fingerprints is also used in other previous works. Although these works are not considered task-agnostic, it would be better to clarify how this work differs from them. 2, Font size in Fig. 4 is too small to read.
1. **Elegant and Practical Design Innovations.** The checkpoint-based augmentation cleverly utilizes existing training artifacts to boost model diversity. The local verifier design directly reduces overfitting and decouples parameter dependencies. Both are low-cost, widely applicable strategies that can be generalized beyond fingerprinting. 2. **Strong Problem Motivation and Practical Relevance.** This paper addresses a real deployment bottleneck in model IP protection—MetaV’s dependence on la
1. **Limited Theoretical Analysis.** The paper’s central claim—improved generalization via reduced entanglement—is only empirically validated. There is no formal generalization or bias-variance analysis to support the intuition. 2. **Verifier Design.** The local verifier is a single linear layer; its capacity to handle high-dimensional nonlinear outputs is questionable. Runtime or query-efficiency trade-offs are not discussed.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Advanced Graph Neural Networks · Generative Adversarial Networks and Image Synthesis
