{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/towards-empirical-sandwich-bounds-on-the-rate-1","title":"Towards Empirical Sandwich Bounds on the Rate-Distortion Function","arxiv_id":"2111.12166","date":"2021-11-23","proceeding":"ICLR 2022 4","authors":["Yibo Yang","Stephan Mandt"],"abstract":"Rate-distortion (R-D) function, a key quantity in information theory, characterizes the fundamental limit of how much a data source can be compressed subject to a fidelity criterion, by any compression algorithm. As researchers push for ever-improving compression performance, establishing the R-D function of a given data source is not only of scientific interest, but also sheds light on the possible room for improving compression algorithms. Previous work on this problem relied on distributional assumptions on the data source (Gibson, 2017) or only applied to discrete data (Blahut, 1972; Arimoto, 1972). By contrast, this paper makes the first attempt at an algorithm for sandwiching the R-D function of a general (not necessarily discrete) source requiring only i.i.d. data samples. We estimate R-D sandwich bounds for a variety of artificial and real-world data sources, in settings far beyond the feasibility of any known method, and shed light on the optimality of neural data compression (Ball\\'e et al., 2021; Yang et al., 2022). Our R-D upper bound on natural images indicates theoretical room for improving state-of-the-art image compression methods by at least one dB in PSNR at various bitrates. Our data and code can be found at https://github.com/mandt-lab/empirical-RD-sandwich.","url_abs":"https://arxiv.org/abs/2111.12166v2","url_pdf":"https://arxiv.org/pdf/2111.12166v2.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":"towards-empirical-sandwich-bounds-on-the-rate-1","repo_url":"https://github.com/mandt-lab/RD-sandwich","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"towards-empirical-sandwich-bounds-on-the-rate-1","repo_url":"https://github.com/mandt-lab/empirical-RD-sandwich","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"data-compression","task_name":"Data Compression"},{"task_slug":"image-compression","task_name":"Image Compression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2111.12166","atlas_url":"https://app.syntology.ai/?focus=2111.12166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12166"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mandt-lab/RD-sandwich","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mandt-lab/empirical-RD-sandwich","reach":{"status":"ok"}}],"summary":{"ran_violates":1,"ran_fixture":1},"by_repo_kind":{"official":{"samples":2,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"samples":[{"code_sha256_prefix":"0a71922be746c35c","entry":"check_no_decoder","repo":"mandt-lab/RD-sandwich","repo_kind":"official","path":"rdub_mlp.py","file_url":"https://github.com/mandt-lab/RD-sandwich/blob/HEAD/rdub_mlp.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"0a71922be746c35c"}},{"code_sha256_prefix":"8990bc7ed16e05ad","entry":"get_runname","repo":"mandt-lab/RD-sandwich","repo_kind":"official","path":"rdub_mlp.py","file_url":"https://github.com/mandt-lab/RD-sandwich/blob/HEAD/rdub_mlp.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8990bc7ed16e05ad"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}