35 citations · 175 across the 34 of their papers we have counts for
42 papers · 1 filter
Exact Sampling Under Campbell Cost via Rényi Channel Simulation Divergence
Yijun Fan, Aaron B. Wagner
We study the communication cost of exact sampling under Campbell's exponential coding criterion. Given a target distribution and a proposal distribution , the sender and rec…
Do Neural Networks Compress Manifolds Optimally?
Sourbh Bhadane, Aaron B. Wagner, Johannes Ballé
Artificial Neural-Network-based (ANN-based) lossy compressors have recently obtained striking results on several sources. Their success may be ascribed to an ability to identify th…
Functional Covering of Point Processes
Nirmal V. Shende, Aaron B. Wagner
We introduce a new distortion measure for point processes called functional-covering distortion. It is inspired by intensity theory and is related to both the covering of point pro…
On One-Bit Quantization
Sourbh Bhadane, Aaron B. Wagner
We consider the one-bit quantizer that minimizes the mean squared error for a source living in a real Hilbert space. The optimal quantizer is a projection followed by a thresholdin…
Efficiently Computable Converses for Finite-Blocklength Communication
Felipe Areces, Dan Song, Richard Wesel +1
This paper presents a method for computing a finite-blocklength converse for the rate of fixed-length codes with feedback used on discrete memoryless channels (DMCs). The new conve…
The Rate-Distortion-Perception Tradeoff: The Role of Common Randomness
Aaron B. Wagner
A rate-distortion-perception (RDP) tradeoff has recently been proposed by Blau and Michaeli and also Matsumoto. Focusing on the case of perfect realism, which coincides with the pr…
Minimax Rate-Distortion
Adeel Mahmood, Aaron B. Wagner
We show the existence of variable-rate rate-distortion codes that meet the disortion constraint almost surely and are minimax, i.e., strongly, universal with respect to an unknown…
Lossy Compression with Universal Distortion
Adeel Mahmood, Aaron B. Wagner
We consider a novel variant of -semifaithful lossy coding in which the distortion measure is revealed only to the encoder and only at run-time, as well as an extension of it in…
Principal Bit Analysis: Autoencoding with Schur-Concave Loss
Sourbh Bhadane, Aaron B. Wagner, Jayadev Acharya
We consider a linear autoencoder in which the latent variables are quantized, or corrupted by noise, and the constraint is Schur-concave in the set of latent variances. Although fi…
A coding theorem for the rate-distortion-perception function
Lucas Theis, Aaron B. Wagner
The rate-distortion-perception function (RDPF; Blau and Michaeli, 2019) has emerged as a useful tool for thinking about realism and distortion of reconstructions in lossy compressi…
A Practical Coding Scheme for the BSC with Feedback
Ke Wu, Aaron B. Wagner
We provide a practical implementation of the rubber method of Ahlswede et al. for binary alphabets. The idea is to create the "skeleton" sequence therein via an arithmetic decoder…
Neural Networks Optimally Compress the Sawbridge
Aaron B. Wagner, Johannes Ballé
Neural-network-based compressors have proven to be remarkably effective at compressing sources, such as images, that are nominally high-dimensional but presumed to be concentrated…
A Case for Maximal Leakage as a Side Channel Leakage Metric
Benjamin Wu, Aaron B. Wagner, G. Edward Suh
Side channels represent a broad class of security vulnerabilities that have been demonstrated to exist in many applications. Because completely eliminating side channels often lead…
A New Method for Employing Feedback to Improve Coding Performance
Aaron B. Wagner, Nirmal V. Shende, Yücel Altuğ
We introduce a novel mechanism, called timid/bold coding, by which feedback can be used to improve coding performance. For a certain class of DMCs, called compound-dispersion chann…
On exact asymptotics of the error probability in channel coding: symmetric channels
Yücel Altuğ, Aaron B. Wagner
The exact order of the optimal sub-exponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryles…
An Operational Approach to Information Leakage
Ibrahim Issa, Aaron B. Wagner, Sudeep Kamath
Given two random variables and , an operational approach is undertaken to quantify the ``leakage'' of information from to . The resulting measure $\mathcal{L}(X \!\!…
The Stochastic-Calculus Approach to Multi-Receiver Poisson Channels
Nirmal V. Shende, Aaron B. Wagner
We study two-receiver Poisson channels using tools derived from stochastic calculus. We obtain a general formula for the mutual information over the Poisson channel that allows for…
LP Bounds for Rate-Distortion with Variable Side Information
Sinem Unal, Aaron B. Wagner
We consider a rate-distortion problem with side information at multiple decoders. Several upper and lower bounds have been proposed for this general problem or special cases of it.…
Vector Gaussian Rate-Distortion with Variable Side Information
Sinem Unal, Aaron B. Wagner
We consider rate-distortion with two decoders, each with distinct side information. This problem is well understood when the side information at the decoders satisfies a certain de…
Variable Packet-Error Coding
Xiaoqing Fan, Oliver Kosut, Aaron B. wagner
We consider a problem in which a source is encoded into N packets, an unknown number of which are subject to adversarial errors en route to the decoder. We seek code designs for wh…
Measuring Secrecy by the Probability of a Successful Guess
Ibrahim Issa, Aaron B. Wagner
The secrecy of a communication system in which both the legitimate receiver and an eavesdropper are allowed some distortion is investigated. The secrecy metric considered is the ex…
A Rate-Distortion Approach to Index Coding
Sinem Unal, Aaron B. Wagner
We approach index coding as a special case of rate-distortion with multiple receivers, each with some side information about the source. Specifically, using techniques developed fo…
Refinement of the random coding bound
Yucel Altug, Aaron B. Wagner
An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not…
The third-order term in the normal approximation for singular channels
Yucel Altug, Aaron B. Wagner
For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This…