{"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/interpretable-preference-learning-a-game","title":"Interpretable preference learning: a game theoretic framework for large margin on-line feature and rule learning","arxiv_id":"1812.07895","date":"2018-12-19","proceeding":null,"authors":["Mirko Polato","Fabio Aiolli"],"abstract":"A large body of research is currently investigating on the connection between\nmachine learning and game theory. In this work, game theory notions are\ninjected into a preference learning framework. Specifically, a preference\nlearning problem is seen as a two-players zero-sum game. An algorithm is\nproposed to incrementally include new useful features into the hypothesis. This\ncan be particularly important when dealing with a very large number of\npotential features like, for instance, in relational learning and rule\nextraction. A game theoretical analysis is used to demonstrate the convergence\nof the algorithm. Furthermore, leveraging on the natural analogy between\nfeatures and rules, the resulting models can be easily interpreted by humans.\nAn extensive set of experiments on classification tasks shows the effectiveness\nof the proposed method in terms of interpretability and feature selection\nquality, with accuracy at the state-of-the-art.","url_abs":"http://arxiv.org/abs/1812.07895v1","url_pdf":"http://arxiv.org/pdf/1812.07895v1.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":"interpretable-preference-learning-a-game","repo_url":"https://github.com/makgyver/PRL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"relational-reasoning","task_name":"Relational Reasoning"},{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[{"method_slug":"interpretability","method_name":"Interpretability"}],"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":"makgyver/PRL","kind":"listed","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":"3466c55b725d598ed130e39e49605f635e1f7c7d502d7229e674272e0be38b1f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}