On a Generalization of the Jensen-Shannon Divergence and the Jensen-Shannon Centroid

Electrophysiological features of cortical 3D networks are deeply modulated by scaffold properties

Three-dimensionality (3D) was proven essential for developing reliable models for different anatomical compartments and many diseases. However, the neuronal compartment still poses a great challenge as we still do not understand precisely how the brain computes information and how the complex chain of neuronal events can generate conscious behavior. Therefore, a comprehensive model of neuronal tissue has not yet been found. The present work was conceived in this framework: we aimed to contribute to what must be a collective effort by filling in some information on possible 3D strategies to pursue. We compared directly different kinds of scaffolds (i.e., PDMS sponges, thermally crosslinked hydrogels, and glass microbeads) in their effect on neuronal network activity recorded using micro-electrode arrays. While the overall rate of spiking activity remained consistent, the type of scaffold had a notable impact on bursting dynamics. The frequency, density of bursts, and occurrence of random spikes were all affected. The examination of inter-burst intervals revealed distinct burst generation patterns unique to different scaffold types. Network burst propagation unveiled divergent trends among configurations. Notably, it showed the most differences, underlying that functional variations may arise from a different 3D spatial organization. This evidence suggests that not all 3D neuronal constructs can sustain the same level of richness of activity. Furthermore, we commented on the reproducibility, efficacy, and scalability of the methods, where the beads still offer superior performances. By comparing different 3D scaffolds, our results move toward understanding the best strategies to develop functional 3D neuronal units for reliable pre-clinical studies.

Correlations of Cross-Entropy Loss in Machine Learning

Cross-entropy loss is crucial in training many deep neural networks. In this context, we show a number of novel and strong correlations among various related divergence functions. In particular, we demonstrate that, in some circumstances, (a) cross-entropy is almost perfectly correlated with the little-known triangular divergence, and (b) cross-entropy is strongly correlated with the Euclidean distance over the logits from which the softmax is derived. The consequences of these observations are as follows. First, triangular divergence may be used as a cheaper alternative to cross-entropy. Second, logits can be used as features in a Euclidean space which is strongly synergistic with the classification process. This justifies the use of Euclidean distance over logits as a measure of similarity, in cases where the network is trained using softmax and cross-entropy. We establish these correlations via empirical observation, supported by a mathematical explanation encompassing a number of strongly related divergence functions.

Robust Stochastic Neural Ensemble Learning With Noisy Labels for Thoracic Disease Classification

Chest radiography is the most common radiology examination for thoracic disease diagnosis, such as pneumonia. A tremendous number of chest X-rays prompt data-driven deep learning models in constructing computer-aided diagnosis systems for thoracic diseases. However, in realistic radiology practice, a deep learning-based model often suffers from performance degradation when trained on data with noisy labels possibly caused by different types of annotation biases. To this end, we present a novel stochastic neural ensemble learning (SNEL) framework for robust thoracic disease diagnosis using chest X-rays. The core idea of our method is to learn from noisy labels by constructing model ensembles and designing noise-robust loss functions. Specifically, we propose a fast neural ensemble method that collects parameters simultaneously across model instances and along optimization trajectories. Moreover, we propose a loss function that both optimizes a robust measure and characterizes a diversity measure of ensembles. We evaluated our proposed SNEL method on three publicly available hospital-scale chest X-ray datasets. The experimental results indicate that our method outperforms competing methods and demonstrate the effectiveness and robustness of our method in learning from noisy labels. Our code is available at https://github.com/hywang01/SNEL.

Inference of dynamic hypergraph representations in temporal interaction data

A range of systems across the social and natural sciences generate data sets consisting of interactions between two distinct categories of items at various instances in time. Online shopping, for example, generates purchasing events of the form (user, product, time of purchase), and mutualistic interactions in plant-pollinator systems generate pollination events of the form (insect, plant, time of pollination). These data sets can be meaningfully modeled as temporal hypergraph snapshots in which multiple items within one category (i.e., online shoppers) share a hyperedge if they interacted with a common item in the other category (i.e., purchased the same product) within a given time window, allowing for the application of hypergraph analysis techniques. However, it is often unclear how to choose the number and duration of these temporal snapshots, which have a strong influence on the final hypergraph representations. Here we propose a principled nonparametric solution to this problem by extracting temporal hypergraph snapshots that optimally capture structural regularities in temporal event data according to the minimum description length principle. We demonstrate our methods on real and synthetic data sets, finding that they can recover planted artificial hypergraph structure in the presence of considerable noise and reveal meaningful activity fluctuations in human mobility data.

