Cramér–Rao bound
E157397
The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Cramér–Rao bound canonical | 3 |
| Cramér–Rao inequality | 2 |
| Cramér–Rao lower bound | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1382696 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Cramér–Rao bound Context triple: [Gauss–Markov theorem, relatedTo, Cramér–Rao bound]
-
A.
Gauss–Markov theorem
The Gauss–Markov theorem is a fundamental result in statistics stating that, under certain conditions, the ordinary least squares estimator is the best linear unbiased estimator (BLUE) of the coefficients in a linear regression model.
-
B.
Berry–Esseen theorem
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
-
C.
Bekenstein bound
The Bekenstein bound is a theoretical limit in physics on the maximum amount of information or entropy that can be contained within a finite region of space with a given amount of energy.
-
D.
Rényi divergence
Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
-
E.
Linear Estimation
Linear Estimation is a foundational text in signal processing and control theory that systematically develops the theory and applications of optimal estimation, including Kalman filtering and related methods.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Cramér–Rao bound Target entity description: The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
-
A.
Gauss–Markov theorem
The Gauss–Markov theorem is a fundamental result in statistics stating that, under certain conditions, the ordinary least squares estimator is the best linear unbiased estimator (BLUE) of the coefficients in a linear regression model.
-
B.
Berry–Esseen theorem
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
-
C.
Bekenstein bound
The Bekenstein bound is a theoretical limit in physics on the maximum amount of information or entropy that can be contained within a finite region of space with a given amount of energy.
-
D.
Rényi divergence
Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
-
E.
Linear Estimation
Linear Estimation is a foundational text in signal processing and control theory that systematically develops the theory and applications of optimal estimation, including Kalman filtering and related methods.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
inequality in statistics
ⓘ
lower bound on variance ⓘ result in estimation theory ⓘ statistical bound ⓘ |
| alsoKnownAs |
Cramér–Rao bound
ⓘ
surface form:
Cramér–Rao inequality
Cramér–Rao bound ⓘ
surface form:
Cramér–Rao lower bound
|
| appliesTo |
parametric statistical models
ⓘ
scalar parameter estimation ⓘ unbiased estimators ⓘ vector parameter estimation ⓘ |
| assumes | unbiasedness of estimator ⓘ |
| characterizes | best possible precision of unbiased estimators ⓘ |
| condition |
differentiability of log-likelihood
ⓘ
interchangeability of integration and differentiation ⓘ regularity conditions on likelihood function ⓘ |
| describes | lower bound on variance of unbiased estimators ⓘ |
| equalityCondition |
achieved by efficient estimators
ⓘ
achieved by maximum likelihood estimator under regularity conditions ⓘ |
| field |
estimation theory
ⓘ
statistical inference ⓘ statistics ⓘ |
| gives | lower bound on covariance matrix of unbiased estimators ⓘ |
| historicalPeriod | 20th century ⓘ |
| implies | no unbiased estimator can have variance below the bound ⓘ |
| influenced |
design of optimal estimators
ⓘ
development of modern estimation theory ⓘ |
| limitation |
may not be tight in finite samples
ⓘ
may not hold for biased estimators ⓘ |
| mathematicalForm |
Cov(T) − I(θ)^{-1} is positive semidefinite for vector parameter θ
ⓘ
Var(T) ≥ 1 / I(θ) for scalar parameter θ ⓘ |
| namedAfter |
Calcutta Rao
ⓘ
Harald Cramér ⓘ |
| relatedConcept |
Barankin bound
ⓘ
Bhattacharyya distance ⓘ
surface form:
Bhattacharyya bound
Fisher information ⓘ
surface form:
Fisher information inequality
Van Trees inequality ⓘ efficient estimator ⓘ |
| relatesTo | Fisher information ⓘ |
| typeOf | information inequality ⓘ |
| usedFor |
assessing efficiency of estimators
ⓘ
benchmarking estimator performance ⓘ |
| usedIn |
Electronics and Communication Engineering
ⓘ
surface form:
communications engineering
control theory ⓘ econometrics ⓘ experimental design ⓘ machine learning ⓘ signal processing ⓘ |
| usesConcept |
Fisher information
ⓘ
surface form:
Fisher information matrix
|
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Cramér–Rao bound Description of subject: The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Cramér–Rao inequality
this entity surface form:
Cramér–Rao lower bound
this entity surface form:
Cramér–Rao inequality