1 / 21

Workshop on Parameter Redundancy Part II

Dive into detecting parameter redundancy in complex models through exhaustive summaries, PLUR decomposition, and reparameterization. Learn practical examples and techniques for simplifying derivative matrices.

jmichele
Télécharger la présentation

Workshop on Parameter Redundancy Part II

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Workshop on Parameter Redundancy Part II Diana Cole

  2. Introduction • The key to the symbolic method for detecting parameter redundancy is to find a derivative matrix and its rank. • Models are getting more complex • The derivative matrix is therefore structurally more complex • Maple runs out of memory calculating the rank • Examples: Hunter and Caswell (2008), Jiang et al (2007) • How do you proceed? • Numerically – but only valid for specific value of parameters • Symbolically – involves extending the theory, again it involves a derivative matrix and it’s rank, but the derivative matrix is structurally simpler. Striped Sea Bass Age-dependent tag-return models for fish Wandering Albatross Multi-state models for sea birds

  3. Exhaustive Summaries CJS Model (revisited) Herring Gulls (Larus argentatus) capture-recapture data for 1983 to 1986 (Lebreton, et al 1995) Catchpole and Morgan (1997) theory

  4. Exhaustive Summaries Catchpole and Morgan (1997) - sufficient to examine or (only if no missing data)

  5. Exhaustive Summaries

  6. Exhaustive Summary • An exhaustive summary, , is a vector that uniquely defines the model (Cole and Morgan, 2009a, generalises definition in Walter and Lecoutier, 1982). • Derivative matrix • r = Rank(D) is the number of estimable parameters in a model • p parameters; d = p – r is the deficiency of the model (how many parameters you cannot estimate). If d = 0 model is full rank (not parameter redundant) . If d > 0 model is parameter redundant. • More than one exhaustive summary exists for a model • Choosing a structurally simpler exhaustive summary will simplify the derivative matrix • Exhaustive summaries can be simplified by any one-one transformation such as multiplying by a constant, taking logs, and removing repeated terms. • For multinomial models and product-multinomial models the more complicated 1 Pij can be removed (Catchpole and Morgan, 1997), as long as there are no missing values. (If there are missing values the appropriate exhaustive summary is the complete set of log-likelihood terms)

  7. Methods For Use With Exhaustive SummariesWhat can you estimate?(Catchpole and Morgan, 1998 extended to exhaustive summaries in Cole and Morgan, 2009) • A model: p parameters, rank r, deficiency d = p – r • There will be d nonzero solutions to TD = 0. • Zeros in s indicate estimable parameters. • Example: CJS, regardless of which exhaustive summary is used • Solve PDEs to find full set of estimable pars. • Example: CJS, PDE: Can estimate: 1, 2, p2, p3 and 3p4

  8. Methods For Use With Exhaustive SummariesExtension Theorem • Suppose a model has exhaustive summary 1 and parameters 1. • Now extend that model by adding extra exhaustive summary terms 2, and extra parameters 2. (Eg add more years of ringing/recovery) New model’s exhaustive summary is  = [1 2]T and parameters are  = [1 2]T. • If D1 is full rank and D2 is full rank, the extended model will be full rank. The result can be further generalised by induction. • Result is trivially always true, if you add zero or one extra parameter • Method can also be used for parameter redundant models by first rewriting the model in terms of its estimable set of parameters.

  9. Methods For Use With Exhaustive SummariesThe PLUR decomposition • Ring-recovery Model is not parameter redundant. (Call this top model) • However the nested model with 1,1 = 1,2 is parameter redundant, deficiency = 1. • This information is in the top model’s derivative matrix • Write derivative matrix which is full rank r as D = PLUR • P is a square permutation matrix • L is a lower diagonal square matrix, with 1’s on the diagonal • U is an upper triangular square matrix (any entry on the diagonal) • R is a matrix (size of D) in reduced echelon form • R will always have rank r, regardless of constraints. • By design P and L will always have rank r. • The rank of U can vary.

  10. Methods For Use With Exhaustive Summaries The PLUR decomposition • A square matrix which is not full rank will have determinant 0. • If Det(U) = 0 at any point, model is parameter redundant at that point(as long as R is defined). The deficiency of U evaluated at that point is the deficiency of that nested model(Cole and Morgan, 2009a) • Ring-recovery example top model: Therefore nested model is parameter redundant with deficiency 1

  11. Finding simpler exhaustive summaries Reparameterisation • Choose a reparameterisation, s, that simplifies the model structure CJS Model (revisited): • Reparameterise the exhaustive summary. Rewrite the exhaustive summary, (), in terms of the reparameterisation - (s).

  12. Reparameterisation • Calculate the derivative matrix Ds • The no. of estimable parameters = rank(Ds) rank(Ds) = 5, no. est. pars = 5 • If Ds is full rank ( Rank(Ds) = Dim(s) ) s = sre is a reduced-form exhaustive summary. If Ds is not full rank solve set of PDE to find a reduced-form exhaustive summary, sre There are 5 si and the Rank(Ds) = 5, so Ds is full rank. s is a reduced-form exhaustive summary

  13. Reparameterisation • Use sre as an exhaustive summary A reduced-form exhaustive summary is Rank(D2) = 5; 5 estimable parameters. Solve PDEs: estimable parameters are 1, 2, p2, p3 and 3p4

  14. The PLUR decomposition • CJS with survival covariates. • Let i = {1 + exp(a +bxi)}-1 where xi is a covariate • Parameters:  = [abp2p3p4] • Use exhaustive summary: • Rank(D) = 5  not parameter redundant • PLUR decomposition Det(U) = • Parameter redundant if x1 = x2

  15. Reparameterisation Wandering Albatross (Diomedea exulans) • Hunter and Caswell (2008) examine parameter redundancy of multi-state mark-recapture models, but cannot evaluate the symbolic rank of the derivative matrix (developed numerical method) • 4 state breeding success model: 3 post-success 1 success 3 1 4 2 4 = post-failure 2 = failure successful breeding capture breeding given survival survival

  16. Reparameterisation • Choose a reparameterisation, s, that simplifies the model structure • Rewrite the exhaustive summary, (), in terms of the reparameterisation - (s).

  17. Reparameterisation • Calculate the derivative matrix Ds • The no. of estimable parameters =rank(Ds) rank(Ds) = 12, no. est. pars = 12, deficiency = 14 – 12 = 2 • If Ds is full rank s = sre is a reduced-form exhaustive summary. If Ds is not full rank solve set of PDE to find a reduced-form exhaustive summary, sre

  18. Reparameterisation Method • Use sre as an exhaustive summary

  19. Reparameterisation Method • Jiang et al (2007) age-dependent fisheries model is more complex, but essentially uses reparameterisation method (Cole and Morgan, 2009b) • Rachel’s talk looked at multi-state analysis of Great Crested Newts. The parameter redundancy of the more complex models can be examined using the reparameterisation method to find a simpler exhaustive summary

  20. Conclusion • Exhaustive summaries offer a more general framework for symbolic detection of parameter redundancy • Parameter redundancy can be investigated symbolically by examining a derivative matrix and its rank. • Parameter redundant nested models can be found using a PLUR decomposition of any full rank derivative matrix. • The use of reparameterisation allows us to produce structurally much simpler exhaustive summaries, allowing us to examine parameter redundancy of much more complex models symbolically. • Methods are general and can in theory be applied to any parametric model

  21. References • Original Symbolic Approach: • Catchpole, E. A. and Morgan, B. J. T. (1997) Detecting parameter redundancy. Biometrika, 84, 187-196 • Catchpole, E. A., Morgan, B. J. T. and Freeman, S. N. (1998) Estimation in parameter redundant models. Biometrika, 85, 462-468 • Catchpole, E. A. and Morgan, B. J. T. (2001) Deficency of parameter redundant models. Biometrika, 88, 593-598 • Recent Advances in Symbolic Approach: • Cole, D. J. and Morgan, B. J. T (2009a) Determining the Parametric Structure of Non-Linear Models IMSAS, University of Kent Technical report UKC/IMS/09/005 • Cole, D. J. and Morgan, B. J. T. (2009b) A note on determining parameter redundancy in age-dependent tag return models for estimating fishing mortality, natural mortality and selectivity. IMSAS, University of Kent Technical report UKC/IMS/09/003 (To appear in JABES) • Cole, D.J. and Morgan, B.J.M (2007) Detecting Parameter Redundancy in Covariate Models. IMSAS, University of Kent Technical report UKC/IMS/07/007, • See http://www.kent.ac.uk/ims/personal/djc24/publications.htm for papers • Other references: • Hunter, C.M. and Caswell, H. (2008). Parameter redundancy in multistate mark-recapture models with unobservable states. In Ecological and Environmental Statistics Volume 3. Eds., D. L. Thomson, E. G. Cooch and M. J. Conroy, 797-826 • Jiang, H. Pollock, K. H., Brownie, C., Hightower, J. E., Hoenig, J. M. and Hearn, W. S. (2007) Age-dependent tag return models for estimating fishing mortality, natural mortality and selectivity. JABES, 12, 177-194 • Lebreton, J. Morgan, B. J. T., Pradel R. and Freeman, S. N. (1995) A simultaneous survival rate analysis of dead recovery and live recapture data. Biometrics, 51, 1418-1428. • Walter, E. and Lecoutier, Y (1982) Global approaches to identifiably testing for linear and nonlinear state space models. Mathematics and Computers in Simulations, 24, 472-482

More Related