BEGIN:VCALENDAR
VERSION:2.0
X-WR-CALNAME;VALUE=TEXT:Kobbi Nissim: "Characterizing the Sample Complexity of Private Learners"
PRODID:-//Harvard events data//EN
BEGIN:VEVENT
UID:event_71441_0
SUMMARY:Kobbi Nissim: "Characterizing the Sample Complexity of Private Learners"
DESCRIPTION:<p><strong>CRCS Lunch Seminar</strong></p><p>Date: Monday, November 5, 2012<br>Time: 12:00pm – 1:30pm<br>Place: Maxwell Dworkin 119</p><p>Speaker:   Kobbi Nissim, Ben-Gurion University and Harvard CRCS</p><p>Title: Characterizing the Sample Complexity of Private Learners</p><p><drupal-media data-entity-type="media" data-entity-uuid="e769602b-afeb-4e1a-b858-d6773e4c4a6d"></drupal-media></p><p>Abstract:  The notion of private learning [Kasiviswanathan el al. 08] is a combination of PAC (probably approximately correct) learning [Valiant 84] and differential privacy [Dwork et al. 06]. Kasiviswanathan el al. presented a generic construction of private learner for finite concept classes, where the sample complexity depends logarithmically in the size of the concept class. For concept classes of small VC dimension, this sample complexity is significantly larger than what is sufficient for non-private learning.</p><p>I will present some of the known bounds on the sample complexity of private learners, and a recent characterization of the sample complexity as a combinatorial measure of the learned concept class.</p><p>Joint work with Amos Beimel and Uri Stemmer.</p>
LOCATION:Maxwell Dworkin 119
STATUS:CONFIRMED
DTSTART:20121105T170000Z
DTEND:20121105T183000Z
END:VEVENT
END:VCALENDAR