6 citations · 26 across the 18 of their papers we have counts for
22 papers
Capacity of Uniform Noise Channels Under Average Input Power Constraints
Yihan Zhang
The foundational work of Shannon (1948) identified the capacity of an additive noise channel under an average input power constraint as a mutual information maximization problem ov…
Sharp One-Dimensional Sub-Gaussian Comparison in Convex Order
Yihan Zhang
We prove that any random variable whose moment generating function is point-wise upper bounded by that of must be dominated by …
Can Decentralized Stochastic Minimax Optimization Algorithms Converge Linearly for Finite-Sum Nonconvex-Nonconcave Problems?
Yihan Zhang, Wenhao Jiang, Feng Zheng +3
Decentralized minimax optimization has been actively studied in the past few years due to its application in a wide range of machine learning models. However, the current theoretic…
Multiple Packing: Lower Bounds via Error Exponents
Yihan Zhang, Shashank Vatedka
We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. Multiple packing is a natural generalization of the sphere packing problem.…
Multiple Packing: Lower Bounds via Infinite Constellations
Yihan Zhang, Shashank Vatedka
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let …
Multiple Packing: Lower and Upper Bounds
Yihan Zhang, Shashank Vatedka
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let …
Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models
Yihan Zhang, Marco Mondelli, Ramji Venkataramanan
In a mixed generalized linear model, the goal is to learn multiple signals from unlabeled observations: each sample comes from exactly one signal, but it is not known which one. We…
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery
Nicolas Resch, Chen Yuan, Yihan Zhang
In this work we consider the list-decodability and list-recoverability of arbitrary -ary codes, for all integer values of . A code is called -list-decodable if…
Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models
Yihan Zhang, Nir Weinberger
We consider a high-dimensional mean estimation problem over a binary hidden Markov model, which illuminates the interplay between memory in data, sample size, dimension, and signal…
The Capacity of Causal Adversarial Channels
Yihan Zhang, Sidharth Jaggi, Michael Langberg +1
We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common random…
Bounds for Multiple Packing and List-Decoding Error Exponents
Yihan Zhang, Shashank Vatedka
We revisit the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0…
Codes for the Z-channel
Nikita Polyanskii, Yihan Zhang
This paper is a collection of results on combinatorial properties of codes for the Z-channel. A Z-channel with error fraction takes as input a length- binary codeword and in…
Network Coding with Myopic Adversaries
Sijie Li, Rawad Bitar, Sidharth Jaggi +1
We consider the problem of reliable communication over a network containing a hidden {\it myopic} adversary who can eavesdrop on some links, jam some links, and d…
Zero-Error Communication over Adversarial MACs
Yihan Zhang
We consider zero-error communication over a two-transmitter deterministic adversarial multiple access channel (MAC) governed by an adversary who has access to the transmissions of…
MG-GCN: Fast and Effective Learning with Mix-grained Aggregators for Training Large Graph Convolutional Networks
Tao Huang, Yihan Zhang, Jiajing Wu +2
Graph convolutional networks (GCNs) have been employed as a kind of significant tool on many graph-based applications recently. Inspired by convolutional neural networks (CNNs), GC…
Tight List-Sizes for Oblivious AVCs under Constraints
Yihan Zhang, Sidharth Jaggi, Amitalok J. Budkuley
We study list-decoding over adversarial channels governed by oblivious adversaries (a.k.a. oblivious Arbitrarily Varying Channels (AVCs)). This type of adversaries aims to maliciou…
List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian
Yihan Zhang
This paper provides upper and lower bounds on list sizes of list decoding for two-user oblivious arbitrarily varying multiple access channels (AVMACs). An oblivious AVMAC consists…
Quadratically Constrained Two-way Adversarial Channels
Yihan Zhang, Shashank Vatedka, Sidharth Jaggi
We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-…
Generalized List Decoding
Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi
This paper concerns itself with the question of list decoding for general adversarial channels, e.g., bit-flip () channels, erasure channels, (-) ch…
Improved efficiency for covering codes matching the sphere-covering bound
Aditya Potukuchi, Yihan Zhang
A covering code is a subset with the property that any is close to some in Hamming distance. For every $ε,δ>…
List Decoding Random Euclidean Codes and Infinite Constellations
Yihan Zhang, Shashank Vatedka
We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the sourc…
Quadratically Constrained Myopic Adversarial Channels
Yihan Zhang, Shashank Vatedka, Sidharth Jaggi +1
We study communication in the presence of a jamming adversary where quadratic power constraints are imposed on the transmitter and the jammer. The jamming signal is allowed to be a…