English
Related papers

Related papers: An Orthogonality Principle for Select-Maximum Esti…

200 papers

Scientific modeling applications often require estimating a distribution of parameters consistent with a dataset of observations - an inference task also known as source distribution estimation. This problem can be ill-posed, however, since…

Machine Learning · Computer Science 2024-12-02 Julius Vetter , Guy Moss , Cornelius Schröder , Richard Gao , Jakob H. Macke

We study distributed binary hypothesis testing with a single sensor and two remote decision centers that are also equipped with local sensors. The communication between the sensor and the two decision centers takes place over three links: a…

Information Theory · Computer Science 2022-02-07 Mustapha Hamad , Mireille Sarkiss , Michèle Wigger

We consider a sensor scheduling and remote estimation problem with one sensor and one estimator. At each time step, the sensor makes an observation on the state of a source, and then decides whether to transmit its observation to the…

Systems and Control · Computer Science 2015-10-02 Xiaobin Gao , Emrah Akyol , Tamer Basar

We study the zero-error source coding problem in which an encoder with Side Information (SI) $g(Y)$ transmits source symbols $X$ to a decoder. The decoder has SI $Y$ and wants to recover $f(X,Y)$ where $f,g$ are deterministic. We exhibit a…

Information Theory · Computer Science 2022-12-19 Nicolas Charpenay , Maël le Treust , Aline Roumy

We obtain robust and computationally efficient estimators for learning several linear models that achieve statistically optimal convergence rate under minimal distributional assumptions. Concretely, we assume our data is drawn from a…

Machine Learning · Statistics 2020-12-07 Ainesh Bakshi , Adarsh Prasad

This paper considers a sequential estimation and sensor scheduling problem with one sensor and one estimator. The sensor makes sequential observations about the state of an underlying memoryless stochastic process, and makes a decision as…

Systems and Control · Computer Science 2016-11-17 Xiaobin Gao , Emrah Akyol , Tamer Basar

The Quantum Reverse Shannon Theorem has been a milestone in quantum information theory. It states that asymptotically reliable simulation of a quantum channel, assisted by unlimited shared entanglement, requires a rate of classical…

Quantum Physics · Physics 2025-02-18 Ke Li , Yongsheng Yao

The error exponent of fixed-length lossy source coding was established by Marton. Ahlswede showed that this exponent can be discontinuous at a rate $R$, depending on the probability distribution $P$ of the given information source and the…

Information Theory · Computer Science 2023-04-25 Yutaka Jitsumatsu

For the information transmission over a binary symmetric channel the random coding is used. The transmission of exponential number of messages is considered. The exact decoding error probability exponent is derived. The proof is based on…

Information Theory · Computer Science 2026-05-20 Marat V. Burnashev

This paper studies expurgated exponents for joint source-channel coding of discrete memoryless sources and channels under i.i.d. random coding. We show that a two-class partitioning of source sequences, where the codeword distribution…

Information Theory · Computer Science 2026-01-22 Seyed AmirPouya Moeini , Albert Guillén i Fàbregas

We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over…

Quantum Physics · Physics 2024-10-15 Aadil Oufkir , Yongsheng Yao , Mario Berta

In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side information. First, it is assumed that the input is subject…

Information Theory · Computer Science 2016-11-18 Mustafa Cenk Gursoy

Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that…

Information Theory · Computer Science 2008-10-14 Raul Etkin , Neri Merhav , Erik Ordentlich

For the information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that…

Information Theory · Computer Science 2008-08-18 Marat V. Burnashev , Hirosuke Yamamoto

A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel coding error exponent for multiple access channels in the…

Information Theory · Computer Science 2013-09-19 Lóránt Farkas , Tamás Kói

In this letter, we employ and design the expectation--conditional maximization either (ECME) algorithm, a generalisation of the EM algorithm, for solving the maximum likelihood direction finding problem of stochastic sources, which may be…

Signal Processing · Electrical Eng. & Systems 2025-08-05 Ming-yan Gong , Bin Lyu

Suppose that a random variable $X$ of interest is observed perturbed by independent additive noise $Y$. This paper concerns the "the least favorable perturbation" $\hat Y_\ep$, which maximizes the prediction error $E(X-E(X|X+Y))^2$ in the…

Probability · Mathematics 2021-03-18 Philip A. Ernst , Abram M. Kagan , L. C. G. Rogers

Unitary errors, such as those arising from fault-tolerant compilation of quantum algorithms, systematically bias observable estimates. Correcting this bias typically requires additional resources, such as an increased number of non-Clifford…

Quantum Physics · Physics 2026-01-13 Dmitrii Khitrin , Kenneth R. Brown , Abhinav Anand

The distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is…

Information Theory · Computer Science 2019-04-24 Nir Weinberger , Yuval Kochman

We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an \emph{expected}…

Information Theory · Computer Science 2009-09-24 Young-Han Kim , Amos Lapidoth , Tsachy Weissman