{"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/ranking-for-relevance-and-display-preferences","title":"Ranking for Relevance and Display Preferences in Complex Presentation Layouts","arxiv_id":"1805.02404","date":"2018-05-07","proceeding":null,"authors":["Harrie Oosterhuis","Maarten de Rijke"],"abstract":"Learning to Rank has traditionally considered settings where given the\nrelevance information of objects, the desired order in which to rank the\nobjects is clear. However, with today's large variety of users and layouts this\nis not always the case. In this paper, we consider so-called complex ranking\nsettings where it is not clear what should be displayed, that is, what the\nrelevant items are, and how they should be displayed, that is, where the most\nrelevant items should be placed. These ranking settings are complex as they\ninvolve both traditional ranking and inferring the best display order. Existing\nlearning to rank methods cannot handle such complex ranking settings as they\nassume that the display order is known beforehand. To address this gap we\nintroduce a novel Deep Reinforcement Learning method that is capable of\nlearning complex rankings, both the layout and the best ranking given the\nlayout, from weak reward signals. Our proposed method does so by selecting\ndocuments and positions sequentially, hence it ranks both the documents and\npositions, which is why we call it the Double-Rank Model (DRM). Our experiments\nshow that DRM outperforms all existing methods in complex ranking settings,\nthus it leads to substantial ranking improvements in cases where the display\norder is not known a priori.","url_abs":"http://arxiv.org/abs/1805.02404v1","url_pdf":"http://arxiv.org/pdf/1805.02404v1.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":"ranking-for-relevance-and-display-preferences","repo_url":"https://github.com/HarrieO/RankingComplexLayouts","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"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":"HarrieO/RankingComplexLayouts","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":"c3852cc441cc9dad36df60a4a5c9616243d904d1929084d6deb7fe3b6873852e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}