Searcharxiv⌕ Search

arXiv subjects

Yonina C. Eldar

Publications and source records attributed to Yonina C. Eldar.

At least 253 records · Page 14Linked to original sources

UVeQFed: Universal Vector Quantization for Federated Learning

Traditional deep learning models are trained at a centralized server using labeled data samples collected from end devices or users. Such data samples often include private information, which the users may not be willing to share. Federated learning (FL) is an emerging approach to train such learning models without requiring the users to share their possibly private labeled data. In FL, each user trains its copy of the learning model locally. The server then collects the individual updates and aggregates them into a global model. A major challenge that arises in this method is the need of each user to efficiently transmit its learned model over the throughput limited uplink channel. In this work, we tackle this challenge using tools from quantization theory. In particular, we identify the unique characteristics associated with conveying trained models over rate-constrained channels, and propose a suitable quantization scheme for such settings, referred to as universal vector quantization for FL (UVeQFed). We show that combining universal vector quantization methods with FL yields a decentralized training system in which the compression of the trained models induces only a minimum distortion. We then theoretically analyze the distortion, showing that it vanishes as the number of users grows. We also characterize the convergence of models trained with the traditional federated averaging method combined with UVeQFed to the model which minimizes the loss function. Our numerical results demonstrate the gains of UVeQFed over previously proposed methods in terms of both distortion induced in quantization and accuracy of the resulting aggregated model.

cs.LG↗

Serial Quantization for Sparse Time Sequences

Sparse signals are encountered in a broad range of applications. In order to process these signals using digital hardware, they must be first sampled and quantized using an analog-to-digital convertor (ADC), which typically operates in a serial scalar manner. In this work, we propose a method for serial quantization of sparse time sequences (SQuaTS) inspired by group testing theory, which is designed to reliably and accurately quantize sparse signals acquired in a sequential manner using serial scalar ADCs. Unlike previously proposed approaches which combine quantization and compressed sensing (CS), our SQuaTS scheme updates its representation on each incoming analog sample and does not require the complete signal to be observed and stored in analog prior to quantization. We characterize the asymptotic tradeoff between accuracy and quantization rate of SQuaTS as well as its computational burden. We also propose a variation of SQuaTS, which trades rate for computational efficiency. Next, we show how SQuaTS can be naturally extended to distributed quantization scenarios, where a set of jointly sparse time sequences are acquired individually and processed jointly. Our numerical results demonstrate that SQuaTS is capable of achieving substantially improved representation accuracy over previous CS-based schemes without requiring the complete set of analog signal samples to be observed prior to its quantization, making it an attractive approach for acquiring sparse time sequences.

cs.IT↗

Statistical model-based evaluation of neural networks

Using a statistical model-based data generation, we develop an experimental setup for the evaluation of neural networks (NNs). The setup helps to benchmark a set of NNs vis-a-vis minimum-mean-square-error (MMSE) performance bounds. This allows us to test the effects of training data size, data dimension, data geometry, noise, and mismatch between training and testing conditions. In the proposed setup, we use a Gaussian mixture distribution to generate data for training and testing a set of competing NNs. Our experiments show the importance of understanding the type and statistical conditions of data for appropriate application and design of NNs

cs.LG↗

Deep Networks for Direction-of-Arrival Estimation in Low SNR

In this work, we consider direction-of-arrival (DoA) estimation in the presence of extreme noise using Deep Learning (DL). In particular, we introduce a Convolutional Neural Network (CNN) that is trained from mutli-channel data of the true array manifold matrix and is able to predict angular directions using the sample covariance estimate. We model the problem as a multi-label classification task and train a CNN in the low-SNR regime to predict DoAs across all SNRs. The proposed architecture demonstrates enhanced robustness in the presence of noise, and resilience to a small number of snapshots. Moreover, it is able to resolve angles within the grid resolution. Experimental results demonstrate significant performance gains in the low-SNR regime compared to state-of-the-art methods and without the requirement of any parameter tuning. We relax the assumption that the number of sources is known a priori and present a training method, where the CNN learns to infer the number of sources jointly with the DoAs. Simulation results demonstrate that the proposed CNN can accurately estimate off-grid angles in low SNR, while at the same time the number of sources is successfully inferred for a sufficient number of snapshots. Our robust solution can be applied in several fields, ranging from wireless array sensors to acoustic microphones or sonars.

