High-arity PAC learning

Add to your list(s) Download to your calendar using vCal

• Leonardo Coregliano (University of Chicago)
• Thursday 15 January 2026, 14:00-15:00
• MR13, CMS.

If you have a question about this talk, please contact Julia Wolf.

In this third talk of the series on high-arity learning frameworks, I will discuss the high-arity PAC learning theory, which is motivated by PAC learning of graphs, hypergraphs and relational structures and is heavily inspired by (hyper)graph limits, and is characterized by a slicewise notion of the Vapnik—Chervonenkis dimension.

I will also discuss how exchangeability theory plays a crucial role in agnostic version of learning and a phenomenon exclusive to high-arity learning: the interplay between the partite and non-partite. Time permitting, I will also talk about what part of the theory extends to learning hypergraph limits.

No background in learning theory, model theory or hypergraph limits is required for this talk.

This talk is based on joint work with Maryanthe Malliaris.

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Discrete Analysis Seminar
• Hanchen DaDaDash
• Interested Talks
• MR13, CMS
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.