LAISHA
Open Laisha

ICAR AICE-JRF/SRF Statistical Inference I: Estimation: practice questions

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) · India · National Testing Agency for ICAR

Original practice questions written to the published syllabus · not past papers
10worked here, free
51written to this exam in this subject
11syllabus units

What this subject covers

How to estimate well and know it: sufficiency and completeness, unbiasedness and minimum variance, the Cramer-Rao bound, the Rao-Blackwell and Lehmann-Scheffe theorems, the methods of moments, maximum likelihood and minimum chi-square, and confidence intervals.

In the exams: AICE-JRF Ag Stat Unit 1 (heavy: each theorem named); GATE ST 'Estimation' (heavy); IIT JAM MS (heavy); UPSC ISS Statistics I (heavy); ISI and CSIR-NET (present)

What ICAR AICE-JRF/SRF asks from it

ICAR AICE-JRF/SRF Agricultural Statistics (Unit 1)

Statements and applications of the Cramér-Rao, Rao-Blackwell and Lehmann-Scheffé theorems; sufficiency by factorisation; MLE and moment estimators of standard distributions; interval estimation.

Where the 51 questions fall

How our questions for ICAR AICE-JRF/SRF spread across the units of Statistical Inference I: Estimation. Difficulty: 11 easy, 20 medium, 20 hard.

Completeness, ancillarity and Basu's theorem7
Iterative maximum likelihood: Newton-Raphson and Fisher scoring7
Maximum likelihood: properties, invariance and asymptotic normality6
Sufficiency, the factorisation theorem and minimal sufficiency5
Minimum variance unbiased estimation; Rao-Blackwell and Lehmann-Scheffe theorems5
Cramer-Rao inequality and Fisher information5
Point estimation: unbiasedness, consistency and efficiency4
Minimum chi-square and other methods4
Interval estimation: pivotal quantities and coverage3
Large-sample confidence intervals3
Method of moments2

10 practice questions, worked

Choose an answer, then open the working. Each explanation says why the right answer is right and why the others are not.

1 · Sufficiency, the factorisation theorem and minimal sufficiency · medium

X₁, ..., Xₙ are iid with density θx^(θ−1) on (0, 1), θ > 0. Which statistic is sufficient for θ?

  1. Σ log Xᵢ
  2. ΣXᵢ and ΣXᵢ²
  3. X₍ₙ₎
  4. ΣXᵢ
Answer and working

A. Σ log Xᵢ

L = θⁿ(ΠXᵢ)^(θ−1) = θⁿ exp[(θ − 1)Σ log Xᵢ], so ΠXᵢ, equivalently Σ log Xᵢ, is sufficient. This is a beta(θ, 1) exponential family with T(x) = log x.

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

2 · Minimum variance unbiased estimation; Rao-Blackwell and Lehmann-Scheffe theorems · easy

What does the Rao-Blackwell theorem guarantee for an unbiased estimator U and a sufficient statistic T?

  1. E(U | T) is the unique UMVUE, whatever the family of distributions
  2. E(U | T) is unbiased with variance ≤ Var(U) for every θ
  3. E(U | T) attains the Cramér-Rao lower bound for every θ
  4. E(U | T) is consistent, even if U itself is not consistent
Answer and working

B. E(U | T) is unbiased with variance ≤ Var(U) for every θ

Conditioning on a sufficient statistic keeps unbiasedness and cannot raise variance (law of total variance). Uniqueness and UMVUE status need completeness as well (Lehmann-Scheffé); attaining the CRLB is not guaranteed.

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

3 · Minimum variance unbiased estimation; Rao-Blackwell and Lehmann-Scheffe theorems · easy

What does the Lehmann-Scheffé theorem state?

  1. An estimator attaining the Cramér-Rao bound is a function of a complete statistic, and hence unique
  2. An unbiased estimator that is a function of a complete sufficient statistic is the unique UMVUE
  3. The MLE is the UMVUE whenever a complete sufficient statistic exists
  4. Any function of a sufficient statistic is the UMVUE of its own expectation
