Source-linked AI summary
Model-intrinsic, Weight-level, and Training-free Spectral Fingerprinting for Large Language Models
Yanan He, Yanli Chen, Ling Xiong, Gejian Zhao, Hanzhou Wu
TL;DR
Open-weight LLM reuse makes ownership protection and offline provenance checks important, while existing response- and activation-based evidence can depend on prompts or inference conditions. The paper builds compact fingerprints from GATE-weight spectra and pools layer features by depth; experiments report high similarity for related models, low similarity for unrelated ones, and stability under tested modifications.
Problem
Increasing release and reuse of open-weight LLM checkpoints creates a need for fingerprinting that supports ownership protection, provenance analysis, and offline auditing.
Source: §I · p. 1Method
The method derives spectral scalar features from GATE projection weights, pools layer-wise features into a model fingerprint, and compares fingerprints using linear CKA.
Source: §I · p. 2, B. Model-level Fingerprint Construction · p. 3Results
Unrelated pairs had a maximum similarity of 0.2288, below the minimum related similarity of 0.9727, and tested pruning, GPTQ quantization, and distillation-related pairs had similarities of at least 0.9108.
Source: B. Main Results · pp. 4–5Takeaways & Limitations
The experiments support GATE spectral fingerprints as weight-level evidence for provenance verification, with strong source separation and robustness to the evaluated model modifications.
Source: §V · p. 6The reported comparison with REEF and adapted HuRef-ICS uses the same 29 model pairs, so that baseline evidence is scoped to the current evaluation.
Source: E. Comparative Evaluation and… · p. 6
Abstract
from arXiv · showhide
The increasing release and reuse of Large Language Models (LLMs) as open-weight checkpoints make model fingerprinting important for ownership protection and offline auditing. Existing fingerprinting methods typically construct evidence from query responses, generated outputs, or input-induced activations. Although effective in representation-based settings, they can be affected by prompt selection, decoding configuration, inference environment, and forward-pass implementation, which may limit their applicability. Here we introduce a model-intrinsic weight-level framework that derives compact fingerprints from spectral structures encoded in LLM parameters. Specifically, the framework constructs GATE spectral scalar features from the singular-value distributions of GATE projection weights in gated feed-forward networks (FFNs), and aggregates the resulting layer-wise features through depth-wise segmented pooling to form a model-level fingerprint. Such representation preserves coarse layer-depth organization while reducing dependence on strict layer-to-layer alignment, enabling comparison across LLMs with different depths. The similarity between fingerprints is computed by linear centered kernel alignment. The entire pipeline is training-free and does not require input samples, generated outputs, forward activations, or an auxiliary verifier. Experiments on representative LLM families and post-training variants have demonstrated a clear separation between source-related models and unrelated ones, and stable similarity under instruction tuning, quantization, pruning, and distillation-related modifications, which verify that spectral features are robust evidence for LLM fingerprinting.
I. INTRODUCTION
As open-weight LLM checkpoints are increasingly released and adapted, the paper motivates reproducible weight-derived evidence for ownership and provenance checks when parameters are available. It focuses on decoder-only models with gated FFNs, whose layers provide an organized set of projection weights for analysis.
I. INTRODUCTION
- Open-weight checkpoint reuse creates a need for fingerprinting that supports ownership protection, provenance analysis, and offline auditing.When model parameters are available, an auditor may check whether a suspect checkpoint is related to a specified source model.Source: §I · p. 1
- The paper investigates fingerprints built from singular-value distributions of GATE projection weights, extracting layer-wise features and aggregating them along model depth.The extraction uses static weights and requires neither input samples, model outputs, nor forward inference.Source: §I · p. 2
A. Large Language Models
- The target source-model families use decoder-only Transformers with gated FFNs, whose repeated blocks provide a consistent layer-wise organization of projection weights.The paper describes Transformer, recurrent, state-space, and hybrid sequence-modeling backbones, with Transformer the most popular.Source: A. Large Language Models · p. 2
B. Gated Feed-Forward Networks
A gated FFN uses parallel UP and GATE projections followed by a DOWN projection. The GATE branch produces the modulation signal, making its weights a meaningful object for weight-level spectral analysis.
B. Gated Feed-Forward Networks
- A gated FFN has parallel UP and GATE input projections followed by a DOWN projection.The three projections act on the hidden representation entering the FFN.Source: B. Gated Feed-Forward Networks · p. 2
- The GATE branch applies an activation to generate a data-dependent signal that element-wise modulates the expanded intermediate features.The UP projection expands the hidden representation, while the DOWN projection maps the gated representation back to the hidden dimension.Source: B. Gated Feed-Forward Networks · p. 2
- Because it generates the modulation signal, the GATE weight matrix is a meaningful weight-level object for spectral analysis within each Transformer block.Source: B. Gated Feed-Forward Networks · p. 2
III. MODEL-INTRINSIC, WEIGHT-LEVEL, AND TRAINING-FREE SPECTRAL FINGERPRINTING TECHNIQUE
The method converts GATE projection singular-value distributions into layer-wise scalar features, then pools those features along depth into a fixed-size model fingerprint. Linear CKA compares fingerprints.
III. MODEL-INTRINSIC, WEIGHT-LEVEL, AND TRAINING-FREE SPECTRAL FINGERPRINTING TECHNIQUE
- The method derives a scalar GATE spectral feature from each layer’s singular-value distribution and aggregates the layer-wise values along model depth into a fixed-size fingerprint.The feature reflects whether spectral energy is concentrated in a few directions or distributed across more directions.Source: §III · p. 2
- The layer-wise features are ordered by depth and aggregated through segmented mean pooling; the framework figure summarizes this construction from layer-wise GATE weights.The number of groups defaults to 8, and linear CKA computes similarity between fingerprint vectors.Source: §III · pp. 2–3, Figure 1 · p. 3
A. Layer-wise GATE Spectral Feature
- For each GATE weight matrix, the method retains the top r singular values, normalizes them, computes spectral entropy, and exponentiates it to form the layer’s scalar feature.The singular values describe transformation strength along orthogonal directions; their distribution reflects how the matrix’s spectral energy is organized.Source: A. Layer-wise GATE Spectral Feature · p. 3
B. Model-level Fingerprint Construction
The model-level fingerprint uses mean-pooled GATE spectral features from contiguous depth segments, producing a fixed-size representation that preserves coarse depth organization without depending on model depth.
B. Model-level Fingerprint Construction
- Contiguous, approximately equal-sized depth segments are formed from the ordered Transformer blocks, and the layer features in each segment are mean-pooled.The default uses 8 groups, including approximately equal-sized segments when the layer count is not divisible by 8.Source: B. Model-level Fingerprint Construction · p. 3
- The pooled segment features are stacked from shallow to deep to form the model-level fingerprint.The fingerprint construction removes dependence on model depth while preserving coarse depth-wise organization.Source: B. Model-level Fingerprint Construction · p. 3
C. Fingerprint Similarity
The paper compares model-level fingerprints using linear CKA, which in this one-dimensional setting is the squared Pearson correlation between mean-centered vectors.
C. Fingerprint Similarity
- Linear CKA is used to compare the model-level fingerprint vectors of two LLMs.The method is introduced as a similarity measure for the fingerprints.Source: C. Fingerprint Similarity · p. 3
- For column-vector fingerprints, linear CKA is the squared cosine similarity of mean-centered vectors, equivalent to the squared Pearson correlation coefficient.It measures linear relationship strength while treating positive and negative correlations equally.Source: C. Fingerprint Similarity · p. 4
IV. EXPERIMENTAL RESULTS AND ANALYSIS
The evaluation compares fingerprints across representative open-weight LLM families and groups of related, modified, and unrelated model pairs. It also expands the pair set to assess separation, robustness, and sensitivity to fingerprint settings.
A. Setup
- The 29-pair evaluation contains 9 related, 6 robust, and 14 unrelated pairs for pairwise analysis, robustness evaluation, and cross-method comparison.The represented open-weight families include Qwen2.5, Mistral, Baichuan2, and LLaMA.Source: A. Setup · p. 4
- The expanded evaluation contains 120 pairs over 25 checkpoints, including 30 related and 90 unrelated pairs.It is used for ROC and threshold analysis, truncation-rank sensitivity, and structure-matched evaluation.Source: A. Setup · p. 4
- For the 29-pair evaluation, the fingerprint uses r = 128 and s = 8, while the expanded evaluation reports AUROC, normalized pAUC@5% FPR, TPR@1% FPR, and the KS statistic.The truncation rank r is not treated as universally optimal because it affects retained spectral information and verification performance.Source: A. Setup · p. 4
- The 29-pair evaluation reports related, robust, and unrelated mean and boundary similarities, with a conservative separation gap defined from the related minimum and unrelated maximum.The gap is defined as Related Min minus Unrelated Max.Source: A. Setup · p. 4
B. Main Results
Across the expanded evaluation, related and unrelated groups have sharply different fingerprint similarities, while tested post-training modifications retain high similarity. The pairwise results likewise show high same-family similarity and low cross-family or cross-architecture similarity.
B. Main Results
- The lowest source-related similarity is 0.9727, while most other related pairs are close to 1.0, across evaluated instruction-tuned, domain-specialized, chat, and other same-family variants.Table II reports source-related and post-training-modified pairs.Source: Table II · p. 4, B. Main Results · p. 4
- All tested pruning, GPTQ quantization, and distillation-related robust-pair similarities are at least 0.9108.Mistral-7B-v0.3-prune6 reduces depth from 32 to 26 layers while retaining similarity 0.9198.Source: B. Main Results · p. 4
- Unrelated pairs from different model families or architectures reach a maximum similarity of 0.2288, below the minimum related similarity of 0.9727.Table III reports unrelated pairs from different families or architectures.Source: Table III · p. 5, B. Main Results · p. 5
- Related and Unrelated groups have mean similarities of 0.9949 and 0.0923, respectively, yielding a conservative separation gap of 0.7439; the Robust group mean is 0.9568 with minimum 0.9108.These group-level results are summarized in Table IV.Source: Table IV · p. 5, B. Main Results · p. 5
C. Ablation Study
The ablations select GATE projections and s = 8 as the current settings, while rank results vary with both the metric and evaluation set.
C. Ablation Study
- Increasing s generally lowers unrelated similarity but weakens robustness; s = 8 balances the two, while s = 16 has a substantial robustness drop.The segment-number ablation uses the 29-pair set with r = 128.Source: C. Ablation Study · p. 5, Table V · p. 5
- GATE-only offers a favorable balance: unrelated maximum 0.2288, separation gap 0.7439, and robust minimum 0.9108.UP-only has higher unrelated similarities, DOWN-only weakens related-model consistency, and adding projections gives no consistent improvement.Source: Figure 2 · p. 5, C. Ablation Study · p. 5
- On the expanded 120-pair set, r = 64 leads AUROC, pAUC@5%, and TPR@1%, while r = 32 leads KS.Truncation rank determines how many leading singular values are retained for spectral-entropy computation; performance varies non-monotonically with rank.Source: Table VI · p. 5, C. Ablation Study · p. 5
- On the original 29-pair set, r = 64 and r = 128 both score 1.0000 on all four discrimination metrics, so r = 128 is a fixed setting, not a universal optimum.The preferred rank depends on the evaluation population.Source: C. Ablation Study · p. 5
D. Expanded Verification and Robustness Analysis
The expanded evaluation reports strong verification performance, including on structure-matched pairs. Targeted GATE spectral perturbations degrade fingerprint similarity more than random controls, with stronger degradation generally accompanying a utility cost.
D. Expanded Verification and Robustness Analysis
- On 120 model pairs, r = 64 reaches AUROC 0.9870; at threshold 0.9, TPR is 90.00% and FPR is 4.44%.The threshold is an empirical operating point, not a universal selection.Source: D. Expanded Verification and… · p. 5
- On the structure-matched subset, AUROC is 1.0000 at r = 128 and 0.9800 at r = 64, so matching matrix dimensions and depth alone does not determine similarity.At r = 128, 23 pairs are negatively correlated, but none has correlation at or below −0.9.Source: D. Expanded Verification and… · p. 5
- At ϵ = 2%, Rank-4 CKA falls to 0.6519 with held-out perplexity increasing 12.41%, while Gaussian control stays near 1.0; the ϵ = 3% utility-constrained candidate has CKA 0.8910 and a 3.08% increase.Targeted perturbations affect the fingerprint more strongly than budget-matched Gaussian perturbations; ϵ denotes the relative Frobenius-norm perturbation budget.Source: D. Expanded Verification and… · pp. 5–6, Table VII · p. 6
E. Comparative Evaluation and Limitations
The comparison emphasizes that the method uses static GATE weights rather than prompts, responses, or forward-pass activations. The paper also reports matching threshold metrics with adapted HuRef-ICS, greater Mahalanobis separation, and limitations in architecture coverage and further evaluation.
E. Comparative Evaluation and Limitations
- The method avoids prompt construction and response collection, and extracts fingerprints from static GATE weights without forward passes or input-dependent activations.Table VIII summarizes evidence sources and access requirements across representative methods.Source: E. Comparative Evaluation and… · p. 6, Table VIII · p. 6
- Both methods achieve 1.0000 on AUROC, pAUC@5%, TPR@1%, and KS, while the proposed method reports a Mahalanobis separation of 14.402.The comparison uses the same 29 model pairs.Source: Table IX · p. 6, E. Comparative Evaluation and… · p. 6
- Standard extraction relies on gated FFNs, and applicability to non-gated architectures, larger models, adversarial finetuning, model merging, and registry-scale collision risks require further study.Source: E. Comparative Evaluation and… · p. 6
V. CONCLUSION
- The conclusion presents the method as a practical approach to offline LLM provenance analysis, reporting source separation and robustness under evaluated modifications.It requires neither input samples nor forward inference.Source: §V · p. 6