English
Related papers

Related papers: Efficient Bound for Conditional Min-Entropy of Phy…

200 papers

We determine a lower gap property for the growth of an unbounded \(\mathbb{Z}\)-valued \(k\)-regular sequence. In particular, if \(f:\mathbb{N}\to\mathbb{Z}\) is an unbounded \(k\)-regular sequence, we show that there is a constant \(c>0\)…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…

Information Theory · Computer Science 2018-12-05 Michael Fauss , Abdelhak M. Zoubir

We present a post-processing certification workflow for nonlinear elliptic boundary value problems that upgrades a standard finite element computation to a rigorous existence and output certificate. For a given approximate discrete state,…

Numerical Analysis · Mathematics 2026-02-03 Hiroki Ishizaka

We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…

Information Theory · Computer Science 2022-09-05 Anelia Somekh-Baruch

The reliable fraction of information is an attractive score for quantifying (functional) dependencies in high-dimensional data. In this paper, we systematically explore the algorithmic implications of using this measure for optimization. We…

Artificial Intelligence · Computer Science 2018-09-17 Panagiotis Mandros , Mario Boley , Jilles Vreeken

We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W' to agree on a secret key R in the presence of an active adversary. Robust fuzzy extractors were defined by Dodis et…

Cryptography and Security · Computer Science 2008-08-08 Bhavana Kanukurthi , Leonid Reyzin

This study investigates the potential accuracy boundaries of physics-informed neural networks, contrasting their approach with previous similar works and traditional numerical methods. We find that selecting improved optimization algorithms…

Computational Physics · Physics 2024-12-16 Jorge F. Urbán , Petros Stefanou , José A. Pons

Lower bounds involving $f$-divergences between the underlying probability measures are proved for the minimax risk in estimation problems. Our proofs just use simple convexity facts. Special cases and straightforward corollaries of our…

Statistics Theory · Mathematics 2011-02-22 Adityanand Guntuboyina

In a recent paper, the authors proposed a general methodology for probabilistic learning on manifolds. The method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization…

Probability · Mathematics 2018-03-30 C. Soizea , R. Ghanem , C. Safta , X. Huan , Z. P. Vane , J. Oefelein , G. Lacaz , H. N. Najm , Q. Tang , X. Chen

This paper presents an evolvable conditional diffusion method such that black-box, non-differentiable multi-physics models, as are common in domains like computational fluid dynamics and electromagnetics, can be effectively used for guiding…

Machine Learning · Computer Science 2025-06-18 Zhao Wei , Chin Chun Ooi , Abhishek Gupta , Jian Cheng Wong , Pao-Hsiung Chiu , Sheares Xue Wen Toh , Yew-Soon Ong

The entropic uncertainty relations are a very active field of scientific inquiry. Their applications include quantum cryptography and studies of quantum phenomena such as correlations and non-locality. In this work we find…

Quantum Physics · Physics 2018-10-12 Dariusz Kurzyk , Łukasz Pawela , Zbigniew Puchała

Generative models such as denoising diffusion models are quickly advancing their ability to approximate highly complex data distributions. They are also increasingly leveraged in scientific machine learning, where samples from the implied…

Machine Learning · Computer Science 2025-03-14 Jan-Hendrik Bastek , WaiChing Sun , Dennis M. Kochmann

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

Here we present an analytic approximation for the entropy of floating-point numbers, along with bounds on the error of this approximation. It is well-known that the differential entropy is tightly linked to the discrete entropy of a…

Information Theory · Computer Science 2026-05-13 Sultan Daniels , Samuel H. D'Ambrosia , Michael R. DeWeese , Anant Sahai

We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-linear minimization problem over the same feasible set. Our…

Optimization and Control · Mathematics 2012-01-17 Thomas L. Magnanti , Dan Stratila

Experimental design is crucial for inference where limitations in the data collection procedure are present due to cost or other restrictions. Optimal experimental designs determine parameters that in some appropriate sense make the data…

Machine Learning · Statistics 2016-03-11 Panagiotis Tsilifis , Roger G. Ghanem , Paris Hajali

We investigate the equilibrium behavior for the decentralized cheap talk problem for real random variables and quadratic cost criteria in which an encoder and a decoder have misaligned objective functions. In prior work, it has been shown…

Information Theory · Computer Science 2021-11-16 Ertan Kazıklı , Serkan Sarıtaş , Sinan Gezici , Tamás Linder , Serdar Yüksel

We consider the Bouchaud trap model on the integers in the case that the trap distribution has a slowly varying tail at infinity. Our main result is a functional limit theorem for the model under the annealed law, analogous to the…

Probability · Mathematics 2016-04-21 David Croydon , Stephen Muirhead

Stochastic differential equations are commonly used to describe the evolution of stochastic processes. The state uncertainty of such processes is best represented by the probability density function (PDF), whose evolution is governed by the…

Machine Learning · Computer Science 2026-03-03 Chun-Wei Kong , Luca Laurenti , Jay McMahon , Morteza Lahijanian

We study the maximal entropy per unit generator of push-point mapping classes on the punctured disk. Our work is motivated by fluid mixing by rods in a planar domain. If a single rod moves among N-fixed obstacles, the resulting fluid…

Dynamical Systems · Mathematics 2016-01-20 Philip Boyland , Jason Harrington
‹ Prev 1 4 5 6 7 8 10 Next ›