erth 491-01 / geop 572-02 geodetic methods [20pt] lecture ... · variational approach: assume...

29
ERTH 491-01 / GEOP 572-02 Geodetic Methods – Lecture 18: Modeling: Parameter Estimation – Ronni Grapenthin [email protected] MSEC 356 x5924 October 19, 2015 1 / 13

Upload: others

Post on 19-Aug-2020

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

ERTH 491-01 / GEOP 572-02Geodetic Methods

– Lecture 18: Modeling: Parameter Estimation –

Ronni [email protected] 356

x5924

October 19, 2015

1 / 13

Page 2: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

“Guess the Process”

UNAVCO, https://plus.google.com/112042426109504523574/posts/62kUxwSWCiB2 / 13

Page 3: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

“Guess the Process”

UNAVCO, https://plus.google.com/112042426109504523574/posts/62kUxwSWCiB2 / 13

Page 4: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

“Guess the Process”

UNAVCO, https://plus.google.com/112042426109504523574/posts/62kUxwSWCiB2 / 13

Page 5: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

“Guess the Process”

UNAVCO, https://plus.google.com/112042426109504523574/posts/62kUxwSWCiB2 / 13

Page 6: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

“Guess the Process”

UNAVCO, https://plus.google.com/112042426109504523574/posts/62kUxwSWCiB

3 / 13

Page 7: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

“Guess the Process”

2009 vs 2015

UNAVCO, https://plus.google.com/112042426109504523574/posts/62kUxwSWCiB4 / 13

Page 8: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

“Guess the Process”

2009 vs 2015UNAVCO, https://plus.google.com/112042426109504523574/posts/62kUxwSWCiB

4 / 13

Page 9: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Parameter Estimation

• We have measurements and an idea about the process - how dowe get best estimate for parameters? E.g.,

d = a + b ∗ x

where• d are the measurements (column vector)• x are the “coordinates” of the measurements (column vector)• a,b describe the process (scalars)

• What is a best estimate?• Yes, inference of parameters from measurements is an

estimation! WHY?

5 / 13

Page 10: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Matrix Notation

. . . on board . . .

6 / 13

Page 11: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Parameter Estimation

Let’s look at an example . . .

7 / 13

Page 12: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Least Squares Solution

• least squares is general approach to solve linear systems ofequations

• linear systems obey superposition and scaling• assume mi are model parameters, which of these are linear?

d = m1 + m2x − (1/2)m3x2

d = (m1 −m2x)1/2 −m23x

• General form: d = Gm + ε

• d is data vector• G design/model/system matrix || Green’s functions• m model parameters that “tweak” G• ε residuals / measurement errors

• Solve for m!

8 / 13

Page 13: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Least Squares Solution

• least squares is general approach to solve linear systems ofequations

• linear systems obey superposition and scaling• assume mi are model parameters, which of these are linear?

d = m1 + m2x − (1/2)m3x2

d = (m1 −m2x)1/2 −m23x

• General form: d = Gm + ε• d is data vector• G design/model/system matrix || Green’s functions• m model parameters that “tweak” G• ε residuals / measurement errors

• Solve for m!

8 / 13

Page 14: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Least Squares Solution

• General form: d = Gm + ε

• Least squares solution: mest = (GTG)−1GTd

How to get there?

• Variational approach:

• assume optimal solution minimizes length, j of the residual vector r :j = rT r

• Probabilistic approach:

• assume optimal solution is most probable one (maximumlikelihood), derived from probability density function of observingmeasurements

• Geometric approach:

• solution is a projection from data space into model space, what isprojection of vector b in direction of vector a

Most problems result in same least squares solution

9 / 13

Page 15: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Least Squares Solution

• General form: d = Gm + ε

• Least squares solution: mest = (GTG)−1GTd

How to get there?• Variational approach:

• assume optimal solution minimizes length, j of the residual vector r :j = rT r

• Probabilistic approach:

• assume optimal solution is most probable one (maximumlikelihood), derived from probability density function of observingmeasurements

• Geometric approach:

• solution is a projection from data space into model space, what isprojection of vector b in direction of vector a

Most problems result in same least squares solution

9 / 13

Page 16: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Least Squares Solution

• General form: d = Gm + ε

• Least squares solution: mest = (GTG)−1GTd

How to get there?• Variational approach:

• assume optimal solution minimizes length, j of the residual vector r :j = rT r

• Probabilistic approach:

• assume optimal solution is most probable one (maximumlikelihood), derived from probability density function of observingmeasurements

• Geometric approach:

• solution is a projection from data space into model space, what isprojection of vector b in direction of vector a

Most problems result in same least squares solution

9 / 13

Page 17: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Least Squares Solution

• General form: d = Gm + ε

• Least squares solution: mest = (GTG)−1GTd

How to get there?• Variational approach:

• assume optimal solution minimizes length, j of the residual vector r :j = rT r

• Probabilistic approach:• assume optimal solution is most probable one (maximum

likelihood), derived from probability density function of observingmeasurements

• Geometric approach:

• solution is a projection from data space into model space, what isprojection of vector b in direction of vector a

Most problems result in same least squares solution

9 / 13

Page 18: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Least Squares Solution

• General form: d = Gm + ε

• Least squares solution: mest = (GTG)−1GTd

How to get there?• Variational approach:

• assume optimal solution minimizes length, j of the residual vector r :j = rT r

• Probabilistic approach:• assume optimal solution is most probable one (maximum

likelihood), derived from probability density function of observingmeasurements

• Geometric approach:• solution is a projection from data space into model space, what is

projection of vector b in direction of vector a

Most problems result in same least squares solution

9 / 13

Page 19: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Variational Approach

• choose solution where residual vector r has minimum length• most common is standard geometric / Euclidean length / L2 -

