{"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/hybrid-mst-a-hybrid-active-sampling-strategy","title":"Hybrid-MST: A Hybrid Active Sampling Strategy for Pairwise Preference Aggregation","arxiv_id":"1810.08851","date":"2018-10-20","proceeding":"NeurIPS 2018 12","authors":["Jing Li","Rafal K. Mantiuk","Junle Wang","Suiyi Ling","Patrick Le Callet"],"abstract":"In this paper we present a hybrid active sampling strategy for pairwise\npreference aggregation, which aims at recovering the underlying rating of the\ntest candidates from sparse and noisy pairwise labelling. Our method employs\nBayesian optimization framework and Bradley-Terry model to construct the\nutility function, then to obtain the Expected Information Gain (EIG) of each\npair. For computational efficiency, Gaussian-Hermite quadrature is used for\nestimation of EIG. In this work, a hybrid active sampling strategy is proposed,\neither using Global Maximum (GM) EIG sampling or Minimum Spanning Tree (MST)\nsampling in each trial, which is determined by the test budget. The proposed\nmethod has been validated on both simulated and real-world datasets, where it\nshows higher preference aggregation ability than the state-of-the-art methods.","url_abs":"http://arxiv.org/abs/1810.08851v1","url_pdf":"http://arxiv.org/pdf/1810.08851v1.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":"hybrid-mst-a-hybrid-active-sampling-strategy","repo_url":"https://github.com/jingnantes/hybrid-mst","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.08851","atlas_url":"https://app.syntology.ai/?focus=1810.08851","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":"1810.08851"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.08851\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.08851"},"call":"get_concepts_for_paper(arxiv_id=\"1810.08851\")"}],"by_repo":[{"repo":"jingnantes/hybrid-mst","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":"2c02fb5aae7318cc6e051156d56adfe66aa68888919bbe7394407592a3a6d116","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}