research
∙
06/19/2022
On The Memory Complexity of Uniformity Testing
In this paper we consider the problem of uniformity testing with limited...
share
research
∙
06/19/2022
Deterministic Finite-Memory Bias Estimation
In this paper we consider the problem of estimating a Bernoulli paramete...
research
∙
02/15/2022
On the Role of Channel Capacity in Learning Gaussian Mixture Models
This paper studies the sample complexity of learning the k unknown cente...
research
∙
10/12/2021
Blind Modulo Analog-to-Digital Conversion of Vector Processes
In a growing number of applications, there is a need to digitize a (poss...
research
∙
10/04/2021
Spiked Covariance Estimation from Modulo-Reduced Measurements
Consider the rank-1 spiked model: X=√(ν)ξu+ Z, where ν is the spike inte...
research
∙
05/11/2021
On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel
Motivated by applications in unsourced random access, this paper develop...
research
∙
03/03/2021
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems
In Rate Distortion (RD) problems one seeks reduced representations of a ...
research
∙
02/16/2021
Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss
The construction of multiclass classifiers from binary classifiers is st...
research
∙
09/16/2020
Strong data processing constant is achieved by binary inputs
For any channel P_Y|X the strong data processing constant is defined as ...
research
∙
07/22/2020
Multi-reference alignment in high dimensions: sample complexity and phase transition
Multi-reference alignment entails estimating a signal in ℝ^L from its ci...
research
∙
05/30/2020
New bounds on the density of lattice coverings
We obtain new upper bounds on the minimal density of lattice coverings o...
research
∙
05/15/2020
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules
In this paper we consider the problem of binary hypothesis testing with ...
research
∙
04/21/2020
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption
Motivated by a fundamental paradigm in cryptography, we consider a recen...
research
∙
04/02/2020
An Upgrading Algorithm with Optimal Power Law
Consider a channel W along with a given input distribution P_X. In certa...
research
∙
09/03/2019
A Note on the Probability of Rectangles for Correlated Binary Strings
Consider two sequences of n independent and identically distributed fair...
research
∙
08/20/2019
A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels
The interactive capacity of a channel is defined in this paper as the ma...
research
∙
03/28/2019
Above the Nyquist Rate, Modulo Folding Does Not Hurt
We consider the problem of recovering a continuous-time bandlimited sign...
research
∙
02/21/2019
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
We consider the classic joint source-channel coding problem of transmitt...
research
∙
01/29/2019
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs
We consider the problem of recovering n i.i.d samples from a zero mean m...
research
∙
12/07/2018
Information-Distilling Quantizers
Let X and Y be dependent random variables. This paper considers the prob...
research
∙
06/23/2018
A Modulo-Based Architecture for Analog-to-Digital Conversion
Systems that capture and process analog signals must first acquire them ...
research
∙
01/29/2018