Qm

The variance floor for a geometric success probability

You run a sequence of independent trials, each succeeding with probability pp, and record how many trials it takes to reach the first success. Repeating this nn times gives i.i.d. geometric counts X1,,XnX_1, \dots, X_n on {1,2,3,}\{1, 2, 3, \dots\}, with probability mass f(x;p)=(1p)x1pf(x;p) = (1-p)^{x-1}p.

Compute the Fisher information for pp and state the Cramer-Rao lower bound on the variance of any unbiased estimator of pp.

Your answer

Solving needs a free account

Answers, streaks and solutions unlock when you are signed in. Reading the question and the hint stays free.

Discussion

Sign in to join the discussion · reading is open to everyone

💡 Discussion rules

  1. No full solutions here. Hints and approaches only.
  2. Complexity, edge cases and intuition are the point.
  3. Interview experiences are welcome. Respect your NDAs.

Loading discussion…

Learn the concepts

The theory behind this question.

Related questions

The Cramer-Rao floor and how efficient the mean isCramér–Rao bound for a Bernoulli proportionThe variance floor for estimating an arrival rateThe variance floor for a normal mean with known spreadThe variance floor for a normal variance with known mean
All questions →