eess.SP↗

Point of Care Image Analysis for COVID-19

Early detection of COVID-19 is key in containing the pandemic. Disease detection and evaluation based on imaging is fast and cheap and therefore plays an important role in COVID-19 handling. COVID-19 is easier to detect in chest CT, however, it is expensive, non-portable, and difficult to disinfect, making it unfit as a point-of-care (POC) modality. On the other hand, chest X-ray (CXR) and lung ultrasound (LUS) are widely used, yet, COVID-19 findings in these modalities are not always very clear. Here we train deep neural networks to significantly enhance the capability to detect, grade and monitor COVID-19 patients using CXRs and LUS. Collaborating with several hospitals in Israel we collect a large dataset of CXRs and use this dataset to train a neural network obtaining above 90% detection rate for COVID-19. In addition, in collaboration with ULTRa (Ultrasound Laboratory Trento, Italy) and hospitals in Italy we obtained POC ultrasound data with annotations of the severity of disease and trained a deep network for automatic severity grading.

eess.IV↗

Compressed Fourier-Domain Convolutional Beamforming for Wireless Ultrasound imaging

Wireless ultrasound (US) systems that produce high-quality images can improve current clinical diagnosis capabilities by making the imaging process much more efficient, affordable, and accessible to users. The most common technique for generating B-mode US images is delay and sum (DAS) beamforming, where an appropriate delay is introduced to signals sampled and processed at each transducer element. However, sampling rates that are much higher than the Nyquist rate of the signal are required for high resolution DAS beamforming, leading to large amounts of data, making transmission of channel data over WIFI impractical. Moreover, the production of US images that exhibit high resolution and good image contrast requires a large set of transducers which further increases the data size. Previous works suggest methods for reduction in sampling rate and in array size. In this work, we introduce compressed Fourier domain convolutional beamforming, combining Fourier domain beamforming, sparse convolutional beamforming, and compressed sensing methods. This allows reducing both the number of array elements and the sampling rate in each element, while achieving high resolution images. Using in vivo data we demonstrate that the proposed method can generate B-mode images using 142 times less data than DAS. Our results pave the way towards wireless US and demonstrate that high resolution US images can be produced using sub-Nyquist sampling and a small number of receiving channels.

eess.SP↗

A Deep-Unfolded Reference-Based RPCA Network For Video Foreground-Background Separation

Deep unfolded neural networks are designed by unrolling the iterations of optimization algorithms. They can be shown to achieve faster convergence and higher accuracy than their optimization counterparts. This paper proposes a new deep-unfolding-based network design for the problem of Robust Principal Component Analysis (RPCA) with application to video foreground-background separation. Unlike existing designs, our approach focuses on modeling the temporal correlation between the sparse representations of consecutive video frames. To this end, we perform the unfolding of an iterative algorithm for solving reweighted $\ell_1$-$\ell_1$ minimization; this unfolding leads to a different proximal operator (a.k.a. different activation function) adaptively learned per neuron. Experimentation using the moving MNIST dataset shows that the proposed network outperforms a recently proposed state-of-the-art RPCA network in the task of video foreground-background separation.

cs.LG↗

Over-the-Air Federated Learning from Heterogeneous Data

Federated learning (FL) is a framework for distributed learning of centralized models. In FL, a set of edge devices train a model using their local data, while repeatedly exchanging their trained updates with a central server. This procedure allows tuning a centralized model in a distributed fashion without having the users share their possibly private data. In this paper, we focus on over-the-air (OTA) FL, which has been suggested recently to reduce the communication overhead of FL due to the repeated transmissions of the model updates by a large number of users over the wireless channel. In OTA FL, all users simultaneously transmit their updates as analog signals over a multiple access channel, and the server receives a superposition of the analog transmitted signals. However, this approach results in the channel noise directly affecting the optimization procedure, which may degrade the accuracy of the trained model. We develop a Convergent OTA FL (COTAF) algorithm which enhances the common local stochastic gradient descent (SGD) FL algorithm, introducing precoding at the users and scaling at the server, which gradually mitigates the effect of the noise. We analyze the convergence of COTAF to the loss minimizing model and quantify the effect of a statistically heterogeneous setup, i.e. when the training data of each user obeys a different distribution. Our analysis reveals the ability of COTAF to achieve a convergence rate similar to that achievable over error-free channels. Our simulations demonstrate the improved convergence of COTAF over vanilla OTA local SGD for training using non-synthetic datasets. Furthermore, we numerically show that the precoding induced by COTAF notably improves the convergence rate and the accuracy of models trained via OTA FL.

