Computer Science Department Master Calendar

View Full Calendar

Ruta Jawale "Locally Covert Learning"

Event Type
Seminar/Symposium
Sponsor
Illinois Computer Science
Virtual
wifi event
Date
Feb 12, 2024   11:00 am  
Speaker
Ruta Jawale, UIUC
Contact
Candice Steidinger
E-Mail
steidin2@illinois.edu
Views
45
Originating Calendar
Computer Science Speakers Calendar

We look forward to seeing you online

Abstract: The goal of a covert learning algorithm is to learn a function f by querying it, while ensuring that an adversary, who sees all queries and their responses, is unable to (efficiently) learn any more about f than they could learn from random input-output pairs. We focus on a relaxation that we call local covertness, in which queries are distributed across k servers and we only limit what is learnable by k - 1 colluding servers. For any constant k, we give a locally covert algorithm for efficiently learning any Fourier-sparse function (technically, our notion of learning is improper, agnostic, and with respect to the uniform distribution). Our result holds unconditionally and for computationally unbounded adversaries. Prior to our work, such an algorithm was known only for the special case of O(log n)-juntas, and only with k = 2 servers [Yuval Ishai et al., 2019]. Our main technical observation is that the original Goldreich-Levin algorithm only utilizes i.i.d. pairs of correlated queries, where each half of every pair is uniformly random. We give a simple generalization of this algorithm in which pairs are replaced by k-tuples in which any k - 1 components are jointly uniform. The cost of this generalization is that the number of queries needed grows exponentially with k.

Based on joint work with Justin Holmgren.  ITC 2023.  eprint.iacr.org/2023/392

link for robots only