activity
20172024
most citedAbove the Nyquist Rate, Modulo Folding Does Not Hurt

61 citations · 167 across the 16 of their papers we have counts for

collaborators
Showing cs.ITShow all

9 papers · 1 filter

cs.IT2023

On the Noise Sensitivity of the Randomized SVD

Elad Romanov

The randomized singular value decomposition (R-SVD) is a popular sketching-based algorithm for efficiently computing the partial SVD of a large matrix. When the matrix is low-rank,…

cs.IT2022

On the Role of Channel Capacity in Learning Gaussian Mixture Models

Elad Romanov, Tamir Bendory, Or Ordentlich

This paper studies the sample complexity of learning the unknown centers of a balanced Gaussian mixture model (GMM) in with spherical covariance matrix $σ^2\math…

cs.IT2021

Spiked Covariance Estimation from Modulo-Reduced Measurements

Elad Romanov, Or Ordentlich

Consider the rank-1 spiked model: , where is the spike intensity, is an unknown direction and $ξ\sim \mathcal{N}(0,1),…

cs.IT2021★ 7 cited

On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel

Elad Romanov, Or Ordentlich

Motivated by applications in unsourced random access, this paper develops a novel scheme for the problem of compressed sensing of binary signals. In this problem, the goal is to de…

cs.IT2020★ 19 cited

Multi-reference alignment in high dimensions: sample complexity and phase transition

Elad Romanov, Tamir Bendory, Or Ordentlich

Multi-reference alignment entails estimating a signal in from its circularly-shifted and noisy copies. This problem has been studied thoroughly in recent years, focu…

cs.IT2019★ 61 cited

Above the Nyquist Rate, Modulo Folding Does Not Hurt

Elad Romanov, Or Ordentlich

We consider the problem of recovering a continuous-time bandlimited signal from the discrete-time signal obtained from sampling it every seconds and reducing the result modul…

cs.IT2019★ 13 cited

Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs

Elad Romanov, Or Ordentlich

We consider the problem of recovering i.i.d samples from a zero mean multivariate Gaussian distribution with an unknown covariance matrix, from their modulo wrapped measurement…

cs.IT2018★ 7 cited

The Noise-Sensitivity Phase Transition in Spectral Group Synchronization Over Compact Groups

Elad Romanov, Matan Gavish

In Group Synchronization, one attempts to find a collection of unknown group elements from noisy measurements of their pairwise differences. Several important problems in vision an…

cs.IT2017★ 12 cited

Near-optimal matrix recovery from random linear measurements

Elad Romanov, Matan Gavish

In matrix recovery from random linear measurements, one is interested in recovering an unknown -by- matrix from measurements where each …