English
Related papers

Related papers: Variable-Length Resolvability for General Sources …

200 papers

In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding…

Information Theory · Computer Science 2011-02-15 Amir Ingber , Yuval Kochman

In this paper we study the nonasymptotic bounds of a special Joint Source-Channel Coding system with hierarchical source, where an observable source and an unobservable indirect source are required to be reconstructed. Namely, we focus on…

Information Theory · Computer Science 2026-03-17 Shuo Shao , Chao Qi , Jincheng Dai

This paper provides an extensive study of the behavior of the best achievable rate (and other related fundamental limits) in variable-length lossless compression. In the non-asymptotic regime, the fundamental limits of fixed-to-variable…

Information Theory · Computer Science 2012-12-13 Ioannis Kontoyiannis , Sergio Verdu

We study the problem of secure joint source-channel coding for multimodal semantic sources transmitted over noisy wiretap channels. The source model consists of $m$ modalities (e.g., image, audio, and sensor data), all represented as random…

Information Theory · Computer Science 2026-05-26 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

We present novel solutions to the problem of direct localization of multiple narrow-band and arbitrarily correlated sources by partly calibrated arrays, i.e., arrays composed of fully calibrated sub-arrays yet lacking inter-array…

Signal Processing · Electrical Eng. & Systems 2018-07-27 Amir Adler , Mati Wax

In this article we discuss estimation of the common variance of several normal populations with tree order restricted means. We discuss the asymptotic properties of the maximum likelihood estimator of the variance as the number of…

Statistics Theory · Mathematics 2014-07-24 Antar Bandyopadhyay , Sanjay Chaudhuri

Sample average approximation (SAA) is a widely popular approach to data-driven decision-making under uncertainty. Under mild assumptions, SAA is both tractable and enjoys strong asymptotic performance guarantees. Similar guarantees,…

Optimization and Control · Mathematics 2016-11-03 Dimitris Bertsimas , Vishal Gupta , Nathan Kallus

We provide an asymptotic analysis of linear transport problems in the diffusion limit under minimal regularity assumptions on the domain, the coefficients, and the data. The weak form of the limit equation is derived and the convergence of…

Analysis of PDEs · Mathematics 2014-07-31 Herbert Egger , Matthias Schlottbom

The coefficient of variation (CV) is commonly used to measure relative dispersion. However, since it is based on the sample mean and standard deviation, outliers can adversely affect the CV. Additionally, for skewed distributions the mean…

Statistics Theory · Mathematics 2020-09-28 Chandima N. P. G. Arachchige , Luke A. Prendergast , Robert G. Staudte

In this paper, we study a sampling problem where a source takes samples from a Wiener process and transmits them through a wireless channel to a remote estimator. Due to channel fading, interference, and potential collisions, the packet…

Information Theory · Computer Science 2023-10-19 Jiayu Pan , Yin Sun , Ness B. Shroff

The choice of approximate posterior distribution is one of the core problems in variational inference. Most applications of variational inference employ simple families of posterior approximations in order to allow for efficient inference,…

Machine Learning · Statistics 2016-06-15 Danilo Jimenez Rezende , Shakir Mohamed

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 finding completes the characterization of the third-order…

Information Theory · Computer Science 2013-09-23 Yucel Altug , Aaron B. Wagner

Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…

Information Theory · Computer Science 2024-03-01 Deheng Yuan , Tao Guo , Zhongyi Huang , Shi Jin

We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another…

Information Theory · Computer Science 2017-04-26 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

In this paper, the problem of target localization in the presence of outlying sensors is tackled. This problem is important in practice because in many real-world applications the sensors might report irrelevant data unintentionally or…

Optimization and Control · Mathematics 2018-02-15 Alireza Zaeemzadeh , Mohsen Joneidi , Behzad Shahrasbi , Nazanin Rahnavard

Uniform convergence rates are provided for asymptotic representations of sample extremes. These bounds which are universal in the sense that they do not depend on the extreme value index are meant to be extended to arbitrary samples…

We introduce a fundamental lemma called the Poisson matching lemma, and apply it to prove one-shot achievability results for various settings, namely channels with state information at the encoder, lossy source coding with side information…

Information Theory · Computer Science 2021-09-21 Cheuk Ting Li , Venkat Anantharam

We investigate the maximum coding rate achievable over a two-user broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. Specifically, upon decoding the common message, each…

Information Theory · Computer Science 2015-04-23 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

In single-molecule microscopy it is necessary to locate with high precision point sources from noisy observations of the spectrum of the signal at frequencies capped by $f_c$, which is just about the frequency of natural light. This paper…

Information Theory · Computer Science 2015-04-06 Veniamin I. Morgenshtern , Emmanuel J. Candes

We consider the problem of recovering a signal consisting of a superposition of point sources from low-resolution data with a cut-off frequency f. If the distance between the sources is under 1/f, this problem is not well posed in the sense…

Optimization and Control · Mathematics 2016-09-09 Carlos Fernandez-Granda
‹ Prev 1 8 9 10 Next ›