research
∙
08/30/2023
Random Shortening of Linear Codes and Applications
Random linear codes (RLCs) are well known to have nice combinatorial pro...
share
research
∙
07/01/2023
Effective Resistances in Non-Expander Graphs
Effective resistances are ubiquitous in graph algorithms and network ana...
research
∙
11/15/2021
Improved Decoding of Expander Codes
We study the classical expander codes, introduced by Sipser and Spielman...
research
∙
02/03/2021
Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergence
Consider a regression problem where the learner is given a large collect...
research
∙
11/10/2020
Role of Digital Twin in Optical Communication: Fault Management, Hardware Configuration, and Transmission Simulation
Optical communication is developing rapidly in the directions of hardwar...
research
∙
05/31/2020
Estimating Principal Components under Adversarial Perturbations
Robustness is a key requirement for widespread deployment of machine lea...
research
∙
11/29/2019
Adversarially Robust Low Dimensional Representations
Adversarial or test time robustness measures the susceptibility of a mac...
research
∙
11/03/2019
Testing noisy linear functions for sparsity
We consider the following basic inference problem: there is an unknown h...
research
∙
07/09/2019
Reconstruction under outliers for Fourier-sparse functions
We consider the problem of learning an unknown f with a sparse Fourier s...
research
∙
04/30/2019
Estimating the Frequency of a Clustered Signal
We consider the problem of locating a signal whose frequencies are "off ...
research
∙
11/27/2017
