| Document Date: 2014-05-28 14:26:58
Open Document File Size: 413,87 KBShare Result on Facebook
City PARIS / / Company IBM / / Event FDA Phase / / Facility Harvard’s Center / / IndustryTerm online-mistake-bound learning model / online mistake-bound learning model / online learning / low-communication protocol / constant communication equality protocol / private algorithms / correct protocol / data mining / communication protocol / communication protocols / computing / learning algorithm / differentially-private algorithms / learning algorithms / private-coin protocols / / Organization Harvard’s Center for Research / / Person David Xiao / X. Alice / Feldman / Learning Two / / Position model / Private / / Product EvalC / / ProgrammingLanguage D / R / C / / Technology learning algorithm / randomized algorithm / differentially private algorithms / constant communication equality protocol / communication protocol / data mining / low-communication protocol / machine learning / private-coin protocols / Differentially-private communication protocols / Simpler learning algorithms / differentially-private algorithms / /
SocialTag |
JMLR: Workshop and Conference Proceedings vol 35:1–20, 2014 Sample Complexity Bounds on Differentially Private Learning via Communication Complexity Vitaly Feldman IBM Research - Almaden.