Dual Expert Distillation Network for Generalized Zero-Shot Learning
Zhijie Rao Jingcai Guo Xiaocheng Lu Jingming Liang Jie Zhang Haozhao Wang Kang Wei Xiaofeng Cao


Learning Syntax Without Planting Trees: Understanding When and Why Transformers Generalize Hierarchically
    Kabir Ahuja1  Vidhisha Balachandran2   Madhur Panwar3    Tianxing He1   Noah A. Smith1   Navin Goyal3   Yulia Tsvetkov1 



1 University of Washington 
2 Carnegie Mellon University 
3 Microsoft Research





    
===================================================================================================================================================================================================================




Zero-shot learning has consistently yielded remarkable progress via modeling nuanced one-to-one visual-attribute correlation. Existing studies resort to refining a uniform mapping function to align and correlate the sample regions and subattributes, ignoring two crucial issues: 1) the inherent asymmetry of attributes; and 2) the unutilized channel information. This paper addresses these issues by introducing a simple yet effective approach, dubbed Dual Expert Distillation Network (DEDN), where two experts are dedicated to coarse- and fine-grained visual-attribute modeling, respectively. Concretely, one coarse expert, namely cExp, has a complete perceptual scope to coordinate visual-attribute similarity metrics across dimensions, and moreover, another fine expert, namely fExp, consists of multiple specialized subnetworks, each corresponds to an exclusive set of attributes. Two experts cooperatively distill from each other to reach a mutual agreement during training. Meanwhile, we further equip DEDN with a newly designed backbone network, i.e., Dual Attention Network (DAN), which incorporates both region and channel attention information to fully exploit and leverage visual semantic knowledge. Experiments on various benchmark datasets indicate a new state-of-the-art. Code is available at https://github.com/zjrao/DEDNgithub.com/zjrao/DEDN




§ INTRODUCTION




Recognizing unknown categories in the open environment is a critical challenge for automatic recognition systems. Zero-Shot Learning (ZSL) <cit.> that serves as a promising solution has received increasing attention, which is inspired by human text-to-image reasoning capabilities. The objective of ZSL is to transfer the visual knowledge of seen classes to the unseen domain by virtue of shared semantic information, thus empowering the model to recognize the unseen classes. More trickily, Generalized Zero-Shot Learning (GZSL) <cit.> requires recognizing samples from both seen and unseen classes in the inference phase.

Mainstream studies broadly follow two routes, generative <cit.><cit.><cit.> and embedding techniques <cit.><cit.><cit.>, where most of the schemes are devoted to mining and constructing class-wise visual-attribute relations. To strengthen the fine-grained perceptual capabilities of the model, recent research has invested considerable effort into modeling local-subattribute correlations <cit.><cit.><cit.>. The motivation is to build a refined pairwise relation map via searching and binding subattributes and the corresponding region visual features (Figure <ref> (a)). Despite their contribution to boosting performance, the inherent asymmetry of attributes remains undiscussed, and the channel information is not fully exploited. 

The asymmetry of attributes stems from the fact that 1) the semantic dimensions between attributes are heterogeneous or even antagonistic. Take the SUN dataset <cit.> as an example, where 38 attributes (studying, playing, etc.) describe the function of one scene, while 27 attributes (trees, flowers, etc.) describe the entities in the scene. It can be obviously observed that the former are abstract and global, while the latter are concrete and local; 2) the visual features corresponding to attributes are intertwined. For example, neighboring regions tend to be more semantically similar, a phenomenon that is exacerbated by the local information fusion mechanism of the convolutional kernel, which leads to difficulties in accurately locating fine-grained attributes such as head, crown, and so on. 

In this paper, we revisit the task of modeling visual-attribute relations from the perspective of attribute annotations. Given the inherent complexity of attribute descriptions, existing learning paradigms are virtually forcing a single model to undertake a multi-objective hybrid task, which is ideally appealing yet empirically challenging. Naturally, we employ the idea of divide-and-conquer to release the pressure of a single model. We meticulously decompose the hybrid task into multiple subtasks, i.e., dividing the attributes into multiple disjoint clusters and assigning specialized learnable networks to them. Our approach is referred to as, Dual Expert Distillation Network, abbreviated DEDN. As shown in Figure <ref>, our approach sets up two experts. cExp, in line with common practices, is equipped with complete attribute perception capability to harmonize holistic visual-attribute measure results. fExp, consists of multiple subnetworks, where each subnetwork is only responsible for capturing the characteristics of a specific attribute cluster. During the training phase, we encourage the two to learn cooperatively to compensate for their respective deficiencies in a mutually distilling manner. The decision results of the two experts are combined for final inference.

For the issue of underutilized channel information, we design a novel attention network, Dual Attention Network (DAN), as the backbone. DAN employs a dual-attention mechanism that fully exploits the potential semantic knowledge of both regions and channels to facilitate more precise visual-attribute correlation metrics. To further boost performance, we present Margin-Aware Loss (MAL) as the training loss function to address the confidence imbalance between seen and unseen classes.

Our contributions are summarized below:



    
  * We rethink the issue of modeling visual-attribute relations from the perspective of attribute annotations and point out that the inherent complexity of attributes is one of the major bottlenecks. We propose a simple yet effective strategy of establishing two experts working on distinct attribute perception scopes to learn and infer collaboratively in a complementary manner.

    
  * We present a novel attention network, dubbed DAN, which incorporates both region and channel attention information to better capture correlations between visuals and attributes. Furthermore, a new learning function named MAL is designed to balance the confidence of seen and unseen classes.

    
  * We conduct extensive experiments on mainstream evaluation datasets, and the results show that the proposed method effectively improves the performance.
    




§ RELATED WORK


In ZSL/GZSL, attributes are the only ties that bridge seen and unseen classes, hence exploring and constructing the link between visuals and attributes is a core subject. Existing methods fall into class-wise visual-attribute modeling, which treats both visual features and attribute vectors as a whole, and regional visual-subattribute modeling, which seeks to explore the correlation between local visual information and subattributes.



 §.§ Class-wise Visual-Attribute Modeling


Mainstream researches broadly follow two technical routes, generative and embedding techniques. Generative techniques utilize the latent distribution fitting ability of generative models such as GAN and VAE to implicitly learn the relationship between attributes and categories to construct hallucinatory samples of unseen classes <cit.><cit.><cit.><cit.><cit.><cit.><cit.><cit.>. The technical bottleneck of this route is the poor realism of the hallucinatory samples, thus many studies incorporate other techniques such as meta-learning <cit.>, representation learning <cit.><cit.><cit.><cit.><cit.>, etc. for joint training. Embedding techniques aim at projecting visual and attribute features to a certain space, from which the most similar semantic information is searched. In general, embedding techniques are categorized into three directions: visual-to-attribute space <cit.><cit.><cit.><cit.>, attribute-to-visual space <cit.><cit.>, and common space <cit.><cit.>. Researchers in the first two directions invest considerable effort in designing robust mapping functions to cope with domain shift and out-of-distribution generalization problems. The third direction centers on finding a suitable semantic space. Class-level visual-attribute modeling lacks the fine-grained perceptual ability to respond to interactions between local visual features and subattributes.





 §.§ Region-wise Visual-Attribute Modeling


Region-wise modeling is a promising direction in embedding techniques. Unlike other embedding approaches, region-wise modeling focuses on the correlation between local information and subattributes to build more detailed mapping functions. Models based on attention mechanisms are the dominant means in this direction, motivated by training models to search for corresponding visual features based on semantic vectors. Recent approaches include feature-to-attribute attention networks <cit.><cit.>, bidirectional attention networks <cit.>, and multi-attention networks <cit.>. In addition, some studies resort to prototype learning, where the goal is to explicitly learn the corresponding prototypical visual features of individual subattributes, thus aiding the model's judgment <cit.><cit.>. Further, modeling the topological structure between regional features with the help of graph convolution techniques also yields promising results <cit.><cit.>. While the main idea of these approaches is to design appropriate attention networks or regularization functions, ignoring the inherent complexity of attribute annotations, we provide a new perspective to think about the visual-attribute modeling problem. In addition, existing region-attribute methods, although achieving good results, neglect the utilization of channel information, and we design a new attention network that utilizes both region and channel information.



§ METHODOLOGY




 §.§ Preliminary


Following previous studies <cit.><cit.>, we adopt a fixed feature extractor, ResNet-101 <cit.>, to extract visual features. Suppose 𝒟^s= {(F_i^s, Y_i^s)} denotes the seen classes, where F_i^s is the visual feature and Y_i^s denotes its label. Note that F∈ℝ^C× H× W, where C, H, W are the channel number, height, and width, respectively. Similarly have 𝒟^u= {(F_i^u, Y_i^u)} to denote the unseen classes. Normally, the visual features of the unseen classes are not accessible during the training phase. Alternatively, we have the shared attribute A∈ℝ^K× D, where K denotes the total number of categories, and D denotes the number of attributes. Also, we use the semantic vectors of each attribute learned by GloVe, denoted by V∈ℝ^D× G, where G denotes the dimension of the vector.



 §.§ Overview


