{"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/learning-from-less-data-a-unified-data-subset","title":"Learning From Less Data: A Unified Data Subset Selection and Active Learning Framework for Computer Vision","arxiv_id":"1901.01151","date":"2019-01-03","proceeding":null,"authors":["Vishal Kaushal","Rishabh Iyer","Suraj Kothawade","Rohan Mahadev","Khoshrav Doctor","Ganesh Ramakrishnan"],"abstract":"Supervised machine learning based state-of-the-art computer vision techniques\nare in general data hungry. Their data curation poses the challenges of\nexpensive human labeling, inadequate computing resources and larger experiment\nturn around times. Training data subset selection and active learning\ntechniques have been proposed as possible solutions to these challenges. A\nspecial class of subset selection functions naturally model notions of\ndiversity, coverage and representation and can be used to eliminate redundancy\nthus lending themselves well for training data subset selection. They can also\nhelp improve the efficiency of active learning in further reducing human\nlabeling efforts by selecting a subset of the examples obtained using the\nconventional uncertainty sampling based techniques. In this work, we\nempirically demonstrate the effectiveness of two diversity models, namely the\nFacility-Location and Dispersion models for training-data subset selection and\nreducing labeling effort. We demonstrate this across the board for a variety of\ncomputer vision tasks including Gender Recognition, Face Recognition, Scene\nRecognition, Object Detection and Object Recognition. Our results show that\ndiversity based subset selection done in the right way can increase the\naccuracy by upto 5 - 10% over existing baselines, particularly in settings in\nwhich less training data is available. This allows the training of complex\nmachine learning models like Convolutional Neural Networks with much less\ntraining data and labeling costs while incurring minimal performance loss.","url_abs":"http://arxiv.org/abs/1901.01151v1","url_pdf":"http://arxiv.org/pdf/1901.01151v1.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":"learning-from-less-data-a-unified-data-subset","repo_url":"https://github.com/caihuaiguang/CHG-Shapley-for-Data-Selection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-from-less-data-a-unified-data-subset","repo_url":"https://github.com/decile-team/cords","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"face-recognition","task_name":"Face Recognition"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"object-recognition","task_name":"Object Recognition"},{"task_slug":"scene-recognition","task_name":"Scene Recognition"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.01151","atlas_url":"https://app.syntology.ai/?focus=1901.01151","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":"1901.01151"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.01151\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.01151"},"call":"get_concepts_for_paper(arxiv_id=\"1901.01151\")"}],"by_repo":[{"repo":"caihuaiguang/CHG-Shapley-for-Data-Selection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2406.11730"],"harvested_for_calls":[{"arxiv_id":"2406.11730","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.11730"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.11730\")"}]},{"repo":"decile-team/cords","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2511.17399"],"harvested_for_calls":[{"arxiv_id":"2511.17399","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2511.17399"},"call":"get_harvested_code_for_paper(arxiv_id=\"2511.17399\")"}]}],"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":"6a76586441bafcc808392680b8c9418912db6019a27dac8911347a0e2b76b358","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}