155 citations · 198 across the 21 of their papers we have counts for
23 papers
Probabilistic Gradient Coding via Structure-Preserving Sparsification
Yuxin Jiang, Wenqin Zhang, Lele Wang
Gradient coding is a distributed computing technique aiming to provide robustness against slow or non-responsive computing nodes, known as stragglers, while balancing the computati…
Low-Complexity Coding Techniques for Cloud Radio Access Networks
Nadim Ghaddar, Lele Wang
The problem of coding for the uplink and downlink of cloud radio access networks (C-RAN's) with users and relays is considered. It is shown that low-complexity coding schem…
An Information-Theoretic Framework for Out-of-Distribution Generalization with Applications to Stochastic Gradient Langevin Dynamics
Wenliang Liu, Guanding Yu, Lele Wang +1
We study the Out-of-Distribution (OOD) generalization in machine learning and propose a general framework that establishes information-theoretic generalization bounds. Our framewor…
Noisy Computing of the Threshold Function
Ziao Wang, Nadim Ghaddar, Banghua Zhu +1
Let denote the -out-of- threshold function: given input Boolean variables, the output is if and only if at least of the inputs are . We conside…
Noisy Computing of the and Functions
Banghua Zhu, Ziao Wang, Nadim Ghaddar +2
We consider the problem of computing a function of variables using noisy queries, where each query is incorrect with some fixed and known probability . Specifica…
Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
Ziao Wang, Weina Wang, Lele Wang
Graph alignment refers to the task of finding the vertex correspondence between two correlated graphs of vertices. Extensive study has been done on polynomial-time algorithms f…
On the Optimal Bounds for Noisy Computing
Banghua Zhu, Ziao Wang, Nadim Ghaddar +2
We revisit the problem of computing with noisy information considered in Feige et al. 1994, which includes computing the OR function from noisy queries, and computing the MAX, SEAR…
Constructions for Nonadaptive Tropical Group Testing
Nicholas Kwan, Lele Wang
PCR testing is an invaluable diagnostic tool that has most recently seen widespread use during the COVID-19 pandemic. A recent work by Wang, Gabrys and Vardy proposed tropical code…
A Lego-Brick Approach to Coding for Network Communication
Nadim Ghaddar, Shouvik Ganguly, Lele Wang +1
Coding schemes for several problems in network information theory are constructed starting from point-to-point channel codes that are designed for symmetric channels. Given that th…
Noisy Sorting Capacity
Ziao Wang, Nadim Ghaddar, Banghua Zhu +1
Sorting is the task of ordering elements using pairwise comparisons. It is well known that comparisons are both necessary and sufficient when the outcomes of the…
On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
Ziao Wang, Ning Zhang, Weina Wang +1
Graph alignment aims at finding the vertex correspondence between two correlated graphs, a task that frequently occurs in graph mining applications such as social network analysis.…
Soft BIBD and Product Gradient Codes
Animesh Sakorikar, Lele Wang
Gradient coding is a coding theoretic framework to provide robustness against slow or unresponsive machines, known as stragglers, in distributed machine learning applications. Rece…
Attributed Graph Alignment
Ning Zhang, Ziao Wang, Weina Wang +1
Motivated by various data science applications including de-anonymizing user identities in social networks, we consider the graph alignment problem, where the goal is to identify t…
Universal Graph Compression: Stochastic Block Models
Alankrita Bhatt, Ziao Wang, Chi Wang +1
Motivated by the prevalent data science applications of processing large-scale graph data such as social networks and biological networks, this paper investigates lossless compress…
Distributed Source Simulation With No Communication
Tomer Berg, Ofer Shayevitz, Young-Han Kim +1
We consider the problem of distributed source simulation with no communication, in which Alice and Bob observe sequences and respectively, drawn from a joint distributi…
Sliding-Window Superposition Coding:Two-User Interference Channels
Lele Wang, Young-Han Kim, Chiao-Yi Chen +2
A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access…
Graph Information Ratio
Lele Wang, Ofer Shayevitz
We introduce the notion of information ratio between two (simple, undirected) graphs and , defined as the supremum of ratios such that there exists a…
Quickest Sequence Phase Detection
Lele Wang, Sihuang Hu, Ofer Shayevitz
A phase detection sequence is a length- cyclic sequence, such that the location of any length- contiguous subsequence can be determined from a noisy observation of that subse…
Polar coding for interference networks
Lele Wang, Eren Sasoglu
A polar coding scheme for interference networks is introduced. The scheme combines Arikan's monotone chain rules for multiple-access channels and a method by Hassani and Urbanke to…
Universal Polarization
Eren Sasoglu, Lele Wang
A method to polarize channels universally is introduced. The method is based on combining two distinct channels in each polarization step, as opposed to Arikan's original method of…
A Comparison of Superposition Coding Schemes
Lele Wang, Eren Sasoglu, Bernd Bandemer +1
There are two variants of superposition coding schemes. Cover's original superposition coding scheme has code clouds of the identical shape, while Bergmans's superposition coding s…
On the Capacity Region for Index Coding
Fatemeh Arbabjolfaei, Bernd Bandemer, Young-Han Kim +2
A new inner bound on the capacity region of a general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bou…
On the Capacity of the Noncausal Relay Channel
Lele Wang, Mohammad Naghshvar
This paper studies the noncausal relay channel, also known as the relay channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and Mammen. Unlike the standard relay…