Download presentation

Presentation is loading. Please wait.

Published byLayne Barley Modified about 1 year ago

1
General Classes of Lower Bounds on Outage Error Probability and MSE in Bayesian Parameter Estimation Tirza Routtenberg Dept. of ECE, Ben-Gurion University of the Negev Supervisor: Dr. Joseph Tabrikian

2
Outline Introduction Derivation of a new class of lower bounds on the probability of outage error Derivation of a new class of lower bounds on the MSE Bounds properties: tightness conditions, relation to the ZZLB Examples Conclusion

3
Introduction Bayesian parameter estimation Goal: to estimate the unknown parameter θ based on the observation vector x. Assumptions: θ and x are random variables The observation cdf and posterior pdf are known Applications: Radar/Sonar, Communication, Biomedical, Audio/speech,…

4
Mean-square error (MSE) Probability of outage error Introduction Parameter estimation criteria

5
Advantages of the probability of outage error criterion: Provides meaningful information in the presence of large errors case. Dominated by the all error distribution. Prediction of the operation region. SNR Large-errors Threshold Small errors MSE Introduction Parameter estimation criteria SNR Large-errors Threshold Small errors Probability of outage error

6
Introduction MMSE estimation The minimum MSE is attained by MMSE:

7
Introduction h-MAP estimation The h-MAP estimator is The corresponding minimum probability of h-outage error is

8
Performance lower bounds Motivation Performance analysis Threshold prediction System design Feasibility study Threshold bound PERFORMANCE MEASURE SNR or number of samples

9
Performance lower bounds Bounds desired features Computational simplicity Tightness Asymptotically coincides with the optimal performance Validity: independent of the estimator. Threshold bound PERFORMANCE MEASURE SNR or number of samples

10
Previous work: probability of outage error bounds Most of the existing bounds on the probability of outage error are based on the relation to the probability of error in decision procedure (binary/multiple). Kotelnikov inequality - lower bound for uniformly distributed unknown parameter.

11
Previous work: Bayesian MSE bounds Bayesian Cramér–Rao (Van Trees, 1968) Bayesian Bhattacharyya bound (Van Trees 1968) Weiss–Weinstein (1985) Reuven-Messer (1997) Bobrovski–Zakai (1976) Bayesian MSE bounds Weiss–Weinstein class The covariance inequality Ziv-Zakai class Relation to probability of error in decision problem Ziv–Zakai (ZZLB) (1969) Bellini–Tartara (1974) Chazan–Zakai–Ziv (1975) Extended ZZLB (Bell, Steinberg, Ephraim,Van Trees,1997)

12
General class of outage error probability lower bounds The probability of outage error ? (Reverse) Hölder inequality for Taking

13
Objective: obtain valid bounds, independent of. General class of outage error probability lower bounds

14
Theorem: A necessary and sufficient condition to obtain a valid bound which is independent of the estimator, is that the function is periodic in θ with period h, almost everywhere. General class of outage error probability lower bounds

15
Using Fourier series representation the general class of bounds is General class of outage error probability lower bounds

16
Example: Linear Gaussian model The model The minimum h-outage error probability: The single coefficient bound:

17
■ The bound is maximized w.r.t. for given p The tightest subclass of lower bounds Convergence condition: There exists l 0 h (θ,x), α>0 such that for all │l│≥│l 0 h (θ,x)│ This mild condition guaranties that converges for every p≥1.

18
Under the convergence condition, the tightest bounds are The tightest subclass of lower bounds h – sampling period Repeat for all x and

19
Properties: ■ The bound exists ■ The bound becomes tighter by decreasing p. ■ For p→1 +, the tightest bound is The tightest subclass of lower bounds Under the convergence condition, the tightest bounds are h – sampling period

20
General class of MSE lower bounds The probability of outage error and MSE are related via: Chebyshev's inequality Known probability identity

21
New MSE lower bounds can be obtained by using and lower bounding the probability of outage error For example: ■ General class of MSE bounds: ■ The tightest MSE bound: General class of MSE lower bounds

22
General class of lower bounds on different cost functions Arbitrary cost function C(·) that is non-decreasing and differentiable satisfies Thus, it can be bounded using lower bounds on the probability of outage error Examples: the absolute error, higher moments of the error.

23
The extended ZZLB is The tightest proposed MSE bound can be rewritten as Properties: Relation to the ZZLB Theorem The proposed tightest MSE bound is always tighter than the extended ZZLB.

24
For any converging sequence of non-negative numbers Therefore, Properties: Relation to the ZZLB ZZLBThe proposed bound max out

25
Properties: unimodal symmetric pdf Theorem: A. If the posterior pdf f θ| x (θ| x) is unimodal, then the proposed tightest outage error probability bound coincides with the minimum probability of outage error for every h>0. B. If the posterior pdf f θ| x (θ| x) is unimodal and symmetric, then the proposed tightest MSE bound coincides with the minimum MSE.

26
Example 1 Statistics

27
The model Statistics Example 2

28
Conclusion The concept of probability of outage error criterion is proposed. New classes of lower bounds on the probability of outage error and on the MSE in Bayesian parameter estimation were derived. It is shown that the proposed tightest MSE bound is always tighter than the Ziv-Zakai lower bound. Tightness of the bounds: Probability of outage error- condition: Unimodal posterior pdf. MSE – condition: Unimodal and symmetric posterior pdf.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google