4 citations · 7 across the 3 of their papers we have counts for
6 papers · 1 filter
Information Geometry and Classical Cramér-Rao Type Inequalities
Kumar Vijay Mishra, M. Ashok Kumar
We examine the role of information geometry in the context of classical Cramér-Rao (CR) type inequalities. In particular, we focus on Eguchi's theory of obtaining dualistic geometr…
Are Guessing, Source Coding, and Tasks Partitioning Birds of a Feather?
M. Ashok Kumar, Albert Sunny, Ashish Thakre +2
This paper establishes a close relationship among the four information theoretic problems, namely Campbell source coding, Arikan guessing, Huleihel et al. memoryless guessing and B…
Cramér-Rao Lower Bounds Arising from Generalized Csiszár Divergences
M. Ashok Kumar, Kumar Vijay Mishra
We study the geometry of probability distributions with respect to a generalized family of Csiszár -divergences. A member of this family is the relative -entropy which is als…
A Unified Framework for Problems on Guessing, Source Coding and Task Partitioning
M. Ashok Kumar, Albert Sunny, Ashish Thakre +1
We study four problems namely, Campbell's source coding problem, Arikan's guessing problem, Huieihel et al.'s memoryless guessing problem, and Bunte and Lapidoth's task partitionin…
Information Geometric Approach to Bayesian Lower Error Bounds
M. Ashok Kumar, Kumar Vijay Mishra
Information geometry describes a framework where probability densities can be viewed as differential geometry structures. This approach has shown that the geometry in the space of…
Projection Theorems of Divergences and Likelihood Maximization Methods
Atin Gayen, M. Ashok Kumar
Projection theorems of divergences enable us to find reverse projection of a divergence on a specific statistical model as a forward projection of the divergence on a different but…