Deep Randomized Distributed Function Computation (DeepRDFC): Neural Distributed Channel Simulation
The randomized distributed function computation (RDFC) framework, which unifies many cutting-edge distributed computation and learning applications, is considered. An autoencoder (AE) architecture is proposed to minimize the total variation distance between the probability distribution simulated by the AE outputs and an unknown target distribution, using only data samples. We illustrate significantly high RDFC performance with communication load gains from our AEs compared to data compression methods. Our designs establish deep learning-based RDFC methods and aim to facilitate the use of RDFC methods, especially when the amount of common randomness is limited and strong function computation guarantees are required.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization
Machine learning with big data often involves large optimization models. For distributed optimization over a cluster of machines, frequent communication and synchronization of all model parameters (optimization variables…
Distributed ComputingDistributed OptimizationDistributed Sketching Methods for Privacy Preserving Regression
In this work, we study distributed sketching methods for large scale regression problems. We leverage multiple randomized sketches for reducing the problem dimensions as well as preserving privacy and improving straggler…
Computational EfficiencyPrivacy PreservingregressionHyperdimensional Computing for Efficient Distributed Classification with Randomized Neural Networks
In the supervised learning domain, considering the recent prevalence of algorithms with high computational cost, the attention is steering towards simpler, lighter, and less computationally extensive training and inferen…
ClassificationDistributed Sketching for Randomized Optimization: Exact Characterization, Concentration and Lower Bounds
We consider distributed optimization methods for problems where forming the Hessian is computationally challenging and communication is a significant bottleneck. We leverage randomized sketches for reducing the problem d…
Cloud ComputingDistributed OptimizationProtecting Big Data Privacy Using Randomized Tensor Network Decomposition and Dispersed Tensor Computation
Data privacy is an important issue for organizations and enterprises to securely outsource data storage, sharing, and computation on clouds / fogs. However, data encryption is complicated in terms of the key management a…
Dimensionality ReductionManagementTensor Networks