Filters








46 Hits in 4.9 sec

Robust Gradient Descent via Moment Encoding with LDPC Codes [article]

Raj Kumar Maity, Ankit Singh Rawat, Arya Mazumdar
2019 arXiv   pre-print
We, instead, propose to encode the second-moment of the data with a low density parity-check (LDPC) code.  ...  We show that for a random model for stragglers, the proposed moment encoding based gradient descent method can be viewed as the stochastic gradient descent method.  ...  Acknowledgements This work is supported in part by National Science Foundation awards CCF 1642658 (CAREER) and CCF 1618512.  ... 
arXiv:1805.08327v2 fatcat:bghtp26hhjbutjnxx6jffb3e5q

Boost decoding performance of finite geometry LDPC codes with deep learning tactics [article]

Guangwen Li, Xiao Yu
2022 arXiv   pre-print
We adopt the similar decoding framework to seek a low-complexity and high-performance decoder for a class of finite geometry LDPC codes in short and moderate block lengths.  ...  Consequently, for the referred LDPC codes, their rigorous algebraic structure promotes the feasibility of cutting down the number of trainable parameters even to only one, whereas incurring marginal performance  ...  ACKNOWLEDGEMENT The authors would like to thank Google corporation for providing the excellent computing platforms of Colab and Kaggle online, which make it possible to train and test our models freely  ... 
arXiv:2205.00481v1 fatcat:7fa6datnhfeixgoodeohax2ltq

Ricean K-factor Estimation based on Channel Quality Indicator in OFDM Systems using Neural Network [article]

Kun Wang
2018 arXiv   pre-print
Most existing works estimate K factor based on either maximum-likelihood criterion or higher-order moments, and the existing works are targeted at K-factor estimation at receiver side.  ...  The Ricean K factor, defined as the ratio of direct path and scattered paths, provides a good indication of the link quality.  ...  For the gradient descent to work, the parameters W and b need to be initialized.  ... 
arXiv:1808.06537v1 fatcat:i4uhcpa3yvdlvpgfxktvnp7dvm

Fundamental Limits of Approximate Gradient Coding [article]

Sinong Wang, Jiashang Liu, Ness Shroff
2019 arXiv   pre-print
We implement our schemes and demonstrate the advantage of the approaches over the current fastest gradient coding strategies.  ...  We identify a fundamental three-fold tradeoff for any approximate gradient coding scheme d≥ O((1/ϵ)/(n/s)), where d is the computation load, ϵ is the error of gradient.  ...  Rawat, and A. Mazumdar, "Robust gradient descent via moment encoding with ldpc codes," SysML, 2018. [20] M. Ye and E.  ... 
arXiv:1901.08166v1 fatcat:bppo7wujfvfgbkzavlcj3nddvi

Table of Contents [EDICS]

2020 IEEE Transactions on Signal Processing  
Sirigina, and A. K. Krishna 3103 Efficient QP-ADMM Decoder for Binary LDPC Codes and Its Performance Analysis . . . . . . . J. Bai, Y. Wang, and Q.  ...  Luo 3644 Federated Variance-Reduced Stochastic Gradient Descent With Robustness to Byzantine Attacks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  ...  Li 1500 Resolving Range Ambiguity via Multiple-Input Multiple-Output Radar With Element-Pulse Coding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  ... 
doi:10.1109/tsp.2020.3045363 fatcat:wcnvdcy3rvhblh7rtxfe6gz4re

Coded Distributed Computing with Partial Recovery [article]

Emre Ozfatura and Sennur Ulukus and Deniz Gunduz
2021 arXiv   pre-print
Coded computation techniques provide robustness against straggling workers in distributed computing.  ...  In this paper, we first introduce a novel coded matrix-vector multiplication scheme, called coded computation with partial recovery (CCPR), which benefits from the advantages of both coded and uncoded  ...  Singh Rawa, and A. Mazumdar, “Robust gradient de- 5273–5282, 2020. scent via moment encoding and ldpc codes,” in 2019 IEEE International [38] B. Hasırcıoğlu, J.  ... 
arXiv:2007.02191v2 fatcat:a7rx5w4yrbhnbnh4uf2s2h3eke

2020 Index IEEE Transactions on Signal Processing Vol. 68

2020 IEEE Transactions on Signal Processing  
., and Rahmani, M., One-Step Prediction for Discrete Time-Varying Nonlinear Systems With Unknown Inputs and Correlated Noises; TSP  ...  ., +, TSP 2020 2186-2198 Efficient QP-ADMM Decoder for Binary LDPC Codes and Its Performance Analysis.  ...  ., +, TSP 2020 4700-4712 Efficient QP-ADMM Decoder for Binary LDPC Codes and Its Performance Analysis.  ... 
doi:10.1109/tsp.2021.3055469 fatcat:6uswtuxm5ba6zahdwh5atxhcsy

Technical Program

2021 2020 IEEE Information Theory Workshop (ITW)  
by random coding, and may be strictly lower than the Shannon (matched) capacity.  ...  The Schalkwijk-Kailath (SK) feedback scheme is a capacity-achieving coding scheme for the point-to-point white Gaussian channel with feedback.  ...  Among them are certain moment equivalence assumptions often used in the robust statistics literature.  ... 
doi:10.1109/itw46852.2021.9457668 fatcat:j425ygeajrbd5esztbe5zgygty

