I am looking at the following model:
$c$ is a fixed vector in $\mathbb{R}_+^n$ and for any $x \in \mathbb{R}_+^n$ we obtain a value $y =[c^Tx]$, i.e. rounding $c^Tx$ to the nearest integer.
I want to determine c based on observations of $x_1, \ldots ,x_k$ and $y_1, \ldots, y_k$. (Before EDIT $x_1, \ldots ,x_n$ and $y_1 \ldots, y_n$.)
Of course I could simply do a least squares, but I do not know how to get a good measure of error then. I think one could somehow exploit the fact that error is not really random but comes from rounding. And I think it should be possible to measure of quality of the resulting vector $c$.
So here is the question:
Do you know a method to determine $c$ together with a bound on the error in $c$, i.e. an interval for each coefficient of $c$ where the true value is guaranteed to be contained. (Of course I'd like to know methods which small error bounds)?
EDIT: I had a typo fixed, namely I may have many more observations $k$ than the dimension of the vectors $n$. My hope is to be able to get better bounds by increasing $k$.
for a limited number of levels of y , try using multinomial probit. the idea is that for n-0.5 < y < n+0.5, you see n. Treat this as a categorical dependent variable.
hope this helps!