cs.LG↗

BiLiMO: Bit-Limited MIMO Radar via Task-Based Quantization

Recent years have witnessed growing interest in reduced cost radar systems operating with low power. Multiple-input multiple-output (MIMO) radar technology is known to achieve high performance sensing by probing with multiple orthogonal waveforms. However, implementing a low cost low power MIMO radar is challenging. One of the reasons for this difficulty stems from the increased cost and power consumption required by analog-to-digital convertors (ADCs) in acquiring the multiple waveforms at the radar receiver. In this work we study reduced cost MIMO radar receivers restricted to operate with low resolution ADCs. We design bit-limited MIMO radar (BiLiMO) receivers which are capable of accurately recovering their targets while operating under strict resolution constraints. This is achieved by applying an additional analog filter to the acquired waveforms, and designing the overall hybrid analog-digital system to facilitate target identification using task-based quantization methods. In particular, we exploit the fact that the target parameters can be recovered from a compressed representation of the received waveforms. We thus tune the acquisition system to recover this representation with minimal distortion, from which the targets can be extracted in digital, and characterize the achievable error in identifying the targets. Our numerical results demonstrate that the proposed BiLiMO receiver operating with a bit budget of one bit per sample achieves target recovery performance which approaches that of costly MIMO radars operating with unlimited resolution ADCs, while substantially outperforming MIMO receivers operating only in the digital domain under the same bit limitations.

eess.SP↗

ViterbiNet: A Deep Learning Based Viterbi Algorithm for Symbol Detection

Symbol detection plays an important role in the implementation of digital receivers. In this work, we propose ViterbiNet, which is a data-driven symbol detector that does not require channel state information (CSI). ViterbiNet is obtained by integrating deep neural networks (DNNs) into the Viterbi algorithm. We identify the specific parts of the Viterbi algorithm that are channel-model-based, and design a DNN to implement only those computations, leaving the rest of the algorithm structure intact. We then propose a meta-learning based approach to train ViterbiNet online based on recent decisions, allowing the receiver to track dynamic channel conditions without requiring new training samples for every coherence block. Our numerical evaluations demonstrate that the performance of ViterbiNet, which is ignorant of the CSI, approaches that of the CSI-based Viterbi algorithm, and is capable of tracking time-varying channels without needing instantaneous CSI or additional training data. Moreover, unlike conventional Viterbi detection, ViterbiNet is robust to CSI uncertainty, and it can be reliably implemented in complex channel models with constrained computational burden. More broadly, our results demonstrate the conceptual benefit of designing communication systems to that integrate DNNs into established algorithms.

cs.LG↗

On the Error Exponent of Approximate Sufficient Statistics for M-ary Hypothesis Testing

Consider the problem of detecting one of M i.i.d. Gaussian signals corrupted in white Gaussian noise. Conventionally, matched filters are used for detection. We first show that the outputs of the matched filter form a set of asymptotically optimal sufficient statistics in the sense of maximizing the error exponent of detecting the true signal. In practice, however, M may be large which motivates the design and analysis of a reduced set of N statistics which we term approximate sufficient statistics. Our construction of these statistics is based on a small set of filters that project the outputs of the matched filters onto a lower-dimensional vector using a sensing matrix. We consider a sequence of sensing matrices that has the desiderata of row orthonormality and low coherence. We analyze the performance of the resulting maximum likelihood (ML) detector, which leads to an achievable bound on the error exponent based on the approximate sufficient statistics; this bound recovers the original error exponent when N = M. We compare this to a bound that we obtain by analyzing a modified form of the Reduced Dimensionality Detector (RDD) proposed by Xie, Eldar, and Goldsmith [IEEE Trans. on Inform. Th., 59(6):3858-3874, 2013]. We show that by setting the sensing matrices to be column-normalized group Hadamard matrices, the exponents derived are ensemble-tight, i.e., our analysis is tight on the exponential scale given the sensing matrices and the decoding rule. Finally, we derive some properties of the exponents, showing, in particular, that they increase linearly in the compression ratio N/M.

