محبوبترین نویسندگان :
نویسندگان مقالات پربازدید :
یادگیری ماشین 2013
جزئیات رویداد
اینستاگرام تی پی بین
همایش ، رویداد ، ژورنال
حوزه های تحت پوشش رویداد

  • bounds on the sample complexity for private learning and private data release

    نویسندگان :
    کلمات کلیدی :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 812
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     learning is a task that generalizes many of the analyses that are applied to collections of data, in particular, to collections of sensitive individual information. hence, it is natural to ask what can be learned while preserving individual privacy. kasiviswanathan et al. (in siam j. comput., 40(3):793–826, 2011) initiated such a discussion. they formalized the notion of private learning, as a combination of pac learning and differential privacy, and investigated what concept classes can be learned privately. somewhat surprisingly, they showed that for finite, discrete domains (ignoring time complexity), every pac learning task could be performed privately with polynomially many labeled examples; in many natural cases this could even be done in polynomial time.while these results seem to equate non-private and private learning, there is still a significant gap: the sample complexity of (non-private) pac learning is crisply characterized in terms of the vc-dimension of the concept class, whereas this relationship is lost in the constructions of private learners, which exhibit, generally, a higher sample complexity.looking into this gap, we examine several private learning tasks and give tight bounds on their sample complexity. in particular, we show strong separations between sample complexities of proper and improper private learners (such separation does not exist for non-private learners), and between sample complexities of efficient and inefficient proper private learners. our results show that vc-dimension is not the right measure for characterizing the sample complexity of proper private learning.we also examine the task of private data release (as initiated by blum et al. in stoc, pp. 609–618,2008), and give new lower bounds on the sample complexity. our results show that the logarithmic dependence on size of the instance space is essential for private data release.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها