BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:High-arity PAC learning - Leonardo Coregliano (University of Chica
 go)
DTSTART:20260115T140000Z
DTEND:20260115T150000Z
UID:TALK241636@talks.cam.ac.uk
CONTACT:Julia Wolf
DESCRIPTION:In this third talk of the series on high-arity learning framew
 orks\, I will discuss the high-arity PAC learning theory\, which is\nmotiv
 ated by PAC learning of graphs\, hypergraphs and relational structures and
  is heavily inspired by (hyper)graph limits\, and\nis characterized by a s
 licewise notion of the Vapnik--Chervonenkis dimension. \n\nI will also dis
 cuss how exchangeability theory\nplays a crucial role in agnostic version 
 of learning and a phenomenon exclusive to high-arity learning: the interpl
 ay between\nthe partite and non-partite. Time permitting\, I will also tal
 k about what part of the theory extends to learning hypergraph\nlimits.\n\
 nNo background in learning theory\, model theory or hypergraph limits is r
 equired for this talk.\n\nThis talk is based on joint work with Maryanthe 
 Malliaris.\n
LOCATION:MR13\, CMS
END:VEVENT
END:VCALENDAR