cs.IT↗

Learned SPARCOM: Unfolded Deep Super-Resolution Microscopy

The use of photo-activated fluorescent molecules to create long sequences of low emitter-density diffraction-limited images enables high-precision emitter localization, but at the cost of low temporal resolution. We suggest combining SPARCOM, a recent high-performing classical method, with model-based deep learning, using the algorithm unfolding approach, to design a compact neural network incorporating domain knowledge. Our results show that we can obtain super-resolution imaging from a small number of high emitter density frames without knowledge of the optical system and across different test sets using the proposed learned SPARCOM (LSPARCOM) network. We believe LSPARCOM can pave the way to interpretable, efficient live-cell imaging in many settings, and find broad use in single-molecule localization microscopy of biological structures.

eess.IV↗

Enhanced Channel Estimation in Massive MIMO via Coordinated Pilot Design

Pilot contamination is a limiting factor in multicell massive multiple-input multiple-output (MIMO) systems because it can severely impair channel estimation. Prior works have suggested coordinating pilot design across cells in order to reduce the channel estimation error caused by pilot contamination. In this paper, we propose a method for coordinated pilot design using fractional programming to minimize the weighted mean squared-error (MSE) in channel estimation. In particular, we apply the recently proposed quadratic transform to the MSE expression which allows the effect of pilot contamination to be decoupled. The resulting problem reformulation enables the pilots to be optimized in closed form if they can be designed arbitrarily. When the pilots are restricted to a given set of orthogonal sequences, pilot optimization reduces to an assignment problem which can be solved by weighted bipartite matching. Furthermore, we consider the max-min fairness of data rates with orthogonal pilots and obtain an extension of the proposed method to correlated Rayleigh fading. Finally, simulations demonstrate the advantage of the proposed (orthogonal and nonorthogonal) pilot designs as compared with state-of-the-art methods in combating pilot contamination.

cs.IT↗

Sampling Signals on Graphs: From Theory to Applications

The study of sampling signals on graphs, with the goal of building an analog of sampling for standard signals in the time and spatial domains, has attracted considerable attention recently. Beyond adding to the growing theory on graph signal processing (GSP), sampling on graphs has various promising applications. In this article, we review current progress on sampling over graphs focusing on theory and potential applications. Although most methodologies used in graph signal sampling are designed to parallel those used in sampling for standard signals, sampling theory for graph signals significantly differs from the theory of Shannon--Nyquist and shift-invariant sampling. This is due in part to the fact that the definitions of several important properties, such as shift invariance and bandlimitedness, are different in GSP systems. Throughout this review, we discuss similarities and differences between standard and graph signal sampling and highlight open problems and challenges.

eess.SP↗

Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processing

Deep neural networks provide unprecedented performance gains in many real world problems in signal and image processing. Despite these gains, future development and practical deployment of deep networks is hindered by their blackbox nature, i.e., lack of interpretability, and by the need for very large training sets. An emerging technique called algorithm unrolling or unfolding offers promise in eliminating these issues by providing a concrete and systematic connection between iterative algorithms that are used widely in signal processing and deep neural networks. Unrolling methods were first proposed to develop fast neural network approximations for sparse coding. More recently, this direction has attracted enormous attention and is rapidly growing both in theoretic investigations and practical applications. The growing popularity of unrolled deep networks is due in part to their potential in developing efficient, high-performance and yet interpretable network architectures from reasonable size training sets. In this article, we review algorithm unrolling for signal and image processing. We extensively cover popular techniques for algorithm unrolling in various domains of signal and image processing including imaging, vision and recognition, and speech processing. By reviewing previous works, we reveal the connections between iterative algorithms and neural networks and present recent theoretical results. Finally, we provide a discussion on current limitations of unrolling and suggest possible future research directions.

