Papers › Neural Implicit Dictionary via Mixture-of-Expert Training

Neural Implicit Dictionary via Mixture-of-Expert Training

8 Jul 2022arXiv:2207.03691archive 2025-07-28

Peihao Wang, Zhiwen Fan, Tianlong Chen, Zhangyang Wang

Representing visual signals by coordinate-based deep fully-connected networks has been shown advantageous in fitting complex details and solving inverse problems than discrete grid-based representation. However, acquiring such a continuous Implicit Neural Representation (INR) requires tedious per-scene training on tons of signal measurements, which limits its practicality. In this paper, we present a generic INR framework that achieves both data and training efficiency by learning a Neural Implicit Dictionary (NID) from a data collection and representing INR as a functional combination of basis sampled from the dictionary. Our NID assembles a group of coordinate-based subnetworks which are tuned to span the desired function space. After training, one can instantly and robustly acquire an unseen scene representation by solving the coding coefficients. To parallelly optimize a large group of networks, we borrow the idea from Mixture-of-Expert (MoE) to design and train our network with a sparse gating mechanism. Our experiments show that, NID can improve reconstruction of 2D images or 3D scenes by 2 orders of magnitude faster with up to 98% less input data. We further demonstrate various applications of NID in image inpainting and occlusion removal, which are considered to be challenging with vanilla INR. Our codes are available in https://github.com/VITA-Group/Neural-Implicit-Dict.

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 15 code samples harvested from 1 repository linked to this paper: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified; every one of the 6 samples that ran constructed an object rather than computing a result. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 15 samples from 1 repository, 6 ran (6 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 on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

vita-group/neural-implicit-dict officialmentioned in papermentioned on GitHubpytorchSyntology: 15 samples, 6 ran (0 instrument-failed) · 9 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

15 samples harvested: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified; every one of the 6 samples that ran constructed an object rather than computing a result. “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.

6ran
9unverified

Licence: 0 of the 15 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 vita-group/neural-implicit-dict. “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”. For 5 samples that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

vita-group/neural-implicit-dict official repository 15 samples, 6 ran (0 instrument-failed) · 9 unverified
FCBlock in 8 papers models.py ran · metamorphic tier: deterministic MIT (permissive) · f756e1bf1683ec39 · report fixture: returned FCBlock · level recorded 2026-09-22
FourierFeatMapping models.py ran · metamorphic tier: deterministic MIT (permissive) · 590a7e6aebd2a441 · report fixture: returned FourierFeatMapping · level recorded 2026-09-22
IdentityMapping models.py ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · dfa297410a3da3e6 · report fixture: returned IdentityMapping · level recorded 2026-09-22
PositionalEncoding in 126 papers
census: 13 implementations from 9 papers, 9 distinct outputs across 5 buckets, one shared input per bucket
models.py ran · metamorphic tier: deterministic MIT (permissive) · 8c22d93e4d7f89e3 · report fixture: returned PositionalEncoding · level recorded 2026-09-22
RBFLayer models.py ran · metamorphic tier: deterministic MIT (permissive) · 6049ee59a61d0375 · report fixture: returned RBFLayer · level recorded 2026-09-22
Sine in 13 papers models.py ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · f725c8f70ba37716 · report fixture: returned Sine · level recorded 2026-09-22
INRMoE models.py unverified MIT (permissive) · b37256b41cf55cbd · report
INRNet models.py unverified MIT (permissive) · d64923580e745bc2 · report
MoECombiner models.py unverified MIT (permissive) · ba9654f756e1e1f1 · report
RandomFourierMapping models.py unverified MIT (permissive) · c91e5d7bfb64a8ee · report
init_weights_elu models.py unverified MIT (permissive) · c342d1c15dad9826 · report
init_weights_normal in 5 papers models.py unverified MIT (permissive) · 6b8816b6be7c9e2b · report
init_weights_relu models.py unverified MIT (permissive) · 07ca9e05bd1b5378 · report
init_weights_selu models.py unverified MIT (permissive) · 5f4fed9f6dd565ef · report
init_weights_xavier in 5 papers models.py unverified MIT (permissive) · 9d952dc991e7ac2e · 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 Neural Implicit Dictionary (graph method: Neural Implicit Dictionary). 17 bricks; individually on a fixture: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified; every one of the 6 samples that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

  1. INRMoE entry · level 0 · unverified · b37256b41cf55cbd
  2. INRNet helper · level 0 · unverified · d64923580e745bc2
  3. MoECombiner helper · level 0 · unverified · ba9654f756e1e1f1
  4. FCBlock model · level 1 · ran · f756e1bf1683ec39
  5. FourierFeatMapping helper · level 1 · ran · 590a7e6aebd2a441
  6. IdentityMapping helper · level 1 · ran · dfa297410a3da3e6
  7. PositionalEncoding helper · level 1 · ran · 8c22d93e4d7f89e3
  8. RBFLayer helper · level 1 · ran · 6049ee59a61d0375
  9. RandomFourierMapping helper · level 0 · unverified · c91e5d7bfb64a8ee
  10. Sine helper · level 1 · ran · f725c8f70ba37716
  11. first_layer_sine_init helper · level 0 · unverified · 2960e2b2441e1027
  12. init_weights_elu helper · level 0 · unverified · c342d1c15dad9826
  13. init_weights_normal helper · level 0 · unverified · 6b8816b6be7c9e2b
  14. init_weights_relu helper · level 0 · unverified · 07ca9e05bd1b5378
  15. init_weights_selu helper · level 0 · unverified · 5f4fed9f6dd565ef
  16. init_weights_xavier helper · level 0 · unverified · 9d952dc991e7ac2e
  17. sine_init helper · level 0 · unverified · 0bef15aad24e7f4a

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="2207.03691") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Image Inpainting

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Inpainting

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