Exploring properties and inequalities for geometrically arithmetically-Cr-convex functions with Cr-order relative entropy
We introduce a new class of interval-valued functions which we call Geometrically
Arithmetically Cr-convex functions (GA-Cr-convex functions) and investigate its properties …
Arithmetically Cr-convex functions (GA-Cr-convex functions) and investigate its properties …
Self organizing maps for cultural content delivery
Tailored analytics play a key role in the successful delivery of cultural content to huge and
diverse groups. Primarily the latter depends on a number of information retrieval factors …
diverse groups. Primarily the latter depends on a number of information retrieval factors …
Extracting robust and accurate features via a robust information bottleneck
We propose a novel strategy for extracting features in supervised learning that can be used
to construct a classifier which is more robust to small perturbations in the input space. Our …
to construct a classifier which is more robust to small perturbations in the input space. Our …
From torch to projector: Fundamental tradeoff of integrated sensing and communications
Sensing and communications (S&C) were historically developed in parallel. In the last
decade, they have been evolving from separation to integration, giving rise to the integrated …
decade, they have been evolving from separation to integration, giving rise to the integrated …
Stability of Bernstein's theorem and soft doubling for vector Gaussian channels
MM Mahvari, G Kramer - IEEE Transactions on Information …, 2023 - ieeexplore.ieee.org
The stability of Bernstein's characterization of Gaussian distributions is extended to vectors
by utilizing characteristic functions. Stability is used to develop a soft doubling argument that …
by utilizing characteristic functions. Stability is used to develop a soft doubling argument that …
Estimation: On the Optimality of Linear Estimators
Consider the problem of estimating a random variable $ X $ from noisy observations $ Y=
X+ Z $, where $ Z $ is standard normal, under the $ L^ 1$ fidelity criterion. It is well known …
X+ Z $, where $ Z $ is standard normal, under the $ L^ 1$ fidelity criterion. It is well known …
An algebraic and probabilistic framework for network information theory
In this monograph, we develop a mathematical framework based on asymptotically good
random structured codes, ie, codes possessing algebraic properties, for network information …
random structured codes, ie, codes possessing algebraic properties, for network information …
Euclidean forward–reverse Brascamp–Lieb inequalities: Finiteness, structure, and extremals
A new proof is given for the fact that centered Gaussian functions saturate the Euclidean
forward–reverse Brascamp–Lieb inequalities, extending the Brascamp–Lieb and Barthe …
forward–reverse Brascamp–Lieb inequalities, extending the Brascamp–Lieb and Barthe …
A globally convergent difference-of-convex algorithmic framework and application to log-determinant optimization problems
The difference-of-convex algorithm (DCA) is a conceptually simple method for the
minimization of (possibly) nonconvex functions that are expressed as the difference of two …
minimization of (possibly) nonconvex functions that are expressed as the difference of two …
Quantum Brascamp–Lieb dualities
Brascamp–Lieb inequalities are entropy inequalities which have a dual formulation as
generalized Young inequalities. In this work, we introduce a fully quantum version of this …
generalized Young inequalities. In this work, we introduce a fully quantum version of this …