Explore cutting-edge research on efficiently computing similarities to private datasets in this 30-minute talk by Sandeep Silwal from MIT. Delve into the realm of extroverted sublinear algorithms and their applications in privacy-preserving data analysis. Gain insights into innovative techniques for maintaining data confidentiality while enabling meaningful computations on sensitive information. Learn about the latest advancements in this field and their potential impact on various industries and research domains.
Efficiently Computing Similarities to Private Datasets
Overview
Syllabus
Efficiently Computing Similarities to Private Datasets
Taught by
Simons Institute
Related Courses
-
Secure and Private AI
-
Secure Multiparty Computation - Session III
-
Private Nearest Neighbor Search with Sublinear Communication and Malicious Security
-
Small Space Differentially Private Graph Algorithms in the Continual Release Model
-
Demystifying Privacy Preserving Computing
-
Oblivious Data Access - Session 1
