相关论文: Equivalence of Two Proof Techniques for Non-Shanno…

A generalized skew information is defined and a generalized uncertainty relation is established with the help of a trace inequality which was recently proven by J.I.Fujii. In addition, we prove the trace inequality conjectured by S.Luo and…

We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is…

Shannon and Khinchin showed that assuming four information theoretic axioms the entropy must be of Boltzmann-Gibbs type, $S=-\sum_i p_i \log p_i$. Here we note that in physical systems one of these axioms may be violated. For non-ergodic…

According to Blackwell's Theorem it is equivalent to compare channels by either a garbling order or optimal decision making. This equivalence does not hold anymore if also allowing pre-garbling, i. e. for the so-called Shannon-order (see…

In this paper we introduce a new technique for proving norm inequalities in operator ideals with an unitarily invariant norm. Among the well known inequalities which can be proved with this technique are the L\"owner-Heinz inequality,…

Language style transferring rephrases text with specific stylistic attributes while preserving the original attribute-independent content. One main challenge in learning a style transfer system is a lack of parallel data where the source…

A renowned information-theoretic formula by Shannon expresses the mutual information rate of a white Gaussian channel with a stationary Gaussian input as an integral of a simple function of the power spectral density of the channel input.…

Test statistics which are invariant under various subgroups of the orthogonal group are shown to provide tests whose powers are asymptotically equal to their level against the usual type of contiguous alternative in models where the number…

We give the Choi-Davis-Jensen type inequality without using convexity. Applying our main results, we also give new inequalities improving previous known results. In particular, we show some inequalities for relative operator entropies and…

The ``impossibility theorem'' -- which is considered foundational in algorithmic fairness literature -- asserts that there must be trade-offs between common notions of fairness and performance when fitting statistical models, except in two…

It is well known that there is a strong connection between entropy inequalities and submodularity, since the entropy of a collection of random variables is a submodular function. Unifying frameworks for information inequalities arising from…

Noncontextuality inequalities are usually derived from the distinguishability properties of quantum states, i.e. their orthogonality. Here, we show that antidistinguishability can also be used to derive noncontextuality inequalities. The…

This paper presents some new inequalities, the most important of which is the inequality given in Theorem 2.1. It can solve a class of inequalities by a unified method. An important application of the inequality given in Theorem 2.1 is to…

The task of deciding whether two documents are written by the same author is challenging for both machines and humans. This task is even more challenging when the two documents are written about different topics (e.g. baseball vs. politics)…

Post-hoc explanations for black box models have been studied extensively in classification and regression settings. However, explanations for models that output similarity between two inputs have received comparatively lesser attention. In…

In this paper we formalize the notions of information elements and information lattices, first proposed by Shannon. Exploiting this formalization, we identify a comprehensive parallelism between information lattices and subgroup lattices.…

In the first part of this thesis, we discuss the algebraic approach to classical and quantum physics and develop information theoretic concepts within this setup. In the second part, we discuss the uncertainty principle in quantum…

Two-sample tests for multivariate data and non-Euclidean data are widely used in many fields. Parametric tests are mostly restrained to certain types of data that meets the assumptions of the parametric models. In this paper, we study a…

Ruzsa's equivalence theorem provided a framework for converting certain families of inequalities in additive combinatorics to entropic inequalities (which sometimes did not possess stand-alone entropic proofs). In this work, we first…

Two-sample feature selection is the problem of finding features that describe a difference between two probability distributions, which is a ubiquitous problem in both scientific and engineering studies. However, existing methods have…