Skip to content
Conference

Discrepancy-guided parameter suppression for robust fine-tuning and domain generalization

Aug 2026 · International Conference on Computer Vision and Information Technology · Vol 14321, pp. 143210B - 143210B-5 · 0 citations · 9 references
Engineering

TL;DR

This work evaluates Discrepancy-Guided Parameter Suppression on the challenging iWildCam dataset under camera-induced domain shifts, providing the first in-depth assessment of DPS on a real-world distribution shift benchmark.

Abstract

Fine-tuning large pre-trained models on specific tasks can improve in-distribution (ID) accuracy but often degrades out-of-distribution (OOD) generalization. Discrepancy-Guided Parameter Suppression (DPS) is a fine-tuning approach that Discrepancy-Guided Parameter Suppression (DPS) is a fine-tuning approach that freezes the top K percent of model parameters based on the magnitude of their changes. By ranking parameters according to a discrepancy score (the magnitude of change during fine-tuning) and suppressing the highest-discrepancy parameters, DPS encourages the model to learn task-relevant features without overfitting to spurious ID-specific patterns. We evaluate DPS on the challenging iWildCam dataset under camera-induced domain shifts, providing the first in-depth assessment of DPS on a real-world distribution shift benchmark. Using a CLIP ViT-B/16 backbone and identical hyperparameters for a cross-entropy baseline and DPS, we observe improvements on OOD metrics: OOD macro-F1 increases from 35.14% to 36.15% and OOD accuracy from 73.92% to 74.95%, roughly a 1% absolute gain on both. We also provide ablation analyses of the discrepancy metric and suppression rate, showing that normalized, channel-wise suppression at high freezing ratios yields the strongest OOD robustness, consistent with prior findings.

View source

Similar papers

Rethinking BCE Loss for Multi-Label Image Recognition with Fine-Tuning

Class-wise Covariance Regularization is proposed, which aligns the predicted covariance structure of class confidences with the semantic correlations encoded in pretrained text embed-dings with the geometric consistency of the class space throughout fine-tuning, resulting in more stable and interpretable confidence dis...

Ao Zhou, Zhi-Wei Jiang, Zi-Feng Cheng et al. · 0 citations
Aug 2026

SPIRA: Sparse Information-Geometric Rank Adaptation for Parameter-Efficient Fine-Tuning of Large Pretrained Models.

SPIRA is a PEFT framework that separates support discovery from parameter-efficient adaptation and remains competitive with representative PEFT baselines while using lower trainable-parameter budgets than several compared weight-side/LoRA-family baselines.

Zhong-Yi Wen, Zhikai Zhai, Guo-Min Sun et al. · 0 citations
Jul 2026

TopoTuner: Topological Finetuning of Large Language Models

TopoTuner is competitive with full fine-tuning while training only 1-2% of the model parameters, and outperforms LoRA in 7 out of 9 model-dataset settings, which can change up to 39.57% of the projection parameters.

Abdulkadir Erol, Yash Mahajan, Vepaul Hariprashad et al. · 0 citations
Open access 2023

Deep Learning Enhancements Using Pretraining and Fine-Tuning

Experimental findings show that pretrained models outperform those trained from scratch in terms of accuracy, convergence speed, and robustness, and a unified framework is proposed to integrate both processes in a deep learning pipeline.

Kwame Nkosi · 0 citations
2025

AdaMSS: Adaptive Multi-Subspace Approach for Parameter-Efficient Fine-Tuning

Extensive experiments across image classification, natural language understanding, and natural language generation tasks show that AdaMSS achieves comparable performance to full fine-tuning and outperforms other parameter-efficient fine-tuning methods in most cases, all while requiring fewer trainable parameters.

Jingjing Zheng, Wang-Long Lu, Yiming Dong et al. · 0 citations
#machine learning Preprint Sep 2026

Online Self-Weighted Fine-Tuning

Online Self-Weighted Fine-Tuning is proposed, a simple method that augments SFT with online, trajectory-level weighting and offers a favorable compute-performance trade-off as a practical approach for fine-tuning small-to-medium LLMs on binary-verifiable reasoning tasks with only 2 online rollouts.

Hai-Quan Wen, Yiwei He, Bei Peng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.