A Unifying Generator Loss Function for Generative Adversarial Networks

A unifying α-parametrized generator loss function is introduced for a dual-objective generative adversarial network (GAN) that uses a canonical (or classical) discriminator loss function such as the one in the original GAN (VanillaGAN) system. The generator loss function is based on a symmetric class probability estimation type function, Lα, and the resulting GAN system is termed Lα-GAN. Under an optimal discriminator, it is shown that the generator's optimization problem consists of minimizing a Jensen-fα-divergence, a natural generalization of the Jensen-Shannon divergence, where fα is a convex function expressed in terms of the loss function Lα. It is also demonstrated that this Lα-GAN problem recovers as special cases a number of GAN problems in the literature, including VanillaGAN, least squares GAN (LSGAN), least kth-order GAN (LkGAN), and the recently introduced (αD,αG)-GAN with αD=1. Finally, experimental results are provided for three datasets-MNIST, CIFAR-10, and Stacked MNIST-to illustrate the performance of various examples of the Lα-GAN system.

Boltzmann-Shannon interaction entropy: A normalized measure for continuous variables with an application as a subsample quality metric

The recent introduction of geometric partition entropy offered an alternative to differential Shannon entropy for the quantification of uncertainty as estimated from a sample drawn from a one-dimensional bounded continuous probability distribution. In addition to being a fresh perspective for the basis of continuous information theory, this new approach provided several improvements over traditional entropy estimators including its effectiveness on sparse samples and a proper incorporation of the impact from extreme outliers. However, a complimentary relationship exists between the new geometric approach and the basic form of its frequency-based predecessor that is leveraged here to define an entropy measure with no bias toward the sample size. This stable normalized measure is named the Boltzmann-Shannon interaction entropy (BSIE)) as it is defined in terms of a standard divergence between the measure-based and frequency-based distributions that can be associated with the two historical figures. This parameter-free measure can be accurately estimated in a computationally efficient manner, and we illustrate its utility as a quality metric for subsampling in the context of nonlinear polynomial regression.

Cancer Diagnosis through Contour Visualization of Gene Expression Leveraging Deep Learning Techniques

Prompt diagnostics and appropriate cancer therapy necessitate the use of gene expression databases. The integration of analytical methods can enhance detection precision by capturing intricate patterns and subtle connections in the data. This study proposes a diagnostic-integrated approach combining Empirical Bayes Harmonization (EBS), Jensen-Shannon Divergence (JSD), deep learning, and contour mathematics for cancer detection using gene expression data. EBS preprocesses the gene expression data, while JSD measures the distributional differences between cancerous and non-cancerous samples, providing invaluable insights into gene expression patterns. Deep learning (DL) models are employed for automatic deep feature extraction and to discern complex patterns from the data. Contour mathematics is applied to visualize decision boundaries and regions in the high-dimensional feature space. JSD imparts significant information to the deep learning model, directing it to concentrate on pertinent features associated with cancerous samples. Contour visualization elucidates the model's decision-making process, bolstering interpretability. The amalgamation of JSD, deep learning, and contour mathematics in gene expression dataset analysis diagnostics presents a promising pathway for precise cancer detection. This method taps into the prowess of deep learning for feature extraction while employing JSD to pinpoint distributional differences and contour mathematics for visual elucidation. The outcomes underscore its potential as a formidable instrument for cancer detection, furnishing crucial insights for timely diagnostics and tailor-made treatment strategies.

Computational Complexity and Its Influence on Predictive Capabilities of Machine Learning Models for Concrete Mix Design

The design of concrete mixtures is crucial in concrete technology, aiming to produce concrete that meets specific quality and performance criteria. Modern standards require not only strength but also eco-friendliness and production efficiency. Based on the Three Equation Method, conventional mix design methods involve analytical and laboratory procedures but are insufficient for contemporary concrete technology, leading to overengineering and difficulty predicting concrete properties. Machine learning-based methods offer a solution, as they have proven effective in predicting concrete compressive strength for concrete mix design. This paper scrutinises the association between the computational complexity of machine learning models and their proficiency in predicting the compressive strength of concrete. This study evaluates five deep neural network models of varying computational complexity in three series. Each model is trained and tested in three series with a vast database of concrete mix recipes and associated destructive tests. The findings suggest a positive correlation between increased computational complexity and the model's predictive ability. This correlation is evidenced by an increment in the coefficient of determination (R2) and a decrease in error metrics (mean squared error, Minkowski error, normalized squared error, root mean squared error, and sum squared error) as the complexity of the model increases. The research findings provide valuable insights for increasing the performance of concrete technical feature prediction models while acknowledging this study's limitations and suggesting potential future research directions. This research paves the way for further refinement of AI-driven methods in concrete mix design, enhancing the efficiency and precision of the concrete mix design process.

