{"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/exact-passive-aggressive-algorithms-for","title":"Exact Passive-Aggressive Algorithms for Learning to Rank Using Interval Labels","arxiv_id":"1808.06107","date":"2018-08-18","proceeding":null,"authors":["Naresh Manwani","Mohit Chandra"],"abstract":"In this paper, we propose exact passive-aggressive (PA) online algorithms for\nlearning to rank. The proposed algorithms can be used even when we have\ninterval labels instead of actual labels for examples. The proposed algorithms\nsolve a convex optimization problem at every trial. We find exact solution to\nthose optimization problems to determine the updated parameters. We propose\nsupport class algorithm (SCA) which finds the active constraints using the KKT\nconditions of the optimization problems. These active constrains form support\nset which determines the set of thresholds that need to be updated. We derive\nupdate rules for PA, PA-I and PA-II. We show that the proposed algorithms\nmaintain the ordering of the thresholds after every trial. We provide the\nmistake bounds of the proposed algorithms in both ideal and general settings.\nWe also show experimentally that the proposed algorithms successfully learn\naccurate classifiers using interval labels as well as exact labels. Proposed\nalgorithms also do well compared to other approaches.","url_abs":"http://arxiv.org/abs/1808.06107v1","url_pdf":"http://arxiv.org/pdf/1808.06107v1.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":"exact-passive-aggressive-algorithms-for","repo_url":"https://github.com/StuDiw/PAC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"}],"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":"StuDiw/PAC","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":"4bd2343b7d967247c41efd63a73f04f9455489538ccdef4541e7afd141c75b10","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}