English
Related papers

Related papers: Hidden independence in unstructured probabilistic …

200 papers

We propose a test of independence of two multivariate random vectors, given a sample from the underlying population. Our approach, which we call MINT, is based on the estimation of mutual information, whose decomposition into joint and…

Methodology · Statistics 2017-11-20 Thomas B. Berrett , Richard J. Samworth

Bell inequalities may only be derived, if hidden variables do not depend on the experimental settings. The stochastic independence of hidden and setting variables is called: freedom of choice, free will, measurement independence or no…

Quantum Physics · Physics 2022-04-01 Marian Kupczynski

Many domain experts do not have the time or expertise to write formal Bayesian models. This paper takes an informal problem description as input, and combines a large language model and a probabilistic programming language to define a joint…

Machine Learning · Computer Science 2025-10-27 Justin Domke

We propose a methodology for modeling and comparing probability distributions within a Bayesian nonparametric framework. Building on dependent normalized random measures, we consider a prior distribution for a collection of discrete random…

Methodology · Statistics 2022-06-01 Mario Beraha , Jim E. Griffin

Analysis of a probabilistic system often requires to learn the joint probability distribution of its random variables. The computation of the exact distribution is usually an exhaustive precise analysis on all executions of the system. To…

Information Theory · Computer Science 2023-07-19 Fabrizio Biondi , Yusuke Kawamoto , Axel Legay , Louis-Marie Traonouez

We consider the classical problem of discrete distribution estimation using i.i.d. samples in a novel scenario where additional side information is available on the distribution. In large alphabet datasets such as text corpora, such side…

Information Theory · Computer Science 2026-01-19 Haricharan Balasundaram , Andrew Thangaraj

It is shown that a random binary process with impulse-like autocorrelation can be generated by randomizing the length of symbols occurring in a random Bernoulli process. Such randomization is achieved by random (or judiciously designed…

Signal Processing · Electrical Eng. & Systems 2020-06-30 W. J. Szajnowski

Formal reasoning about hashing-based probabilistic data structures often requires reasoning about random variables where when one variable gets larger (such as the number of elements hashed into one bucket), the others tend to be smaller…

Programming Languages · Computer Science 2021-12-01 Jialu Bao , Marco Gaboardi , Justin Hsu , Joseph Tassarotti

Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…

Combinatorics · Mathematics 2008-08-06 Terence Tao , Van Vu

We study a marginal empirical likelihood approach in scenarios when the number of variables grows exponentially with the sample size. The marginal empirical likelihood ratios as functions of the parameters of interest are systematically…

Statistics Theory · Mathematics 2013-11-07 Jinyuan Chang , Cheng Yong Tang , Yichao Wu

We discuss Bayesian nonparametric procedures for the regression analysis of compositional responses, that is, data supported on a multivariate simplex. The procedures are based on a modified class of multivariate Bernstein polynomials and…

Methodology · Statistics 2021-08-31 Claudia Wehrhahn , Andrés F. Barrientos , Alejandro Jara

In this paper we show the distributions of sliding block patterns for Bernoulli processes with finite alphabet, which is not based on the induction on sample size. We show a new inclusion-exclusion formula in multivariate generating…

Information Theory · Computer Science 2019-02-13 Hayato Takahashi

Testing the validity of probabilistic models containing unmeasured (hidden) variables is shown to be a hard task. We show that the task of testing whether models are structurally incompatible with the data at hand, requires an exponential…

Artificial Intelligence · Computer Science 2013-02-28 Dan Geiger , Azaria Paz , Judea Pearl

We consider a system of dependent Poisson variables, where each variable is the sum of an independent variate and a common variate. It is the common variate that creates the dependence. Within this system, a test of independence may be…

Statistics Theory · Mathematics 2021-03-19 Rolf Larsson

Discrete random structures are important tools in Bayesian nonparametrics and the resulting models have proven effective in density estimation, clustering, topic modeling and prediction, among others. In this paper, we consider nested…

Statistics Theory · Mathematics 2018-01-17 Federico Camerlenghi , David B. Dunson , Antonio Lijoi , Igor Prünster , Abel Rodríguez

We define a measure of redundant information based on projections in the space of probability distributions. Redundant information between random variables is information that is shared between those variables. But in contrast to mutual…

Information Theory · Computer Science 2013-05-30 Malte Harder , Christoph Salge , Daniel Polani

In this paper, a robust non-parametric measure of statistical dependence, or correlation, between two random variables is presented. The proposed coefficient is a permutation-like statistic that quantifies how much the observed sample S_n :…

Methodology · Statistics 2020-07-27 Rami Mahdi

In latent variable models the parameter estimation can be implemented by using the joint or the marginal likelihood, based on independence or conditional independence assumptions. The same dilemma occurs within the Bayesian framework with…

Computation · Statistics 2014-09-18 Silia Vitoratou , Ioannis Ntzoufras , Irini Moustaki

We consider the problem of distributed binary hypothesis testing of two sequences that are generated by an i.i.d. doubly-binary symmetric source. Each sequence is observed by a different terminal. The two hypotheses correspond to different…

Information Theory · Computer Science 2018-01-03 Eli Haim , Yuval Kochman

The combinatorial basis of entropy by Boltzmann can be written $H= {N}^{-1} \ln \mathbb{W}$, where $H$ is the dimensionless entropy of a system, per unit entity, $N$ is the number of entities and $\mathbb{W}$ is the number of ways in which…

Mathematical Physics · Physics 2009-11-13 Robert K. Niven
‹ Prev 1 4 5 6 7 8 10 Next ›