English
Related papers

Related papers: Moser-Tardos resampling algorithm, entropy compres…

200 papers

This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. Numerous renowned algorithms for tackling the compressed sensing problem…

Information Theory · Computer Science 2026-03-11 Xu Zhu , Yufei Ma , Xiaoguang Li , Tiejun Li

The Lovasz Local Lemma due to Erdos and Lovasz is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events,…

Data Structures and Algorithms · Computer Science 2007-05-23 Aravind Srinivasan

Given a boundary of spacetime preserved by a Diff(S^{1}) sub-algebra, we propose a systematic method to compute the zero mode and the central extension of the associated Virasoro algebra of charges. Using these values in the Cardy formula,…

High Energy Physics - Theory · Physics 2009-11-07 Sebastian Silva

We introduce a notion of a point-wise entropy of measures (i.e local entropy) called neutralized local entropy, and compare it with the Brin-Katok local entropy. We show that the neutralized local entropy coincides with Brin-Katok local…

Dynamical Systems · Mathematics 2023-07-31 Snir Ben Ovadia , Federico Rodriguez-Hertz

We consider the task of designing Local Computation Algorithms (LCA) for applications of the Lov\'{a}sz Local Lemma (LLL). LCA is a class of sublinear algorithms proposed by Rubinfeld et al.~\cite{Ronitt} that have received a lot of…

Data Structures and Algorithms · Computer Science 2020-07-08 Dimitris Achlioptas , Themis Gouleakis , Fotis Iliopoulos

We study sufficient conditions for the belonging of random process to certain Besov space and for the Central Limit Theorem (CLT) in these spaces. We investigate also the non-asymptotic tail behavior of normed sums of centered random…

Probability · Mathematics 2015-07-03 E. Ostrovsky , L. Sirota

The traditional compressed sensing approach is naturally offline, in that it amounts to sparsely sampling and reconstructing a given dataset. Recently, an online algorithm for performing compressed sensing on streaming data was proposed:…

Optimization and Control · Mathematics 2016-05-10 Pantelis Sopasakis , Nikolaos Freris , Panagiotis Patrinos

Language prediction is constrained by informational entropy intrinsic to language, such that there exists a limit to how accurate any language model can become and equivalently a lower bound to language compression. The most efficient…

Computation and Language · Computer Science 2025-11-14 Benjamin L. Badger , Matthew Neligeorge

Sampling from constrained distributions has a wide range of applications, including in Bayesian optimization and robotics. Prior work establishes convergence and feasibility guarantees for constrained sampling, but assumes that the feasible…

Machine Learning · Computer Science 2026-05-13 Cornelius V. Braun , Tilman Burghoff , Marc Toussaint

The area law conjecture states that the entanglement entropy of a region of space in the ground state of a gapped, local Hamiltonian only grows like the surface area of the region. We show that, for any quantum state that fulfills an area…

Quantum Physics · Physics 2019-05-22 Henrik Wilming , Jens Eisert

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

chao-dyn · Physics 2009-10-22 N. J. Balmforth , E. A. Spiegel , C. Tresser

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

Information Theory · Computer Science 2018-07-19 Yizhong Wang , Li Xie , Xuan Zhang , Jun Chen

Smart meters have currently attracted attention because of their high efficiency and throughput performance. They transmit a massive volume of continuously collected waveform readings (e.g. monitoring). Although many compression models are…

Signal Processing · Electrical Eng. & Systems 2020-06-08 Sharif Abuadbba , Ayman Ibaida , Ibrahim Khalil , Naveen Chilamkurti , Surya Nepal , Xinghuo Yu

Sampling from multimodal distributions is a central challenge in Bayesian inference and machine learning. In light of hardness results for sampling -- classical MCMC methods, even with tempering, can suffer from exponential mixing times --…

Machine Learning · Statistics 2025-12-23 Holden Lee , Matheau Santana-Gijzen

In this paper, we study the topological entropy and the Hausdorff dimension of a shrinking target set. We give lower and upper bounds of topological entropy and Hausdorff dimension for dynamical systems with exponential specification…

Dynamical Systems · Mathematics 2024-10-29 Xiaobo Hou , Xueting Tian , Yiwei Zhang

The maximum-entropy sampling problem is the NP-hard problem of maximizing the (log) determinant of an order-$s$ principle submatrix of a given order $n$ covariance matrix $C$. Exact algorithms are based on a branch-and-bound framework. The…

Optimization and Control · Mathematics 2021-06-08 Zhongzhu Chen , Marcia Fampa , Jon Lee

In this paper, we are concerned with a model of polytropic gas flow, which consists the mass equation, the momentum equation and a varying entropy equation. First, a new technique, to set up a relation between the Riemann invariants of the…

Analysis of PDEs · Mathematics 2020-04-17 Yun-guang Lu

We study entanglement entropy of boundary states in a free bosonic conformal field theory. A boundary state can be thought of as composed of a particular combination of left and right-moving modes of the two-dimensional conformal field…

High Energy Physics - Theory · Physics 2015-06-22 Leopoldo A. Pando Zayas , Norma Quiroz

In this paper, an estimation of lower bound of topological entropy for coupled-expanding systems associated with transition matrices in compact Hausdorff spaces is given. Estimations of upper and lower bounds of topological entropy for…

Dynamical Systems · Mathematics 2015-06-04 Hua Shao , Yuming Shi , Hao Zhu

Diffusion Posterior Sampling (DPS) provides a principled Bayesian approach to inverse problems by sampling from $p(x_0 \mid y)$. While posterior sampling is valuable for capturing uncertainty and multi-modality, many classical and practical…

Graphics · Computer Science 2026-05-26 Shaorong Zhang , Rob Brekelmans , Greg Ver Steeg