BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.20//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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20241021T163000
DTEND;TZID=America/New_York:20241021T173000
DTSTAMP:20260527T064256
CREATED:20240903T195022Z
LAST-MODIFIED:20241016T144838Z
UID:10003435-1729528200-1729531800@cmsa.fas.harvard.edu
SUMMARY:Higher Vapnik–Chervonenkis theory
DESCRIPTION:Colloquium \nSpeaker: Artem Chernikov\, University of Maryland \nTitle: Higher Vapnik–Chervonenkis theory \nAbstract: Finite VC-dimension\, a combinatorial property of families of sets\, was discovered simultaneously by Vapnik and Chervonenkis in probabilistic learning theory\, and by Shelah in model theory (where it is called NIP). It plays an important role in several areas including machine learning\, combinatorics\, mathematical logic\, functional analysis and topological dynamics. We develop aspects of higher-order VC-theory\, in particular establishing a generalization of the epsilon-net theorem for families of sets (and functions) on n-fold product spaces with bounded VC_n-dimension (i.e. there is a bound on the sizes of n-dimensional boxes that can be shattered). We obtain some applications in combinatorics and in model theory\, including a strong version of Szemerdi’s regularity lemma for hypergraphs omitting a fixed finite n-partite n-hypergraph. Joint work with Henry Towsner.
URL:https://cmsa.fas.harvard.edu/event/colloquium-102124/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-10.21.2024.png
END:VEVENT
END:VCALENDAR