George Zhang

George Zhang

Auto-generated profile, based on publicly available information

George Zhang

Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 July 2025 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GZGeorge Zhang
George Zhang
JQJingjing Qian
Jingjing Qian
Jun ChenJun Chen
Jun Chen
AKAshish Khisti
Ashish Khisti
In the context of lossy compression, Blau & Michaeli [1] adopt a mathematical notion of perceptual quality and define the information rate-distortion-perception function, generalizing the classical rate-distortion tradeoff. We consider the notion of universal representations in which one may fix a rate and an encoder then vary the decoder to achieve any point within a collection of distortion and perception constraints. We prove that the corresponding information-theoretic universal rate-distortion-perception function is operationally achievable in an approximate sense. Under MSE distortion, we show that the entire distortion-perception tradeoff of a Gaussian source can be achieved by a single encoder of the same rate asymptotically. We then characterize the achievable distortion-perception region for a fixed representation in the case of arbitrary distributions, and identify conditions under which the aforementioned results continue to hold approximately. Finally, we extend our notion of universality to the case where the rate is no longer fixed and additional bits can be sent at a second stage, generalizing the classical theory of successive refinement [2] with perception constraints. This motivates the study of practical constructions that are approximately universal across the RDP tradeoff, thereby alleviating the need to design a new encoder for each objective. We provide experimental results on MNIST and SVHN suggesting that on image compression tasks, the operational tradeoffs achieved by machine learning models with a fixed encoder suffer only a small penalty when compared to their variable encoder counterparts.

20 December 2022 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
HLHuan Liu
Huan Liu
GZGeorge Zhang
George Zhang
Jun ChenJun Chen
Jun Chen
AKAshish Khisti
Ashish Khisti
We study an extension of lossy compression where the reconstruction is subject to a distribution constraint which can be different from the source distribution. We formulate our setting as a generalization of optimal transport with an entropy bottleneck to account for the rate constraint due to compression. We provide expressions for the tradeoff between compression rate and the achievable distortion with and without shared common randomness between the encoder and decoder. We study the examples of binary, uniform and Gaussian sources (in an asymptotic setting) in detail and demonstrate that shared randomness can strictly improve the tradeoff. For the case without common randomness and squared-Euclidean distortion, we show that the optimal solution partially decouples into the problem of optimal compression and transport and also characterize the penalty associated with fully decoupling them. We provide experimental results by training deep learning end-to-end compression systems for performing denoising on SVHN (The Street View House Numbers) and super-resolution on MNIST (Modified National Institute of Standards and Technology) datasets suggesting consistency with our theoretical results. Our code is available at https://github.com/liuh127/CrossdomainLC.