New distances measure mixtures of Gaussians, useful in machine learning.
problem Comparing distributions with disjoint supports.
method Schoenberg-Rao distances based on concave Rao's entropy.
result Closed-form distances for mixtures of Gaussians.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “Entropy-based distances”
GMM-HMMs improve malware classification compared to discrete HMMs.
problem Improving malware classification accuracy using GMM-HMM models.
method Used GMM-HMM models for opcode and entropy-based features comparison with discrete HMMs.
result GMM-HMMs generally improve significantly on entropy-based features classification results.
New entropy-based objective for sparse coding improves learning.
problem Sparse coding with probabilistic priors and non-Gaussian observables.
method Derive a solely entropy-based learning objective for sparse coding parameters.
result Fully analytical ELBO objective for sparse coding with non-trivial posterior approximations.
Entropy-based GP adaptive design improves failure probability estimation.
problem Limited accuracy in failure probability estimation due to model evaluation costs.
method Entropy-based Gaussian process (GP) adaptive design combined with multifidelity importance sampling (MFIS).
result More accurate failure probability estimates and higher confidence.
Clustering evaluation measures are frequently used to evaluate the performance of algorithms. However, most measures are not properly normalized and ignore some information in the inherent structure of clusterings. We model the relation between two clusterings as a bipartite graph and propose a general component-based …
We present a new method of generating mixture models for data with categorical attributes. The keys to this approach are an entropy-based density metric in categorical space and annealing of high-entropy/low-density components from an initial state with many components. Pruning of low-density components using the entro…
This paper studies an entropy-based multi-objective Bayesian optimization (MBO). The entropy search is successful approach to Bayesian optimization. However, for MBO, existing entropy-based methods ignore trade-off among objectives or introduce unreliable approximations. We propose a novel entropy-based MBO called Pare…
Entropy-based model for hierarchical learning from multiscale data.
problem Learning from data with auxiliary information and multiscale target functions.
method Entropy-based hierarchical learning model with multiscale entropies.
result Entropy-based model yields stronger guarantees than uniform convergence bounds.
Paper proposes a Renyi entropy-based method for tuning hierarchical topic models.
problem Tuning hierarchical topic models, especially determining the number of topics at each level, is challenging.
method The paper introduces a Renyi entropy-based metric for quality assessment and a practical tuning concept.
result The proposed method can estimate the number of topics for two hierarchical levels in hARTM model.
From Ecology to Finance (and Back?): Recent Advancements in the Analysis of Bipartite Networksphysics.soc-ph
Bipartite networks provide an insightful representation of many systems, ranging from mutualistic networks of species interactions to investment networks in finance. The analysis of their topological structures has revealed the ubiquitous presence of properties which seem to characterize many - apparently different - s…
This work improves VAEs using MCMC methods for better variational bounds.
problem Improving the expressiveness of variational distributions in VAEs.
method Entropy-based adaptation for MALA/HMC chains to optimize tighter variational bounds.
result Higher held-out log-likelihoods and improved generative metrics.
Adaptive HMC improves sampling efficiency by optimizing mass matrix.
problem Inefficient HMC performance due to mass matrix choice.
method Gradient-based adaptation of mass matrix to maximize proposal entropy.
result Adaptation method outperforms HMC variants by optimizing mass matrix.
Paper models entropy-based impact of soft errors on neural network inference.
problem Estimating impact of radiation-induced faults on neural network inference.
method Entropy-based statistical models for SEU and MBU across layers.
result Accurate models to evaluate error-resiliency of neural network topologies.
A new method for domain generalization using unlabeled data.
problem Learning from multiple domains with limited labeled data.
method Combines meta learning and semi-supervised learning with entropy-based pseudo-labeling and discrepancy loss.
result Significantly outperforms state-of-the-art methods on benchmark datasets.
The scientific method relies on the iterated processes of inference and inquiry. The inference phase consists of selecting the most probable models based on the available data; whereas the inquiry phase consists of using what is known about the models to select the most relevant experiment. Optimizing inquiry involves …
This is full length article (draft version) where problem number of topics in Topic Modeling is discussed. We proposed idea that Renyi and Tsallis entropy can be used for identification of optimal number in large textual collections. We also report results of numerical experiments of Semantic stability for 4 topic mode…
Entropy based ideas find wide-ranging applications in finance for calibrating models of portfolio risk as well as options pricing. The abstracted problem, extensively studied in the literature, corresponds to finding a probability measure that minimizes relative entropy with respect to a specified measure while satisfy…
An empirical investigation of the interaction of sample size and discretization - in this case the entropy-based method CAIM (Class-Attribute Interdependence Maximization) - was undertaken to evaluate the impact and potential bias introduced into data mining performance metrics due to variation in sample size as it imp…
A novel outlier score detects new road infrastructure images.
problem Detecting newly observed road infrastructure images.
method Entropy-based outlier score using directed nearest neighbor graphs.
result High potential of the proposed technique in identifying outliers.
Study generalizes Picard iteration for nonlinear PDEs, deriving bounds on error.
problem Generalize Picard iteration for nonlinear parabolic PDEs.
method Formulate Picard iteration as abstract state-transition model, derive generalization error bounds.
result Picard depth reduction reduces Picard truncation error without increasing estimation error.
A new active learning method for Gaussian process models.
problem Efficiently exploring unbounded state spaces for accurate models.
method Maximizes mutual information with respect to a bounded region using model predictive control.
result Our method yields a better model within the region of interest than entropy-based methods.
FEDS distills LIC model knowledge into a lightweight student for efficient compression.
problem Efficiently compress images with high performance and low resources.
method FEDS combines feature alignment and entropy-based loss for lightweight compression.
result Student model matches teacher's performance while reducing parameters and speeding up.
Unified framework for network model assessment using maximum entropy.
problem Statistical inference for network models.
method Constrained entropy-maximization problem, Lagrange multipliers.
result Consistent goodness-of-fit and two-sample tests for network models.
This work introduces a novel method to evaluate generative model novelty.
problem Evaluating the novelty of generative models compared to a reference model.
method Spectral approach to differential clustering and Kernel-based Entropic Novelty (KEN) score.
result The KEN score effectively detects novel modes and compares generative models.
ALIEN improves uncertainty estimation of language models by refining entropy-based methods.
problem Overconfidence in uncertainty estimation for language models, especially for difficult inputs.
method ALIEN refines entropy-based uncertainty by aligning it with prediction reliability, using a lightweight uncertainty head.
result ALIEN consistently outperforms strong baselines in detecting incorrect predictions and achieving the lowest calibration error.
The study proves compactness and existence of entropy minimizers for self-shrinking surfaces.
problem Understanding entropy in higher-codimension mean curvature flow.
method Measure-theoretical techniques and rigidity results for self-shrinkers.
result Existence of entropy minimizers and improved rigidity results.
Introduces RPU to explain randomization preference in dynamic settings.
problem Explains preference for randomization in dynamic investment problems.
method Introduces recursive perturbed utility (RPU) to incorporate randomization preference.
result Proves RPU-optimal portfolio policy is Gaussian and can be expressed in closed form.
Local Sobolev inequality on Ricci flows with applications.
problem Understanding the local geometry of Ricci flows.
method Proving a local Sobolev inequality for Ricci flows.
result The local ν-functional depends only on the Nash entropy at the center of a disk.
MESSY estimation recovers symbolic density functions from samples using maximum entropy.
problem Estimating probability density functions from limited samples.
method Maximum-Entropy approach with gradient flow and symbolic regression.
result Efficiently finds optimal symbolic expressions for unknown distributions.
A framework uses free probability to analyze Transformer models.
problem Understanding the dynamics and complexity of Transformer-based language models.
method Formal operator-theoretic analysis using free probability theory.
result Entropy-based generalization bounds derived under freeness assumptions.
We describe a method for selecting relevant new training data for the LSTM-based domain selection component of our personal assistant system. Adding more annotated training data for any ML system typically improves accuracy, but only if it provides examples not already adequately covered in the existing data. However, …
We present a procedure for effective estimation of entropy and mutual information from small-sample data, and apply it to the problem of inferring high-dimensional gene association networks. Specifically, we develop a James-Stein-type shrinkage estimator, resulting in a procedure that is highly efficient statistically …
Gintropy: Gini index based generalization of Entropyphysics.soc-ph
Paper introduces a new measure combining entropy and Gini index.
problem Quantifying complexity in socio- and econo-physics.
method Generalizes entropy using Gini index and Lorenz curve transformation.
result Supports quantifying complexity in socio- and econo-physics.
CAT framework improves AI medical screening fairness and reliability.
problem Imbalanced data, varying performance across cohorts, and patient-level inconsistencies in traditional metrics.
method CAT framework introduces patient-level assessment, entropy-based distribution weighting, and cohort-weighted sensitivity and specificity.
result Enhanced predictive reliability, fairness, and interpretability of AI-driven medical screening models.
Diagnostic stroke imaging with C-arm cone-beam computed tomography (CBCT) enables reduction of time-to-therapy for endovascular procedures. However, the prolonged acquisition time compared to helical CT increases the likelihood of rigid patient motion. Rigid motion corrupts the geometry alignment assumed during reconst…
SOAR improves deep networks' robustness against adversarial examples.
problem Improving deep neural networks' robustness against adversarial examples.
method Formulated adversarial robustness problem under robust optimization framework, approximated loss function using second-order Taylor series expansion.
result SOAR significantly improves robustness of networks against adversarial perturbations.
In this paper, we present a machine learning approach for estimating the number of incident wavefronts in a direction of arrival scenario. In contrast to previous works, a multilayer neural network with a cross-entropy objective is trained. Furthermore, we investigate an online training procedure that allows an adaptio…
The paper establishes bounds for Ricci flows using entropy and heat kernel methods.
problem Analyzing geometric and analytic properties of Ricci flows.
method Entropy and heat kernel bounds, monotonicity formula for variance of conjugate heat kernels.
result Optimal bounds for Ricci flows, including volume, heat kernel, and entropy estimates.
Exploration is an extremely challenging problem in reinforcement learning, especially in high dimensional state and action spaces and when only sparse rewards are available. Effective representations can indicate which components of the state are task relevant and thus reduce the dimensionality of the space to explore.…
An Entropy-Based Test and Development Framework for Uncertainty Modeling in Level-Set Visualizationscs.HC
The study evaluates different probability models for uncertainty visualization using entropy calculations.
problem Choosing the right probability model affects memory use, run time, and accuracy in uncertainty visualization.
method Entropy calculation on ensemble data to compare various probability models (uniform, Gaussian, histogram, quantile).
result Models matching the ensemble data distribution have the lowest entropy, indicating better accuracy.
We consider the issue of multiple agents learning to communicate through reinforcement learning within partially observable environments, with a focus on information asymmetry in the second part of our work. We provide a review of the recent algorithms developed to improve the agents' policy by allowing the sharing of …
The interdependent nature of the global economy has become stronger with increases in international trade and investment. We propose a new model to reconstruct the international trade network and associated cost network by maximizing entropy based on local information about inward and outward trade. We show that the tr…
Paper introduces variance-based measures for second-order uncertainty quantification in classification problems.
problem Uncertainty in machine learning predictions and decision-making.
method Second-order uncertainty quantification using variance-based measures.
result Variance-based measures effectively quantify uncertainty on a class-based level and are competitive with entropy-based measures.
We investigate entropy as a financial risk measure. Entropy explains the equity premium of securities and portfolios in a simpler way and, at the same time, with higher explanatory power than the beta parameter of the capital asset pricing model. For asset pricing we define the continuous entropy as an alternative meas…
High quality reconstruction with interventional C-arm cone-beam computed tomography (CBCT) requires exact geometry information. If the geometry information is corrupted, e. g., by unexpected patient or system movement, the measured signal is misplaced in the backprojection operation. With prolonged acquisition times of…
Sample size determination for a data set is an important statistical process for analyzing the data to an optimum level of accuracy and using minimum computational work. The applications of this process are credible in every domain which deals with large data sets and high computational work. This study uses Bayesian a…
New estimator for joint entropy outperforms existing methods in various distributions.
problem Estimating joint entropy in high-dimensional spaces.
method Partitioned sample spacing (PSS) for nonparametric estimation.
result PSS consistently outperforms k-NN and normalizing flow methods.
For decomposable score-based structure learning of Bayesian networks, existing approaches first compute a collection of candidate parent sets for each variable and then optimize over this collection by choosing one parent set for each variable without creating directed cycles while maximizing the total score. We target…