PreprintCC BY 4.0arXiv
On the discrete Fisher information
Abstract
We investigate a discrete analogue of the Fisher information. By using a discrete Laplacian operator, we can construct a discrete analogue of the score function and hence of the information. This provides a natural framework for establishing several information-theoretic inequalities in the discrete setting.
Related
- Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry
- A Sharp Fisher-Information Inequality for Boolean Pairs: Proof of the Amari--Kobayashi Conjecture
- Conditional Fisher-Information Central Limit Theorems under Log-Concavity with Information-Theoretic Consequences
- A Hexagonal Counterexample to Log-Convexity of Fisher Information Along the Heat Flow
- Bayesian Optimization with Fisher Information Geometry: Gradient Bounds and Trust-Region Methods
BibTeX
@misc{ball2026discrete,
title = {{On the discrete Fisher information}},
author = {Keith M. Ball and Barnabás Gárgyán},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.19076},
eprint = {2610.19076},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.19076},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On the discrete Fisher information
AU - Keith M. Ball
AU - Barnabás Gárgyán
PY - 2026
DA - 2026/10/13
PB - arXiv
DO - 10.48550/arxiv.2610.19076
UR - https://arxiv.org/abs/2610.19076
AB - We investigate a discrete analogue of the Fisher information. By using a discrete Laplacian operator, we can construct a discrete analogue of the score function and hence of the information. This provides a natural framework for establishing several information-theoretic inequalities in the discrete setting.
ER -