A self-learning Monte Carlo tree search algorithm for robot path planning

This paper proposes a self-learning Monte Carlo tree search algorithm (SL-MCTS), which has the ability to continuously improve its problem-solving ability in single-player scenarios. SL-MCTS combines the MCTS algorithm with a two-branch neural network (PV-Network). The MCTS architecture can balance the search for exploration and exploitation. PV-Network replaces the rollout process of MCTS and predicts the promising search direction and the value of nodes, which increases the MCTS convergence speed and search efficiency. The paper proposes an effective method to assess the trajectory of the current model during the self-learning process by comparing the performance of the current model with that of its best-performing historical model. Additionally, this method can encourage SL-MCTS to generate optimal solutions during the self-learning process. We evaluate the performance of SL-MCTS on the robot path planning scenario. The experimental results show that the performance of SL-MCTS is far superior to the traditional MCTS and single-player MCTS algorithms in terms of path quality and time consumption, especially its time consumption is half less than that of the traditional MCTS algorithms. SL-MCTS also performs comparably to other iterative-based search algorithms designed specifically for path planning tasks.

Generating Flavor Molecules Using Scientific Machine Learning

Flavor is an essential component in the development of numerous products in the market. The increasing consumption of processed and fast food and healthy packaged food has upraised the investment in new flavoring agents and consequently in molecules with flavoring properties. In this context, this work brings up a scientific machine learning (SciML) approach to address this product engineering need. SciML in computational chemistry has opened paths in the compound's property prediction without requiring synthesis. This work proposes a novel framework of deep generative models within this context to design new flavor molecules. Through the analysis and study of the molecules obtained from the generative model training, it was possible to conclude that even though the generative model designs the molecules through random sampling of actions, it can find molecules that are already used in the food industry, not necessarily as a flavoring agent, or in other industrial sectors. Hence, this corroborates the potential of the proposed methodology for the prospecting of molecules to be applied in the flavor industry.

mRNA targeting eliminates the need for the signal recognition particle during membrane protein insertion in bacteria

Signal-sequence-dependent protein targeting is essential for the spatiotemporal organization of eukaryotic and prokaryotic cells and is facilitated by dedicated protein targeting factors such as the signal recognition particle (SRP). However, targeting signals are not exclusively contained within proteins but can also be present within mRNAs. By in vivo and in vitro assays, we show that mRNA targeting is controlled by the nucleotide content and by secondary structures within mRNAs. mRNA binding to bacterial membranes occurs independently of soluble targeting factors but is dependent on the SecYEG translocon and YidC. Importantly, membrane insertion of proteins translated from membrane-bound mRNAs occurs independently of the SRP pathway, while the latter is strictly required for proteins translated from cytosolic mRNAs. In summary, our data indicate that mRNA targeting acts in parallel to the canonical SRP-dependent protein targeting and serves as an alternative strategy for safeguarding membrane protein insertion when the SRP pathway is compromised.

Cross-modality comparison between structural and metabolic networks in individual brain based on the Jensen-Shannon divergence method: a healthy Chinese population study

The study aimed to investigate the consistency and diversity between metabolic and structural brain networks at individual level constructed with divergence-based method in healthy Chinese population. The ¹⁸F-FDG PET and T1-weighted images of brain were collected from 209 healthy participants. The Jensen-Shannon divergence (JSD) was used to calculate metabolic or structural connectivities between any pair of brain regions and then individual brain networks were constructed. The global and regional topological properties of both networks were analyzed with graph theoretical analysis. Regional properties including nodal efficiency, degree, and betweenness centrality were used to define hub regions of networks. Cross-modality similarity of brain connectivity was analyzed with differential power (DP) analysis. The default mode network (DMN) had the largest number of brain connectivities with high DP values. The small-worldness indexes of metabolic and structural networks in all participants were greater than 1. The structural network showed higher assortativity and local efficiency than metabolic network, while hierarchy and global efficiency were greater in the metabolic network (all P < 0.001). Most of hubs in both networks were symmetrically spatial distributed in the regions of the DMN and subcortical nuclei including thalamus and amygdala, etc. The human brain presented small-world architecture both in perspective of individual metabolic and structural networks. There was a structural substrate that supported the brain to globally and efficiently integrate and process metabolic interaction across brain regions. The cross-modality cooperation or specialization in both networks might imply mechanisms of achieving higher-order brain functions.

Relating Darcy-Scale Chemical Reaction Order to Pore-Scale Spatial Heterogeneity

Due to spatial scaling effects, there is a discrepancy in mineral dissolution rates measured at different spatial scales. Many reasons for this spatial scaling effect can be given. We investigate one such reason, i.e., how pore-scale spatial heterogeneity in porous media affects overall mineral dissolution rates. Using the bundle-of-tubes model as an analogy for porous media, we show that the Darcy-scale reaction order increases as the statistical similarity between the pore sizes and the effective-surface-area ratio of the porous sample decreases. The analytical results quantify mineral spatial heterogeneity using the Darcy-scale reaction order and give a mechanistic explanation to the usage of reaction order in Darcy-scale modeling. The relation is used as a constitutive relation of reactive transport at the Darcy scale. We test the constitutive relation by simulating flow-through experiments. The proposed constitutive relation is able to model the solute breakthrough curve of the simulations. Our results imply that we can infer mineral spatial heterogeneity of a porous media using measured solute concentration over time in a flow-through dissolution experiment.

Absent Color Indexing: Histogram-Based Identification Using Major and Minor Colors

The color histogram is a statistical behavior for robust pattern search or matching; however, difficulties have arisen in using it to discriminate among similar objects. Our method, called absent color indexing (ABC), describes how to use absent or minor colors as a feature in order to solve problems while robustly recognizing images, even those with similar color features. The proposed approach separates a source color histogram into apparent (AP) and absent (AB) color histograms in order to provide a fair way of focusing on the major and minor contributions together. A threshold for this separation is automatically obtained from the mean color histogram by considering the statistical significance of the absent colors. After these have been separated, an inversion operation is performed to reinforce the weight of AB. In order to balance the contributions of the two histograms, four similarity measures are utilized as candidates for combination with ABC. We tested the performance of ABC in terms of the F-measure using different similarity measures, and the results show that it is able to achieve values greater than 0.95. Experiments on Mondrian random patterns verify the ability of ABC to distinguish similar objects by margin. The results of extensive experiments on real-world images and open databases are presented here in order to demonstrate that the performance of our relatively simple algorithm remained robust even in difficult cases.

Adversarial Auto-encoder Domain Adaptation for Cold-start Recommendation with Positive and Negative Hypergraphs

This paper presents a novel model named Adversarial Auto-encoder Domain Adaptation (AADA) to handle the recommendation problem under cold-start settings. Specifically, we divide the hypergraph into two hypergraphs, i.e., a positive hypergraph and a negative one. Below, we adopt the cold-start user recommendation for illustration. After achieving positive and negative hypergraphs, we apply hypergraph auto-encoders to them to obtain positive and negative embeddings of warm users and items. Additionally, we employ a multi-layer perceptron to get warm and cold-start user embeddings called regular embeddings. Subsequently, for warm users, we assign positive and negative pseudo-labels to their positive and negative embeddings, respectively, and treat their positive and regular embeddings as the source and target domain data, respectively. Then, we develop a matching discriminator to jointly minimize the classification loss of the positive and negative warm user embeddings and the distribution gap between the positive and regular warm user embeddings. In this way, warm users’ positive and regular embeddings are connected. Since the positive hypergraph maintains the relations between positive warm user and item embeddings, and the regular warm and cold-start user embeddings follow a similar distribution, the regular cold-start user embedding and positive item embedding are bridged to discover their relationship. The proposed model can be easily extended to handle the cold-start item recommendation by changing inputs. We perform extensive experiments on real-world datasets for both cold-start user and cold-start item recommendations. Promising results in terms of precision, recall, NDCG, and hit rate verify the effectiveness of the proposed method.

Alteration of the Individual Metabolic Network of the Brain Based on Jensen-Shannon Divergence Similarity Estimation in Elderly Patients With Type 2 Diabetes Mellitus

