English
Related papers

Related papers: Universal Bayesian Measures and Universal Histogra…

200 papers

This paper deals with studying vague convergence of random measures of the form $\mu_{n}=\sum_{i=1}^{n} p_{i,n} \delta_{\theta_i}$, where $(\theta_i)_{1\le i \le n}$ is a sequence of independent and identically distributed random variables…

Statistics Theory · Mathematics 2016-10-12 Luai Al-Labadi

Sequential probability assignment and universal compression go hand in hand. We propose sequential probability assignment for non-binary (and large alphabet) sequences with empirical distributions whose parameters are known to be bounded…

Information Theory · Computer Science 2021-02-09 Michael Drmota , Gil Shamir , Wojciech Szpankowski

We compute analytically the radiative quantum corrections, up to next-to-leading loop order, to the universal critical exponents for both massless and massive O($N$) $\lambda\phi^{4}$ scalar squeezed field theories for probing the…

High Energy Physics - Theory · Physics 2022-11-18 P. A. L. Mourão , H. A. S. Costa , P. R. S. Carvalho

We describe a universal information compression scheme that compresses any pure quantum i.i.d. source asymptotically to its von Neumann entropy, with no prior knowledge of the structure of the source. We introduce a diagonalisation…

Quantum Physics · Physics 2007-05-23 Richard Jozsa , Stuart Presnell

Wu and Verd\'u developed a theory of almost lossless analog compression, where one imposes various regularity conditions on the compressor and the decompressor with the input signal being modelled by a (typically infinite-entropy)…

Dynamical Systems · Mathematics 2022-12-29 Yonatan Gutman , Adam Śpiewak

We study the rate of Bayesian consistency for hierarchical priors consisting of prior weights on a model index set and a prior on a density model for each choice of model index. Ghosal, Lember and Van der Vaart [2] have obtained general…

Statistics Theory · Mathematics 2008-09-23 Yang Xing

Bayesian sequence prediction is a simple technique for predicting future symbols sampled from an unknown measure on infinite sequences over a countable alphabet. While strong bounds on the expected cumulative error are known, there are only…

Machine Learning · Computer Science 2013-07-02 Tor Lattimore , Marcus Hutter , Peter Sunehag

We treat three types of measures of the quantum walk (QW) with the spatial perturbation at the origin, which was introduced by [1]: time averaged limit measure, weak limit measure, and stationary measure. From the first two measures, we see…

Quantum Physics · Physics 2013-06-12 Norio Konno , Tomasz Luczak , Etsuo Segawa

Bayesian neural networks (BNNs) are a principled approach to modeling predictive uncertainties in deep learning, which are important in safety-critical applications. Since exact Bayesian inference over the weights in a BNN is intractable,…

Machine Learning · Statistics 2024-01-02 Tim Z. Xiao , Weiyang Liu , Robert Bamler

Uncertainty quantification (UQ) is essential for deploying machine learning models in safety-critical physical systems, yet classical Bayesian approaches incur substantial computational overhead. We establish a formal connection between…

The aim of this paper is to extend the concept of measure density introduced by Buck for finite unions of arithmetic progressions, to arbitrary subsets of N defined by a given system of decompositions. This leads to a variety of new…

Classical Analysis and ODEs · Mathematics 2015-04-10 Maria Rita Iacò , Milan Paštéka , Robert F. Tichy

Clarke and Barron analysed the relative entropy between an i.i.d. source and a Bayesian mixture over a continuous class containing that source. In this paper a comparable result is obtained when the source is permitted to be both…

Information Theory · Computer Science 2014-11-13 Tor Lattimore , Marcus Hutter

Teramoto et al. defined a new measure called the gap ratio that measures the uniformity of a finite point set sampled from $\cal S$, a bounded subset of $\mathbb{R}^2$. We generalize this definition of measure over all metric spaces by…

Computational Geometry · Computer Science 2015-12-07 Arijit Bishnu , Sameer Desai , Arijit Ghosh , Mayank Goswami , Subhabrata Paul

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs

We establish the following universality property in high dimensions: Let $X$ be a random vector with density in $\mathbb{R}^n$. The density function can be arbitrary. We show that there exists a fixed unit vector $\theta \in \mathbb{R}^n$…

Metric Geometry · Mathematics 2016-04-28 Bo'az Klartag

Many applications require data processing to be performed on individual pieces of data which are of finite sizes, e.g., files in cloud storage units and packets in data networks. However, traditional universal compression solutions would…

Information Theory · Computer Science 2012-05-22 Ahmad Beirami , Mohsen Sardari , Faramarz Fekri

We consider the problem of joint universal variable-rate lossy coding and identification for parametric classes of stationary $\beta$-mixing sources with general (Polish) alphabets. Compression performance is measured in terms of…

Information Theory · Computer Science 2016-11-15 Maxim Raginsky

In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class. Here we apply this viewpoint to geometry and initiate a program…

High Energy Physics - Theory · Physics 2023-11-22 Adam R. Brown , Michael H. Freedman , Henry W. Lin , Leonard Susskind

The property of perfectness plays an important role in the theory of Bayesian networks. First, the existence of perfect distributions for arbitrary sets of variables and directed acyclic graphs implies that various methods for reading…

Artificial Intelligence · Computer Science 2012-12-12 Christopher Meek , David Maxwell Chickering

We study the power of uniform sampling for $k$-Median in various metric spaces. We relate the query complexity for approximating $k$-Median, to a key parameter of the dataset, called the balancedness $\beta \in (0, 1]$ (with $1$ being…

Data Structures and Algorithms · Computer Science 2023-02-23 Lingxiao Huang , Shaofeng H. -C. Jiang , Jianing Lou
‹ Prev 1 3 4 5 6 7 10 Next ›