{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/learning-from-aggregate-observations","title":"Learning from Aggregate Observations","arxiv_id":"2004.06316","date":"2020-04-14","proceeding":"NeurIPS 2020 12","authors":["Yivan Zhang","Nontawat Charoenphakdee","Zhenguo Wu","Masashi Sugiyama"],"abstract":"We study the problem of learning from aggregate observations where supervision signals are given to sets of instances instead of individual instances, while the goal is still to predict labels of unseen individuals. A well-known example is multiple instance learning (MIL). In this paper, we extend MIL beyond binary classification to other problems such as multiclass classification and regression. We present a general probabilistic framework that accommodates a variety of aggregate observations, e.g., pairwise similarity/triplet comparison for classification and mean/difference/rank observation for regression. Simple maximum likelihood solutions can be applied to various differentiable models such as deep neural networks and gradient boosting machines. Moreover, we develop the concept of consistency up to an equivalence relation to characterize our estimator and show that it has nice convergence properties under mild assumptions. Experiments on three problem settings -- classification via triplet comparison and regression via mean/rank observation indicate the effectiveness of the proposed method.","url_abs":"https://arxiv.org/abs/2004.06316v3","url_pdf":"https://arxiv.org/pdf/2004.06316v3.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-aggregate-observations","repo_url":"https://github.com/YivanZhang/lio","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"binary-classification","task_name":"Binary Classification"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"multiple-instance-learning","task_name":"Multiple Instance Learning"},{"task_slug":null,"task_name":"Triplet"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2004.06316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06316"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/YivanZhang/lio","reach":null}],"summary":{"ran_draft_wrong":4,"ran_honours":1,"ran_violates":1},"by_repo_kind":{"official":{"samples":6,"ran":6,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"3c51f64b5294678c","entry":"direct_cauchy_loss","repo":"YivanZhang/lio","repo_kind":"official","path":"lio/losses/regression.py","file_url":"https://github.com/YivanZhang/lio/blob/HEAD/lio/losses/regression.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3c51f64b5294678c"}},{"code_sha256_prefix":"0d7c9e41375cff43","entry":"direct_gaussian_loss","repo":"YivanZhang/lio","repo_kind":"official","path":"lio/losses/regression.py","file_url":"https://github.com/YivanZhang/lio/blob/HEAD/lio/losses/regression.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0d7c9e41375cff43"}},{"code_sha256_prefix":"13ab4765b88bcbc2","entry":"direct_observation_loss","repo":"YivanZhang/lio","repo_kind":"official","path":"lio/losses/classification.py","file_url":"https://github.com/YivanZhang/lio/blob/HEAD/lio/losses/classification.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"13ab4765b88bcbc2"}},{"code_sha256_prefix":"5348e3ae1b8100bd","entry":"indirect_observation_loss","repo":"YivanZhang/lio","repo_kind":"official","path":"lio/losses/classification.py","file_url":"https://github.com/YivanZhang/lio/blob/HEAD/lio/losses/classification.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5348e3ae1b8100bd"}},{"code_sha256_prefix":"4130304ee6322cd2","entry":"mean_gaussian_loss","repo":"YivanZhang/lio","repo_kind":"official","path":"lio/losses/regression.py","file_url":"https://github.com/YivanZhang/lio/blob/HEAD/lio/losses/regression.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4130304ee6322cd2"}},{"code_sha256_prefix":"5f6bc2034e7dbd06","entry":"pairwise_similarity_loss","repo":"YivanZhang/lio","repo_kind":"official","path":"lio/losses/classification.py","file_url":"https://github.com/YivanZhang/lio/blob/HEAD/lio/losses/classification.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5f6bc2034e7dbd06"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}