The aim of this study was to investigate the interactive effect between aging and type 2 diabetes mellitus (T2DM) on brain glucose metabolism, individual metabolic connectivity, and network properties. Using a 2 × 2 factorial design, 83 patients with T2DM (40 elderly and 43 middle-aged) and 69 sex-matched healthy control subjects (HCs) (34 elderly and 35 middle-aged) underwent 18F-fluorodeoxyglucose positron emission tomography/magnetic resonance scanning. Jensen-Shannon divergence was applied to construct individual metabolic connectivity and networks. The topological properties of the networks were quantified using graph theoretical analysis. The general linear model was used to mainly estimate the interaction effect between aging and T2DM on glucose metabolism, metabolic connectivity, and network. There was an interaction effect between aging and T2DM on glucose metabolism, metabolic connectivity, and regional metabolic network properties (all P < 0.05). The post hoc analyses showed that compared with elderly HCs and middle-aged patients with T2DM, elderly patients with T2DM had decreased glucose metabolism, increased metabolic connectivity, and regional metabolic network properties in cognition-related brain regions (all P < 0.05). Age and fasting plasma glucose had negative correlations with glucose metabolism and positive correlations with metabolic connectivity. Elderly patients with T2DM had glucose hypometabolism, strengthened functional integration, and increased efficiency of information communication mainly located in cognition-related brain regions. Metabolic connectivity pattern changes might be compensatory changes for glucose hypometabolism.

Redundancy Reduction for Sensor Deployment in Prosthetic Socket: A Case Study

The irregular pressure exerted by a prosthetic socket over the residual limb is one of the major factors that cause the discomfort of amputees using artificial limbs. By deploying the wearable sensors inside the socket, the interfacial pressure distribution can be studied to find the active regions and rectify the socket design. In this case study, a clustering-based analysis method is presented to evaluate the density and layout of these sensors, which aims to reduce the local redundancy of the sensor deployment. In particular, a Self-Organizing Map (SOM) and K-means algorithm are employed to find the clustering results of the sensor data, taking the pressure measurement of a predefined sensor placement as the input. Then, one suitable clustering result is selected to detect the layout redundancy from the input area. After that, the Pearson correlation coefficient (PCC) is used as a similarity metric to guide the removal of redundant sensors and generate a new sparser layout. The Jenson-Shannon Divergence (JSD) and the mean pressure are applied as posterior validation metrics that compare the pressure features before and after sensor removal. A case study of a clinical trial with two sensor strips is used to prove the utility of the clustering-based analysis method. The sensors on the posterior and medial regions are suggested to be reduced, and the main pressure features are kept. The proposed method can help sensor designers optimize sensor configurations for intra-socket measurements and thus assist the prosthetists in improving the socket fitting.

Permutation Jensen-Shannon distance: A versatile and fast symbolic tool for complex time-series analysis

The main motivation of this paper is to introduce the permutation Jensen-Shannon distance, a symbolic tool able to quantify the degree of similarity between two arbitrary time series. This quantifier results from the fusion of two concepts, the Jensen-Shannon divergence and the encoding scheme based on the sequential ordering of the elements in the data series. The versatility and robustness of this ordinal symbolic distance for characterizing and discriminating different dynamics are illustrated through several numerical and experimental applications. Results obtained allow us to be optimistic about its usefulness in the field of complex time-series analysis. Moreover, thanks to its simplicity, low computational cost, wide applicability, and less susceptibility to outliers and artifacts, this ordinal measure can efficiently handle large amounts of data and help to tackle the current big data challenges.

Damage Detection in Largely Unobserved Structures under Varying Environmental Conditions: An AutoRegressive Spectrum and Multi-Level Machine Learning Methodology

Vibration-based damage detection in civil structures using data-driven methods requires sufficient vibration responses acquired with a sensor network. Due to technical and economic reasons, it is not always possible to deploy a large number of sensors. This limitation may lead to partial information being handled for damage detection purposes, under environmental variability. To address this challenge, this article proposes an innovative multi-level machine learning method by employing the autoregressive spectrum as the main damage-sensitive feature. The proposed method consists of three levels: (i) distance calculation by the log-spectral distance, to increase damage detectability and generate distance-based training and test samples; (ii) feature normalization by an improved factor analysis, to remove environmental variations; and (iii) decision-making for damage localization by means of the Jensen-Shannon divergence. The major contributions of this research are represented by the development of the aforementioned multi-level machine learning method, and by the proposal of the new factor analysis for feature normalization. Limited vibration datasets relevant to a truss structure and consisting of acceleration time histories induced by shaker excitation in a passive system, have been used to validate the proposed method and to compare it with alternate, state-of-the-art strategies.

Assessment of time irreversibility in a time series using visibility graphs

