Picture for Mohammad Ali Maddah-Ali

Mohammad Ali Maddah-Ali

Private, Augmentation-Robust and Task-Agnostic Data Valuation Approach for Data Marketplace

Add code
Nov 01, 2024
Viaarxiv icon

Coded Computing: A Learning-Theoretic Framework

Add code
Jun 01, 2024
Viaarxiv icon

NeRCC: Nested-Regression Coded Computing for Resilient Distributed Prediction Serving Systems

Add code
Feb 08, 2024
Viaarxiv icon

Byzantine-Resistant Secure Aggregation for Federated Learning Based on Coded Computing and Vector Commitment

Add code
Feb 20, 2023
Viaarxiv icon

SwiftAgg+: Achieving Asymptotically Optimal Communication Load in Secure Aggregation for Federated Learning

Add code
Mar 24, 2022
Figure 1 for SwiftAgg+: Achieving Asymptotically Optimal Communication Load in Secure Aggregation for Federated Learning
Figure 2 for SwiftAgg+: Achieving Asymptotically Optimal Communication Load in Secure Aggregation for Federated Learning
Figure 3 for SwiftAgg+: Achieving Asymptotically Optimal Communication Load in Secure Aggregation for Federated Learning
Figure 4 for SwiftAgg+: Achieving Asymptotically Optimal Communication Load in Secure Aggregation for Federated Learning
Viaarxiv icon

SwiftAgg: Communication-Efficient and Dropout-Resistant Secure Aggregation for Federated Learning with Worst-Case Security Guarantees

Add code
Feb 08, 2022
Figure 1 for SwiftAgg: Communication-Efficient and Dropout-Resistant Secure Aggregation for Federated Learning with Worst-Case Security Guarantees
Figure 2 for SwiftAgg: Communication-Efficient and Dropout-Resistant Secure Aggregation for Federated Learning with Worst-Case Security Guarantees
Figure 3 for SwiftAgg: Communication-Efficient and Dropout-Resistant Secure Aggregation for Federated Learning with Worst-Case Security Guarantees
Viaarxiv icon

Optimal Communication-Computation Trade-Off in Heterogeneous Gradient Coding

Add code
Mar 02, 2021
Figure 1 for Optimal Communication-Computation Trade-Off in Heterogeneous Gradient Coding
Figure 2 for Optimal Communication-Computation Trade-Off in Heterogeneous Gradient Coding
Viaarxiv icon

Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computing

Add code
Sep 17, 2020
Figure 1 for Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computing
Figure 2 for Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computing
Figure 3 for Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computing
Figure 4 for Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computing
Viaarxiv icon

A Hybrid-Order Distributed SGD Method for Non-Convex Optimization to Balance Communication Overhead, Computational Complexity, and Convergence Rate

Add code
Mar 27, 2020
Figure 1 for A Hybrid-Order Distributed SGD Method for Non-Convex Optimization to Balance Communication Overhead, Computational Complexity, and Convergence Rate
Figure 2 for A Hybrid-Order Distributed SGD Method for Non-Convex Optimization to Balance Communication Overhead, Computational Complexity, and Convergence Rate
Figure 3 for A Hybrid-Order Distributed SGD Method for Non-Convex Optimization to Balance Communication Overhead, Computational Complexity, and Convergence Rate
Figure 4 for A Hybrid-Order Distributed SGD Method for Non-Convex Optimization to Balance Communication Overhead, Computational Complexity, and Convergence Rate
Viaarxiv icon

Corella: A Private Multi Server Learning Approach based on Correlated Queries

Add code
Mar 26, 2020
Figure 1 for Corella: A Private Multi Server Learning Approach based on Correlated Queries
Figure 2 for Corella: A Private Multi Server Learning Approach based on Correlated Queries
Figure 3 for Corella: A Private Multi Server Learning Approach based on Correlated Queries
Figure 4 for Corella: A Private Multi Server Learning Approach based on Correlated Queries
Viaarxiv icon