English
Related papers

Related papers: Universal Gaussian Quantization with Side Informat…

200 papers

We study the problem of Gaussian bandits with general side information, as first introduced by Wu, Szepesvari, and Gyorgy. In this setting, the play of an arm reveals information about other arms, according to an arbitrary a priori known…

Machine Learning · Computer Science 2025-05-19 Alexia Atsidakou , Orestis Papadigenopoulos , Constantine Caramanis , Sujay Sanghavi , Sanjay Shakkottai

A popular approach to learning encoders for lossy compression is to use additive uniform noise during training as a differentiable approximation to test-time quantization. We demonstrate that a uniform noise channel can also be implemented…

Machine Learning · Statistics 2020-10-22 Eirikur Agustsson , Lucas Theis

A secrecy system with side information at the decoders is studied in the context of lossy source compression over a noiseless broadcast channel. The decoders have access to different side information sequences that are correlated with the…

Information Theory · Computer Science 2014-10-07 Eva C. Song , Paul Cuff , H. Vincent Poor

Computing polarised intensities from noisy data in Stokes U and Q suffers from a positive bias that should be suppressed. To develop a correction method that, when applied to maps, should provide a distribution of polarised intensity that…

Instrumentation and Methods for Astrophysics · Physics 2017-04-05 Peter Müller , Rainer Beck , Marita Krause

Asymptotic energy-distortion performance of zero-delay communication scenarios under additive white Gaussian noise is investigated. Using high-resolution analysis for quantizer design, the higher-order term in the logarithm of the…

Information Theory · Computer Science 2018-01-01 Ceren Sevinç , Ertem Tuncel

We consider the problem of transmitting a source over an infinite-bandwidth additive white Gaussian noise channel with unknown noise level under an input energy constraint. We construct a universal scheme that uses modulo-lattice modulation…

Information Theory · Computer Science 2024-10-28 Omri Lev , Anatoly Khina

Quantifying uncertainty in high-dimensional sparse linear regression is a fundamental task in statistics that arises in various applications. One of the most successful methods for quantifying uncertainty is the debiased LASSO, which has a…

Statistics Theory · Mathematics 2024-02-27 Pedro Abdalla , Gil Kur

We examine the coordinated and universal rate-efficient sampling of a subset of correlated discrete memoryless sources followed by lossy compression of the sampled sources. The goal is to reconstruct a predesignated subset of sources within…

Information Theory · Computer Science 2017-06-23 Vinay Praneeth Boda , Prakash Narayan

The development of new techniques to improve measurements is crucial for all sciences. By employing quantum systems as sensors to probe some physical property of interest allows the application of quantum resources, such as coherent…

Quantum Physics · Physics 2019-05-15 G. H. Aguilar , M. A. de Souza , R. M. Gomes , J. Thompson , M. Gu , L. C. Céleri , S. P. Walborn

In this paper, we propose the explicit construction of a new class of lattices based on polar codes, which are provably good for the additive white Gaussian noise (AWGN) channel. We follow the multilevel construction of Forney \textit{et…

Information Theory · Computer Science 2013-07-05 Yanfei Yan , Cong Ling , Xiaofu Wu

In this work, we prove that polar lattices, when tailored for lossy compression, are quantization-good in the sense that their normalized second moments approach $\frac{1}{2\pi e}$ as the dimension of lattices increases. It has been…

Information Theory · Computer Science 2025-01-22 Ling Liu , Shanxiang Lyu , Cong Ling , Baoming Bai

A theoretical and experimental analysis related to the identification of vertices of unknown shapes is presented. Shapes are seen as real functions of their closed boundary. Unlike traditional approaches, which see curvature as the rate of…

Computer Vision and Pattern Recognition · Computer Science 2017-09-21 Konstantinos A. Raftopoulos , Stefanos D. Kollias , Marin Ferecatu

In this paper, a methodology is investigated for signal recovery in the presence of non-Gaussian noise. In contrast with regularized minimization approaches often adopted in the literature, in our algorithm the regularization parameter is…

Optimization and Control · Mathematics 2017-01-23 Yosra Marnissi , Yuling Zheng , Emilie Chouzenoux , Jean-Christophe Pesquet

We propose a novel scheme for rate-compatible arbitrary-length polar code construction for the additive white Gaussian noise (AWGN) channel. The proposed scheme is based on the concept of non-uniform channel polarization. The original polar…

Information Theory · Computer Science 2021-03-23 R. M. Oliveira , R. C. de Lamare

We introduce a universal quantization scheme based on random coding, and we analyze its performance. This scheme consists of a source-independent random codebook (typically_mismatched_ to the source distribution), followed by optimal…

Information Theory · Computer Science 2007-07-13 Ioannis Kontoyiannis , Rami Zamir

In this paper, we propose a Polar coding scheme for parallel Gaussian channels. The encoder knows the sum rate of the parallel channels but does not know the rate of any channel. By using the nesting property of Polar code, we design a…

Information Theory · Computer Science 2017-05-23 David Tse , Bin Li , Kai Chen

We consider a class of linear ill-posed inverse problems arising from inversion of a compact operator with singular values which decay exponentially to zero. We adopt a Bayesian approach, assuming a Gaussian prior on the unknown function.…

Statistics Theory · Mathematics 2013-12-09 Sergios Agapiou , Andrew M. Stuart , Yuan-Xiang Zhang

Scalar lattice quantization with a modulo operator, dithering, and probabilistic shaping is applied to the Wyner-Ziv (WZ) problem with a Gaussian source and mean square error distortion. The method achieves the WZ rate-distortion pairs. The…

Information Theory · Computer Science 2025-06-17 Muhammed Yusuf Sener , Gerhard Kramer , Shlomo Shamai , Wen Xu

Recent work in machine learning community proposed multiple methods for performing lossy compression (quantization) of large matrices. This quantization is important for accelerating matrix multiplication (main component of large language…

Information Theory · Computer Science 2025-10-16 Or Ordentlich , Yury Polyanskiy

We propose a nonuniform quantized decoder for polar codes. The design metric of the quantizers is to minimize the distortion incurred by quantization. The quantizers are obtained via dynamic programming and the optimality of the quantizer…

Information Theory · Computer Science 2020-11-17 Zhiwei Cao , Hongfei Zhu , Yuping Zhao , Dou Li