Communication-Efficient Edge AI: Algorithms and Systems [article]

Yuanming Shi, Kai Yang, Tao Jiang, Jun Zhang, Khaled B. Letaief
2020 arXiv   pre-print
AI at the edge requires close cooperation among edge devices, such as smart phones and smart vehicles, and edge servers at the wireless access points and base stations, which however result in heavy communication  ...  We then introduce communication-efficient techniques, from both algorithmic and system perspectives for training and inference tasks at the network edge.  ...  Zhi Ding from the University of California at Davis for insightful and constructive comments to improve the presentation of this work.  ... 
arXiv:2002.09668v1 fatcat:nhasdzb7t5dt5brs2r7ocdzrnm

A Survey of Coded Distributed Computing [article]

Jer Shyuan Ng, Wei Yang Bryan Lim, Nguyen Cong Luong, Zehui Xiong, Alia Asheralieva, Dusit Niyato, Cyril Leung, Chunyan Miao
2020 arXiv   pre-print
Coding theoretic techniques have proved effective in WiFi and cellular systems to deal with channel noise.  ...  To address these issues, coded distributed computing (CDC), i.e., a combination of coding theoretic techniques and distributed computing, has been recently proposed as a promising solution.  ...  data based on pair-wise balanced scheme and provide a rigorous convergence analysis of the proposed coding scheme [15] LDPC Codes Encode the second moment of the data points [151] , [152] Encoded  ... 
arXiv:2008.09048v1 fatcat:riy4dxvuc5ae3krz7lf25zkg6m

Table of Contents

2021 2021 IEEE International Symposium on Information Theory (ISIT)  
: EFFICIENT AND ROBUST DISTRIBUTED MATRIX COMPUTATIONS VIA ...............................COMBINING FOR NONSTATIONARY POLARIZATION ON ..................................... 1730 ERASURE CHANNELS Hanwen  ...  Technology, China; Andreas Winter, Universitat Autònoma de Barcelona, Spain D3-T1-S4: DISTRIBUTED COMPUTATION II D3-T1-S4.1: DIFFERENTIALLY QUANTIZED GRADIENT DESCENT .................................  ... 
doi:10.1109/isit45174.2021.9518212 fatcat:vkpbkhd3kzaxtcwe53osdnt6ku

Machine Learning for Multimedia Communications

Nikolaos Thomos, Thomas Maugey, Laura Toni
2022 Sensors  
In this paper, we review the recent major advances that have been proposed all across the transmission chain, and we discuss their potential impact and the research challenges that they raise.  ...  Machine learning is revolutionizing the way multimedia information is processed and transmitted to users.  ...  Then, training is done by means of the stochastic gradient descent algorithm. The decoder achieves improved decoding performance and reduced complexity.  ... 
doi:10.3390/s22030819 pmid:35161566 pmcid:PMC8840624 fatcat:nmz7s6ei3bdddarbt2bqhf6beu

Joint Alignment of Multiple Protein–Protein Interaction Networks via Convex Optimization

Somaye Hashemifar, Qixing Huang, Jinbo Xu
2016 Journal of Computational Biology  
HSA is robust, accurate, and outperforms or rivals existing computational tools when evaluated on simulated and real datasets in diverse cell types.  ...  Genome-wide chromosome conformation capture (Hi-C) has been widely used to study chromatin interactions and the 3D structures of the genome.  ...  We conclude by discussing how the efficient and robust bacterial gradient descent algorithms we developed can be used by distributed sensors or wireless networks that operate under strict communication  ... 
doi:10.1089/cmb.2016.0025 pmid:27428933 fatcat:tr4e3u3hqjaoziavhhsklxkkmi

Parameter Estimation and Classification via Supervised Learning in the Wireless Physical Layer: A Survey and Tutorial

Kyle W. McClintick, Galahad M. Wernsing, Paulo Victor R. Ferreira, Alexander M. Wyglinski
2021 IEEE Access  
Automatic Coding and Modulation (ACM).  ...  achieve low costs via inexpensive forward-pass computations, attain flexible operations due to trainable parameters, and yield accurate results based on the universal approximator attribute.  ...  Recent improvements to control codes include turbo codes [108] and Low-Density Parity-Check (LDPC) codes [109] .  ... 
doi:10.1109/access.2021.3128813 fatcat:kj6xxdefzbbttanqdlwgq7ekqq

Message Passing Algorithms for Phase Noise Tracking Using Tikhonov Mixtures [article]

Shachar Shayovitz, Dan Rapaheli
2013 arXiv   pre-print
We show simulation results and complexity analysis for the proposed algorithm and show better performance than other state of the art low complexity algorithms.  ...  We further show a method for limiting the number of tracked components and further complexity reduction approaches.  ...  The global algorithms attempt to solve (35) by gradient descent type solutions which are very computationally demanding.  ... 
arXiv:1306.3693v2 fatcat:rk36dsicvbep5g3qs477x73shi
« Previous Showing results 1 — 15 out of 46 results