Private Sequential Learning

References

• Blum A , Ligett K , Roth A (2013) A learning theory approach to noninteractive database privacy. J. ACM 60(2):1–25.Crossref, Google Scholar
• Chaudhuri K , Hsu D (2011) Sample complexity bounds for differentially private learning. Proc. 24th Annual Conf. Learn. Theory (PMLR), 155–186.Google Scholar
• Chor B , Kushilevitz E , Goldreich O , Sudan M (1998) Private information retrieval. J. ACM 45(6):965–981.Crossref, Google Scholar
• Cummings R , Ligett K , Nissim K , Roth A , Wu ZS (2016) Adaptive learning with robust generalization guarantees. Conf. on Learning Theory, 772–814.Google Scholar
• Duchi J , Wainwright M , Jordan M (2018) Minimax optimal procedures for locally private estimation. J. Amer. Statist. Assoc. 113(521):182–201.Google Scholar
• Dwork C , Roth A (2014) The algorithmic foundations of differential privacy. Foundations Trends Theoretical Comput. Sci. 9(3–4):211–407.Crossref, Google Scholar
• Dwork C , Naor M , Vadhan S (2012) The privacy of the analyst and the power of the state. Proc. IEEE 53rd Annu. Sympos. on Foundations of Computer Science (IEEE, New York), 400–409.Google Scholar
• Dwork C , McSherry F , Nissim K , Smith A (2006) Calibrating noise to sensitivity in private data analysis. Proc. Theory of Cryptography Conf. (Springer, New York), 265–284.Google Scholar
• Dwork C , Feldman V , Hardt M , Pitassi T , Reingold O , Roth A (2015a) Generalization in adaptive data analysis and holdout reuse. Adv. Neural Inform. Processing Systems 29:2350–2358.Google Scholar
• Dwork C , Feldman V , Hardt M , Pitassi T , Reingold O , Roth A (2015b) The reusable holdout: Preserving validity in adaptive data analysis. Science . 349(6248):636–638.Crossref, Google Scholar
• Dwork C , Feldman V , Hardt M , Pitassi T , Reingold O , Roth AL (2015c) Preserving statistical validity in adaptive data analysis. Proc. 47th Annual Sympos. Theory Comput. (ACM, New York), 117–126.Google Scholar
• Fanti G , Kairouz P , Oh S , Viswanath P (2015) Spy vs. spy: Rumor source obfuscation. Performance Evaluation Rev. 43:271–284.Crossref, Google Scholar
• Feldman V , Xiao D (2014) Sample complexity bounds on differentially private learning via communication complexity. Conf. on Learning Theory, 1000–1019.Google Scholar
• Gasarch W (2004) A survey on private information retrieval. Bull. EATCS 82:72–107.Google Scholar
• Horstein M (1963) Sequential transmission using noiseless feedback. IEEE Trans. Inform. Theory 9(3):136–143.Crossref, Google Scholar
• Jain P , Kothari P , Thakurta A (2012) Differentially private online learning. Proc. 25th Annual Conf. Learn. Theory (PMLR), 23:24.1–24.34.Google Scholar
• Kushilevitz E , Ostrovsky R (1997) Replication is not needed: Single database, computationally-private information retrieval. Proc. 38th Annual Sympos. Foundations Comput. Sci . (IEEE, Piscataway, NJ), 364–373.Crossref, Google Scholar
• Liao J , Sankar L , Tan VY , du Pin Calmon F (2018) Hypothesis testing under mutual information privacy constraints in the high privacy regime. IEEE Trans. Inform. Forensics Security 13(4):1058–1071.Crossref, Google Scholar
• Raskhodnikova S , Smith A , Lee HK , Nissim K , Kasiviswanathan SP (2008) What can we learn privately. Proc. 54th Annual Sympos. Foundations Comput. Sci . (IEEE, Piscataway, NJ), 531–540.Google Scholar
• Smith A (2011) Privacy-preserving statistical estimation with optimal convergence rates. Proc. 43rd Annual Sympos. Theory Comput. (ACM, New York), 813–822.Google Scholar
• Tsitsiklis J , Xu K (2018) Delay-predictability tradeoffs in reaching a secret goal. Oper. Res. 66(2):587–596.Link, Google Scholar
• Waeber R , Frazier PI , Henderson SG (2013) Bisection search with noisy responses. SIAM J. Control Optim. 51(3):2261–2279.Crossref, Google Scholar
• Wasserman L , Zhou S (2010) A statistical framework for differential privacy. J. Amer. Statist. Assoc. 105(489):375–389.Crossref, Google Scholar
• Xu K (2018) Query complexity of bayesian private learning. Adv. Neural Inform. Processing Systems 31:2431–2440.Google Scholar
• Xu Z (2017) Private sequential search and optimization. MS thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar