Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Hi Alex,
In #27 we discussed two threads: other solvers for ACC/PCC (such as BBSE or invariant ratio estimators) and Bayesian quantification.
This PR sketches how the Bayesian quantification estimator could look like. Instead of solving an equation (by explicit inversion or optimization), it uses a Markov chain Monte Carlo NUTS sampler to find all prevalence vector values$P_\text{test}(Y)$ compatible with the observed distribution of classifier predictions.
More formally, we are doing Bayesian inference in the following model:
where$\pi'$ is the latent variable modelling $P_\text{test}(Y)$ and $\phi$ is a latent variable modelling $P(C\mid Y)$ matrix (where $C$ is the classifier prediction and $Y$ is the true label).