Papers › Transformer Meets Boundary Value Inverse Problems

Transformer Meets Boundary Value Inverse Problems

29 Sep 2022arXiv:2209.14977archive 2025-07-28

Ruchi Guo, Shuhao Cao, Long Chen

A Transformer-based deep direct sampling method is proposed for electrical impedance tomography, a well-known severely ill-posed nonlinear boundary value inverse problem. A real-time reconstruction is achieved by evaluating the learned inverse operator between carefully designed data and the reconstructed images. An effort is made to give a specific example to a fundamental question: whether and how one can benefit from the theoretical structure of a mathematical problem to develop task-oriented and structure-conforming deep neural networks? Specifically, inspired by direct sampling methods for inverse problems, the 1D boundary data in different frequencies are preprocessed by a partial differential equation-based feature map to yield 2D harmonic extensions as different input channels. Then, by introducing learnable non-local kernels, the direct sampling is recast to a modified attention mechanism. The new method achieves superior accuracy over its predecessors and contemporary operator learners and shows robustness to noises in benchmarks. This research shall strengthen the insights that, despite being invented for natural language processing tasks, the attention mechanism offers great flexibility to be modified in conformity with the a priori mathematical knowledge, which ultimately leads to the design of more physics-compatible neural architectures.

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

By repository: official repository: 12 samples from 1 repository, 5 ran (5 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 6 samples from 2 repositories, 5 ran (5 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-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

scaomath/eit-transformer officialmentioned in papermentioned on GitHubpytorchSyntology: 12 samples, 5 ran (0 instrument-failed) · 7 unverified report
zenki229/aais_pinn mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
zenki229/tmcfpinn mentioned on GitHubpytorchMITSyntology: 5 samples, 4 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

18 samples harvested: 10 ran (of which 6 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 8 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.

10ran
8unverified

Licence: 0 of the 18 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 3 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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 4 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.

scaomath/eit-transformer official repository 12 samples, 5 ran (0 instrument-failed) · 7 unverified
BasicBlock in 126 papers
census: 6 implementations from 6 papers, 5 distinct outputs on one shared input
libs/hut.py ran fingerprinted MIT (permissive) · cc18719516f10d04 · report fixture: returned BasicBlock · level recorded 2026-09-22
BottleneckBlock in 5 papers libs/hut.py ran fingerprinted MIT (permissive) · 24a9a41f13af71f1 · report fixture: returned BottleneckBlock · level recorded 2026-09-22
RelativePositionBias libs/hut.py ran MIT (permissive) · 6dfbfb40a3f1069b · report fixture: returned RelativePositionBias · level recorded 2026-09-22
down_block in 6 papers libs/hut.py ran fingerprinted MIT (permissive) · cce566136eb91588 · report fixture: returned down_block · level recorded 2026-09-22
up_block in 6 papers libs/hut.py ran MIT (permissive) · 8caf576fea0ddaef · report fixture: returned up_block · level recorded 2026-09-22
BasicTransBlock libs/hut.py unverified MIT (permissive) · 04fb07399a8c0557 · report
BasicTransDecoderBlock libs/hut.py unverified MIT (permissive) · 1867fed83e7549a9 · report
HybridUT libs/hut.py unverified MIT (permissive) · 73192eb40023eb4e · report
LinearAttention in 20 papers libs/hut.py unverified MIT (permissive) · 083b5d5af368508a · report
LinearAttentionDecoder libs/hut.py unverified MIT (permissive) · af529b0cb3755654 · report
down_block_trans libs/hut.py unverified MIT (permissive) · b6af3b0a7e0023b9 · report
up_block_trans libs/hut.py unverified MIT (permissive) · d2839e542dc3f87b · report
zenki229/aais_pinn community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
DeepNeuralNet libs/deep_neural_net.py ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 30e6196656eb2ec7 · report fixture: returned DeepNeuralNet · level recorded 2026-09-22
zenki229/tmcfpinn community (archive-listed) 5 samples, 4 ran (0 instrument-failed) · 1 unverified
float_token reference_solvers/lshape_2d/generate_lshape_reference.py ran fingerprinted MIT (permissive) · 79d54eaacbf71604 · report fixture: signature value:float/0/float · returned str · level recorded 2026-09-25
frac_bdf_coeff reference_solvers/lshape_2d/generate_lshape_reference.py ran fingerprinted MIT (permissive) · e552f66cdeb2fc00 · report fixture: signature n_coeffs:int/0/int, alpha:float/0/float · returned ndarray · level recorded 2026-09-25
initial_profile reference_solvers/lshape_2d/generate_lshape_reference.py ran fingerprinted MIT (permissive) · 1bcc22fc4ff56de8 · report fixture: signature x:ndarray/2/float, y:ndarray/2/float · returned ndarray · level recorded 2026-09-25
setup_wandb in 13 papers src/utils/experiments.py ran MIT (permissive) · d562a082cac25629 · report fixture: signature cfg:DictConfig/0/?, model:callable/0/? · returned NoopRun · level recorded 2026-09-25
mitlef src/physics/fractional.py unverified MIT (permissive) · 3a2f5f3bd29e6bae · 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. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

2 assemblies on this paper: 2 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

2 sibling assemblies for Transformer-based deep direct sampling method (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for Transformer-based deep direct sampling method (graph method: Transformer-based deep direct sampling method). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 2 siblings

  1. DeepNeuralNet entry · level 1 · ran · 30e6196656eb2ec7

harvested Assembly for Transformer-based deep direct sampling method (graph method: Transformer-based deep direct sampling method). 14 bricks; individually on a fixture: 7 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. HybridUT entry · level 0 · unverified · 73192eb40023eb4e
  2. BasicBlock helper · level 1 · ran · cc18719516f10d04
  3. BasicTransBlock model · level 0 · unverified · 04fb07399a8c0557
  4. down_block helper · level 1 · ran · cce566136eb91588
  5. down_block_trans helper · level 0 · unverified · b6af3b0a7e0023b9
  6. up_block helper · level 1 · ran · 8caf576fea0ddaef
  7. up_block_trans helper · level 0 · unverified · d2839e542dc3f87b
  8. conv3x3 helper · level 1 · ran · our draft was wrong · 583f9780bdd00a45
  9. LinearAttention model · level 0 · unverified · 083b5d5af368508a
  10. BottleneckBlock helper · level 1 · ran · 24a9a41f13af71f1
  11. BasicTransDecoderBlock model · level 0 · unverified · 1867fed83e7549a9
  12. RelativePositionBias helper · level 1 · ran · 6dfbfb40a3f1069b
  13. conv1x1 helper · level 1 · ran · our draft was wrong · be3fea8e6f5db9c7
  14. LinearAttentionDecoder helper · level 0 · unverified · af529b0cb3755654

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

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