Consider a finite set $A$. Let the sample space be $A\times A$. We have an unknown probability distribution $f$ on this sample space. Now this probability distribution has a "blocky" property, which I am going to explain.
Let a block be a function (not necessarily probability distribution) over the sample space $b_{(B,C,r)}$ where $B,C\subset A$ and $r$ be any real number (not necessarily in $[0,1]$). Then $b_{(B,C,r)}(x,y)=r$ if $(x,y)\in B\times C$ and $b_{(B,C,r)}(x,y)=0$ if not. Then $f$ can be written as a finite sum of those blocks (at most $|A|^{2}$ of them in fact). Let $X$ be the minimum number of blocks needed to sum to $f$. If prior to observing any trials, we know that $X$ follows a geometric distribution with unknown $p$ truncated to $[1,|A|^{2}]$ then we say that $f$ is "blocky". (Note that despite the analogy to reconstructing a picture, a block need not be a rectangle: there is no relationship among elements in $A$)
Now we are given the outcome of a number of trials, where each trial consists of picking an element in the sample space with probability given by that unknown but "blocky" probability distribution $f$. The task is to make estimate of $f$ of each possible outcome.
So what is a good algorithm for that?
I'm sorry that I am new to statistics and thus I was not able to phrase this in a more proper way, and I do not even know if this problem has a solution or not, so it might be trivial or unsolved for all I know. Hope I can get some help on this. Thank you for any help you can give.
