We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Information theoretic active learning has been widely studied for probabilistic models. For simple regression an optimal myopic policy is easily tractable. However, for other tasks and with more complex models, such as classification with nonparametric models, the optimal solution is harder to compute. Current approaches make approximations to achieve tractability. We propose an approach that expresses information gain in terms of predictive entropies, and apply this method to the Gaussian Process Classifier (GPC). Our approach makes minimal approximations to the full information theoretic objective. Our experimental performance compares favourably to many popular active learning algorithms, and has equal or lower computational complexity. We compare well to decision theoretic approaches also, which are privy to more information and require much more computational time. Secondly, by developing further a reformulation of binary preference learning to a classification problem, we extend our algorithm to Gaussian Process preference learning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1112.5745")
get_code_for_paper("1112.5745")
have("1112.5745")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1112.5745.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1112.5745)
Connect an agent — have() is free.