eess.IV↗

Sparse Array Design via Fractal Geometries

Sparse sensor arrays have attracted considerable attention in various fields such as radar, array processing, ultrasound imaging and communications. In the context of correlation-based processing, such arrays enable to resolve more uncorrelated sources than physical sensors. This property of sparse arrays stems from the size of their difference coarrays, defined as the differences of element locations. Thus, the design of sparse arrays with large difference coarrays is of great interest. In addition, other array properties such as symmetry, robustness and array economy are important in different applications. Numerous studies have proposed diverse sparse geometries, focusing on certain properties while lacking others. Incorporating multiple properties into the design task leads to combinatorial problems which are generally NP-hard. For small arrays these optimization problems can be solved by brute force, however, in large scale they become intractable. In this paper, we propose a scalable systematic way to design large sparse arrays considering multiple properties. To that end, we introduce a fractal array design in which a generator array is recursively expanded according to its difference coarray. Our main result states that for an appropriate choice of the generator such fractal arrays exhibit large difference coarrays. Furthermore, we show that the fractal arrays inherit their properties from their generators. Thus, a small generator can be optimized according to desired requirements and then expanded to create a fractal array which meets the same criteria. This approach paves the way to efficient design of large arrays of hundreds or thousands of elements with specific properties.

eess.SP↗

eSampling: Energy Harvesting ADCs

Analog-to-digital converters (ADCs) allow physical signals to be processed using digital hardware. The power consumed in conversion grows with the sampling rate and quantization resolution, imposing a major challenge in power-limited systems. A common ADC architecture is based on sample-and-hold (S/H) circuits, where the analog signal is being tracked only for a fraction of the sampling period. In this paper, we propose the concept of eSampling ADCs, which harvest energy from the analog signal during the time periods where the signal is not being tracked. This harvested energy can be used to supplement the ADC itself, paving the way to the possibility of zero-power consumption and power-saving ADCs. We analyze the tradeoff between the ability to recover the sampled signal and the energy harvested, and provide guidelines for setting the sampling rate in the light of accuracy and energy constraints. Our analysis indicates that eSampling ADCs operating with up to 12 bits per sample can acquire bandlimited analog signals such that they can be perfectly recovered without requiring power from the external source. Furthermore, our theoretical results reveal that eSampling ADCs can in fact save power by harvesting more energy than they consume. To verify the feasibility of eSampling ADCs, we present a circuit-level design using standard complementary metal oxide semiconductor (CMOS) 65 nm technology. An eSampling 8-bit ADC which samples at 40 MHZ is designed on a Cadence Virtuoso platform. Our experimental study involving Nyquist rate sampling of bandlimited signals demonstrates that such ADCs are indeed capable of harvesting more energy than that spent during analog-to-digital conversion, without affecting the accuracy.

eess.SP↗

Spatial Modulation for Joint Radar-Communications Systems: Design, Analysis, and Hardware Prototype

Dual-function radar-communications (DFRC) systems implement radar and communication functionalities on a single platform. Jointly designing these subsystems can lead to substantial gains in performance as well as size, cost, and power consumption. In this paper, we propose a DFRC system, which utilizes generalized spatial modulation (GSM) to realize coexisting radar and communications waveforms. Our proposed GSM-based scheme, referred to as spatial modulation based communication-radar (SpaCoR) system, allocates antenna elements among the subsystems based on the transmitted message, thus achieving increased communication rates by embedding additional data bits in the antenna selection. We formulate the resulting signal models, and present a dedicated radar processing scheme. To evaluate the radar performance, we characterize the statistical properties of the transmit beam pattern. Then, we present a hardware prototype of the proposed DFRC system, demonstrating the feasibility of the scheme. Our results show that the proposed GSM system achieves improved communication performance compared to techniques utilizing fixed allocations operating at the same data rate. For the radar subsystem, our experiments show that the spatial agility induced by the GSM transmission improves the angular resolution and reduces the sidelobe level in the transmit beam pattern compared to using fixed antenna allocations.

eess.SP↗