{"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/scalable-bayesian-rule-lists","title":"Scalable Bayesian Rule Lists","arxiv_id":"1602.08610","date":"2016-02-27","proceeding":"ICML 2017 8","authors":["Hongyu Yang","Cynthia Rudin","Margo Seltzer"],"abstract":"We present an algorithm for building probabilistic rule lists that is two\norders of magnitude faster than previous work. Rule list algorithms are\ncompetitors for decision tree algorithms. They are associative classifiers, in\nthat they are built from pre-mined association rules. They have a logical\nstructure that is a sequence of IF-THEN rules, identical to a decision list or\none-sided decision tree. Instead of using greedy splitting and pruning like\ndecision tree algorithms, we fully optimize over rule lists, striking a\npractical balance between accuracy, interpretability, and computational speed.\nThe algorithm presented here uses a mixture of theoretical bounds (tight enough\nto have practical implications as a screening or bounding procedure),\ncomputational reuse, and highly tuned language libraries to achieve\ncomputational efficiency. Currently, for many practical problems, this method\nachieves better accuracy and sparsity than decision trees; further, in many\ncases, the computational time is practical and often less than that of decision\ntrees. The result is a probabilistic classifier (which estimates P(y = 1|x) for\neach x) that optimizes the posterior of a Bayesian hierarchical model over rule\nlists.","url_abs":"http://arxiv.org/abs/1602.08610v2","url_pdf":"http://arxiv.org/pdf/1602.08610v2.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":"scalable-bayesian-rule-lists","repo_url":"https://github.com/corels/corels","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"scalable-bayesian-rule-lists","repo_url":"https://github.com/corels/rcppcorels","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"scalable-bayesian-rule-lists","repo_url":"https://github.com/csinva/imodels","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"scalable-bayesian-rule-lists","repo_url":"https://github.com/eddelbuettel/rcppcorels","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"scalable-bayesian-rule-lists","repo_url":"https://github.com/nlarusstone/corels","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"scalable-bayesian-rule-lists","repo_url":"https://github.com/fingoldin/pycorels","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"scalable-bayesian-rule-lists","repo_url":"https://github.com/saligrama/rcorels","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.08610","atlas_url":"https://app.syntology.ai/?focus=1602.08610","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1602.08610"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.08610\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.08610"},"call":"get_concepts_for_paper(arxiv_id=\"1602.08610\")"}],"by_repo":[{"repo":"corels/corels","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"corels/rcppcorels","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"csinva/imodels","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2202.00858"],"harvested_for_calls":[{"arxiv_id":"2202.00858","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.00858"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.00858\")"}]},{"repo":"eddelbuettel/rcppcorels","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"nlarusstone/corels","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"fingoldin/pycorels","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"saligrama/rcorels","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"52f55e5edc07e1c1e88e4909c31cd83a437f0ea85fae1107d15f9590eb9ad637","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}