{"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/practical-full-resolution-learned-lossless","title":"Practical Full Resolution Learned Lossless Image Compression","arxiv_id":"1811.12817","date":"2018-11-30","proceeding":"CVPR 2019 6","authors":["Fabian Mentzer","Eirikur Agustsson","Michael Tschannen","Radu Timofte","Luc van Gool"],"abstract":"We propose the first practical learned lossless image compression system, L3C, and show that it outperforms the popular engineered codecs, PNG, WebP and JPEG 2000. At the core of our method is a fully parallelizable hierarchical probabilistic model for adaptive entropy coding which is optimized end-to-end for the compression task. In contrast to recent autoregressive discrete probabilistic models such as PixelCNN, our method i) models the image distribution jointly with learned auxiliary representations instead of exclusively modeling the image distribution in RGB space, and ii) only requires three forward-passes to predict all pixel probabilities instead of one for each pixel. As a result, L3C obtains over two orders of magnitude speedups when sampling compared to the fastest PixelCNN variant (Multiscale-PixelCNN). Furthermore, we find that learning the auxiliary representation is crucial and outperforms predefined auxiliary representations such as an RGB pyramid significantly.","url_abs":"https://arxiv.org/abs/1811.12817v3","url_pdf":"https://arxiv.org/pdf/1811.12817v3.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":"practical-full-resolution-learned-lossless","repo_url":"https://github.com/fab-jul/L3C-PyTorch","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"practical-full-resolution-learned-lossless","repo_url":"https://github.com/PaulEmmanuelSotir/DeepCV","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"practical-full-resolution-learned-lossless","repo_url":"https://github.com/fab-jul/torchac","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"practical-full-resolution-learned-lossless","repo_url":"https://github.com/tuatruog/astrocompress","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"image-compression","task_name":"Image Compression"}],"methods":[{"method_slug":"pixelcnn","method_name":"PixelCNN"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-compression-on-imagenet32","task":"Image Compression","dataset":"ImageNet32","model":"L3C","rank_in_archive_order":3,"of":5,"metrics":{"bpsp":"4.76"},"uses_additional_data":false},{"leaderboard":"/sota/image-compression-on-imagenet32","task":"Image Compression","dataset":"ImageNet32","model":"JPEG2000","rank_in_archive_order":4,"of":5,"metrics":{"bpsp":"6.35"},"uses_additional_data":false},{"leaderboard":"/sota/image-compression-on-imagenet32","task":"Image Compression","dataset":"ImageNet32","model":"PNG","rank_in_archive_order":5,"of":5,"metrics":{"bpsp":"6.42"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.12817","atlas_url":"https://app.syntology.ai/?focus=1811.12817","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":"1811.12817"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.12817\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.12817"},"call":"get_concepts_for_paper(arxiv_id=\"1811.12817\")"}],"by_repo":[{"repo":"fab-jul/L3C-PyTorch","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PaulEmmanuelSotir/DeepCV","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1904.12848"],"harvested_for_calls":[{"arxiv_id":"1904.12848","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.12848"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.12848\")"}]},{"repo":"fab-jul/torchac","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tuatruog/astrocompress","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2506.08306"],"harvested_for_calls":[{"arxiv_id":"2506.08306","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2506.08306"},"call":"get_harvested_code_for_paper(arxiv_id=\"2506.08306\")"}]}],"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":"885129e1c07c6453e9f019063460b3615ec024572efc45f6e9bb42b1ff1fd191","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}