English
Related papers

Related papers: An improvement of the asymptotic Elias bound for n…

200 papers

Asymptotic expansion is constructed and justified for the solution to a nonuniform Neumann boundary-value problem for the Poisson equation with the right-hand side that depends both on longitudinal and transversal variables in a thin…

Analysis of PDEs · Mathematics 2013-04-30 Arsen V. Klevtsovskiy , Taras A. Mel'nyk

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 consider the problem of guessing the realization of a random variable but under more general Tsallis' non-extensive entropic framework rather than the classical Maxwell-Boltzman-Gibbs-Shannon framework. We consider both the conditional…

Information Theory · Computer Science 2019-05-21 Abhik Ghosh

Entropic uncertainty relations place nontrivial lower bounds to the sum of Shannon information entropies for noncommuting observables. Here we obtain a novel lower bound on the entropy sum for general pairs of observables in…

Quantum Physics · Physics 2009-11-13 Julio I. de Vicente , Jorge Sánchez-Ruiz

We consider the problem of binary classification with abstention in the relatively less studied \emph{bounded-rate} setting. We begin by obtaining a characterization of the Bayes optimal classifier for an arbitrary input-label distribution…

Machine Learning · Computer Science 2019-05-24 Shubhanshu Shekhar , Mohammad Ghavamzadeh , Tara Javidi

The data for many classification problems, such as pattern and speech recognition, follow mixture distributions. To quantify the optimum performance for classification tasks, the Shannon mutual information is a natural information-theoretic…

Signal Processing · Electrical Eng. & Systems 2022-06-22 Yijun Ding , Amit Ashok

Nonparametric regression problems with qualitative constraints such as monotonicity or convexity are ubiquitous in applications. For example, in predicting the yield of a factory in terms of the number of labor hours, the monotonicity of…

Statistics Theory · Mathematics 2023-11-21 Soham Mallick , Siddhaarth Sarkar , Arun Kumar Kuchibhotla

We analyze the problem of discrete distribution estimation under $\ell_1$ loss. We provide non-asymptotic upper and lower bounds on the maximum risk of the empirical distribution (the maximum likelihood estimator), and the minimax risk in…

Information Theory · Computer Science 2015-12-31 Yanjun Han , Jiantao Jiao , Tsachy Weissman

We consider statistics for stochastic evolution equations in Hilbert space with emphasis on stochastic partial differential equations (SPDEs). We observe a solution process under additional measurement errors and want to estimate a real or…

Statistics Theory · Mathematics 2025-05-21 Gregor Pasemann , Markus Reiß

In this paper, we derive an asymptotic closed--form expression for the error bound on extrapolation of doubly selective mobile MIMO wireless channels. The bound shows the relationship between the prediction error and system design…

Information Theory · Computer Science 2014-07-25 Ramoni Adeogun , Paul Teal , Pawel Dmochowski

We present new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to two related exponential codeword length objectives. The objectives explored here are exponential-average…

Information Theory · Computer Science 2011-05-03 Michael B. Baer

A general method is presented for deriving the limiting behavior of estimators that are defined as the values of parameters optimizing an empirical criterion function. The asymptotic behavior of such estimators is typically deduced from…

Statistics Theory · Mathematics 2008-12-18 Peter Radchenko

We revisit the standard ``telescoping sum'' argument ubiquitous in the final steps of analyzing evaluation complexity of algorithms for smooth nonconvex optimization, and obtain a refined formulation of the resulting bound as a function of…

Optimization and Control · Mathematics 2024-08-20 Serge Gratton , Chee-Khian Sim , Philippe L. Toint

We systematically compute improved asymptotic rank bounds for tensors. Using numerical implicitization, we implement the geometric framework of Kaski and Micha{\l}ek across all computationally feasible cases. By detecting the absence of…

Algebraic Geometry · Mathematics 2026-01-14 Kisun Lee

This paper derives the rate of convergence and asymptotic distribution for a class of Kolmogorov-Smirnov style test statistics for conditional moment inequality models for parameters on the boundary of the identified set under general…

Applications · Statistics 2011-12-06 Timothy B. Armstrong

This paper focuses on parameter estimation and introduces a new method for lower bounding the Bayesian risk. The method allows for the use of virtually \emph{any} information measure, including R\'enyi's $\alpha$, $\varphi$-Divergences, and…

Information Theory · Computer Science 2023-03-27 Amedeo Roberto Esposito , Adrien Vandenbroucque , Michael Gastpar

We leverage proof techniques Fourier analysis and an existing result in coding theory to derive new bounds for the problem of non-interactive simulation of binary random variables. Previous bounds in the literature were derived by applying…

Information Theory · Computer Science 2021-01-26 Lei Yu , Vincent Y. F. Tan

In this paper, we study initial-boundary value problems for the Cahn--Hilliard system with convection and nonconvex potential, where dynamic boundary conditions are assumed for both the associated order parameter and the corresponding…

Optimization and Control · Mathematics 2018-03-15 Gianni Gilardi , Jürgen Sprekels

We study asymptotically constrained systems for numerical integration of the Einstein equations, which are intended to be robust against perturbative errors for the free evolution of the initial data. First, we examine the previously…

General Relativity and Quantum Cosmology · Physics 2009-10-31 Gen Yoneda , Hisa-aki Shinkai

We study the problem of transmission of information over classical and classical-quantum channels in the one-shot regime where the underlying codes are constrained to be group codes. In the achievability part, we introduce a new input…

Information Theory · Computer Science 2024-06-21 James Chin-Jen Pang , Sandeep Pradhan , Hessam Mahdavifar
‹ Prev 1 3 4 5 6 7 10 Next ›