research
∙
09/04/2023
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes
In this work, we consider the list-decodability and list-recoverability ...
share
research
∙
08/28/2023
Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing
We consider the problem of parameter estimation from observations given ...
research
∙
04/29/2023
Can ChatGPT Pass An Introductory Level Functional Language Programming Course?
The recent introduction of ChatGPT has drawn significant attention from ...
research
∙
04/24/2023
Can Decentralized Stochastic Minimax Optimization Algorithms Converge Linearly for Finite-Sum Nonconvex-Nonconcave Problems?
Decentralized minimax optimization has been actively studied in the past...
research
∙
04/20/2023
Federated Compositional Deep AUC Maximization
Federated learning has attracted increasing attention due to the promise...
research
∙
11/21/2022
Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models
In a mixed generalized linear model, the objective is to learn multiple ...
research
∙
11/08/2022
Multiple Packing: Lower Bounds via Error Exponents
We derive lower bounds on the maximal rates for multiple packings in hig...
research
∙
11/08/2022
Multiple Packing: Lower Bounds via Infinite Constellations
We study the problem of high-dimensional multiple packing in Euclidean s...
research
∙
11/08/2022
Multiple Packing: Lower and Upper Bounds
We study the problem of high-dimensional multiple packing in Euclidean s...
research
∙
10/14/2022
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery
In this work we consider the list-decodability and list-recoverability o...
research
∙
06/06/2022
Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models
We consider a high-dimensional mean estimation problem over a binary hid...
research
∙
05/13/2022
The Capacity of Causal Adversarial Channels
We characterize the capacity for the discrete-time arbitrarily varying c...
research
∙
07/12/2021
Bounds for Multiple Packing and List-Decoding Error Exponents
We revisit the problem of high-dimensional multiple packing in Euclidean...
research
∙
05/04/2021
Codes for the Z-channel
This paper is a collection of results on combinatorial properties of cod...
research
∙
02/19/2021
Network Coding with Myopic Adversaries
We consider the problem of reliable communication over a network contain...
research
∙
01/29/2021
Zero-Error Communication over Adversarial MACs
We consider zero-error communication over a two-transmitter deterministi...
research
∙
11/17/2020
MG-GCN: Fast and Effective Learning with Mix-grained Aggregators for Training Large Graph Convolutional Networks
Graph convolutional networks (GCNs) have been employed as a kind of sign...
research
∙
09/08/2020
Tight List-Sizes for Oblivious AVCs under Constraints
We study list-decoding over adversarial channels governed by oblivious a...
research
∙
01/09/2020
List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian
This paper provides upper and lower bounds on list sizes of list decodin...
research
∙
01/08/2020
Quadratically Constrained Two-way Adversarial Channels
We study achievable rates of reliable communication in a power-constrain...
research
∙
09/10/2019
Generalized List Decoding
This paper concerns itself with the question of list decoding for genera...
research
∙
02/20/2019
Improved efficiency for explicit covering codes matching the sphere-covering bound
A covering code is a subset of vectors over a finite field with the prop...
research
∙
01/12/2019
List Decoding Random Euclidean Codes and Infinite Constellations
We study the list decodability of different ensembles of codes over the ...
research
∙
01/18/2018