Our approach is shown in Figure <ref> (Left). First, we disassemble the attribute set into multiple clusters based on their characteristics. Then the attribute vectors and the visual feature are fed into cExp and fExp simultaneously. cExp directly computes the scores of all attributes on that visual feature, while the scores of fExp are obtained by combining the computation results of each subnetwork. We constrain the two to learn from each other using distillation loss. Meanwhile, we introduce DAN as the backbone and MAL as the optimization objective.



 §.§ Dual Attention Network


Firstly we introduce the proposed novel backbone network, Dual Attention Network (DAN). Mining and constructing relations between visual features and attributes is crucial for zero-shot learning. Recently many works have been devoted to modeling the association between regions and attributes, such as attention-based approaches <cit.><cit.><cit.> and prototype-based techniques <cit.><cit.>. However, these methods only focus on the semantic information of regions and ignore the role of channels. Therefore, DAN incorporates both the attention information of regions and channels to promote the efficacy of the model in utilizing visual features.

As shown in Figure <ref> (Right), DAN contains two parallel components that model region-attribute and channel-attribute relations, respectively. We first introduce the region-attribute component. We have visual features F∈ℝ^C× H× W, which is flattened to F∈ℝ^C× R, where R=H× W denotes the number of regions. Let W_1, W_2∈ℝ^G× C denote two learnable matrices. W_1 maps the attribute vectors to the visual space and computes their similarity. The formula is expressed as:

    S_r = VW_1F,

where S_r∈ℝ^D× R represents the score obtained for each attribute on each region. W_2 is in charge of computing the attention weights to encourage the model to focus on the region-attribute pairs with the highest similarity. The formula is expressed as:

    A_r = VW_2F/∑_r∈ RVW_2F_r,

where A_r∈ℝ^D× R denote the normalized weight obtained by softmax. Then we naturally get the weighted matrix of scores, represented as:

    O_r = ∑_R S_r× A_r,

where O_r∈ℝ^D represents the similarity score obtained for each attribute on a visual feature. 

Next, we introduce the channel-attribute section, which has a similar principle. We have the scaled visual feature F∈ℝ^R× C and W_3, W_4∈ℝ^G× R. Then W_3 is charged with calculating the similarity score obtained by the attribute on each channel, formulated as:

    S_c = VW_3F,

where S_c∈ℝ^D× C. And W_4 computes its attention weights:

    A_c = VW_4F/∑_c∈ CVW_4F_c,

where A_c∈ℝ^D× C. Finally, we get the weighted score map:

    O_c = ∑_C S_c× A_c,

where O_c∈ℝ^D. We expect the final scores of attributes from different scale features to be consistent, i.e., semantic consistency. Therefore we employ ℒ_align, which contains a Jensen-Shannon Divergence (JSD) and a Mean Squared Error, to align the outputs of both, formulated as:

    ℒ_align=1/2(ℒ_KL(O_r||O_c)+ℒ_KL(O_c||O_r))+||O_r-O_c||_2^2,

where ℒ_KL denotes Kullback-Leibler Divergence. In the inference phase, we use the weighted sum of O_r and O_c as the final output, expressed as:

    O=λ_rc× O_r+(1-λ_rc)× O_c,

where λ_rc is a hyperparameter.



 §.§ Dual Expert Distillation Network


Despite the fact that DAN enhances the modeling capability of the network, it is extremely challenging for a single model to simultaneously handle attributes with different semantic dimensions as well as visual features with different granularities. To this end, we propose the Dual Expert Distillation Network (DEDN) to alleviate the pressure on a single network (Figure <ref> (left)). cExp is set up with a complete attribute-aware scope as in conventional practice. Specifically, the input of cExp is the semantic vectors of all attributes, and the output is the similarity scores of all attributes. Denote cExp by ϕ_ec={W_1^ec, W_2^ec, W_3^ec, W_4^ec}, the output is defined as:

    O_ec=ϕ_ec(V, F),

where O_ec∈ℝ^D and V∈ℝ^D× G.

fExp consists of multiple subnetworks, each focusing on a specific attribute cluster. At first, we elaborate on how the attribute clusters are divided. Since attribute annotations are manually labeled based on semantics, they are inherently clustered in nature. For example, in the SUN dataset <cit.>, the top 38 prompts are used to describe the scene function. Therefore, it is easy to perform the division by human operation, Chat-GPT <cit.>, or clustering algorithm. It requires a trivial amount of effort but is worth it. 

Assuming that the attribute set is divided into Q disjoint clusters, i.e. V={V_1∈ℝ^D_1× G, V_2∈ℝ^D_2× G, ..., V_Q∈ℝ^D_Q× G}, where D_1+D_2+...+D_Q=D. Accordingly, there are Q subnetworks for fExp to handle these attribute clusters one-to-one. Let ϕ_ef={ϕ_ef^1, ϕ_ef^2, ..., ϕ_ef^Q} denotes fExp, then the output is defined as:

    O_ef=ϕ_ef^1(V_1, F)⊕ϕ_ef^2(V_2, F)⊕...⊕ϕ_ef^Q(V_Q, F),

where ⊕ denotes concat operation.

After that, we calculate the score of each category for training and inference. Specifically, we compute the similarity with the output of the expert and the attributes of each category, defined as:

    P_ec=O_ecA^𝖳, P_ef=O_efA^𝖳,

where P_ec, P_ef∈ℝ^K. To facilitate cooperative learning between two expert networks, we introduce distillation loss to constrain their semantic consistency. Concretely, the distillation loss contains a Jensen-Shannon Divergence (JSD) and a Mean Squared Error, defined as:

    ℒ_distill=1/2(ℒ_KL(P_ec||P_ef)+ℒ_KL(P_ef||P_ec))+||P_ec-P_ef||_2^2.




 §.§ Margin-Aware Loss


Once the category scores are obtained, the network is optimized by using the cross-entropy loss, which is formulated as:

    ℒ_ce=-logexp(P_ec^y)/∑_y_i^Kexp(P_ec^y_i),

where y is the ground truth. The loss of P_ef ditto. Note that we next narrate with P_ec only, and the principle is the same for P_ef.

Due to the lack of access to samples from the unseen classes during the training phase, the scores of the unseen classes are relatively low and thus cannot compete with the seen classes in GZSL. To address this problem, the common practice <cit.><cit.> is to add a margin to the scores:

    PM_ec = [P_ec^1-ϵ, ..., P_ec^N-ϵ, P_ec^N+1+ϵ,..., P_ec^K+ϵ],

where ϵ is a constant, P_ec^1∼ P_ec^N are seen classes score, and P_ec^N+1∼ P_ec^K are unseen classes score. However, this method leads to misclassification of seen classes that would otherwise be correctly predicted. In order to maintain the correctness of the predicted classes while enhancing the competitiveness of the unseen classes. We propose Margin-Aware Loss (MAL), which takes the form:

    0.99!ℒ_mal=-logexp(P_ec^y-2ϵ)/exp(P_ec^y-2ϵ)+∑_y_i≠ y^𝒮exp(P_ec^y_i+ϵ)+∑^𝒰exp(P_ec^y_i),

where 𝒮, 𝒰 denote seen and unseen classes, respectively. In contrast to the cross-entropy loss, MAL reactivates the confidence of the predicted class to ensure that it stays ahead in the margin-processed scores, while suppressing the confidence of the other seen classes to ensure the competitiveness of the unseen classes.



 §.§ Summarize


In the training phase, the basic training loss of cExp stems from the classification and the alignment loss, which is expressed as:

    ℒ_ec=ℒ_mal^ec+βℒ_align^ec,

where β is a hyperparameter. Similarly, we have the basic training loss of fExp:

    ℒ_ef=ℒ_mal^ef+βℒ_align^ef.

Then the final loss is obtained from the combination of basic losses and distillation loss, denoted as:

    ℒ_DEDN=ℒ_ec+ℒ_ef+γℒ_distill,

where γ is a hyperparameter.

In the inference phase, the recommendations of the two experts are combined and used for final judgment. The predicted result is expressed as:

    maxλ_e× P_ec+(1-λ_e)× P_ef,

where λ_e is a hyperparameter.



§ EXPERIMENTS


Datasets. We conduct extensive experiments on three benchmark datasets to verify the effectiveness of the method, including CUB (Caltech UCSD Birds 200) <cit.>, SUN (SUN Attribute) <cit.>, and AWA2 (Animals with Attributes 2) <cit.>. We split all datasets following <cit.>. CUB comprises 200 bird species totaling 11,788 image samples, of which 50 categories are planned as unseen classes. We use class attributes for fair comparison, which contain 312 subattributes. SUN has a sample of 717 different scenes totaling 14,340 images, where 72 categories are unseen classes. Attribute annotations are 102-dimensional. AWA2 includes 50 classes of assorted animals totaling 37,322 samples, of which 10 categories are considered unseen classes. Its number of attributes is 85.


Evaluation Protocols. We perform experiments in both the Zero-Shot learning (ZSL) and Generalized Zero-Shot learning (GZSL) settings. For ZSL, we employ top-1 accuracy to evaluate the performance of the model, denoted as T. For GZSL, we record the accuracy for both seen classes, and unseen classes, denoted as S, and U, respectively. We also record the harmonic mean H, which is computed as, H=(2×S×U)/(S+U).


Implementation Details. For a fair comparison, we use the fixed ResNet-101 <cit.> without finetune as the feature extractor. We set the batch size to 50 and the learning rate to 0.0001. The RMSProp optimizer with the momentum set as 0.9 and weight decay set as 1e-4 is employed. For hyperparameters, [β, γ] are fixed to [0.001, 0.1]. We empirically set [λ_rc, λ_e] to [0.8, 0.9] for CUB, [0.95, 0.3] for SUN, [0.8, 0.5] for AWA2. Subsequent experimental analyses show that the performance of our method has low sensitivity to hyperparameters. For attribute clusters, we classify attribute sets according to their characteristics, and the results are shown in Table <ref>.





 §.§ Compared with State-of-the-arts


To evaluate the performance of the proposed method, we compare it with the state-of-the-art various methods. Generative methods: f-CLSWGAN (CVPR '18) <cit.>, f-VAEGAN-D2 (CVPR '19) <cit.>, TF-VAEGAN (ECCV '20) <cit.>, E-PGN (CVPR '20) <cit.>, CADA-VAE (CVPR '19) <cit.>, FREE (ICCV '21) <cit.>, SDGZSL (ICCV '21) <cit.>, CE-GZSL (CVPR '21) <cit.>, VS-Boost (IJCAI '23) <cit.>; Embedding methos: LFGAA (ICCV '19) <cit.>, APN (NeurIPS '20) <cit.>, DCN (NeurIPS '18) <cit.>, HSVA (NeurIPS '21) <cit.>; Region-Attribute modeling: SGMA (NeurIPS '19) <cit.>, AREN (CVPR '19) <cit.>, DAZLE (CVPR '20) <cit.>, MSDN (CVPR '22) <cit.>.





The experimental results are shown in Table 1. Our method achieves the best performance in seven metrics and second place in one metric. For Generalized Zero-Shot Learning (GZSL), we beat VS-Boost by 2% in the H-score of CUB, a fine-grained bird dataset whose attribute annotations possess explicit correspondences to visual features. It demonstrates the superiority of the proposed method for fine-grained modeling. On the SUN and AWA2 datasets, we obtain the best and second-best results in H-score, respectively. These two datasets have fewer attributes and contain complex semantic dimensions, including abstract, concrete, etc. The experimental results demonstrate the effectiveness of the proposed method in deconstructing complex tasks to alleviate the modeling pressure of a single network. In addition, the U-scores of our method on all three datasets are well ahead of the others, demonstrating that the proposed method effectively captures the relationship between attributes and visuals to generalize to unseen classes.

For Zero-Shot Learning (ZSL), we achieve the highest top-1 accuracy on the SUN and AWA2 datasets, as well as competitive performance on CUB. Specifically, our method outperforms TF-VAEGAN by 1.4% on the SUN dataset. On AWA2, we have a 2.4% lead relative to the second-place E-PGN. The experimental results validate the superiority of the proposed method. Notably, our method achieves far better results than existing region-attribute modeling methods in both ZSL and GZSL settings, which implies the potential of attribute intrinsic asymmetry and channel information is not fully exploited.



 §.§ Ablation Study


To evaluate the role of each module, we perform a series of ablation experiments. The results of the experiments are shown in Table <ref>. Comprehensively, removing any of the modules leads to different degrees of performance degradation, verifying the rationality and necessity of the design of each module. Concretely, it is observed that the performance of cExp is slightly lower than that of fExp without the distillation loss constraint, which indicates the potential research value of the inherent asymmetry of the attributes. Meanwhile, without distillation, the performance of DEDN is higher than both cExp and fExp, demonstrating the complementary properties of the dual experts. In addition, it is worth noting that DAN removing the channel attention results in a substantial performance degradation, demonstrating the importance of channel information. Moreover, the role of ℒ_mal in balancing the confidence of unseen and seen classes can be observed from the metrics U and S. When ℒ_mal is removed, the metric U increases dramatically while S decreases dramatically. Finally, the results also demonstrate the importance of ℒ_align for constraining semantic consistency.



 §.§ Empirical Analysis








 §.§ The influence of parameters λ_e and λ_rc


We launch a series of empirical analyses, including evaluating the impact of parameters λ_e and λ_rc on the final performance. Figure <ref> (a) illustrates the sensitivity of the harmonic mean for each dataset with respect to parameter λ_e. It can be observed that the influence of parameter a is extremely small. Of particular note, when λ_e is set to 1 or 0, it indicates that only the cExp or fExp after distillation learning is used for the inference phase. It implies that by mutual distillation learning, each of the two experts learns the strengths of the other, thereby reaching an agreement. Figure <ref> (b) illustrates the impact of λ_rc. It can be seen that setting λ_rc above 0.7 stabilizes the performance. Optimization is achieved when it is set between 0.7 and 0.9.




  §.§.§ The influence of different clustering algorithms


We further evaluate the impact of the clustering algorithm on performance. In Introducing Table <ref>, we have explained that attribute clusters are obtained by humans to classify the attribute sets based on their characteristics. In this subsection, we use the K-Means algorithm for attribute clustering as a comparison to evaluate the performance. The experimental results are shown in Figure <ref> (c), where the harmonic mean (H) and top-1 accuracy (T) are reported. From the figure, it can be seen that the K-Means algorithm is slightly poorer compared to human classification, but a good result is also achieved. It again shows that the idea of dividing the attribute set into different clusters holds great promise.



  §.§.§ The influence of the number of attribute clusters


We evaluate the impact of the number of attribute clusters on performance. The attributes of CUB, SUN, and AWA2 are classified into 6, 4, and 4 categories, respectively (Table <ref>). In this subsection, we halve the categories, i.e., the numbers of attribute clusters for CUB, SUN, and AWA2 are 3, 2, and 2. The experimental results are shown in Figure <ref> (d), where half denotes that the cluster number is halved. We can see that half leads to a reduction of H by 0.6%, 1.0%, and 6.8%, respectively, and a reduction of T by 0.7%, 0.2%, and 11%, respectively. The results show that detailed attribute classification facilitates the model in capturing more fine-grained information and thus improves the performance.



  §.§.§ Visual analysis of attention.


We perform a visual analysis of the attention of the two experts, and the schematic is shown in Figure <ref>. It can be observed that cExp has a better localization for some global attributes, such as HeadPatternMaler, BellyColorGrey, ShapePerchingLike. Meanwhile, fExp has more detailed and precise localization for some local attributes, such as UpperTailColorGrey, ThroatColorGrey, LegColorWhite. The two experts collaborate and learn in a complementary way to improve together, which leads to better performance.



§ CONCLUSION


In this paper, we analyze the impact of attribute annotations and channel information on the regional visual-attribute modeling task. We argue that the intrinsic asymmetry of attributes is one of the important bottlenecks constraining existing approaches and propose a simple yet effective framework named DEDN to address this problem. DEDN consists of two expert networks, one with complete attribute-domain perception to harmonize the global correlation confidence and the other consisting of multiple subnetworks, each focusing on a specific attribute domain to capture fine-grained association information. Both of them complement each other and learn cooperatively. Meanwhile, we introduce DAN as a strong backbone, a novel attention network that incorporates both region and channel knowledge. Moreover, we present a new loss named MAL to train the network. Numerous experiments demonstrate the significant superiority of the proposed approach.

guo2020novel,zhou2021device,ijcai2022p311,guo2020dual,zhou2021octo,guo2019adaptive,guo2016improved,guo2021conservative,guo2023graph,liu2022towards,guo2019ams,lu2023decomposed,guo2019ee,ma2019position,huo2023offline,wang2023data,guo2022application,wang2022exploring,wang2022efficient,huo2024procc,zhou2022cadm,guo2021learning,zhang2023towards,guo2022fed,qi2023hwamei,guo2023mdenet,lu2023drpt,wang2023towards,liu20232,qi2023arena,qi2023hwamei,rao2023srcd,li2023dissecting,guo2023sfp,wang4503551towards,liu2023gbe,guo2023cns,huo2024non,guo2024multimodal,li2023dissecting,wang2024towards,wang2023sfp,huo2024utdnet,zhou2024pass,guo2023parsnets,rao2023attribute,guo2024fine,zhou2024robustness,li2023freepih,chen2024fine

named


