{"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/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"},"arxiv_metadata":null,"syntology_extracted_results":null}