Efficiently Computing Similarities to Private Datasets
Offered By: Simons Institute via YouTube
Course Description
Overview
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.
Syllabus
Efficiently Computing Similarities to Private Datasets
Taught by
Simons Institute
Related Courses
Sampling-Based Sublinear Low-Rank Matrix Arithmetic Framework for Dequantizing Quantum Machine LearningAssociation for Computing Machinery (ACM) via YouTube Sublinear Algorithms for Gap Edit Distance
IEEE via YouTube High Dimensional Robust Sparse Regression
Simons Institute via YouTube Learning-Augmented Sketches for Frequency Estimation
Simons Institute via YouTube Adaptive Sparse Recovery with Limited Adaptivity
Simons Institute via YouTube