{"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/convex-formulation-of-multiple-instance","title":"Convex Formulation of Multiple Instance Learning from Positive and Unlabeled Bags","arxiv_id":"1704.06767","date":"2017-04-22","proceeding":null,"authors":["Han Bao","Tomoya Sakai","Issei Sato","Masashi Sugiyama"],"abstract":"Multiple instance learning (MIL) is a variation of traditional supervised\nlearning problems where data (referred to as bags) are composed of sub-elements\n(referred to as instances) and only bag labels are available. MIL has a variety\nof applications such as content-based image retrieval, text categorization and\nmedical diagnosis. Most of the previous work for MIL assume that the training\nbags are fully labeled. However, it is often difficult to obtain an enough\nnumber of labeled bags in practical situations, while many unlabeled bags are\navailable. A learning framework called PU learning (positive and unlabeled\nlearning) can address this problem. In this paper, we propose a convex PU\nlearning method to solve an MIL problem. We experimentally show that the\nproposed method achieves better performance with significantly lower\ncomputational costs than an existing method for PU-MIL.","url_abs":"http://arxiv.org/abs/1704.06767v3","url_pdf":"http://arxiv.org/pdf/1704.06767v3.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":"convex-formulation-of-multiple-instance","repo_url":"https://github.com/levelfour/pumil","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"content-based-image-retrieval","task_name":"Content-Based Image Retrieval"},{"task_slug":"image-retrieval","task_name":"Image Retrieval"},{"task_slug":"multiple-instance-learning","task_name":"Multiple Instance Learning"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"text-categorization","task_name":"Text Categorization"}],"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":"levelfour/pumil","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":"d9347cc9a526385c81df60c03af7db71a69cefb6efac47456b01d62a088ef9cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}