BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20210504T103000
DTEND;TZID=America/New_York:20210504T123000
DTSTAMP:20240126T060113Z
CREATED:20240126T060113Z
LAST-MODIFIED:20240126T060113Z
UID:10001374-1620124200-1620131400@cmsa.fas.harvard.edu
SUMMARY:Rank-Based Independence Testing in Near Linear Time
DESCRIPTION:Speaker: Chaim Even-Zohar (Alan Turing Institute\, London) \nTitle: Rank-Based Independence Testing in Near Linear Time \nAbstract: In 1948 Hoeffding proposed a nonparametric test that detects dependence between two continuous random variables (X\,Y)\, based on the ranking of n paired samples (Xi\,Yi). The computation of this commonly-used test statistic requires O(n log n) time. Hoeffding’s test is consistent against any dependent probability density f(x\,y)\, but can be fooled by other bivariate distributions with continuous margins. Variants of this test with stronger consistency have been considered in works by Blum\, Kiefer\, and Rosenblatt\, Yanagimoto\, and Bergsma and Dassios\, and others. The so far best known algorithms to compute them have required quadratic time.\nWe present an algorithm that computes these improved tests in time O(n log n). It is based on a new combinatorial approach for counting pattern occurrences in a given permutation\, which we call corner tree formulas\, and will be explained in the talk. \nJoint work with Calvin Leng.
URL:https://cmsa.fas.harvard.edu/event/rank-based-independence-testing-in-near-linear-time/
CATEGORIES:Computer Science for Mathematicians Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20210511T113000
DTEND;TZID=America/New_York:20210511T123000
DTSTAMP:20240126T055408Z
CREATED:20240126T055408Z
LAST-MODIFIED:20240126T055408Z
UID:10001369-1620732600-1620736200@cmsa.fas.harvard.edu
SUMMARY:5/11/2021 Computer Science for Mathematicians
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/5-11-2021-computer-science-for-mathematicians/
CATEGORIES:Computer Science for Mathematicians Seminar
END:VEVENT
END:VCALENDAR