Related papers: Multi-q Analysis of Image Patterns
We generalize the completely monotone conjecture ([CG15]) from Shannon entropy to the Tsallis entropy up for orders up to at least four. To this end, we employ the algorithm ([J\"un16, JM06a]) which employs the technique of systematic…
We prove characterization theorems for relative entropy (also known as Kullback-Leibler divergence), q-logarithmic entropy (also known as Tsallis entropy), and q-logarithmic relative entropy. All three have been characterized axiomatically…
The Lagrangian technique of Niven (2004, Physica A, 334(3-4): 444) is used to determine the constrained forms of the Tsallis entropy function - i.e. Lagrangian functions in which the probabilities of each state are independent - for each…
Tsallis' non-extensive entropy $S_q$ enables us to treat both a power and exponential evolutions of underlying microscopic dynamics on equal footing by adjusting the variable entropic index $q$ to proper one $q^*$. We propose an alternative…
In density estimation task, maximum entropy model (Maxent) can effectively use reliable prior information via certain constraints, i.e., linear constraints without empirical parameters. However, reliable prior information is often…
Camera traps are a method for monitoring wildlife and they collect a large number of pictures. The number of images collected of each species usually follows a long-tail distribution, i.e., a few classes have a large number of instances,…
We discuss the generalized von Neumann (Tsallis) entropy and the generalized Fisher information (GFI) in nonextensive quantum systems, by using the interpolation approximation (IA) which has been shown to yield good results for the quantal…
We derive a scaling property from a fundamental nonlinear differential equation whose solution is the so-called q-exponential function. A scaling property has been believed to be given by a power function only, but actually more general…
Maximum Tsallis entropy (MTE) framework in reinforcement learning has gained popularity recently by virtue of its flexible modeling choices including the widely used Shannon entropy and sparse entropy. However, non-Shannon entropies suffer…
This paper investigates applicability of thermodynamic concepts and principles to competitive systems. We show that Tsallis entropies are suitable for characterisation of systems with transitive competition when mutations deviate from Gibbs…
Zooplankton images, like many other real world data types, have intrinsic properties that make the design of effective classification systems difficult. For instance, the number of classes encountered in practical settings is potentially…
We revisit the cut-off prescriptions which are needed in order to specify completely the form of Tsallis' maximum entropy distributions. For values of the Tsallis entropic parameter $q>1$ we advance an alternative cut-off prescription and…
We explore a possible application of the additive generalization of the Boltzmann-Gibbs-Shannon entropy proposed in [A.N. Gorban, I.V. Karlin, Phys. Rev. E, 67:016104 (2003)] to fully developed turbulence. The predicted probability…
We consider statistically independent non-identical subsystems with different entropic indices q1 and q2. A relation between q1, q2 and q' (for the entire system) extends a power law for entropic index as a function of distance r. A few…
This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence,…
We introduce an information-theoretic generalization of the fixation statistic, the Tsallis-order $q$ F-statistic, $F_q$, which measures the fraction of Tsallis $q$-entropy lost within subpopulations relative to the pooled population. The…
In this paper entropy based methods are compared and used to measure structural diversity of an ensemble of 21 classifiers. This measure is mostly applied in ecology, whereby species counts are used as a measure of diversity. The measures…
We study the properties of Tsallis entropy and Shannon entropy from the point of view of algorithmic randomness. In algorithmic information theory, there are two equivalent ways to define the program-size complexity K(s) of a given finite…
This paper proposes a new probabilistic non-extensive entropy feature for texture characterization, based on a Gaussian information measure. The highlights of the new entropy are that it is bounded by finite limits and that it is non…
Quantum entropy and skew information play important roles in quantum information science. They are defined by the trace of the positive operators so that the trace inequalities often have important roles to develop the mathematical theory…