BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Yuval Filmus (Technion\, Haifa\, Israel)
DTSTART:20201124T173000Z
DTEND:20201124T180000Z
DTSTAMP:20260417T205144Z
UID:LA-CoCo/16
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/LA-CoCo/16/"
 >Sauer–Shelah–Perles lemma for lattices</a>\nby Yuval Filmus (Technion
 \, Haifa\, Israel) as part of LA Combinatorics and Complexity Seminar\n\n\
 nAbstract\nThe <i>Sauer–Shelah–Perles</i> (SSP) <i>lemma</i> is a fund
 amental result in VC theory\, with important applications in statistical l
 earning theory.  It bounds the number of sets in a family in terms of the 
 size of the universe and the VC dimension.  We generalize the SSP lemma to
  some lattices\, such as the lattice of subspaces of a finite-dimensional 
 vector space over a finite field.  The SSP lemma fails for some lattices\,
  and we identify a local obstruction which we conjecture is the only reaso
 n for such failure.\n\nThe talk will not assume any familiarity with VC th
 eory or with statistical learning theory.\n\nJoint work with Stijn Cambie 
 (Raboud University Nijmegen)\, Bogdan Chornomaz (Vanderbilt University)\, 
 Zeev Dvir (Princeton University) and Shay Moran (Technion).\n
LOCATION:https://researchseminars.org/talk/LA-CoCo/16/
END:VEVENT
END:VCALENDAR