{"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/approximate-inference-via-weighted-rademacher","title":"Approximate Inference via Weighted Rademacher Complexity","arxiv_id":"1801.09028","date":"2018-01-27","proceeding":null,"authors":["Jonathan Kuck","Ashish Sabharwal","Stefano Ermon"],"abstract":"Rademacher complexity is often used to characterize the learnability of a\nhypothesis class and is known to be related to the class size. We leverage this\nobservation and introduce a new technique for estimating the size of an\narbitrary weighted set, defined as the sum of weights of all elements in the\nset. Our technique provides upper and lower bounds on a novel generalization of\nRademacher complexity to the weighted setting in terms of the weighted set\nsize. This generalizes Massart's Lemma, a known upper bound on the Rademacher\ncomplexity in terms of the unweighted set size. We show that the weighted\nRademacher complexity can be estimated by solving a randomly perturbed\noptimization problem, allowing us to derive high-probability bounds on the size\nof any weighted set. We apply our method to the problems of calculating the\npartition function of an Ising model and computing propositional model counts\n(#SAT). Our experiments demonstrate that we can produce tighter bounds than\ncompeting methods in both the weighted and unweighted settings.","url_abs":"http://arxiv.org/abs/1801.09028v1","url_pdf":"http://arxiv.org/pdf/1801.09028v1.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":"approximate-inference-via-weighted-rademacher","repo_url":"https://github.com/ermongroup/weighted-rademacher","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"lemma","task_name":"LEMMA"}],"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":"ermongroup/weighted-rademacher","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":"61aaf785f8346dbeeeba908d6bc87d47d58f2045b1aff428c68f6e9bd5af1232","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}