Answer and working

B. An unbiased estimator that is a function of a complete sufficient statistic is the unique UMVUE

Completeness ensures uniqueness of the unbiased function of T, and Rao-Blackwell ensures it beats every other unbiased estimator. Sufficiency without completeness is not enough, and the MLE is often biased (uniform maximum, normal σ̂²).

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

4 · Cramer-Rao inequality and Fisher information · hard

Counts are iid Poisson(λ). What is the Cramér-Rao lower bound for an unbiased estimator of ψ(λ) = e^(−λ), at λ = 2 with n = 10?

  1. 0.0009
  2. 0.2000
  3. 0.0271
  4. 0.0037
Answer and working

D. 0.0037

Bound = [ψ′(λ)]²/[nI(λ)] = e^(−2λ)/(n/λ) = λe^(−2λ)/n = 2e^(−4)/10 = 0.0037. 0.2000 is the bound for λ itself; omitting the square of ψ′ gives 0.0271; dividing by λ instead of multiplying gives 0.0009.

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

5 · Method of moments · easy

Aphid counts per leaf have mean 2 and variance 6. What is the method-of-moments estimate of the negative binomial k?

  1. 1.0
  2. 3.0
  3. 0.67
  4. 0.5
Answer and working

A. 1.0

From variance = m + m²/k: k̂ = X̄²/(S² − X̄) = 4/4 = 1.0. 3.0 is the dispersion index S²/X̄.

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

6 · Maximum likelihood: properties, invariance and asymptotic normality · medium

For a random sample from the Laplace (double exponential) density (1/2)e^(−|x − θ|), what is the MLE of θ?

  1. The sample mode
  2. The midrange (X₍₁₎ + X₍ₙ₎)/2
  3. The sample mean
  4. The sample median
Answer and working

D. The sample median

Maximising L means minimising Σ|xᵢ − θ|, which is achieved by the median. The mean minimises squared deviations (normal case); the midrange is relevant for uniform location.

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

7 · Maximum likelihood: properties, invariance and asymptotic normality · hard

X₁, ..., Xₙ are iid uniform on (θ − 1/2, θ + 1/2). Which statement about the MLE of θ is correct?

  1. It is unique and equals the sample maximum X₍ₙ₎
  2. It is not unique: any value in [X₍ₙ₎ − 1/2, X₍₁₎ + 1/2] maximises L
  3. It does not exist, because the likelihood is unbounded near the sample extremes
  4. It is unique and equals the sample mean X̄
Answer and working

B. It is not unique: any value in [X₍ₙ₎ − 1/2, X₍₁₎ + 1/2] maximises L

L(θ) = 1 when X₍ₙ₎ − 1/2 ≤ θ ≤ X₍₁₎ + 1/2 and 0 otherwise: a flat maximum over an interval. The midrange is one natural choice within it.

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

8 · Minimum chi-square and other methods · medium

For multinomial data, minimising the likelihood-ratio statistic G² = 2ΣOⱼ log(Oⱼ/Eⱼ(θ)) over θ is equivalent to which estimation method?

  1. Least squares on the frequencies
  2. The method of moments
  3. Maximum likelihood
  4. Minimum Pearson chi-square
Answer and working

C. Maximum likelihood

G² = 2[ΣOⱼ log Oⱼ − ΣOⱼ log Eⱼ(θ)], and the first term does not involve θ, so minimising G² maximises ΣOⱼ log pⱼ(θ), the multinomial log-likelihood.

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

9 · Iterative maximum likelihood: Newton-Raphson and Fisher scoring · easy

What is the Newton-Raphson update for maximising a log-likelihood ℓ(θ) of one parameter?

  1. θ₍ₖ₊₁₎ = θ₍ₖ₎ − ℓ(θ₍ₖ₎)/ℓ′(θ₍ₖ₎)
  2. θ₍ₖ₊₁₎ = θ₍ₖ₎ + ℓ″(θ₍ₖ₎)/ℓ′(θ₍ₖ₎)
  3. θ₍ₖ₊₁₎ = θ₍ₖ₎ − ℓ′(θ₍ₖ₎) / ℓ″(θ₍ₖ₎)
  4. θ₍ₖ₊₁₎ = θ₍ₖ₎ + ℓ′(θ₍ₖ₎)/ℓ″(θ₍ₖ₎)
