Vanishing Fisher information

被引：3
|
作者：
Klaassen, CAJ
Lenstra, AJ
机构：
[1] Univ Amsterdam, Korteweg de Vries Inst Math, NL-1018 TV Amsterdam, Netherlands
[2] EURANDOM, NL-5600 MB Eindhoven, Netherlands
来源：
ACTA APPLICANDAE MATHEMATICAE | 2003年 / 78卷 / 1-3期
关键词：
uniform root n-consistency; Fisher information; spread inequality;
D O I：
10.1023/A:1025785432765
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
There are consistently estimable parameters of interest whose semiparametric Fisher information vanishes at some points of the model in question. Here we investigate how bad this is for estimation.
引用
收藏
页码：193 / 200
页数：8
相关论文
共 50 条
  • [1] Vanishing Fisher Information
    Chris A. J. Klaassen
    Andries J. Lenstra
    Acta Applicandae Mathematica, 2003, 78 : 193 - 200
  • [2] Quantum Fisher kernel for mitigating the vanishing similarity issue
    Suzuki, Yudai
    Kawaguchi, Hideaki
    Yamamoto, Naoki
    QUANTUM SCIENCE AND TECHNOLOGY, 2024, 9 (03):
  • [3] Complexity and Fisher information
    Binder, P.-M.
    Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 2000, 61 (04):
  • [4] INVARIANT FISHER INFORMATION
    NOGUCHI, M
    DIFFERENTIAL GEOMETRY AND ITS APPLICATIONS, 1994, 4 (02) : 179 - 199
  • [5] Clocks and fisher information
    Chen, Ping
    Luo, Shunlong
    THEORETICAL AND MATHEMATICAL PHYSICS, 2010, 165 (02) : 1552 - 1564
  • [6] FISHER INFORMATION AND CONVEXITY
    COHEN, ML
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (04) : 591 - +
  • [7] A Tutorial on Fisher information
    Ly, Alexander
    Marsman, Maarten
    Verhagen, Josine
    Grasman, Raoul P. P. P.
    Wagenmakers, Eric-Jan
    JOURNAL OF MATHEMATICAL PSYCHOLOGY, 2017, 80 : 40 - 55
  • [8] Complexity and Fisher information
    Binder, PM
    PHYSICAL REVIEW E, 2000, 61 (04): : R3303 - R3305
  • [9] Clocks and fisher information
    Ping Chen
    Shunlong Luo
    Theoretical and Mathematical Physics, 2010, 165 : 1552 - 1564
  • [10] Fisher Information Properties
    Zegers, Pablo
    ENTROPY, 2015, 17 (07) : 4918 - 4939
12345