Skip to main content
deleted 1 character in body
Source Link
RobPratt
  • 5.4k
  • 1
  • 15
  • 25

Assume you have $n$ independent binary variables $\{x_1,\dots,x_n\}$ and for each variable $x_i$ you know that its value is equal to $1$ with a probability $p_i$. I would like to enumerate the joint assignments of these variables in such a way that in $k$ steps I capture as much volume of the joint probability mass function as possible. Does there existsexist some approximation algorithm which runs faster than the algorithm which enumerates the assignments according to their joint probability $\Pi p_i$. Or something related?

Assume you have $n$ independent binary variables $\{x_1,\dots,x_n\}$ and for each variable $x_i$ you know that its value is equal to $1$ with a probability $p_i$. I would like to enumerate the joint assignments of these variables in such a way that in $k$ steps I capture as much volume of the joint probability mass function as possible. Does there exists some approximation algorithm which runs faster than the algorithm which enumerates the assignments according to their joint probability $\Pi p_i$. Or something related?

Assume you have $n$ independent binary variables $\{x_1,\dots,x_n\}$ and for each variable $x_i$ you know that its value is equal to $1$ with a probability $p_i$. I would like to enumerate the joint assignments of these variables in such a way that in $k$ steps I capture as much volume of the joint probability mass function as possible. Does there exist some approximation algorithm which runs faster than the algorithm which enumerates the assignments according to their joint probability $\Pi p_i$. Or something related?

added 2 characters in body
Source Link
RobPratt
  • 5.4k
  • 1
  • 15
  • 25

Assume you have $n$ independent binary variables ${x_1,\dots,x_n}$$\{x_1,\dots,x_n\}$ and for each variable $x_i$ you know that its value is equal to $1$ with a probability $p_i$. I would like to enumerate the joint assignments of these variables in such a way that in $k$ steps I capture as much volume of the joint probability mass function as possible. Does there exists some approximation algorithm which runruns faster thenthan the algorithm which enumerates the assignments according to their joint probability $\Pi p_i$. Or something related?

Assume you have $n$ independent binary variables ${x_1,\dots,x_n}$ and for each variable $x_i$ you know that its value is equal to $1$ with a probability $p_i$. I would like to enumerate the joint assignments of these variables in such a way that in $k$ steps I capture as much volume of the joint probability mass function as possible. Does there exists some approximation algorithm which run faster then the algorithm which enumerates the assignments according to their joint probability $\Pi p_i$. Or something related?

Assume you have $n$ independent binary variables $\{x_1,\dots,x_n\}$ and for each variable $x_i$ you know that its value is equal to $1$ with a probability $p_i$. I would like to enumerate the joint assignments of these variables in such a way that in $k$ steps I capture as much volume of the joint probability mass function as possible. Does there exists some approximation algorithm which runs faster than the algorithm which enumerates the assignments according to their joint probability $\Pi p_i$. Or something related?

formatting
Link
YCor
  • 63.9k
  • 5
  • 187
  • 286

choosing k Choosing $k$ different assignments of binary variables in order to capture the largest volume of the joint probability distribution

Source Link
Loading