On Identifying a Massive Number of Distributions

01/14/2018
by   Sara Shahi, et al.
0

Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of observed sequences, are let to grow with the observation blocklength n. Asymptotically matching upper and lower bounds on the probability of error are derived.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2021

Contracting and Involutive Negations of Probability Distributions

A dozen papers have considered the concept of negation of probability di...
research
12/03/2017

Exact upper and lower bounds on the misclassification probability

Exact lower and upper bounds on the best possible misclassification prob...
research
02/09/2020

Monotone probability distributions over the Boolean cube can be learned with sublinear samples

A probability distribution over the Boolean cube is monotone if flipping...
research
08/08/2018

The roll call interpretation of the Shapley value

The Shapley value is commonly illustrated by roll call votes in which pl...
research
08/26/2020

Combinatorial Communication in the Locker Room

The reader may be familiar with various problems involving prisoners and...
research
02/09/2023

Do Random and Chaotic Sequences Really Cause Different PSO Performance?

Our topic is performance differences between using random and chaos for ...
research
06/19/2019

On infinite covariance expansions

In this paper we provide a probabilistic representation of Lagrange's id...

Please sign up or login with your details

Forgot password? Click here to reset