norm:

L2 = (r21 + r2

2 + r23 + r2

4 . . . )−1/2 =

√√√√ N∑i=1

r2i

• L1 - norm less sensitive to bias from single bad points:

L1 = (|r1|+ |r2|+ |r3|+ |r4| . . . )−1/2 =N∑

i=1

|ri |

Solutions:• Least squares solution: mest = (GTG)−1GTd• L1 solution: GTRGmest = GTRd

• R: diagonal weighting matrix : Ri,i = 1/|ri |• nonlinear, need iterative alorithm (IRLS) to solve• IRLS starts with m0

est = mest,L2 solution, construct R0 usingresiduals

• iterate until some threshold reached

10 / 13

Page 20: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Variational Approach

• choose solution where residual vector r has minimum length• most common is standard geometric / Euclidean length / L2 -

norm:

L2 = (r21 + r2

2 + r23 + r2

4 . . . )−1/2 =

√√√√ N∑i=1

r2i

• L1 - norm less sensitive to bias from single bad points:

L1 = (|r1|+ |r2|+ |r3|+ |r4| . . . )−1/2 =N∑

i=1

|ri |

Solutions:• Least squares solution: mest = (GTG)−1GTd• L1 solution: GTRGmest = GTRd

• R: diagonal weighting matrix : Ri,i = 1/|ri |• nonlinear, need iterative alorithm (IRLS) to solve• IRLS starts with m0

est = mest,L2 solution, construct R0 usingresiduals

• iterate until some threshold reached 10 / 13

Page 21: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Variational Approach

• d = Gm + ε

• calculate mest = (GTG)−1GTd• get residuals rest = d−Gmest

• define j(m) = rTr = (d−Gm)T(d−Gm)

• find minimum j : δj(mest) = 0

11 / 13

Page 22: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Confidence Intervals

• if independent and normally distributed data errors:• COV (mL2) = σ2(GT G)−1

• get 95% confidence intervals:• each model parameter mi has normal distribution• mean given by corresponding mi,true

• variance COV (mL2)i,i

mL2 ± 1.96(diag(COV (mL2)))1/2

• 1.96 comes from:

1σ√

∫ 1.96σ

−1.96σe− x2

2σ2 dx ≈ 0.95

12 / 13

Page 23: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Confidence Intervals

• if independent and normally distributed data errors:• COV (mL2) = σ2(GT G)−1

• get 95% confidence intervals:• each model parameter mi has normal distribution• mean given by corresponding mi,true• variance COV (mL2)i,i

mL2 ± 1.96(diag(COV (mL2)))1/2

• 1.96 comes from:

1σ√

∫ 1.96σ

−1.96σe− x2

2σ2 dx ≈ 0.95

12 / 13

Page 24: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Confidence Intervals

• if independent and normally distributed data errors:• COV (mL2) = σ2(GT G)−1

• get 95% confidence intervals:• each model parameter mi has normal distribution• mean given by corresponding mi,true• variance COV (mL2)i,i

mL2 ± 1.96(diag(COV (mL2)))1/2

• 1.96 comes from:

1σ√

∫ 1.96σ

−1.96σe− x2

2σ2 dx ≈ 0.95

12 / 13

Page 25: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Parameter Estimation // Inverse Problems are hard . . .

• model existence

• There may be no model that fits data (exactly)• physics are approximate (or wrong)• data contain noise

• model uniqueness

• There may be other models than mtrue that satisfy data• e.g., non-trivial null space Gm0 = 0• smoothing or other biases may affect solution• model resolution analysis is critical!

• instability

• small change in measurement results in enormous change inparameter estimates

• possibly stabilize such problems regularization (smoothing)

13 / 13

Page 26: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Parameter Estimation // Inverse Problems are hard . . .

• model existence

• There may be no model that fits data (exactly)• physics are approximate (or wrong)• data contain noise

• model uniqueness

• There may be other models than mtrue that satisfy data• e.g., non-trivial null space Gm0 = 0• smoothing or other biases may affect solution• model resolution analysis is critical!

• instability

• small change in measurement results in enormous change inparameter estimates

• possibly stabilize such problems regularization (smoothing)

13 / 13

Page 27: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Parameter Estimation // Inverse Problems are hard . . .

• model existence• There may be no model that fits data (exactly)• physics are approximate (or wrong)• data contain noise

• model uniqueness

• There may be other models than mtrue that satisfy data• e.g., non-trivial null space Gm0 = 0• smoothing or other biases may affect solution• model resolution analysis is critical!

• instability

• small change in measurement results in enormous change inparameter estimates

• possibly stabilize such problems regularization (smoothing)

13 / 13

Page 28: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Parameter Estimation // Inverse Problems are hard . . .

• model existence• There may be no model that fits data (exactly)• physics are approximate (or wrong)• data contain noise

• model uniqueness• There may be other models than mtrue that satisfy data• e.g., non-trivial null space Gm0 = 0• smoothing or other biases may affect solution• model resolution analysis is critical!

• instability

• small change in measurement results in enormous change inparameter estimates

• possibly stabilize such problems regularization (smoothing)

13 / 13

Page 29: ERTH 491-01 / GEOP 572-02 Geodetic Methods [20pt] Lecture ... · Variational approach: assume optimal solution minimizes length, j of the residual vector r: j = rTr Probabilistic

Parameter Estimation // Inverse Problems are hard . . .

• model existence• There may be no model that fits data (exactly)• physics are approximate (or wrong)• data contain noise

• model uniqueness• There may be other models than mtrue that satisfy data• e.g., non-trivial null space Gm0 = 0• smoothing or other biases may affect solution• model resolution analysis is critical!

• instability• small change in measurement results in enormous change in

parameter estimates• possibly stabilize such problems regularization (smoothing)

13 / 13