InfoMSD: an information-maximization self-distillation framework for parameter-efficient fine-tuning on artwork images
Feng Guan, Hao Hong, Yong Wang

TL;DR
This paper introduces InfoMSD, a new method for efficiently fine-tuning large vision models to recognize objects in artwork images without needing labeled data.
Contribution
InfoMSD introduces an unsupervised self-distillation framework with entropy regularization for efficient fine-tuning on unlabeled artwork data.
Findings
InfoMSD improves accuracy by +6.43% over CLIP zero-shot baselines with less than 1% parameter updates.
The method outperforms existing lightweight distillation approaches by 1.35% average accuracy.
Entropy-based regularization sharpens pseudo-labels and balances class coverage effectively.
Abstract
In recent years, despite the remarkable performance of large-scale vision language models across various visual classification tasks, their substantial parameter counts and high fine-tuning costs have hindered deployment in resource-constrained cultural and artwork settings. This work specifically addresses the task of object recognition in artwork—that is, identifying semantic objects (e.g., animals, people, everyday items) depicted within paintings, sketches, and other artistic renditions, rather than classifying artistic styles or genres. To address this issue, we propose InfoMSD, an unsupervised, Information-Maximization Self-Distillation framework designed for parameter-efficient fine-tuning on unlabeled artwork imagery while preserving robust performance. Specifically, InfoMSD incorporates a teacher-student architecture in the self-distillation phase, where the teacher model…
Genes, proteins, chemicals, diseases, species, mutations and cell lines named across the full text — each resolved to its canonical identifier and authoritative record.
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6|
|
|
|
|---|---|---|
| CLIP | 66.81 | 41.12 |
| CLIP-PR | 54.27 | 38.95 |
| UPL | 65.66 | 42.40 |
| LaFTer | 71.89 | 43.18 |
|
|
|
|
|
|
|
|
|
|
|
|---|---|---|---|---|---|
|
| |||||
| CLIP | 66.81 | 86.83 | 91.42 | 98.01 | 99.37 |
| LaFTer | 71.89 | 90.61 | 94.20 | 98.57 | 99.55 |
| |
|
|
|
|
|
|
| |||||
| CLIP | 41.12 | 69.21 | 78.38 | 91.13 | 94.27 |
| LaFTer | 43.18 | 69.60 | 78.14 | 91.06 | 94.32 |
| |
|
|
|
|
|
|
|
|
|
|---|---|---|
| w/o adapter | 72.01 | 40.77 |
| w/o LayerNorm | 69.68 | 41.85 |
| w/o VPT | 53.09 | 14.76 |
| w/o Entropy | 70.34 | 42.24 |
| w/o Divergence | 72.26 | 42.46 |
| InfoMSD |
|
|
|
|
|
|
|
|---|---|---|---|
| ViT-B32 | CLIP | 66.81 | 41.12 |
| LaFTer | 71.89 | 43.18 | |
| InfoMSD |
|
| |
| ViT-B16 | CLIP | 73.78 | 46.61 |
| LaFTer | 79.99 | 49.48 | |
| InfoMSD |
|
| |
| ViT-L14 | CLIP | 85.27 | 58.04 |
| LaFTer | 86.54 | 60.72 | |
| InfoMSD |
|
|
|
| Model parameters | Model update | Training efficiency | ||||||
|---|---|---|---|---|---|---|---|---|---|
|
|
|
|
|
|
|
|
|
| |
| Imagenet-R | 78.44K | 102K | 180.44K | ~150M | 0.12% | 2 m 03 s | 21 m 37 s | 5.75GB | 6.14GB |
| Imagenet-S | 78.44K | 512K | 590.44K | ~150M | 0.39% | 3 m 42 s | 38 m 46 s | 5.73GB | 6.26GB |
|
|
|
|
|
|
|---|---|---|---|---|
| CIFAR-10 (10) | 88.76 / 95.87 | 99.38 / 99.96 | — | — |
| ( | — | — | ||
| Eurosat (10) | 35.57 / 79.70 | 84.62 / 97.59 | — | — |
| ( | ( | — | — | |
| Pets (37) | 79.97 / 89.43 | 95.64 / 99.76 | 96.92 / 99.95 | 99.81 / 100.00 |
| ( | ( | ( | ( | |
| DTD (47) | 43.62 / 53.01 | 72.46 / 84.63 | 84.57 / 93.97 | 96.39 / 99.47 |
| ( | ( | ( | ( |
|
|
|
|
|
|
|
|---|---|---|---|---|---|
| CIFAR-100 (100) | 64.23 / 74.95 | 88.14 / 94.94 | 93.35 / 97.58 | 99.17 / 99.84 | 99.76 / 99.96 |
| ( | ( | ( | ( | ( | |
| Aircraft (101) | 17.67 / 21.33 | 48.90 / 46.64 | 66.79 / 63.07 | 97.27 / 97.93 | 99.01 / 99.52 |
| ( | ( | ( | ( | ( | |
| Food101 (102) | 76.97 / 80.63 | 94.99 / 95.97 | 97.60 / 98.06 | 99.75 / 99.78 | 99.92 / 99.93 |
| ( | ( | ( | ( | ( | |
| Flower (102) | 63.74 / 73.12 | 84.53 / 88.75 | 87.98 / 91.27 | 96.10 / 98.66 | 98.74 / 99.96 |
| ( | ( | ( | ( | ( | |
| UCF101 (101) | 60.16 / 68.91 | 84.46 / 92.04 | 91.17 / 96.88 | 99.31 / 99.97 | 100.00 / 100.00 |
| ( | ( | ( | ( | (0.00) | |
| Caltech101 (100) | 90.59 / 93.71 | 99.39 / 99.96 | 99.80 / 100.00 | 100.00 / 100.00 | 100.00 / 100.00 |
| ( | ( | ( | (0.00) | (0.00) | |
| SUN397 (397) | 60.26 / 66.50 | 89.47 / 92.27 | 94.61 / 96.26 | 99.11 / 99.42 | 99.66 / 99.81 |
| ( | ( | ( | ( | ( |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAesthetic Perception and Analysis · Generative Adversarial Networks and Image Synthesis · Visual Attention and Saliency Detection
Introduction
1
Object recognition in artwork plays a vital role in preserving, interpreting, and disseminating cultural heritage. Unlike artwork style classification (e.g., distinguishing Impressionism from Baroque), this task focuses on identifying the semantic content—such as objects, animals, and human figures—depicted within artistic images including paintings, sketches, and renditions. As cultural heritage institutions worldwide embark on digitization, there is a growing need to develop intelligent systems that can classify and explain visual collections (Li et al., 2024). It is worth noting that while fine art museums may prioritize style-based classification (e.g., Impressionism, Baroque) or brush texture analysis, content-based object recognition remains valuable for diverse cultural institutions—such as natural history museums, archaeological archives, and illustrated manuscript collections—where identifying depicted subjects (e.g., species, artifacts, historical figures) is essential for cataloging and retrieval. The manual process of organizing textual information, such as exhibit descriptions, relies on the subjective judgments of curators or volunteers. This method is time-consuming and lacks uniform standards for classification and naming styles (Mohan and Rodgers, 2021). There are inconsistencies in the use of categorization terms and labels for similar exhibits between different museums or even between different artwork within the same museum. Such unstructured exhibit descriptions constrain the digital integration and reuse of cultural heritage (King et al., 2023). In addition, these classification methods are difficult to adapt to the rapid updating needs of large-scale data collection scenarios. Moreover, manual proofreading and categorization are prone to omissions, errors, and subjective bias (Yang et al., 2023).
In the task of artwork classification, we introduce two complementary explainability techniques to enhance the interpretability of decisions made by vision-language models (VLMs): multi modal saliency analysis and embedding-space visualization.
For saliency analysis, instead of using traditional methods such as Gradient-weighted Class Activation Mapping (Grad-CAM) (Selvaraju et al., 2017), Local Interpretable Model-agnostic Explanations (LIME) (Ribeiro et al., 2016), or Shapley Additive Explanations (SHAP) (Mosca et al., 2022), we adopt the state-of-the-art multi modal explanation technique MM-SHAP (Performance-agnostic Metric for Measuring Multimodal Contributions) (Parcalabescu and Frank, 2023). MM-SHAP enables fine-grained attribution of both visual regions and textual keywords in the joint embedding space, thus providing more precise insights into the model's decision-making process. This approach significantly improves semantic interpretability, especially for complex categories such as “goldfish sketch” and “goldfish oil painting.” By leveraging dual-modality attribution, MM-SHAP offers interpretable feedback that is particularly valuable for curators and art historians.
To further understand how model representations evolve during adaptation, we employ t-distributed Stochastic Neighbor Embedding (t-SNE) to visualize the distribution of learned features. The t-SNE projections clearly illustrate the progressive clustering and separation of different artistic categories in the embedding space as training progresses. This provides visual evidence for the model's performance improvement and reveals its internal learning dynamics (Ribeiro et al., 2016).
However, conventional explanation methods often suffer from substantial computational overhead and latency, which limits their applicability in large-scale, multi modal scenarios like museum environments that demand high-throughput or real-time interpretation (Ezeji et al., 2024). To address these challenges, we combine MM-SHAP-based saliency analysis with efficient clustering visualization, offering a practical and interpretable solution for real-world artwork classification tasks.
The contributions of this paper are summarized as follows:
Propose an information maximization framework that addresses the domain gap between natural images and artwork for efficient semantic object recognition in artistic imagery, requiring minimal computational overhead compared to existing methods.Develop an enhanced label-free tuning approach that overcomes LaFTer's limitations by integrating VLM adaptation with information maximization, achieving better feature clustering and classification performance with reduced training costs.
The remainder of this paper is structured as follows. Section 2 reviews the relevant literature. Section 3 introduces the method we use in the experimental procedure. Section 4 introduces the experimental setup and presents the results that demonstrate the effectiveness of the framework. Section 5 discusses the limitations of the current approach and explains why multi-modal information matters for painting recognition. Finally, Section 6 concludes the paper and outlines directions for future work.
Related works
2
Vision-language models (VLMS)
2.1
Vision-language models have become a powerful approach for understanding the relationship between visual and textual information. Contrastive Language-Image Pre-training (CLIP) (Radford et al., 2021) is a key work in this area. It shows strong zero-shot capabilities by learning visual concepts from natural language supervision. CLIP uses contrastive learning to align image and text representations in a shared space. This allows zero-shot classification by computing similarity between image features and text embeddings of class names. Many works have built on CLIP's success to improve performance in different scenarios. These models work well for domain adaptation tasks. The rich semantic knowledge learned from large-scale web data can transfer to specialized domains. VLMs can understand both visual content and text descriptions. This makes them suitable for cultural heritage applications like artwork analysis, where objects may have historical or artistic significance.
Parameter efficient fine-tuning
2.2
Full fine-tuning of large pre-trained models is computationally expensive and risky. Parameter efficient methods have gained attention as alternatives. These approaches adapt pre-trained models to new tasks while updating only a small subset of parameters.
Prompt learning approaches: Context Optimization (CoOp) (Zhou et al., 2022a) introduces learnable prompts for vision-language models. Additionally, in Visual Prompt Tuning (VPT) (Jia et al., 2022) a set of learnable visual prompt embeddings is prepended to the model's input embedding space and concatenated with the original image embeddings before being fed into the model. Optimizing context vectors while keeping the pre-trained model frozen shows that learning continuous prompts significantly improves performance over hand-crafted prompts in various vision tasks (Lu et al., 2025b).
Adapter-based methods: it contains CLIP-Adapter (Gao et al., 2023) introduces lightweight adapter modules for pre-trained CLIP models. These adapters use bottleneck layers that learn task-specific transformations. They preserve the general knowledge of the pre-trained model. This approach enables efficient adaptation to new domains with minimal parameter updates (Lu et al., 2025d). LP++ (Huang et al., 2024) improves upon a simple linear probe by augmenting text features and calibrating the final classifier's weights with zero-shot statistics. While surprisingly effective for few-shot classification, its reliance on labeled data for training the probe makes it unsuitable for purely unsupervised settings.
Additive fine-tuning: LoRA (Hu et al., 2022) significantly reduces the number of trainable parameters and storage overhead by injecting trainable, paired low-rank decomposition matrices into specific model layers, while keeping the pre-trained weights frozen. In addition, some studies have shown that additionally fine-tuning the Layer Normalization (LN) parameters can further stabilize and enhance model performance, as these layers play a crucial role in governing layer activations and feature distributions (Houlsby et al., 2019, Lu et al., 2025a).
Domain adaptation
2.3
Domain adaptation tackles the challenge of transferring knowledge from a source domain to a target domain with different data distributions. This is important for specialized domains like art and cultural heritage. Visual characteristics in these domains may differ substantially from natural images used in pre-training.
Knowledge distillation for domain generalization: knowledge distillation has emerged as a promising paradigm for enhancing domain generalization by transferring robust representations from teacher to student networks. KDDG (Wang et al., 2021) introduces a regularized knowledge distillation framework that leverages “dark knowledge” from teacher networks combined with a gradient filter to improve cross-domain generalization. The method demonstrates that richer supervisory signals from teachers can reduce the difficulty of learning domain-invariant mappings. More recently, XDED (Lee et al., 2022) proposes cross-domain ensemble distillation, which promotes convergence to flat minima in the loss landscape, thereby improving generalization to unseen domains while accelerating the training process. Both methods have been extensively evaluated on multi-domain benchmarks such as PACS and OfficeHome, establishing strong baselines for distillation-based domain generalization. Our InfoMSD framework shares the teacher-student distillation philosophy but differs in two key aspects: (1) we operate in a label-free setting without requiring ground-truth annotations, and (2) we integrate information maximization objectives to ensure confident yet diverse predictions, which is particularly beneficial for artistic imagery where class boundaries are often ambiguous.
Label-free adaptation: within this paradigm, two primary strategies have emerged. One approach is pseudo-labeling, as exemplified by POUF (Tanwisuth et al., 2023). It leverages the strong zero-shot capability of the pre-trained model to generate initial pseudo-labels for an unlabeled target dataset, which are then used for self-supervised training of prompt vectors. Another strategy relies on consistency regularization, as demonstrated by LaFTer (Mirza et al., 2023). This method learns by enforcing representation consistency between different augmented views of the same unlabeled image, often guided by language to prevent model collapse.
Prior-based enhancement: CLIP with Priors (CLIP-PR) (Li et al., 2023) incorporates label distribution priors to enhance zero-shot classification performance. Different domains may have varying class distributions. This approach leverages this knowledge to improve classification accuracy (Lu et al., 2025c).
Test-time adaptation: in this paradigm, a model is adapted on-the-fly using the unlabeled test data itself to handle potential distribution shifts. TDA (Liu et al., 2024) presents an efficient approach, fine-tuning a lightweight adapter through entropy minimization of predictions on the test batch. This self-supervised signal incentivizes more confident and consistent predictions, thus improving zero-shot performance without labels. Boost Adapter (Zhang et al., 2024) aims to enhance robustness via a regional bootstrapping mechanism, which leverages region proposals to identify diverse semantic parts of an image rather than relying on predictions from the entire image.
The combination of these approaches provides a foundation for developing robust models that can recognize objects in artwork. They leverage the strengths of pre-trained vision-language models while adapting to the specific characteristics of the artistic domain through efficient and unsupervised methods.
Figure 1 illustrates the limitations of representative CLIP-based adaptation techniques when applied to artwork. Zero-shot CLIP struggles with domain misalignment under artistic styles. Visual prompt tuning introduces adaptability but risks overfitting to existing curatorial biases. CLIP-Adapter requires manual re-curation for every artwork context, while LaFTer neglects uncertainty modeling, resulting in low-confidence predictions.
Comparison of prior CLIP-based adaptation methods on artistic domain. (a) Zero-shot CLIP suffers from poor alignment under artistic style shifts. (b) Visual Prompt Tuning adapts with shallow features but overfit to prior curatorial biases. (c) CLIP-Adapter requires re-curation for each artwork. (d) LaFTer overlooks artistic information maximization, leading to low-confidence predictions.
Method
3
Contrastive language-image pre-training
3.1
Contrastive Language-Image Pre-training (CLIP) (Radford et al., 2021) has demonstrated remarkable zero-shot classification capabilities on natural images. However, it faces substantial challenges when applied to specialized domains such as artwork. The core issue stems from the distributional shift between CLIP's pre-training data and the artistic domain.
To be precise, CLIP learns from a large-scale source domain of natural images and their corresponding textual descriptions. It consists of a visual encoder and a text encoder that map images and text from their native spaces into a unified d-dimensional embedding space. For a given target image x and a set of K class labels, the standard zero-shot classification probability is computed as follows. First, a set of text prompts is created (e.g., “a photo of a {class_k}”). The model then extracts the image feature v = ϕ_v(x) and the corresponding text features {t1, …, tK}, where each tk_ = ϕ_t(Tk_). The probability p(y = k|x) is then given by:
where sim(·, ·) denotes the cosine similarity, and τ is a trainable temperature parameter learned during pre-training to scale the logits. Intuitively, this equation computes a softmax over the similarity scores between the image and all class descriptions: the higher the similarity between an image feature v and a text feature tk, the higher the probability that the image belongs to class k. The temperature τ controls the “sharpness” of the distribution—smaller values produce more confident (peaky) predictions, while larger values yield softer (more uniform) distributions.
This aforementioned distributional shift manifests in three fundamental limitations when applying the model to artwork : (1) stylistic divergence, as the visual features optimized for photographic content poorly capture artistic techniques, brushwork patterns, and color compositions; (2) temporal displacement, because objects in historical paintings appear in anachronistic contexts absent from contemporary training data; (3) artistic variance, given that the same semantic object exhibits dramatically different visual manifestations across artistic movements and individual styles. Our goal is to develop a robust classifier for object recognition in paintings across target categories without requiring manual annotation of artistic content.
Self-distillation adaptation
3.2
We propose a two-stage adaptation framework designed to enhance model performance on the target domain. The framework first utilizes a zero-shot classifier as a teacher to generate pseudo-labels from unlabeled data. Subsequently, a student model, augmented with parameter-efficient modules, learns from these labels via a self-distillation process guided by consistency regularization. Given the set of unlabeled paintings , a teacher model is first used to generate high-quality pseudo-labels. For each painting , we create a weakly augmented view . The teacher model then produces a “hard” pseudo-label Ỹ(P) by assigning the class with the highest confidence:
Here, ht denotes the teacher's classifier prototypes, generated by passing text prompts through the CLIP text encoder. In plain terms, the teacher model examines a painting and assigns it to the single class with the highest confidence score. The argmax operation selects this winning class, and one_hot converts it into a vector of zeros with a single one at the winning class position (e.g., [0, 0, 1, 0, …] if class 3 is selected). This “hard” pseudo-label then serves as the training target for the student model. These prompts can either be standard, hand-crafted templates (e.g., “a photo of a {class_k}”) or ensemble prompts generated by a Large Language Model (LLM), like LaFTer (Mirza et al., 2023).
The student model is designed for efficient adaptation by incorporating learnable visual prompts. For the same painting P, we generate a strongly augmented view, which is then processed by the visual encoder's embedding layer to produce patch embeddings E∈ℝ^N×d^ by . We then prepend a set of trainable prompt tokens to these patch embeddings. The final input sequence for the student's vision transformer, denoted as Is, is formed by this concatenation:
Here, Ecls is the special classification token, represents the learnable visual prompts (additional “hint” tokens that the model can adjust during training), and E contains the patch embeddings extracted from the input image. By concatenating these components, we inject trainable parameters into the input sequence without modifying the frozen backbone, enabling parameter-efficient adaptation.
The student's prediction, a probability distribution ŷ(P), is then obtained by passing Is through the transformer layers and the student's classifier head:
The adaptation objective is to minimize the discrepancy between the teacher's pseudo-labels and the student's predictions using a cross-entropy loss:
This is the standard cross-entropy loss commonly used in classification tasks. Since Ỹ(P) is a one-hot vector, the summation effectively reduces to −log(ŷ(P)c), where c is the pseudo-labeled class. Minimizing this loss encourages the student to assign high probability to the class predicted by the teacher. The closer the student's prediction is to the teacher's pseudo-label, the lower the loss value.
Crucially, during this process, only the visual prompts , the LayerNorm parameters of the vision encoder, and the student's classifier parameters hs are updated. This ensures parameter efficiency, with less than 1% of the total model parameters being trainable.
Information maximization for student adaptation
3.3
To further guide the student model's adaptation and mitigate the inherent uncertainty in pseudo-labeling, we incorporate an information maximization objective. This principle encourages the model to produce confident predictions for individual samples while ensuring a diverse distribution of predictions across the entire dataset. This is achieved by optimizing two complementary entropy-based losses, which are computed over a mini-batch of paintings .
First, we define a conditional entropy loss, , which encourages the student model to be decisive for each painting in the batch. It is calculated as the average entropy of predictions:
where ŷ_k_(P) is the k-th element of the student's predicted probability vector ŷ(P). Minimizing this loss pushes the predictions toward one-hot vectors, indicating high confidence. To understand this intuitively: entropy measures uncertainty. A prediction like [0.5, 0.5] (completely uncertain between two classes) has high entropy, while [0.99, 0.01] (confident prediction) has low entropy. By minimizing this term, we encourage the model to “make up its mind” and produce decisive predictions rather than hedging across multiple classes.
Second, to prevent the model from collapsing to a few classes (mode collapse), we introduce a diversity loss, . This loss maximizes the entropy of the average prediction across the batch:
Here, ȳ is the average prediction vector for the mini-batch. Maximizing this term encourages the model to utilize all available classes. Consider a failure case: if the model predicts every image as “goldfish,” the average prediction ȳ would be [1, 0, 0, …], which has zero entropy. By maximizing , we push ȳ toward a uniform distribution (e.g., [0.1, 0.1, …] for 10 classes), ensuring the model spreads its predictions across all classes rather than collapsing to a single dominant class. This prevents the well-known “mode collapse” problem in unsupervised learning.
The complete information maximization objective is a weighted combination of these two terms:
This regularization ensures that the adapted model maintains its discriminative capabilities while avoiding overconfident predictions on ambiguous artistic content.
The two terms work in complementary directions: minimizing makes individual predictions confident (low entropy per sample), while maximizing (equivalent to minimizing ) ensures diverse predictions across the batch (high entropy of average predictions). Together, they embody the principle of information maximization: the model should be certain about each individual prediction while maintaining uncertainty about which class will appear next in the dataset.
InfoMSD
3.4
Our complete training objective combines all components:
where λ controls the contribution of information maximization. The optimization alternates between pseudo-label generation and model parameter updates, with information maximization serving as a regularization mechanism that promotes robust adaptation across diverse artistic styles.
The resulting framework effectively bridges the domain gap between natural photographs and artistic paintings while maintaining computational efficiency and avoiding the need for manual annotation. The integration of information maximization ensures stable adaptation performance across the varied visual characteristics inherent in artwork.
Figure 1 illustrates the limitations of representative CLIP-based adaptation techniques when applied to artwork. Zero-shot CLIP struggles with domain misalignment under artistic styles. Visual prompt tuning introduces adaptability but risks overfitting to existing curatorial biases. CLIP-Adapter requires manual re-curation for every artwork context, while LaFTer neglects uncertainty modeling, resulting in low-confidence predictions.
To address these challenges, Figure 2 presents our proposed framework, which integrates synthetic text generation, pseudo-label-driven prompt tuning, and information-theoretic-base regularization. This approach ensures robust adaptation to diverse artistic styles without relying on labeled training data from the target domain.
Proposed framework overview. The model leverages synthetic text generation, prompt tuning, and mutual information maximization to achieve label-free adaptation for artwork.
To facilitate reproducibility, we provide a step-by-step summary of the complete InfoMSD training procedure in Algorithm 1. The algorithm consists of four main steps per iteration: (1) the teacher generates hard pseudo-labels using weak augmentations, (2) the student processes strongly augmented images with learnable visual prompts, (3) the total loss combines adaptation and information maximization objectives, and (4) only the parameter-efficient modules are updated via backpropagation. Note that unlike some self-distillation methods, our teacher remains fixed (no exponential moving average update) to maintain stable pseudo-label quality throughout training.
Algorithm 1InfoMSD: information-maximization self-distillation.
Results
4
Experiment setup
4.1
Dataset
4.1.1
To evaluate the performance of models in artistic contexts, we utilize two stylized variants of the Imagenet dataset: Imagenet-Sketch and Imagenet-Rendition. These datasets are specifically designed to simulate artistic representations by introducing significant deviations in visual style compared to natural images.
Imagenet-Sketch: Imagenet-Sketch (Wang et al., 2019) is a benchmark dataset designed to evaluate the generalization ability of visual recognition models under significant domain shifts. It comprises 50,000 hand-drawn sketches that span 1,000 object categories aligned with those in the original Imagenet dataset. Unlike natural images, these sketches are grayscale and devoid of texture, emphasizing structural features such as contours and shapes rather than color or fine-grained details. This deliberate abstraction simulates the characteristics of sketch-based representations commonly encountered in human-created artworks. As such, Imagenet-S serves as a challenging testbed for assessing a model's robustness to texture bias and its capacity to rely on high-level semantic abstractions when recognizing objects in stylized or out-of-distribution scenarios.
Imagenet-Rendition: Imagenet-Rn (Hendrycks et al., 2021) is a domain-shifted benchmark dataset consisting of approximately 54,000 images that depict objects from the original Imagenet classes rendered in various non-photorealistic styles. These include a wide range of artistic and synthetic modalities such as watercolor paintings, oil paintings, 3D computer-generated renderings, and handcrafted paper sculptures. The images exhibit significant deviations from standard natural photographs, both in terms of texture and visual style, thereby introducing substantial distributional shifts. Owing to its rich diversity of artistic abstractions, Imagenet-Rendition serves as a rigorous testbed for evaluating the robustness and generalization ability of image classification models when faced with substantial changes in visual appearance and domain characteristics.
In this section, we first describe the baseline models used for evaluation. We then present the experimental setup, including implementation details and evaluation metrics. Finally, we report and analyze the results of our proposed method compared to existing approaches. In our experiments, we use the standard class labels provided with each dataset without relabeling.
It is important to note that both Imagenet-Sketch and Imagenet-Rendition significantly diverge from the canonical Imagenet validation set in terms of texture, color, and overall visual composition, thereby offering a rigorous testbed for object recognition under stylized and artistic transformations. The dataset was randomly divided into 80% for training and 20% for testing to ensure a balanced evaluation protocol.
Evaluation results
4.1.2
Baseline: we compare our method against several recent approaches for zero-shot and pseudo-labeled image classification:
CLIP (Radford et al., 2021) performs zero-shot classification by measuring the cosine similarity between image and text embeddings extracted from frozen vision and language encoders.UPL (Zhou et al., 2022b) introduces learnable text prompts for the CLIP text encoder and updates them using confidence based pseudo labels, without requiring labeled training data.CLIP-PR (Li et al., 2023) extends CLIP by training an adapter on top of the vision encoder, leveraging label distribution priors from downstream datasets to generate more accurate pseudo-labels.LaFTer (Mirza et al., 2023) refines zero-shot classifiers using a collection of unlabeled images and language supervision from pre-trained language models, enabling label-free tuning without manual annotations.
Implementation details
4.1.3
All experiments are implemented using the Dassl.pytorch framework and conducted on a single NVIDIA RTX 4090 GPU with 24GB of memory. The vision backbone is ViT-B/32, initialized from a pre-trained CLIP model, with frozen encoders during zero-shot inference and fine-tuning applied to the parameter-efficient module only. We adopt a batch size of 50 and utilize four data loading workers. The initial learning rate is set to 0.0005, with a weight decay of 1 × 10^−4^, and training is conducted for 10 epochs, visual prompt num set to N = 50. Optimization is performed using the Adam W optimizer. Mixed-precision training (fp16) is employed throughout to accelerate computation and reduce memory consumption.
Main results
4.2
To validate the effectiveness of our proposed InfoMSD approach for artwork recognition, we conduct comprehensive experiments following the evaluation setup described above.
Our evaluation focuses on two key aspects: (1) quantitative performance comparison with state-of-the-art zero-shot and domain adaptation methods on standard benchmarks, and (2) qualitative analysis of the learned representations and their transferability to artistic domains. The experiments are designed to demonstrate how information maximization principles, enable effective knowledge transfer from natural image domains to artwork without requiring labeled artistic data.
The main quantitative results are presented in Tables 1, 2. As shown in Table 1, our InfoMSD method achieves state-of-the-art performance on both benchmarks, reaching 73.24% accuracy on Imagenet-Rendition and 44.14% on Imagenet-Sketch. This represents a significant improvement of 1.35 and 0.96% over the strong LaFTer baseline, respectively. The substantial gains over all competing methods validate the effectiveness of our proposed self-distillation framework augmented with information-theoretic regularization.
Furthermore, the Top-k accuracy results in Table 2 offer a more holistic view of our model's performance. Beyond the established Top-1 superiority, InfoMSD consistently maintains or extends its lead over LaFTer across the Top-5 and Top-10 metrics on both datasets. This consistent out-performance across the entire prediction spectrum strongly suggests that our information maximization objective does more than just boost the top prediction; it enhances the overall quality of the feature representations, leading to a more semantically coherent ranking of all potential classes.
In summary, the consistent and significant improvements across these challenging artistic-style benchmarks strongly support our hypothesis that integrating self-distillation with information maximization is a highly effective strategy for adapting vision-language models to non-photographic domains like artwork, all without requiring any labeled artistic data.
Comparison with few-shot learning methods
4.3
To further contextualize the performance of our zero-shot method, we benchmark InfoMSD against prominent few-shot learning paradigms, namely CoOp and Parameter-Efficient Fine-Tuning (PEFT). Figure 3 illustrates this comparison on the Imagenet-R and Imagenet-S datasets. The plot shows the Top-1 accuracy as a function of the number of training shots (k), where our method and LaFTer serve as zero-shot baselines (k = 0) against CoOp and PEFT, which are evaluated at k = {1, 5, 10}.
Comparison of zero-shot (InfoMSD, LaFTer) and few-shot (CoOp, PEFT) methods on Imagenet-Rendition and Imagenet-Sketch. We plot Top-1 accuracy against the number of training shots, with our method serving as a k = 0 baseline.
The results yield several key insights. At the zero-shot level, InfoMSD consistently outperforms the strong baseline LaFTer on both datasets, achieving 73.2% on Imagenet-R and 44.1% on Imagenet-S. More notably, on Imagenet-R, our zero-shot model's performance surpasses that of both CoOp and PEFT even at 10 shots, demonstrating its exceptional generalization capability and efficiency. On the more challenging Imagenet-S, while PEFT's performance scales with more data and eventually exceeds the zero-shot baseline after five shots, InfoMSD still provides a stronger starting point than 1-shot learners. This analysis underscores that InfoMSD serves as a highly competitive baseline, challenging the necessity of few-shot training in certain low-data scenarios.
Feature and output analysis
4.4
On the Imagenet-Rendition dataset, the CLIP baseline yields feature clusters that are largely entangled, with considerable overlap and poorly defined inter-class boundaries. This suggests a limited ability to separate object categories when exposed to non-photorealistic, stylistically diverse inputs. In contrast, InfoMSD produces feature embeddings that are more clearly partitioned across categories, exhibiting enhanced inter-class separability and more compact intra-class cohesion. These properties reflect a stronger alignment between semantic similarity and geometric proximity in the learned feature space.
A similar pattern is observed on the Imagenet-Sketch dataset. While CLIP features tend to form diffuse groupings with fuzzy class boundaries, InfoMSD representations demonstrate tight, well-defined clusters corresponding to individual categories. The categorical structure is more pronounced and robust to the lack of texture and color, which are characteristic challenges of sketch-based imagery.
Overall, the superior clustering quality of InfoMSD in both scenarios highlights the efficacy of our information maximization strategy. It enables the model to extract semantically meaningful and visually discriminative representations under large domain shifts, thereby supporting improved generalization to artistic and abstract visual domains. Figure 4 presents the t-SNE visualizations of the learned feature representations obtained from the CLIP baseline and our proposed InfoMSD method, evaluated on two domain-shifted datasets: Imagenet-Rendition and Imagenet-Sketch. These visualizations provide intuitive insights into the discriminative capacity and structural organization of the feature spaces induced by the two approaches.
t-SNE visualization on Imagenet Sketch: (a, b) feature representations; (c, d) output distributions. InfoMSD shows better inter-class separation than CLIP. Circles (°): images; crosses (×): text.
Ablation study
4.5
Having demonstrated the superior performance of our InfoMSD method against existing approaches, we now turn to a detailed analysis of the individual components that contribute to its effectiveness. The strong performance gains observed in Table 1 raise important questions about which specific design choices and theoretical principles drive these improvements. To provide deeper insights into our method's success and validate the necessity of each component, we conduct a comprehensive ablation study. The ablation analysis is particularly crucial for understanding how information maximization principles translate into practical performance gains in the artwork domain.
By systematically removing key components—including the adapter modules, layer normalization, visual prompt tuning, and entropy maximization can isolate the contribution of each element and justify our architectural decisions. This analysis not only validates our design choices but also provides guidance for future work in cross-domain object recognition. Table 3 presents the ablation study analyzing individual components of our InfoMSD framework. We systematically remove key components to validate their contributions.
The results demonstrate that each component contributes meaningfully to the final performance.
Parameter-efficient fine-tuning: disabling Visual Prompt Tuning causes the most significant performance degradation (20.15% on Imagenet-R and 29.38% on Imagenet-S), underscoring its indispensable role in adapting the model's feature space to artistic domains. Fine-tuning LayerNorm also proves crucial, as its removal leads to a notable drop (e.g., 3.56% on Imagenet-R), highlighting the importance of stabilizing feature statistics during domain shifts.
Information-theoretic regularization: both components of our information maximization loss are vital for refining performance. Removing the conditional entropy minimization (“w/o Entropy”) term, which encourages prediction confidence, results in a 2.90% drop on Imagenet-R. Similarly, removing the diversity maximization (“w/o Divergence”) term, which prevents mode collapse, leads to a 1.00% drop.
To further validate the generalization of our InfoMSD approach, we evaluate its performance across different Vision Transformer backbones of varying scales. This analysis demonstrates the architectural flexibility of our information maximization framework and reveals how the benefits scale with model capacity. Table 4 compares different Vision Transformer backbones to evaluate the scalability of our approach.
Our method consistently outperforms baselines across all backbone architectures. The performance gains are maintained as model capacity increases, with ViT-L14 achieving 88.89% on Imagenet-R and 61.17% on Imagenet-S. This demonstrates the scalability and robustness of our information maximization approach.
Training efficiency analysis
4.6
While performance improvements are crucial, practical deployment of domain adaptation methods also depends heavily on training efficiency and computational feasibility. Having established the effectiveness and generalization of our InfoMSD approach, we now examine its practical advantages in terms of parameter efficiency and computational requirements. Table 5 demonstrates the training efficiency of our InfoMSD method, highlighting its parameter efficiency and computational advantages.
Our method achieves remarkable parameter efficiency by updating only 0.12 and 0.39% of total model parameters on Imagenet-R and Imagenet-S respectively. The trainable parameters consist primarily of the VPT tokens, layer normalization modules, and lightweight text adapters, totaling less than 600K parameters across both datasets. The training efficiency is further demonstrated by the modest computational requirements. Training completes within 22–39 min with GPU memory usage under 6GB, making our approach highly practical for deployment scenarios with limited computational resources. Building upon LaFTer's label-free foundation, our InfoMSD method not only eliminates the need for annotated data but also significantly reduces parameter overhead and training time, establishing a highly efficient framework for artwork recognition.
Verification on natural datasets
4.7
To rigorously evaluate the generalization capabilities and robustness of our proposed method, InfoMSD, we conducted extensive experiments on a diverse benchmark of 11 publicly available datasets. This benchmark suite was curated to span a wide spectrum of visual recognition challenges, moving beyond the initial validation on Imagenet-R and Imagenet-S. The datasets encompass tasks in general object recognition [e.g., CIFAR-10/100 (Krizhevsky, 2009), Caltech-101 (Fei-Fei et al., 2004)], fine-grained visual classification [e.g., Oxford-Pets (Parkhi et al., 2012), Aircraft (Maji et al., 2013), Food-101 (Bossard et al., 2014), Flower (Nilsback and Zisserman, 2008)], and specialized domains such as satellite imagery (Eurosat) (Helber et al., 2019), texture analysis (DTD) (Cimpoi et al., 2014), scene recognition (SUN397) (Xiao et al., 2010), and action recognition (UCF101) (Soomro et al., 2012). A detailed description of each dataset is provided below:
General object recognition
-
CIFAR-10: comprises 60,000 color images (32 × 32 pixels) across 10 common object classes, with 6,000 images per class.
-
CIFAR-100: a more challenging version of CIFAR-10, featuring 60,000 images distributed over 100 fine-grained classes (600 images per class).
-
Caltech-101: a collection of 9,144 images belonging to 101 object categories, with a variable number of images per category. Fine-grained visual classification
-
Oxford-Pet (Pets): features 7,349 images of 37 cat and dog breeds, with approximately 200 images per breed.
-
FGVC-Aircraft (Aircraft): contains 10,200 images of 100 different aircraft model variants (100 images each).
-
Food-101: a large-scale dataset with 101,000 images of 101 food categories, containing 1,000 images per category.
-
Oxford-Flower (Flower): consists of 8,189 flower images from 102 different species, with image counts per species ranging from 40 to 258. Specialized domain classification
-
Eurosat: a dataset of 27,000 satellite images for land use and land cover classification, divided into 10 categories.
-
Describable textures dataset (DTD): includes 5,640 texture images across 47 categories, with 120 images for each.
-
SUN397: a comprehensive scene recognition dataset with over 100,000 images from 397 distinct scene types.
-
UCF101: an action recognition dataset containing 13,320 video clips from 101 action categories. For our experiments, representative frames are extracted for static image classification.
We benchmark InfoMSD against the foundational zero-shot CLIP model. The detailed performance metrics, including Top-k accuracy, are presented in Tables 6, 7. The results unequivocally demonstrate the superiority of our method. As shown in the tables, InfoMSD consistently outperforms the CLIP baseline across nearly all datasets and metrics.
On the smaller-scale datasets (Table 6), the performance gains are particularly striking. For instance, InfoMSD achieves a remarkable +44.13% increase in Top-1 accuracy on Eurosat, boosting performance from 35.57 to 79.70%. Substantial improvements are also observed on CIFAR-10 (+7.11%), Oxford-Pets (+9.46%), and DTD (+9.39%), highlighting our method's efficacy on tasks with both coarse and fine-grained distinctions in a limited class setting.
A direct comparison against the competitive LaFTer baseline was conducted to quantify the performance advantage of InfoMSD. Figure 5 visualizes the absolute improvement in Top-1 accuracy on all 11 datasets, which are sorted in descending order of the performance gain for clarity. The results demonstrate a consistent and often substantial advantage for our method. The most significant gain is observed on Eurosat, with a remarkable +5.80% improvement, underscoring InfoMSD's efficacy in specialized domains. Substantial improvements exceeding 2.0% are also registered on other challenging datasets, including fine-grained classification tasks such as DTD (+2.61%), Pets (+2.53%), and Aircraft (+2.43%), as well as the scene recognition benchmark SUN397 (+2.00%). While the gains are more modest on general object recognition datasets like CIFAR-10 (+0.47%) and Food101 (+0.33%)—where baseline performance is already high—InfoMSD still maintains a clear and positive margin. Crucially, the universal outperformance across every dataset, irrespective of its domain or complexity, provides compelling evidence of InfoMSD's superior robustness and generalization capabilities compared to LaFTer.
Top-1 accuracy improvement of InfoMSD over the LaFTer baseline across 11 datasets. The bar chart displays the absolute performance gain (%), with datasets sorted by the magnitude of the improvement.
In summary, the comprehensive evaluation across these 11 diverse datasets provides compelling evidence of InfoMSD's effectiveness. The consistent and often substantial improvements over both the foundational CLIP model and a competitive method like LaFTer underscore its superior generalization ability for zero-shot classification tasks.
Discussion
5
The InfoMSD method exhibits several inherent limitations that warrant discussion. First, the approach requires simultaneous optimization of information maximization objectives and cross-modal alignment, resulting in higher computational overhead compared to traditional uni-modal approaches. This increased complexity may present efficiency bottlenecks when processing large-scale artwork datasets. Additionally, due to the adoption of unsupervised domain adaptation with information maximization strategies, the model performance exhibits sensitivity to initial parameter settings, where different initializations may lead to convergence to distinct local optima, affecting stability and reproducibility. Furthermore, while the method demonstrates superior performance in artwork recognition, its generalization capability to other artistic styles such as contemporary abstract art or digital art requires further empirical validation.
Visual interpretability methods for vision-language models
5.1
Interpreting deep neural networks is essential for building trust, ensuring accountability, and diagnosing model behavior, especially in safety-critical or domain-shifted scenarios. In this section, we review four widely-used post-hoc visual explanation techniques—Grad-CAM, LIME, SHAP, and MM-SHAP—that aim to attribute model predictions to input features or modalities. These methods differ in their theoretical assumptions, applicability to model architectures, and granularity of interpretation. We present their underlying mathematical formulations and highlight how each captures distinct perspectives on model behavior, ranging from spatial saliency (Grad-CAM) to feature and modality contributions (SHAP, MM-SHAP).
Grad-CAM: Gradient-weighted Class Activation Mapping (Selvaraju et al., 2017) highlights salient regions by weighting feature maps with class-specific gradients. Given a target class score y^c^ and activation maps A^k^∈ℝ^H×W^, the importance of channel k is:
where Z = H×W. These weights modulate the activation maps to produce the Grad-CAM heatmap:
This results in a class-discriminative saliency map localized in the input space.
LIME: Local Interpretable Model-agnostic Explanations (Ribeiro et al., 2016) approximates the decision boundary of a black-box model f around an input x using an interpretable model g. It perturbs x to form samples , then solves:
Here, defines locality via a kernel (e.g., cosine or exponential distance), and Ω(g) encourages sparsity for interpretability. The learned g is then interpreted to explain f(x).
SHAP: Shapley Additive Explanations (Mosca et al., 2022) assigns each feature i a value ϕ_i_ representing its average marginal contribution across all feature coalitions:
where . In practice, SHAP approximates this via sampling:
This guarantees consistency and local accuracy under mild conditions.
MM-SHAP: performance-agnostic Metric for Measuring Multimodal Contributions (Parcalabescu and Frank, 2023) generalizes SHAP to multimodal inputs. Let M = {m1, …, mK} be the modalities. The Shapley value of modality mi is:
with . A Monte Carlo estimate is:
This quantifies each modality's contribution, independent of accuracy, enabling fine-grained attribution in vision-language systems.
Why are multimodal methods better than single-modality in artwork recognition?
5.2
We employ open-source explanation tools—Grad-CAM, LIME, SHAP, and MM-SHAP—solely to analyze and illustrate the behavior of a pretrained multimodal model (CLIP). These tools are not proposed by this work; they are used to expose how multimodal alignment manifests in practice.
From visuals to evidence
5.2.1
Our claim that multimodal models surpass unimodal ones is supported—without introducing new experiments—by four complementary lines of evidence observed in Figure 6.
Open-source explanations evidencing multimodal benefits (methods not proposed here). For both rendition and sketch styles, Grad-CAM localizes the goldfish body; LIME selects sparse, object-relevant superpixels; SHAP yields consistent positive attributions along object contours. MM-SHAP further quantifies cross-modal consistency: the true caption “goldfish” attains higher image-sentence alignment (ISA; e.g., 30.17 for rendition and 34.87 for sketch) than foils (“penguin”/“elephant”), revealing textual counterfactual sensitivity. The modality contributions adapt with style: higher T-SHAP in rendition (e.g., 67.61%) and more balanced T/V-SHAP in sketch (e.g., 48.98%), indicating stronger reliance on visual evidence under abstraction. Together, these visuals provide convergent support from location, feature importance, semantic alignment, and modality allocation.
(E1) Textual counterfactual sensitivity (real use of the second modality). Holding the image fixed while replacing the true caption goldfish with foils (penguin/elephant) consistently lowers the Image-Sentence-Alignment (ISA), with the true caption remaining higher (e.g., 30.17/34.87 vs. markedly smaller for foils). If the model did not exploit text, such systematic ISA separation would not occur; hence the text modality is functionally engaged.
(E2) Cross-method consistency (non-accidental evidence). Grad-CAM highlights the goldfish body, LIME selects object-coherent superpixels, and SHAP concentrates positive contributions along semantic contours. MM-SHAP integrates these visual cues with text by summarizing alignment (ISA) and per-modality contributions (T-/V-SHAP). Agreement across heterogeneous tools—spatial saliency, feature-level attribution, and multimodal attribution—reduces the risk of explanation idiosyncrasies and strengthens interpretive confidence.
(E3) Modality adaptation (a robustness mechanism). In rendition images, T-SHAP is higher, indicating stronger use of textual priors; in sketch images, V-SHAP rises and the contributions become more balanced. This adaptive reallocation of evidence between text and vision is a capability unimodal models lack, and it explains why semantic alignment remains stable when visual detail is abstracted.
(E4) Semantic alignment rather than mere saliency. Unimodal heatmaps primarily reflect where the image is visually striking, not why a specific concept is predicted. By directly relating image regions to caption semantics, MM-SHAP and ISA target the task objective: the true caption aligns with the object while foils weaken alignment. Thus, multimodal explanations answer the semantic “why” beyond highlighting the visually conspicuous.
The explainability analysis in Section 5.2 directly validates InfoMSD's core mechanisms. First, the entropy minimization term ( ) encourages confident predictions, which manifests as focused Grad-CAM heatmaps concentrated on semantically relevant regions (e.g., the goldfish body) rather than scattered attention. Second, the diversity loss ( ) maintains discriminative class boundaries, enabling meaningful MM-SHAP counterfactual analysis—swapping “goldfish” with “penguin” produces substantial ISA drops because the model preserves distinct class representations. Third, the adaptive T-SHAP/V-SHAP modality weighting (higher text reliance for renditions, more balanced for sketches) reflects how our visual prompts learn domain-specific compensations. Together, these observations confirm that InfoMSD's information-theoretic objectives translate into interpretable and trustworthy decision-making patterns for artwork recognition.
Robustness under style shift
5.2.2
Sketch inputs dilute texture and edges, making pure vision cues less separable (LIME regions become less distinct; SHAP exhibits higher noise). Yet the multimodal readout in Figure 6 maintains a higher ISA for the true caption and rebalances T/V contributions. When visual evidence weakens, textual semantics and cross-modal alignment compensate, yielding more stable decisions than unimodal alternatives.
Without adding experiments, the existing visuals already constitute a coherent argument: (i) textual counterfactuals modulate alignment, evidencing genuine use of text; (ii) diverse explanation tools converge on the same object and concept; (iii) modality contributions adapt to input style, providing a plausible robustness mechanism; and (iv) alignment measures capture semantic consistency rather than saliency alone. Collectively, these observations explain why multimodal modeling offers superior interpretability and stability over single-modality recognition in our setting.
Limitations on benchmark datasets
5.3
A further limitation concerns the scope of our experimental benchmarks. One reviewer suggested evaluating on additional domain generalization datasets such as PACS. In our study, we chose LaFTer as the primary baseline due to its significant influence as a state-of-the-art label-free adaptation method for vision-language models in recent years. However, LaFTer's framework requires dataset-specific text corpus generation through large language models (LLMs) to construct domain-relevant textual knowledge for each benchmark. Unfortunately, LaFTer does not provide pre-generated text corpora for datasets like PACS or WikiArt. Furthermore, publicly available museum-curated datasets with object-level annotations remain scarce, as most existing art datasets (e.g., WikiArt, Pandora-18K) focus on style or artist classification rather than semantic object recognition. If we were to independently generate text corpora for these datasets, it could introduce inconsistencies and potentially unfair comparisons, as the quality and coverage of LLM-generated descriptions may vary depending on prompt engineering and generation strategies.
We acknowledge this as a limitation of the current work. In future studies, we plan to (1) develop a standardized protocol for generating text corpora across diverse artistic datasets to ensure fair comparisons, (2) extend our evaluation to include style-oriented benchmarks such as WikiArt and Pandora-18K, and (3) explore hybrid recognition systems that jointly model both semantic content and artistic style attributes. We sincerely appreciate the reviewer's constructive suggestion, which will guide the direction of our follow-up research.
Conclusions
6
This study presents InfoMSD, a novel framework for object recognition in artwork that integrates information maximization with self-distillation under a zero-shot vision-language paradigm. By addressing the domain gap between natural and artistic images, InfoMSD enables more accurate representation learning in the absence of labeled training data.
The proposed method leverages vision-language priors and enhances them through an unsupervised optimization strategy that emphasizes discriminative feature extraction tailored to artistic imagery. Extensive experiments across multiple painting datasets demonstrate that InfoMSD consistently outperforms baseline methods, including CLIP, CLIP-PR, UPL, and LaFTer, particularly in cases involving stylistic abstraction and underrepresented object categories.
Beyond empirical performance, this work contributes a domain-adaptive approach that bridges computer vision and art analysis. It establishes a foundation for further research into explainable and culturally informed recognition systems, advancing the broader field of computational art understanding.
Furthermore, future work will explore scene-level understanding by modeling spatial and compositional relationships among multiple objects within a painting. This includes parsing visual hierarchies, spatial attention, and narrative structures embedded in complex scenes. Finally, we aim to develop interpretable models that facilitate collaboration with art historians. This includes employing explainable AI techniques such as attention-based saliency maps, concept attribution, and counterfactual generation to enhance transparency and domain trust in art-specific recognition systems.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Bossard L. Guillaumin M. Van Gool L. (2014). “Food-101-mining discriminative components with random forests,” in Computer Vision-ECCV 2014 (Cham: Springer), 446–461. doi: 10.1007/978-3-319-10599-4_29 · doi ↗
- 2Cimpoi M. Maji S. Kokkinos I. Mohamed S. Vedaldi A. (2014). “Describing textures in the wild,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (Columbus, OH: IEEE), 3606–3613. doi: 10.1109/CVPR.2014.461 · doi ↗
- 3Ezeji I. N. Adigun M. Oki O. (2024). Computational complexity in explainable decision support system: a review. J. Intell. Fuzzy Syst. 1–16. doi: 10.3233/JIFS-219407. [Epub ahead of print]. · doi ↗
- 4Fei-Fei L. Fergus R. Perona P. (2004). “Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories,” in Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshop (Washington, DC: IEEE), 178. doi: 10.1109/CVPR.2004.383 · doi ↗
- 5Gao P. Geng S. Zhang R. Ma T. Fang R. Zhang Y. . (2023). CLIP-Adapter: better vision-language models with feature adapters. Int. J. Comput. Vision 132, 581–595. doi: 10.1007/s 11263-023-01891-x · doi ↗
- 6Helber P. Bischke B. Dengel A. Borth D. (2019). Euro SAT: a novel dataset and deep learning benchmark for land use and land cover classification. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 12, 2217–2226. doi: 10.1109/JSTARS.2019.2918242 · doi ↗
- 7Hendrycks D. Basart S. Mu N. Kadavath S. Wang F. Dorundo E. . (2021). “The many faces of robustness: a critical analysis of out-of-distribution generalization,” in Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) (New York, NY: IEEE), 8917–8926. doi: 10.1109/ICCV 48922.2021.00823 · doi ↗
- 8Houlsby N. Giurgiu A. Jastrzebski S. Morrone B. De Laroussilhe Q. Gesmundo A. . (2019). “Parameter-efficient transfer learning for NLP,” in Proceedings of the 36th International Conference on Machine Learning, Vol. 97 (Cambridge, MA: PMLR), 2790–2799.
