{"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/machine-learning-to-do-more-with-less","title":"(Machine) Learning to Do More with Less","arxiv_id":"1706.09451","date":"2017-06-28","proceeding":null,"authors":["Timothy Cohen","Marat Freytsis","Bryan Ostdiek"],"abstract":"Determining the best method for training a machine learning algorithm is\ncritical to maximizing its ability to classify data. In this paper, we compare\nthe standard \"fully supervised\" approach (that relies on knowledge of\nevent-by-event truth-level labels) with a recent proposal that instead utilizes\nclass ratios as the only discriminating information provided during training.\nThis so-called \"weakly supervised\" technique has access to less information\nthan the fully supervised method and yet is still able to yield impressive\ndiscriminating power. In addition, weak supervision seems particularly well\nsuited to particle physics since quantum mechanics is incompatible with the\nnotion of mapping an individual event onto any single Feynman diagram. We\nexamine the technique in detail -- both analytically and numerically -- with a\nfocus on the robustness to issues of mischaracterizing the training samples.\nWeakly supervised networks turn out to be remarkably insensitive to systematic\nmismodeling. Furthermore, we demonstrate that the event level outputs for\nweakly versus fully supervised networks are probing different kinematics, even\nthough the numerical quality metrics are essentially identical. This implies\nthat it should be possible to improve the overall classification ability by\ncombining the output from the two types of networks. For concreteness, we apply\nthis technology to a signature of beyond the Standard Model physics to\ndemonstrate that all these impressive features continue to hold in a scenario\nof relevance to the LHC.","url_abs":"http://arxiv.org/abs/1706.09451v3","url_pdf":"http://arxiv.org/pdf/1706.09451v3.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":"machine-learning-to-do-more-with-less","repo_url":"https://github.com/bostdiek/PublicWeaklySupervised","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"}],"methods":[],"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":"bostdiek/PublicWeaklySupervised","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":"a89ae5e849f21cc0bd952494611e32d4a0ff090f41fcae079b0d4fec53859deb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}