research
∙
03/13/2023
Bayes Complexity of Learners vs Overfitting
We introduce a new notion of complexity of functions and we show that it...
share
research
∙
12/23/2021
Polar Codes Do Not Have Many Affine Automorphisms
Polar coding solutions demonstrate excellent performance under the list ...
research
∙
04/13/2021
On the efficiency of polar-like decoding for symmetric codes
The recently introduced polar codes constitute a breakthrough in coding ...
research
∙
04/12/2021
Noether: The More Things Change, the More Stay the Same
Symmetries have proven to be important ingredients in the analysis of ne...
research
∙
02/10/2021
Adversarial Robustness: What fools you makes you stronger
We prove an exponential separation for the sample complexity between the...
research
∙
10/02/2020
Query complexity of adversarial attacks
Modern machine learning models are typically highly accurate but have be...
research
∙
09/18/2020
The Stability of Low-Density Parity-Check Codes and Some of Its Consequences
We study the stability of low-density parity-check (LDPC) codes under bl...
research
∙
01/11/2020
Partially symmetric monomial codes
A framework of monomial codes is considered, which includes linear codes...
research
∙
12/16/2019
Constructing a provably adversarially-robust classifier from a high accuracy one
Modern machine learning models with very high accuracy have been shown t...
research
∙
01/29/2018
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels
Consider a binary linear code of length N, minimum distance d_min, trans...
research
∙
01/09/2018
A New Coding Paradigm for the Primitive Relay Channel
We present a coding paradigm that provides a new achievable rate for the...
research
∙
02/15/2017
