University of Cambridge > Talks.cam > Statistics > Theoretical properties of Cook's Principal Fitted Components algorithm

Theoretical properties of Cook's Principal Fitted Components algorithm

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact rbg24.

I will talk about how to reduce the dimension of the linear regression space. In particular, I will consider the theoretical properties of the estimators resulting from Dennis Cook’s Principal Fitted Components algorithm. I will give sufficient conditions for root(n)-consistency and explain some of the simulation results in Cook’s Fisher Lecture. I will argue further that, under Cook’s model at least, the PFC algorithm outperforms the more standard Principal Components algorithm. (paper to appear in Electronic Journal of Statistics)

This talk is part of the Statistics series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity