{"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/cae-admm-implicit-bitrate-optimization-via","title":"CAE-ADMM: Implicit Bitrate Optimization via ADMM-based Pruning in Compressive Autoencoders","arxiv_id":"1901.07196","date":"2019-01-22","proceeding":null,"authors":["Haimeng Zhao","Peiyuan Liao"],"abstract":"We introduce ADMM-pruned Compressive AutoEncoder (CAE-ADMM) that uses\nAlternative Direction Method of Multipliers (ADMM) to optimize the trade-off\nbetween distortion and efficiency of lossy image compression. Specifically,\nADMM in our method is to promote sparsity to implicitly optimize the bitrate,\ndifferent from entropy estimators used in the previous research. The\nexperiments on public datasets show that our method outperforms the original\nCAE and some traditional codecs in terms of SSIM/MS-SSIM metrics, at reasonable\ninference speed.","url_abs":"http://arxiv.org/abs/1901.07196v4","url_pdf":"http://arxiv.org/pdf/1901.07196v4.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":"cae-admm-implicit-bitrate-optimization-via","repo_url":"https://github.com/JasonZHM/CAE-ADMM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"cae-admm-implicit-bitrate-optimization-via","repo_url":"https://github.com/JasonZHM/CAEP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"image-compression","task_name":"Image Compression"},{"task_slug":"ms-ssim","task_name":"MS-SSIM"},{"task_slug":"architecture-search","task_name":"Neural Architecture Search"},{"task_slug":"ssim","task_name":"SSIM"}],"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":"JasonZHM/CAE-ADMM","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"JasonZHM/CAEP","kind":"official","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":"9df70e83002673a4a82042fa0c37435db271e298f5909bebeb97127008cde3e3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}