Papers › Compressing Multisets with Large Alphabets using Bits-Back Coding

Compressing Multisets with Large Alphabets using Bits-Back Coding

15 Jul 2021arXiv:2107.09202archive 2025-07-28

Daniel Severo, James Townsend, Ashish Khisti, Alireza Makhzani, Karen Ullrich

Current methods which compress multisets at an optimal rate have computational complexity that scales linearly with alphabet size, making them too slow to be practical in many real-world settings. We show how to convert a compression algorithm for sequences into one for multisets, in exchange for an additional complexity term that is quasi-linear in sequence length. This allows us to compress multisets of exchangeable symbols at an optimal rate, with computational complexity decoupled from the alphabet size. The key insight is to avoid encoding the multiset directly, and instead compress a proxy sequence, using a technique called `bits-back coding'. We demonstrate the method experimentally on tasks which are intractable with previous optimal-rate methods: compression of multisets of images and JavaScript Object Notation (JSON) files. Code for our experiments is available at https://github.com/facebookresearch/multiset-compression.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2107.09202")

Code

Syntology Ran 1 of 8 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 1 ran with no contract checked.

By repository: official repository: 8 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

facebookresearch/multiset-compression officialmentioned in papermentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 1 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran
7unverified

Licence: 7 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from facebookresearch/multiset-compression. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

stack_extend facebookresearch/multiset-compression/multiset_codec/rans.py official repository ran MIT (permissive) · be6081790a78bd00 · report
base_message facebookresearch/multiset-compression/multiset_codec/rans.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · a22b8c105174112c · report
forward_lookup facebookresearch/multiset-compression/multiset_codec/msbst.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · fe7cac16dfb7d0bf · report
insert facebookresearch/multiset-compression/multiset_codec/msbst.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 9808281cdfa48d80 · report
load_corpus facebookresearch/multiset-compression/utils.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 49cb7524aead5cc1 · report
log2_multinomial_coeff facebookresearch/multiset-compression/utils.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · f1d52f9ab7185901 · report
remove facebookresearch/multiset-compression/multiset_codec/msbst.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 68949dba1b92959c · report
stack_slice facebookresearch/multiset-compression/multiset_codec/rans.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · f64d7790cb949a2c · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections