scholarly journals Relative Distribution Entropy Loss Function in CNN Image Retrieval

Entropy ◽  
2020 ◽  
Vol 22 (3) ◽  
pp. 321
Author(s):  
Pingping Liu ◽  
Lida Shi ◽  
Zhuang Miao ◽  
Baixin Jin ◽  
Qiuzhan Zhou
Keyword(s):  
Image Retrieval ◽  
Loss Function ◽  
Euclidean Distance ◽  
Metric Learning ◽  
Loss Functions ◽  
Relative Distribution ◽  
Weighted Distance ◽  
Entropy Loss ◽  
Image Descriptors ◽  
Entropy Weighted

Convolutional neural networks (CNN) is the most mainstream solution in the field of image retrieval. Deep metric learning is introduced into the field of image retrieval, focusing on the construction of pair-based loss function. However, most pair-based loss functions of metric learning merely take common vector similarity (such as Euclidean distance) of the final image descriptors into consideration, while neglecting other distribution characters of these descriptors. In this work, we propose relative distribution entropy (RDE) to describe the internal distribution attributes of image descriptors. We combine relative distribution entropy with the Euclidean distance to obtain the relative distribution entropy weighted distance (RDE-distance). Moreover, the RDE-distance is fused with the contrastive loss and triplet loss to build the relative distributed entropy loss functions. The experimental results demonstrate that our method attains the state-of-the-art performance on most image retrieval benchmarks.

scholarly journals f-Similarity Preservation Loss for Soft Labels: A Demonstration on Cross-Corpus Speech Emotion Recognition

2019 ◽  
Vol 33 ◽  
pp. 5725-5732
Author(s):  
Biqiao Zhang ◽  
Yuqing Kong ◽  
Georg Essl ◽  
Emily Mower Provost
Keyword(s):  
Neural Networks ◽  
Emotion Recognition ◽  
Loss Function ◽  
Deep Neural Networks ◽  
Metric Learning ◽  
Loss Functions ◽  
Speech Emotion Recognition ◽  
Subjective Data ◽  
Dual Form ◽  
Deep Metric Learning

In this paper, we propose a Deep Metric Learning (DML) approach that supports soft labels. DML seeks to learn representations that encode the similarity between examples through deep neural networks. DML generally presupposes that data can be divided into discrete classes using hard labels. However, some tasks, such as our exemplary domain of speech emotion recognition (SER), work with inherently subjective data, data for which it may not be possible to identify a single hard label. We propose a family of loss functions, fSimilarity Preservation Loss (f-SPL), based on the dual form of f-divergence for DML with soft labels. We show that the minimizer of f-SPL preserves the pairwise label similarities in the learned feature embeddings. We demonstrate the efficacy of the proposed loss function on the task of cross-corpus SER with soft labels. Our approach, which combines f-SPL and classification loss, significantly outperforms a baseline SER system with the same structure but trained with only classification loss in most experiments. We show that the presented techniques are more robust to over-training and can learn an embedding space in which the similarity between examples is meaningful.

scholarly journals Semantic and Generalized Entropy Loss Functions for Semi-Supervised Deep Learning

Entropy ◽  
2020 ◽  
Vol 22 (3) ◽  
pp. 334
Author(s):  
Krzysztof Gajowniczek ◽  
Yitao Liang ◽  
Tal Friedman ◽  
Tomasz Ząbkowski ◽  
Guy Van den Broeck
Keyword(s):  
Neural Network ◽  
Supervised Learning ◽  
Loss Function ◽  
Practical Importance ◽  
Loss Functions ◽  
Generalized Entropy ◽  
Entropy Loss ◽  
Additional Information ◽  
Label Information ◽  
Benchmark Datasets

The increasing size of modern datasets combined with the difficulty of obtaining real label information (e.g., class) has made semi-supervised learning a problem of considerable practical importance in modern data analysis. Semi-supervised learning is supervised learning with additional information on the distribution of the examples or, simultaneously, an extension of unsupervised learning guided by some constraints. In this article we present a methodology that bridges between artificial neural network output vectors and logical constraints. In order to do this, we present a semantic loss function and a generalized entropy loss function (Rényi entropy) that capture how close the neural network is to satisfying the constraints on its output. Our methods are intended to be generally applicable and compatible with any feedforward neural network. Therefore, the semantic loss and generalized entropy loss are simply a regularization term that can be directly plugged into an existing loss function. We evaluate our methodology over an artificially simulated dataset and two commonly used benchmark datasets which are MNIST and Fashion-MNIST to assess the relation between the analyzed loss functions and the influence of the various input and tuning parameters on the classification accuracy. The experimental evaluation shows that both losses effectively guide the learner to achieve (near-) state-of-the-art results on semi-supervised multiclass classification.

scholarly journals Function shaping in deep learning

2021 ◽  
Author(s):  
Ēvalds Urtāns
Keyword(s):  
Loss Function ◽  
Value Function ◽  
Metric Learning ◽  
Computer Game ◽  
Loss Functions ◽  
Identification Task ◽  
The Face ◽  
Triplet Loss ◽  
Deep Metric Learning ◽  
The Value Function

This work describes the importance of loss functions and related methods for deep reinforcement learning and deep metric learning. A novel MDQN loss function outperformed DDQN loss function in PLE computer game environments, and a novel Exponential Triplet loss function outperformed the Triplet loss function in the face re-identification task with VGGFace2 dataset reaching 85,7 % accuracy using zero-shot setting. This work also presents a novel UNet-RNN-Skip model to improve the performance of the value function for path planning tasks.

Valence electron spectroscopy of inhomogeneous media

1992 ◽  
Vol 50 (2) ◽  
pp. 1150-1151
Author(s):  
A. Howie ◽  
D.W. McComb
Keyword(s):  
Specific Gravity ◽  
Loss Function ◽  
Electron Spectroscopy ◽  
Valence Electron ◽  
Peak Height ◽  
Loss Functions ◽  
Loss Peak ◽  
High Energies ◽  
Valence Electron Density ◽  
Electron Microscopist

The bulk loss function Im(-l/ε (ω)), a well established tool for the interpretation of valence loss spectra, is being progressively adapted to the wide variety of inhomogeneous samples of interest to the electron microscopist. Proportionality between n, the local valence electron density, and ε-1 (Sellmeyer's equation) has sometimes been assumed but may not be valid even in homogeneous samples. Figs. 1 and 2 show the experimentally measured bulk loss functions for three pure silicates of different specific gravity ρ - quartz (ρ = 2.66), coesite (ρ = 2.93) and a zeolite (ρ = 1.79). Clearly, despite the substantial differences in density, the shift of the prominent loss peak is very small and far less than that predicted by scaling e for quartz with Sellmeyer's equation or even the somewhat smaller shift given by the Clausius-Mossotti (CM) relation which assumes proportionality between n (or ρ in this case) and (ε - 1)/(ε + 2). Both theories overestimate the rise in the peak height for coesite and underestimate the increase at high energies.

scholarly journals Study on Radar Echo-Filling in an Occlusion Area by a Deep Learning Algorithm

2021 ◽  
Vol 13 (9) ◽  
pp. 1779
Author(s):  
Xiaoyan Yin ◽  
Zhiqun Hu ◽  
Jiafeng Zheng ◽  
Boyong Li ◽  
Yuanyuan Zuo
Keyword(s):  
Deep Learning ◽  
Loss Function ◽  
Learning Algorithm ◽  
Weather Radar ◽  
Loss Functions ◽  
Training Dataset ◽  
Echo Intensity ◽  
Common Mean ◽  
Deep Learning Algorithm ◽  
Radar Beam

Radar beam blockage is an important error source that affects the quality of weather radar data. An echo-filling network (EFnet) is proposed based on a deep learning algorithm to correct the echo intensity under the occlusion area in the Nanjing S-band new-generation weather radar (CINRAD/SA). The training dataset is constructed by the labels, which are the echo intensity at the 0.5° elevation in the unblocked area, and by the input features, which are the intensity in the cube including multiple elevations and gates corresponding to the location of bottom labels. Two loss functions are applied to compile the network: one is the common mean square error (MSE), and the other is a self-defined loss function that increases the weight of strong echoes. Considering that the radar beam broadens with distance and height, the 0.5° elevation scan is divided into six range bands every 25 km to train different models. The models are evaluated by three indicators: explained variance (EVar), mean absolute error (MAE), and correlation coefficient (CC). Two cases are demonstrated to compare the effect of the echo-filling model by different loss functions. The results suggest that EFnet can effectively correct the echo reflectivity and improve the data quality in the occlusion area, and there are better results for strong echoes when the self-defined loss function is used.

A Densely Connected Network Based on U-Net for Medical Image Segmentation

2021 ◽  
Vol 17 (3) ◽  
pp. 1-14
Author(s):  
Zhenzhen Yang ◽  
Pengfei Xu ◽  
Yongpeng Yang ◽  
Bing-Kun Bao
Keyword(s):  
Feature Extraction ◽  
Image Segmentation ◽  
Loss Function ◽  
Network Architecture ◽  
Medical Image ◽  
Medical Image Segmentation ◽  
Cross Entropy ◽  
Loss Functions ◽  
Feature Maps ◽  
Different Levels

The U-Net has become the most popular structure in medical image segmentation in recent years. Although its performance for medical image segmentation is outstanding, a large number of experiments demonstrate that the classical U-Net network architecture seems to be insufficient when the size of segmentation targets changes and the imbalance happens between target and background in different forms of segmentation. To improve the U-Net network architecture, we develop a new architecture named densely connected U-Net (DenseUNet) network in this article. The proposed DenseUNet network adopts a dense block to improve the feature extraction capability and employs a multi-feature fuse block fusing feature maps of different levels to increase the accuracy of feature extraction. In addition, in view of the advantages of the cross entropy and the dice loss functions, a new loss function for the DenseUNet network is proposed to deal with the imbalance between target and background. Finally, we test the proposed DenseUNet network and compared it with the multi-resolutional U-Net (MultiResUNet) and the classic U-Net networks on three different datasets. The experimental results show that the DenseUNet network has significantly performances compared with the MultiResUNet and the classic U-Net networks.

scholarly journals The Study of Multiple Classes Boosting Classification Method Based on Local Similarity

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 37
Author(s):  
Shixun Wang ◽  
Qiang Chen
Keyword(s):  
Image Retrieval ◽  
Loss Function ◽  
Single Mode ◽  
Local Similarity ◽  
Text And Image ◽  
Data Set ◽  
Standard Data ◽  
Weak Learner ◽  
Great Progress ◽  
Data Points

Boosting of the ensemble learning model has made great progress, but most of the methods are Boosting the single mode. For this reason, based on the simple multiclass enhancement framework that uses local similarity as a weak learner, it is extended to multimodal multiclass enhancement Boosting. First, based on the local similarity as a weak learner, the loss function is used to find the basic loss, and the logarithmic data points are binarized. Then, we find the optimal local similarity and find the corresponding loss. Compared with the basic loss, the smaller one is the best so far. Second, the local similarity of the two points is calculated, and then the loss is calculated by the local similarity of the two points. Finally, the text and image are retrieved from each other, and the correct rate of text and image retrieval is obtained, respectively. The experimental results show that the multimodal multi-class enhancement framework with local similarity as the weak learner is evaluated on the standard data set and compared with other most advanced methods, showing the experience proficiency of this method.

OPTIMAL REINSURANCE FROM THE VIEWPOINTS OF BOTH AN INSURER AND A REINSURER UNDER THE CVAR RISK MEASURE AND VAJDA CONDITION

2021 ◽  
pp. 1-29
Author(s):  
Yanhong Chen
Keyword(s):  
Loss Function ◽  
Value At Risk ◽  
Numerical Study ◽  
Risk Measure ◽  
Convex Combination ◽  
Weighting Factor ◽  
Loss Functions ◽  
Conditional Value At Risk ◽  
Optimal Reinsurance ◽  
The Impact

ABSTRACT In this paper, we study the optimal reinsurance contracts that minimize the convex combination of the Conditional Value-at-Risk (CVaR) of the insurer’s loss and the reinsurer’s loss over the class of ceded loss functions such that the retained loss function is increasing and the ceded loss function satisfies Vajda condition. Among a general class of reinsurance premium principles that satisfy the properties of risk loading and convex order preserving, the optimal solutions are obtained. Our results show that the optimal ceded loss functions are in the form of five interconnected segments for general reinsurance premium principles, and they can be further simplified to four interconnected segments if more properties are added to reinsurance premium principles. Finally, we derive optimal parameters for the expected value premium principle and give a numerical study to analyze the impact of the weighting factor on the optimal reinsurance.

Sign in / Sign up

Export Citation Format

Share Document