English
Related papers

Related papers: Rate-distortion Theory with Lower Semi-continuous …

200 papers

Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…

Dynamical Systems · Mathematics 2024-12-13 Tristán Radić

We consider correlated and distributed sources without cooperation at the encoder. For these sources, we derive the best achievable performance in the rate-distortion sense of any distributed compressed sensing scheme, under the constraint…

Information Theory · Computer Science 2014-04-10 Giulio Coluccia , Aline Roumy , Enrico Magli

The decision tree is a flexible machine learning model that finds its success in numerous applications. It is usually fitted in a recursively greedy manner using CART. In this paper, we investigate the convergence rate of CART under a…

Machine Learning · Statistics 2023-10-27 Rahul Mazumder , Haoyue Wang

The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…

Optimization and Control · Mathematics 2025-04-28 Hubert Villuendas , Mathieu Besançon , Jérôme Malick

The capability to temporarily arrest the propagation of optical signals is one of the main challenges hampering the ever more widespread use of light in rapid long-distance transmission as well as all-optical on-chip signal processing or…

Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function $R(D)$, then we can transmit this source to within a distortion $D$. We answer the converse question ``If we can transmit a source to…

Information Theory · Computer Science 2007-07-13 Mukul Agarwal , Anant Sahai , Sanjoy Mitter

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

Combinatorics · Mathematics 2017-09-05 Kristóf Bérczi , András Frank

We consider a problem of coding for computing, where the decoder wishes to estimate a function of its local message and the source message at the encoder within a given distortion. We show that the rate-distortion function can be…

Information Theory · Computer Science 2022-05-18 Deheng Yuan , Tao Guo , Bo Bai , Wei Han

Super-resolution theory aims to estimate the discrete components lying in a continuous space that constitute a sparse signal with optimal precision. This work investigates the potential of recent super-resolution techniques for spectral…

Information Theory · Computer Science 2016-11-24 M. Ferreira Da Costa , W. Dai

We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms…

Combinatorics · Mathematics 2017-01-24 Oliver Kullmann , Xishun Zhao

Optimal transport has emerged as a fundamental methodology with applications spanning multiple research areas in recent years. However, the convergence rate of the empirical estimator to its population counterpart suffers from the curse of…

Statistics Theory · Mathematics 2025-10-06 Jiaping Yang , Yunxin Zhang

This paper investigates an information-theoretic model of secure semantic-aware communication. For this purpose, we consider the lossy joint source-channel coding (JSCC) of a memoryless semantic source transmitted over a memoryless wiretap…

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

A (tandem) duplication of length $ k $ is an insertion of an exact copy of a substring of length $ k $ next to its original position. This and related types of impairments are of relevance in modeling communication in the presence of…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Vincent Y. F. Tan

Conformal symmetry is broken in physical QCD; nevertheless, one can use conformal symmetry as a template, systematically correcting for its nonzero $\beta$ function as well as higher-twist effects. For example, commensurate scale relations…

High Energy Physics - Phenomenology · Physics 2017-08-23 Stanley J. Brodsky

We consider a multiterminal source coding problem in which a source is estimated at a central processing unit from lossy-compressed remote observations. Each lossy-encoded observation is produced by a remote sensor which obtains a noisy…

Information Theory · Computer Science 2016-05-13 Ruiyang Song , Stefano Rini , Alon Kipnis , Andrea J. Goldsmith

We analyze the convergence rates of two popular variants of coordinate descent (CD): random CD (RCD), in which the coordinates are sampled uniformly at random, and random-permutation CD (RPCD), in which random permutations are used to…

Optimization and Control · Mathematics 2025-05-30 Donghwa Kim , Jaewook Lee , Chulhee Yun

In this paper, we study the computation of the rate-distortion-perception function (RDPF) for discrete memoryless sources subject to a single-letter average distortion constraint and a perception constraint that belongs to the family of…

Information Theory · Computer Science 2023-05-09 Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

Many problems in science and engineering involve, as part of their solution process, the consideration of a separable function which is the sum of two convex functions, one of them possibly non-smooth. Recently a few works have discussed…

Optimization and Control · Mathematics 2017-03-06 Daniel Reem , Alvaro De Pierro

We discuss a relationship between rate-distortion and optimal transport (OT) theory, even though they seem to be unrelated at first glance. In particular, we show that a function defined via an extremal entropic OT distance is equivalent to…

Information Theory · Computer Science 2023-07-04 Eric Lei , Hamed Hassani , Shirin Saeedi Bidokhti

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…

Numerical Analysis · Mathematics 2018-04-09 Ben Adcock , Rodrigo Platte , Alexei Shadrin
‹ Prev 1 8 9 10 Next ›