Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Jensen-Shannon divergence"”.
-
Relaxing assumptions in deep probabilistic modelling
… deriving from longstanding distributions and divergences at their core, which inhibit their continued advance. By leveraging wider distribution and divergence families, transferring broader parametric assumptions to deep generative models increases the scope of the functions they can …
-
Information theoretic advances in zero-knowledge
… theoretic notions-triangular discrimination and Jensen-Shannon divergence.
-
Learning to Align the Supports of Distributions
… We propose symmetric support difference as a divergence measure to quantify the mismatch between supports. We show that select discriminators (e.g. discriminator trained for Jensen–Shannon divergence) are able to map support differences as support differences in their one-dimensional output …
-
Analysis of Behavior in Populations of Swimming Microbes
… using a relative entropy based metric called the Jensen Shannon divergence. Using this framework, we measured patterns of behavioral changes, both within individual lifetimes and between different individuals in a population. These changes were quantified over time scales that ranged from minutes …
-
Search-based Automatic Image Annotation Using Geotagged Community Photos
… tag probability distributions by extending Jensen-Shannon Divergence to account for statistical fluctuations. To efficiently identify the visual neighbors, the thesis introduces two extensions to the state-of-the-art image matching algorithm, known as Speeded Up Robust Features (SURF). To …
-
DATA GOVERNANCE FRAMEWORK FOR ML-BASED, DATA-INTENSIVE DISTRIBUTED SYSTEMS
… coefficients ($M_J$), a qualitative metric using Jensen-Shannon divergence ($M_{JSD}$), and an entropy-based metric ($M_H$) that quantifies information content retention. Then, we develop sliding window heuristic algorithms that address the NP-hard problem of optimal service selection by employing …