9 results on '"Avestimehr, Salman"'
Search Results
2. Achieving small-batch accuracy with large-batch scalability via Hessian-aware learning rate adjustment
- Author
-
Lee, Sunwoo, He, Chaoyang, and Avestimehr, Salman
- Published
- 2023
- Full Text
- View/download PDF
3. Partial model averaging in Federated Learning: Performance guarantees and benefits
- Author
-
Lee, Sunwoo, Sahu, Anit Kumar, He, Chaoyang, and Avestimehr, Salman
- Published
- 2023
- Full Text
- View/download PDF
4. Federated Learning for Clients' Data Privacy Assurance in Food Service Industry.
- Author
-
Taheri Gorji, Hamed, Saeedi, Mahdi, Mushtaq, Erum, Kashani Zadeh, Hossein, Husarik, Kaylee, Shahabi, Seyed Mojtaba, Qin, Jianwei, Chan, Diane E., Baek, Insuck, Kim, Moon S., Akhbardeh, Alireza, Sokolov, Stanislav, Avestimehr, Salman, MacKinnon, Nicholas, Vasefi, Fartash, and Tavakolian, Kouhyar
- Subjects
DATA privacy ,DEEP learning ,MACHINE learning ,FOOD service ,ASSURANCE services ,FOOD industry - Abstract
The food service industry must ensure that service facilities are free of foodborne pathogens hosted by organic residues and biofilms. Foodborne diseases put customers at risk and compromise the reputations of service providers. Fluorescence imaging, empowered by state-of-the-art artificial intelligence (AI) algorithms, can detect invisible residues. However, using AI requires large datasets that are most effective when collected from actual users, raising concerns about data privacy and possible leakage of sensitive information. In this study, we employed a decentralized privacy-preserving technology to address client data privacy issues. When federated learning (FL) is used, there is no need for data sharing across clients or data centralization on a server. We used FL and a new fluorescence imaging technology and applied two deep learning models, MobileNetv3 and DeepLabv3+, to identify and segment invisible residues on food preparation equipment and surfaces. We used FedML as our FL framework and Fedavg as the aggregation algorithm. The model achieved training and testing accuracies of 95.83% and 94.94% for classification between clean and contamination frames, respectively, and resulted in intersection over union (IoU) scores of 91.23% and 89.45% for training and testing, respectively, of segmentation of the contaminated areas. The results demonstrated that using federated learning combined with fluorescence imaging and deep learning algorithms can improve the performance of cleanliness auditing systems while assuring client data privacy. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
5. Basil: A Fast and Byzantine-Resilient Approach for Decentralized Training.
- Author
-
Elkordy, Ahmed Roushdy, Prakash, Saurav, and Avestimehr, Salman
- Subjects
BASIL ,GROUP rings ,DATA distribution ,PEER-to-peer architecture (Computer networks) ,INFORMATION sharing - Abstract
Decentralized (i.e., serverless) training across edge nodes can suffer substantially from potential Byzantine nodes that can degrade the training performance. However, detection and mitigation of Byzantine behaviors in a decentralized learning setting is a daunting task, especially when the data distribution at the users is heterogeneous. As our main contribution, we propose Basil, a fast and computationally efficient Byzantine-robust algorithm for decentralized training systems, which leverages a novel sequential, memory-assisted and performance-based criteria for training over a logical ring while filtering the Byzantine users. In the IID dataset setting, we provide the theoretical convergence guarantees of Basil, demonstrating its linear convergence rate. Furthermore, for the IID setting, we experimentally demonstrate that Basil is robust to various Byzantine attacks, including the strong Hidden attack, while providing up to absolute ~16% higher test accuracy over the state-of-the-art Byzantine-resilient decentralized learning approach. Additionally, we generalize Basil to the non-IID setting by proposing Anonymous Cyclic Data Sharing (ACDS), a technique that allows each node to anonymously share a random fraction of its local non-sensitive dataset (e.g., landmarks images) with all other nodes. Finally, to reduce the overall latency of Basil resulting from its sequential implementation over the logical ring, we propose Basil+ that enables Byzantine-robust parallel training across groups of logical rings, and at the same time, it retains the performance gains of Basil due to sequential training within each group. Furthermore, we experimentally demonstrate the scalability gains of Basil+ through different sets of experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. Privacy in Retrieval, Computing, and Learning.
- Author
-
Ulukus, Sennur, Avestimehr, Salman, Gastpar, Michael, Jafar, Syed, Tandon, Ravi, and Tian, Chao
- Subjects
CODING theory ,PRIVACY ,DATA privacy ,DISTRIBUTED computing ,INFORMATION theory ,GRID computing - Abstract
The increasing prevalence of massive datasets makes the outsourcing of storage and computation tasks to distributed servers a necessity. This raises a number of concerns regarding the security and integrity of stored information, the privacy of accessing desired information, the communication overhead of distributed systems, the latency, reliability, and complexity of distributed computing, and privacy in distributed training and learning systems. Recent breakthroughs from coding, communication, and information-theoretic perspectives have opened up exciting new research avenues for these topics. There are many theoretical and practical open problems. This Special Issue is dedicated to communication theory, coding theory, information theory, signal processing, and networking aspects of privacy in information retrieval, privacy in coded computing over distributed servers, and privacy in distributed learning. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. Private Retrieval, Computing, and Learning: Recent Progress and Future Challenges.
- Author
-
Ulukus, Sennur, Avestimehr, Salman, Gastpar, Michael, Jafar, Syed A., Tandon, Ravi, and Tian, Chao
- Subjects
INTERNET privacy ,DISTRIBUTED computing ,DATA privacy ,CYBERSPACE ,INFORMATION retrieval ,GRID computing ,PARALLEL processing - Abstract
Most of our lives are conducted in the cyberspace. The human notion of privacy translates into a cyber notion of privacy on many functions that take place in the cyberspace. This article focuses on three such functions: how to privately retrieve information from cyberspace (privacy in information retrieval), how to privately leverage large-scale distributed/parallel processing (privacy in distributed computing), and how to learn/train machine learning models from private data spread across multiple users (privacy in distributed (federated) learning). The article motivates each privacy setting, describes the problem formulation, summarizes breakthrough results in the history of each problem, and gives recent results and discusses some of the major ideas that emerged in each field. In addition, the cross-cutting techniques and interconnections between the three topics are discussed along with a set of open problems and challenges. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. MISO Broadcast Channel With Hybrid CSIT: Beyond Two Users.
- Author
-
Lashgari, Sina, Tandon, Ravi, and Avestimehr, Salman
- Subjects
DEGREES of freedom ,ANALYSIS of variance ,PHASE equilibrium ,MECHANICS (Physics) ,MISO - Abstract
We study the impact of heterogeneity of channel-state-information available at the transmitters (CSIT) on the capacity of broadcast channels with a multiple-antenna transmitter and $k$ single-antenna receivers (MISO BC). In particular, we consider the $k$ -user MISO BC, where the CSIT with respect to each receiver can be either instantaneous/perfect, delayed, or not available; and we study the impact of this heterogeneity of CSIT on the degrees-of-freedom (DoFs) of such network. We first focus on the three-user MISO BC, and we completely characterize the DoF region for all possible heterogeneous CSIT configurations, assuming linear encoding strategies at the transmitters. The result shows that the state-of-the-art achievable schemes in the literature are indeed sum-DoF optimal, when restricted to linear encoding schemes. To prove the result, we develop a novel bound, called interference decomposition bound, which provides a lower bound on the interference dimension at a receiver which supplies delayed CSIT based on the average dimension of constituents of that interference, thereby decomposing the interference into its individual components. Furthermore, we extend our outer bound on the DoF region to the general $k$ -user MISO BC, and demonstrate that it leads to an approximate characterization of linear sum-DoF to within an additive gap of 0.5 for a broad range of CSIT configurations. Moreover, for the special case where only one receiver supplies delayed CSIT, we completely characterize the linear sum-DoF. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
9. Federated Learning of Generative Image Priors for MRI Reconstruction.
- Author
-
Elmas G, Dar SUH, Korkmaz Y, Ceyani E, Susam B, Ozbey M, Avestimehr S, and Cukur T
- Subjects
- Humans, Magnetic Resonance Imaging methods, Image Processing, Computer-Assisted methods, Deep Learning
- Abstract
Multi-institutional efforts can facilitate training of deep MRI reconstruction models, albeit privacy risks arise during cross-site sharing of imaging data. Federated learning (FL) has recently been introduced to address privacy concerns by enabling distributed training without transfer of imaging data. Existing FL methods employ conditional reconstruction models to map from undersampled to fully-sampled acquisitions via explicit knowledge of the accelerated imaging operator. Since conditional models generalize poorly across different acceleration rates or sampling densities, imaging operators must be fixed between training and testing, and they are typically matched across sites. To improve patient privacy, performance and flexibility in multi-site collaborations, here we introduce Federated learning of Generative IMage Priors (FedGIMP) for MRI reconstruction. FedGIMP leverages a two-stage approach: cross-site learning of a generative MRI prior, and prior adaptation following injection of the imaging operator. The global MRI prior is learned via an unconditional adversarial model that synthesizes high-quality MR images based on latent variables. A novel mapper subnetwork produces site-specific latents to maintain specificity in the prior. During inference, the prior is first combined with subject-specific imaging operators to enable reconstruction, and it is then adapted to individual cross-sections by minimizing a data-consistency loss. Comprehensive experiments on multi-institutional datasets clearly demonstrate enhanced performance of FedGIMP against both centralized and FL methods based on conditional models.
- Published
- 2023
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.