{"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/information-theoretic-understanding-of","title":"Information-Theoretic Understanding of Population Risk Improvement with Model Compression","arxiv_id":"1901.09421","date":"2019-01-27","proceeding":null,"authors":["Yuheng Bu","Weihao Gao","Shaofeng Zou","Venugopal V. Veeravalli"],"abstract":"We show that model compression can improve the population risk of a\npre-trained model, by studying the tradeoff between the decrease in the\ngeneralization error and the increase in the empirical risk with model\ncompression. We first prove that model compression reduces an\ninformation-theoretic bound on the generalization error; this allows for an\ninterpretation of model compression as a regularization technique to avoid\noverfitting. We then characterize the increase in empirical risk with model\ncompression using rate distortion theory. These results imply that the\npopulation risk could be improved by model compression if the decrease in\ngeneralization error exceeds the increase in empirical risk. We show through a\nlinear regression example that such a decrease in population risk due to model\ncompression is indeed possible. Our theoretical results further suggest that\nthe Hessian-weighted $K$-means clustering compression approach can be improved\nby regularizing the distance between the clustering centers. We provide\nexperiments with neural networks to support our theoretical assertions.","url_abs":"http://arxiv.org/abs/1901.09421v1","url_pdf":"http://arxiv.org/pdf/1901.09421v1.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":"information-theoretic-understanding-of","repo_url":"https://github.com/wgao9/weight_quant","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"model-compression","task_name":"Model Compression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.09421","atlas_url":"https://app.syntology.ai/?focus=1901.09421","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":"1901.09421"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.09421\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.09421"},"call":"get_concepts_for_paper(arxiv_id=\"1901.09421\")"}],"by_repo":[{"repo":"wgao9/weight_quant","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":"1e18c875dd0178b89186e4f64943e0c8020773770ea7e8d9554d774c6b368c41","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}