Papers › DataMUX: Data Multiplexing for Neural Networks

DataMUX: Data Multiplexing for Neural Networks

18 Feb 2022arXiv:2202.09318archive 2025-07-28

Vishvak Murahari, Carlos E. Jimenez, Runzhe Yang, Karthik Narasimhan

In this paper, we introduce data multiplexing (DataMUX), a technique that enables deep neural networks to process multiple inputs simultaneously using a single compact representation. DataMUX demonstrates that neural networks are capable of generating accurate predictions over mixtures of inputs, resulting in increased throughput with minimal extra memory requirements. Our approach uses two key components -- 1) a multiplexing layer that performs a fixed linear transformation to each input before combining them to create a mixed representation of the same size as a single input, which is then processed by the base network, and 2) a demultiplexing layer that converts the base network's output back into independent representations before producing predictions for each input. We show the viability of DataMUX for different architectures (Transformers, and to a lesser extent MLPs and CNNs) across six different tasks spanning sentence classification, named entity recognition and image classification. For instance, DataMUX for Transformers can multiplex up to 20x/40x inputs, achieving 11x/18x increase in throughput with minimal absolute performance drops of <2% and <4% respectively on MNLI, a natural language inference task. We also provide a theoretical construction for multiplexing in self-attention networks and analyze the effect of various design elements in DataMUX.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 9 code samples harvested from 1 repository linked to this paper: 8 ran (of which 3 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 9 samples from 1 repository, 8 ran (8 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

princeton-nlp/datamux officialmentioned in paperpytorchSyntology: 9 samples, 8 ran (0 instrument-failed) · 1 unverified 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

9 samples harvested: 8 ran (of which 3 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · honoured contract
6ran
1unverified

Licence: 9 of the 9 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 princeton-nlp/datamux. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

princeton-nlp/datamux official repository 9 samples, 8 ran (0 instrument-failed) · 1 unverified
RetrievalHeadIndexDemultiplexing models/multiplexing.py ran licence not identified · pointer only · 4573eece1b643ae9 · report fixture: signature features:Tensor/3/float, instance_labels:Tensor/2/int · returned Tensor · level recorded 2026-09-24
RetrievalHeadMLPDemultiplexing models/multiplexing.py ran fingerprinted licence not identified · pointer only · 1f9ba0adc7fd6702 · report fixture: signature features:Tensor/3/float, instance_labels:Tensor/2/int · returned Tensor · level recorded 2026-09-24
RobertaIndexDemultiplexerSequenceClassification models/multiplexing.py ran fingerprinted licence not identified · pointer only · 546ff05a58f372a4 · report fixture: signature features:Tensor/3/float · returned tuple · level recorded 2026-09-24
RobertaMLPDemultiplexerSequenceClassification models/multiplexing.py ran · metamorphic tier: deterministic licence not identified · pointer only · 807966683fd8b592 · report fixture: returned RobertaMLPDemultiplexerSequenceClassification · level recorded 2026-09-22
RobertaMLPDemuxModule models/multiplexing.py ran · metamorphic tier: deterministic licence not identified · pointer only · cfe0543d2ad4dc5f · report fixture: returned RobertaMLPDemuxModule · level recorded 2026-09-22
SequenceClassifierOutputMuxed models/multiplexing.py ran · metamorphic tier: deterministic licence not identified · pointer only · 165182edd4643caa · report fixture: returned SequenceClassifierOutputMuxed · level recorded 2026-09-22
binary_encoding models/multiplexing.py ran · honoured contract licence not identified · pointer only · 181f1d62d685220a · report fixture: signature max_position:int/0/int, d_model:int/0/int, epsilon:float/0/float · returned Tensor · level recorded 2026-09-22
random_encoding models/multiplexing.py ran · honoured contract fingerprinted licence not identified · pointer only · 8e9f043a6aacef9a · report fixture: signature max_positions:int/0/int, d_model:int/0/int, norm:int/0/int · returned Tensor · level recorded 2026-09-22
RobertaSequenceClassificationMuxed models/multiplexing.py unverified licence not identified · pointer only · 8a784cafcc4e2bf4 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for DataMUX (graph method: DataMUX). 9 bricks; individually on a fixture: 8 ran (of which 3 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. The assembly has not been run end-to-end.

  1. RobertaSequenceClassificationMuxed entry · level 0 · unverified · 8a784cafcc4e2bf4
  2. RetrievalHeadIndexDemultiplexing model · level 1 · ran · 4573eece1b643ae9
  3. RetrievalHeadMLPDemultiplexing helper · level 1 · ran · 1f9ba0adc7fd6702
  4. RobertaIndexDemultiplexerSequenceClassification model · level 1 · ran · 546ff05a58f372a4
  5. RobertaMLPDemultiplexerSequenceClassification model · level 1 · ran · 807966683fd8b592
  6. SequenceClassifierOutputMuxed model · level 1 · ran · 165182edd4643caa
  7. binary_encoding helper · level 1 · ran · honoured contract · 181f1d62d685220a
  8. random_encoding helper · level 1 · ran · honoured contract · 8e9f043a6aacef9a
  9. RobertaMLPDemuxModule helper · level 1 · ran · cfe0543d2ad4dc5f

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2202.09318") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Image ClassificationNamed Entity RecognitionNamed Entity Recognition (NER)Natural Language InferenceSentenceSentence Classificationimage-classificationnamed-entity-recognition

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

BASE

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