{"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/incremental-sparse-bayesian-ordinal","title":"Incremental Sparse Bayesian Ordinal Regression","arxiv_id":"1806.06553","date":"2018-06-18","proceeding":null,"authors":["Chang Li","Maarten de Rijke"],"abstract":"Ordinal Regression (OR) aims to model the ordering information between\ndifferent data categories, which is a crucial topic in multi-label learning. An\nimportant class of approaches to OR models the problem as a linear combination\nof basis functions that map features to a high dimensional non-linear space.\nHowever, most of the basis function-based algorithms are time consuming. We\npropose an incremental sparse Bayesian approach to OR tasks and introduce an\nalgorithm to sequentially learn the relevant basis functions in the ordinal\nscenario. Our method, called Incremental Sparse Bayesian Ordinal Regression\n(ISBOR), automatically optimizes the hyper-parameters via the type-II maximum\nlikelihood method. By exploiting fast marginal likelihood optimization, ISBOR\ncan avoid big matrix inverses, which is the main bottleneck in applying basis\nfunction-based algorithms to OR tasks on large-scale datasets. We show that\nISBOR can make accurate predictions with parsimonious basis functions while\noffering automatic estimates of the prediction uncertainty. Extensive\nexperiments on synthetic and real word datasets demonstrate the efficiency and\neffectiveness of ISBOR compared to other basis function-based OR approaches.","url_abs":"http://arxiv.org/abs/1806.06553v1","url_pdf":"http://arxiv.org/pdf/1806.06553v1.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":"incremental-sparse-bayesian-ordinal","repo_url":"https://github.com/chang-li/SBOR","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"multi-label-learning","task_name":"Multi-Label Learning"},{"task_slug":"regression-1","task_name":"regression"}],"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":"chang-li/SBOR","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":"4f6c374506768b066b0f7f08a3cdaab94060f5f0696ef7364797370f46574fdf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}