{"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/joint-autoregressive-and-hierarchical-priors","title":"Joint Autoregressive and Hierarchical Priors for Learned Image Compression","arxiv_id":"1809.02736","date":"2018-09-08","proceeding":"NeurIPS 2018 12","authors":["David Minnen","Johannes Ballé","George Toderici"],"abstract":"Recent models for learned image compression are based on autoencoders,\nlearning approximately invertible mappings from pixels to a quantized latent\nrepresentation. These are combined with an entropy model, a prior on the latent\nrepresentation that can be used with standard arithmetic coding algorithms to\nyield a compressed bitstream. Recently, hierarchical entropy models have been\nintroduced as a way to exploit more structure in the latents than simple fully\nfactorized priors, improving compression performance while maintaining\nend-to-end optimization. Inspired by the success of autoregressive priors in\nprobabilistic generative models, we examine autoregressive, hierarchical, as\nwell as combined priors as alternatives, weighing their costs and benefits in\nthe context of image compression. While it is well known that autoregressive\nmodels come with a significant computational penalty, we find that in terms of\ncompression performance, autoregressive and hierarchical priors are\ncomplementary and, together, exploit the probabilistic structure in the latents\nbetter than all previous learned models. The combined model yields\nstate-of-the-art rate--distortion performance, providing a 15.8% average\nreduction in file size over the previous state-of-the-art method based on deep\nlearning, which corresponds to a 59.8% size reduction over JPEG, more than 35%\nreduction compared to WebP and JPEG2000, and bitstreams 8.4% smaller than BPG,\nthe current state-of-the-art image codec. To the best of our knowledge, our\nmodel is the first learning-based method to outperform BPG on both PSNR and\nMS-SSIM distortion metrics.","url_abs":"http://arxiv.org/abs/1809.02736v1","url_pdf":"http://arxiv.org/pdf/1809.02736v1.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":"joint-autoregressive-and-hierarchical-priors","repo_url":"https://github.com/Nikolai10/Checkerboard-Context-Model","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"joint-autoregressive-and-hierarchical-priors","repo_url":"https://github.com/mandt-lab/improving-inference-for-neural-image-compression","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"joint-autoregressive-and-hierarchical-priors","repo_url":"https://github.com/InterDigitalInc/CompressAI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"image-compression","task_name":"Image Compression"},{"task_slug":"ms-ssim","task_name":"MS-SSIM"},{"task_slug":"ssim","task_name":"SSIM"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.02736","atlas_url":"https://app.syntology.ai/?focus=1809.02736","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":"1809.02736"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.02736\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.02736"},"call":"get_concepts_for_paper(arxiv_id=\"1809.02736\")"}],"by_repo":[{"repo":"Nikolai10/Checkerboard-Context-Model","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2103.15306"],"harvested_for_calls":[{"arxiv_id":"2103.15306","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.15306"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.15306\")"}]},{"repo":"mandt-lab/improving-inference-for-neural-image-compression","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.04240"],"harvested_for_calls":[{"arxiv_id":"2006.04240","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04240"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.04240\")"}]},{"repo":"InterDigitalInc/CompressAI","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1802.01436"],"harvested_for_calls":[{"arxiv_id":"1802.01436","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.01436"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.01436\")"}]}],"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":"7f5af27d73bb7cb0f58c0dae2325acff0b01825f0fb5d77864d03ab6153a2ff7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}