University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Partial least squares for dependent data

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Partial least squares for dependent data

Download to your calendar using vCal

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

STS - Statistical scalability

We consider the linear and kernel partial least squares algorithms for dependent data and study the consequences of ignoring the dependence both theoretically and numerically. For linear partial least squares estimator we derive convergence rates and show that ignoring non-stationary dependence structures can lead to inconsistent estimation. For kernel partial least squares estimator we establish convergence rates under a source and an effective dimensionality conditions. It is shown both theoretically and in simulations that long range dependence results in slower convergence rates. A protein dynamics example illustrates our results and shows high predictive power of partial least squares.
This is joint work with Marco Singer, Axel Munk and Bert de Groot.



This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 9028.58990536 kWh Long Room, Murray Edwards College Department of Veterinary Medicine , Lecture Theatre 2, Refreshments in SCR from 3.45

Other talks

Tea and Coffee Break CUSCRS and Renal Medicine Coming soon Title to be confirmed In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti Talk TBC
 

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