{"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/preference-modeling-with-context-dependent","title":"Preference Modeling with Context-Dependent Salient Features","arxiv_id":"2002.09615","date":"2020-02-22","proceeding":null,"authors":["Amanda Bower","Laura Balzano"],"abstract":"We consider the problem of estimating a ranking on a set of items from noisy pairwise comparisons given item features. We address the fact that pairwise comparison data often reflects irrational choice, e.g. intransitivity. Our key observation is that two items compared in isolation from other items may be compared based on only a salient subset of features. Formalizing this framework, we propose the salient feature preference model and prove a finite sample complexity result for learning the parameters of our model and the underlying ranking with maximum likelihood estimation. We also provide empirical results that support our theoretical bounds and illustrate how our model explains systematic intransitivity. Finally we demonstrate strong performance of maximum likelihood estimation of our model on both synthetic data and two real data sets: the UT Zappos50K data set and comparison data about the compactness of legislative districts in the US.","url_abs":"https://arxiv.org/abs/2002.09615v2","url_pdf":"https://arxiv.org/pdf/2002.09615v2.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":"preference-modeling-with-context-dependent","repo_url":"https://github.com/Amandarg/salient_features","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2002.09615","atlas_url":"https://app.syntology.ai/?focus=2002.09615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09615"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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":"deterministic:regex_extraction","url":"https://github.com/Amandarg/salient_features","reach":null},{"provenance":"deterministic:regex_extraction","url":"https://github.com/airalcorn2/RankNet","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_fixture":2,"ran":2},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1},"found_in_text":{"samples":1,"ran":1,"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":3,"samples":[{"code_sha256_prefix":"68e1dc7efc8f639a","entry":"compute_probability","repo":"Amandarg/salient_features","repo_kind":"official","path":"fit_model_class.py","file_url":"https://github.com/Amandarg/salient_features/blob/HEAD/fit_model_class.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"68e1dc7efc8f639a"}},{"code_sha256_prefix":"07817d9be6934406","entry":"evaluate_threshold","repo":"Amandarg/salient_features","repo_kind":"official","path":"fit_model_class.py","file_url":"https://github.com/Amandarg/salient_features/blob/HEAD/fit_model_class.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"07817d9be6934406"}},{"code_sha256_prefix":"bb74ee94941ba8a1","entry":"idcg","repo":"airalcorn2/RankNet","repo_kind":"found_in_text","path":"lambdarank.py","file_url":"https://github.com/airalcorn2/RankNet/blob/HEAD/lambdarank.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bb74ee94941ba8a1"}},{"code_sha256_prefix":"7a0f88b5d0dc5f06","entry":"pairwise_comparisons","repo":"Amandarg/salient_features","repo_kind":"official","path":"fit_model_class.py","file_url":"https://github.com/Amandarg/salient_features/blob/HEAD/fit_model_class.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7a0f88b5d0dc5f06"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}