University of Cambridge > Talks.cam > Discrete Analysis Seminar > High-arity PAC learning

  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

High-arity PAC learning

Download to your calendar using vCal

  • UserLeonardo Coregliano (University of Chicago)
  • ClockThursday 15 January 2026, 14:00-15:00
  • HouseMR13, 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:

Note that ex-directory lists are not shown.

Other lists

PELS: Psychology Education and Learning Studies Average on weekdays: 8965.12370242 kWh Average on weekdays: 9003.99585406 kWh

Other talks

Title to be confirmed Polar Oceans Seminar Talk title abstract tba Fairy Tales A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Title TBC
 

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