In this paper, we studied the time-domain irreversibility of time series, which is a fundamental property of systems in a nonequilibrium state. We analyzed a subgroup of the databases provided by University of Rochester, namely from the THEW Project. Our data consists of LQTS (Long QT Syndrome) patients and healthy persons. LQTS may be associated with an increased risk of sudden cardiac death (SCD), which is still a big clinical problem. ECG-based artificial intelligence methods can identify sudden cardiac death with a high accuracy. It follows that heart rate variability contains information about the possibility of SCD, which may be extracted, provided that appropriate methods are developed for this purpose. Our aim was to assess the complexity of both groups using visibility graph (VG) methods. Multivariate analysis of connection patterns of graphs built from time series was performed using multiplex visibility graph methods. For univariate time series, time irreversibility of the ECG interval QT of patients with LQTS was lower than for the healthy. However, we did not observe statistically significant difference in the comparison of RR intervals time series of the two groups studied. The connection patterns retrieved from multiplex VGs have more similarity with each other in the case of LQTS patients. This observation may be used to develop better methods for SCD risk stratification.

On Representations of Divergence Measures and Related Quantities in Exponential Families

Within exponential families, which may consist of multi-parameter and multivariate distributions, a variety of divergence measures, such as the Kullback-Leibler divergence, the Cressie-Read divergence, the Rényi divergence, and the Hellinger metric, can be explicitly expressed in terms of the respective cumulant function and mean value function. Moreover, the same applies to related entropy and affinity measures. We compile representations scattered in the literature and present a unified approach to the derivation in exponential families. As a statistical application, we highlight their use in the construction of confidence regions in a multi-sample setup.

α-Geodesical Skew Divergence

The asymmetric skew divergence smooths one of the distributions by mixing it, to a degree determined by the parameter λ, with the other distribution. Such divergence is an approximation of the KL divergence that does not require the target distribution to be absolutely continuous with respect to the source distribution. In this paper, an information geometric generalization of the skew divergence called the α-geodesical skew divergence is proposed, and its properties are studied.

On a Variational Definition for the Jensen-Shannon Symmetrization of Distances Based on the Information Radius

We generalize the Jensen-Shannon divergence and the Jensen-Shannon diversity index by considering a variational definition with respect to a generic mean, thereby extending the notion of Sibson's information radius. The variational definition applies to any arbitrary distance and yields a new way to define a Jensen-Shannon symmetrization of distances. When the variational optimization is further constrained to belong to prescribed families of probability measures, we get relative Jensen-Shannon divergences and their equivalent Jensen-Shannon symmetrizations of distances that generalize the concept of information projections. Finally, we touch upon applications of these variational Jensen-Shannon divergences and diversity indices to clustering and quantization tasks of probability measures, including statistical mixtures.

RSSI Probability Density Functions Comparison Using Jensen-Shannon Divergence and Pearson Distribution

The performance of a free-space optical (FSO) communications link suffers from the deleterious effects of weather conditions and atmospheric turbulence. In order to better estimate the reliability and availability of an FSO link, a suitable distribution needs to be employed. The accuracy of this model depends strongly on the atmospheric turbulence strength which causes the scintillation effect. To this end, a variety of probability density functions were utilized to model the optical channel according to the strength of the refractive index structure parameter. Although many theoretical models have shown satisfactory performance, in reality they can significantly differ. This work employs an information theoretic method, namely the so-called Jensen–Shannon divergence, a symmetrization of the Kullback–Leibler divergence, to measure the similarity between different probability distributions. In doing so, a large experimental dataset of received signal strength measurements from a real FSO link is utilized. Additionally, the Pearson family of continuous probability distributions is also employed to determine the best fit according to the mean, standard deviation, skewness and kurtosis of the modeled data.

Strongly Convex Divergences

We consider a sub-class of the f-divergences satisfying a stronger convexity property, which we refer to as strongly convex, or κ-convex divergences. We derive new and old relationships, based on convexity arguments, between popular f-divergences.

On Relations Between the Relative Entropy and χ2-Divergence, Generalizations and Applications

This paper is focused on a study of integral relations between the relative entropy and the chi-squared divergence, which are two fundamental divergence measures in information theory and statistics, a study of the implications of these relations, their information-theoretic applications, and some generalizations pertaining to the rich class of f-divergences. Applications that are studied in this paper refer to lossless compression, the method of types and large deviations, strong data–processing inequalities, bounds on contraction coefficients and maximal correlation, and the convergence rate to stationarity of a type of discrete-time Markov chains.