{"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/a-variance-maximization-criterion-for-active","title":"A Variance Maximization Criterion for Active Learning","arxiv_id":"1706.07642","date":"2017-06-23","proceeding":null,"authors":["Yazhou Yang","Marco Loog"],"abstract":"Active learning aims to train a classifier as fast as possible with as few\nlabels as possible. The core element in virtually any active learning strategy\nis the criterion that measures the usefulness of the unlabeled data based on\nwhich new points to be labeled are picked. We propose a novel approach which we\nrefer to as maximizing variance for active learning or MVAL for short. MVAL\nmeasures the value of unlabeled instances by evaluating the rate of change of\noutput variables caused by changes in the next sample to be queried and its\npotential labelling. In a sense, this criterion measures how unstable the\nclassifier's output is for the unlabeled data points under perturbations of the\ntraining data. MVAL maintains, what we refer to as, retraining information\nmatrices to keep track of these output scores and exploits two kinds of\nvariance to measure the informativeness and representativeness, respectively.\nBy fusing these variances, MVAL is able to select the instances which are both\ninformative and representative. We employ our technique both in combination\nwith logistic regression and support vector machines and demonstrate that MVAL\nachieves state-of-the-art performance in experiments on a large number of\nstandard benchmark datasets.","url_abs":"http://arxiv.org/abs/1706.07642v2","url_pdf":"http://arxiv.org/pdf/1706.07642v2.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":"a-variance-maximization-criterion-for-active","repo_url":"https://github.com/YazhouTUD/MVAL","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"informativeness","task_name":"Informativeness"}],"methods":[{"method_slug":"logistic-regression","method_name":"Logistic Regression"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"YazhouTUD/MVAL","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"ae712d2e4f686ad477389995f7c90ba806997c81e7ecff5bfc685431246dceda","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}