University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The Hardness of Conditional Independence Testing

  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

The Hardness of Conditional Independence Testing

Download to your calendar using vCal

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

STSW01 - Theoretical and algorithmic underpinnings of Big Data

Testing for conditional independence between continuous random variables is considered to be a hard statistical problem. We provide a formalization of this result and show that a test with correct size does not have power against any alternative. It is thus impossible to obtain any guarantee if the relationships between the random variables can be arbitrarily complex. We propose a practical test that achieves the correct size if the conditional expectations are smooth enough such that they can be estimated from data. This is joint work with Rajen Shah.

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

https://zoom.us/j/94056313546?pwd=N1dYVFR1b0FwNmk0eGlxeDd1OVY1QT09 my list The obesity epidemic: Discussing the global health crisis

Other talks

Dept of Zoology Inaugural lecture: 'Through the lens of a bee: from the past to the future' Chemical strategies for biomolecule functionalisation, and biomaterial conjugation Fairy Tales Title to be confirmed Morning Tea and Coffee LMB Seminar - Mechanisms of mRNA packaging and export
 

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