{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/11125745","title":"Bayesian Active Learning for Classification and Preference Learning","arxiv_id":"1112.5745","date":"2011-12-24","proceeding":null,"authors":["Neil Houlsby","Ferenc Huszár","Zoubin Ghahramani","Máté Lengyel"],"abstract":"Information theoretic active learning has been widely studied for\nprobabilistic models. For simple regression an optimal myopic policy is easily\ntractable. However, for other tasks and with more complex models, such as\nclassification with nonparametric models, the optimal solution is harder to\ncompute. Current approaches make approximations to achieve tractability. We\npropose an approach that expresses information gain in terms of predictive\nentropies, and apply this method to the Gaussian Process Classifier (GPC). Our\napproach makes minimal approximations to the full information theoretic\nobjective. Our experimental performance compares favourably to many popular\nactive learning algorithms, and has equal or lower computational complexity. We\ncompare well to decision theoretic approaches also, which are privy to more\ninformation and require much more computational time. Secondly, by developing\nfurther a reformulation of binary preference learning to a classification\nproblem, we extend our algorithm to Gaussian Process preference learning.","url_abs":"http://arxiv.org/abs/1112.5745v1","url_pdf":"http://arxiv.org/pdf/1112.5745v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"11125745","repo_url":"https://github.com/airi-institute/al_toolbox","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"11125745","repo_url":"https://github.com/cambridge-mlg/BALaudiogram","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1112.5745","atlas_url":"https://app.syntology.ai/?focus=1112.5745","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1112.5745"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1112.5745\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1112.5745"},"call":"get_concepts_for_paper(arxiv_id=\"1112.5745\")"}],"by_repo":[{"repo":"airi-institute/al_toolbox","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2107.14263"],"harvested_for_calls":[{"arxiv_id":"2107.14263","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.14263"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.14263\")"}]},{"repo":"cambridge-mlg/BALaudiogram","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ba4b3f1f9278b5a07d2eca6fb468d90410382ff8c68902ac785ae206380cb80e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}