Answer and working

C. θ₍ₖ₊₁₎ = θ₍ₖ₎ − ℓ′(θ₍ₖ₎) / ℓ″(θ₍ₖ₎)

Expanding ℓ′(θ) ≈ ℓ′(θₖ) + (θ − θₖ)ℓ″(θₖ) = 0 gives the update with a minus sign; near a maximum ℓ″ < 0, so the step moves in the direction of the score. θ − ℓ/ℓ′ solves ℓ = 0, the wrong equation.

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

10 · Iterative maximum likelihood: Newton-Raphson and Fisher scoring · hard

For a generalised linear model with canonical link, such as logistic regression for germination data, which statement is correct?

  1. Fisher scoring converges but Newton-Raphson diverges, because the observed Hessian is random
  2. Neither method applies; the EM algorithm must be used for every GLM
  3. Fisher scoring and Newton-Raphson coincide, each step being a weighted least-squares fit
  4. Newton-Raphson needs no starting values, because the likelihood is quadratic
Answer and working

C. Fisher scoring and Newton-Raphson coincide, each step being a weighted least-squares fit

With the canonical link the observed and expected information are equal, so the two algorithms are the same and take the iteratively reweighted least squares form. Starting values are still needed (usually from the data themselves).

Further reading: Casella and Berger, Statistical Inference; Lehmann and Casella, Theory of Point Estimation; Rohatgi and Saleh, An Introduction to Probability and Statistics

Ten here, 51 in the app. The Laisha app has every practice question we have written to ICAR AICE-JRF/SRF in this subject, marked as you go, with timed papers, a jump-to-unanswered list and a certificate when you pass at 70 per cent.

Free for ten days, then one subscription of US$10 a month. We would rather say so here than have you find it later.

Practise the full set in Laisha →

Read the subject

Statistical Inference I: EstimationThe full study manual, free ICAR AICE-JRF/SRFFormat, sections and how it has changed

More ICAR AICE-JRF/SRF practice

Statistical Genomics: QTL Mapping, GWAS & Genomic SelectionLinear Models & Regression AnalysisCrop Forecasting, Weather-Based Models & Non-linear Growth ModelsPrinciples of Experimental Design & Basic DesignsBioinformatics & Computational BiologySampling Theory II: Unequal Probability, Cluster, Multistage & Repeated SamplingFactorial Experiments, Confounding, Split- & Strip-Plot DesignsStatistical Genetics: Population & Quantitative GeneticsGroups of Experiments, Multi-Location Trials & Genotype x Environment AnalysisAdvanced Design of Experiments (PhD)Biometrical Techniques in Plant & Animal BreedingIncomplete Block Designs & Design ConstructionSmall Area Estimation & Model-Based Survey InferenceLinear Mixed Models, Variance Components & Spatial Analysis of Field TrialsSurvey Design, Questionnaires, Field Operations & Non-Sampling ErrorsSpecialised Agricultural Experiments: Cropping Systems, Animal & On-Farm TrialsMultivariate AnalysisSampling Theory I: Simple, Stratified, Systematic, Ratio & Regression EstimationCrop Area & Yield Estimation: Crop-Cutting ExperimentsBayesian InferenceCategorical Data Analysis & Generalized Linear ModelsOptimization Techniques for StatisticiansNonparametric & Rank-Based MethodsBioassay, Survival & Epidemiological Statistics

Statistical Inference I: Estimation for other exams

GATE · IndiaIIT JAM · IndiaCUET-PG · IndiaIndian Statistical Institute admission tests · IndiaCSIR-UGC NET · IndiaState statistical services · IndiaASRB NET · IndiaIndian Statistical Service Examination · India

Ask Laisha about this

Opens Laisha's chat with your question ready to send. Sign in or start free.