Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 332

The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.

Lower bounds for parametric estimation with constraints

Gorman, J.D., Hero, A.O.·1990·IEEE Transactions on Information Theory

Abstract

A Chapman-Robbins form of the Barankin bound is used to derive a multiparameter Cramer-Rao (CR) type lower bound on estimator error covariance when the parameter theta in R/sup n/ is constrained to lie in a subset of the parameter space. A simple form for the constrained CR bound is obtained when the constraint set Theta /sub C/, can be expressed as a smooth functional inequality constraint. It is shown that the constrained CR bound is identical to the unconstrained CR bound at the regular points of Theta /sub C/, i.e. where no equality constraints are active. On the other hand, at those points theta in Theta /sub C/ where pure equality constraints are active the full-rank Fisher information matrix in the unconstrained CR bound must be replaced by a rank-reduced Fisher information matrix obtained as a projection of the full-rank Fisher matrix onto the tangent hyperplane of the full-rank Fisher matrix onto the tangent hyperplane of the constraint set at theta . A necessary and sufficient condition involving the forms of the constraint and the likelihood function is given for the bound to be achievable, and examples for which the bound is achieved are presented. In addition to providing a useful generalization of the CR bound, the results permit analysis of the gain in achievable MSE performance due to the imposition of particular constraints on the parameter space without the need for a global reparameterization.>

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/18.59929

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 20 references

Cited by

See all 332

Metadata

Authors
Gorman, J. D., & Hero, A. O.
Venue
IEEE Transactions on Information Theory
Published
1990
Volume
36
Issue
6
Pages
1285-1301
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2128203095
Cited by
332
References
20
FWCI
2.16
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Lower bounds for parametric estimation with constraints. https://app.cochat.ai/papers/10.1109/18.59929
The paper
Gorman, J. D., & Hero, A. O. (1990). Lower bounds for parametric estimation with constraints. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.59929

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.