Query Complexity of Bayesian Private Learning

11/15/2019
by   Kuang Xu, et al.
0

We study the query complexity of Bayesian Private Learning: a learner wishes to locate a random target within an interval by submitting queries, in the presence of an adversary who observes all of her queries but not the responses. How many queries are necessary and sufficient in order for the learner to accurately estimate the target, while simultaneously concealing the target from the adversary? Our main result is a query complexity lower bound that is tight up to the first order. We show that if the learner wants to estimate the target within an error of ε, while ensuring that no adversary estimator can achieve a constant additive error with probability greater than 1/L, then the query complexity is on the order of Llog(1/ε), as ε→ 0. Our result demonstrates that increased privacy, as captured by L, comes at the expense of a multiplicative increase in query complexity. Our proof method builds on Fano's inequality and a family of proportional-sampling estimators. As an illustration of the method's wider applicability, we generalize the complexity lower bound to settings involving high-dimensional linear query learning and partial adversary observation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2018

Private Sequential Learning

We formulate a private learning model to study an intrinsic tradeoff bet...
research
09/21/2019

Optimal query complexity for private sequential learning

Motivated by privacy concerns in many practical applications such as Fed...
research
02/23/2021

Learner-Private Online Convex Optimization

Online convex optimization is a framework where a learner sequentially q...
research
11/07/2022

Query Complexity of the Metric Steiner Tree Problem

We study the query complexity of the metric Steiner Tree problem, where ...
research
08/19/2021

Threshold Phenomena in Learning Halfspaces with Massart Noise

We study the problem of PAC learning halfspaces on ℝ^d with Massart nois...
research
10/06/2022

On Optimal Learning Under Targeted Data Poisoning

Consider the task of learning a hypothesis class ℋ in the presence of an...
research
06/25/2020

Average-case Complexity of Teaching Convex Polytopes via Halfspace Queries

We examine the task of locating a target region among those induced by i...

Please sign up or login with your details

Forgot password? Click here to reset