Explore the intersection of sparsity and privacy in distributed matrix multiplication through this insightful 27-minute talk by Rawad Bitar from the Technical University of Munich. Delve into the concepts of application-driven coding theory as part of the Simons Institute's series on advanced mathematical topics. Gain valuable insights into how sparsity affects privacy concerns in distributed computing environments and learn about potential solutions for maintaining data confidentiality while optimizing computational efficiency.
Sparsity and Privacy in Distributed Matrix Multiplication
Overview
Syllabus
Sparsity and Privacy in Distributed Matrix Multiplication
Taught by
Simons Institute
Related Courses
-
Secure Distributed Matrix Multiplication
-
Breakthroughs - A Refined Laser Method and Faster Matrix Multiplication
-
Strassen's Matrix Multiplication Algorithm - Concept and Time Complexity
-
AlphaTensor - Discover Faster Matrix Multiplication Algorithms with RL - IPAM at UCLA
-
Register Tiling for Unstructured Sparsity in Neural Network Inference
-
ABY3 - A Mixed Protocol Framework for Machine Learning
