Original: T RANSFORMER M EETS B OUNDARY V ALUE I NVERSE P ROBLEMS
Revised: T RANSFORMER M EETS B OUNDARY V ALUE I NVERSE P ROBLEMS

Original: Anonymous authors
Revised: Anonymous authors

Original: Paper under double-blind review
Revised: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: A Transformer-based deep direct sampling method is proposed for a class of boundary value inverse problems.
Revised: A Transformer-based deep direct sampling method is proposed for a class of boundary value inverse problems.

Original: A real-time reconstruction is achieved by evaluating the learned inverse operator between carefully designed data and the reconstructed images.
Revised: A real-time reconstruction is achieved by evaluating the learned inverse operator between carefully designed data and the reconstructed images.

Original: 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?
Revised: 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?

Original: 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.
Revised: 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.

Original: Then, by introducing learnable non-local kernels, the direct sampling is recast to a modified attention mechanism.
Revised: Then, by introducing learnable non-local kernels, the direct sampling is recast to a modified attention mechanism.

Original: The proposed method is then applied to electrical impedance tomography, a well-known severely ill-posed nonlinear inverse problem.
Revised: The proposed method is then applied to electrical impedance tomography, a well-known severely ill-posed nonlinear inverse problem.

Original: The new method achieves superior accuracy over its predecessors and contemporary operator learners, as well as shows robustness with respect to noise.
Revised: The new method achieves superior accuracy over its predecessors and contemporary operator learners, as well as shows robustness with respect to noise.

Original: This research shall strengthen the insights that the attention mechanism, despite being invented for natural language processing tasks, 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.
Revised: This research shall strengthen the insights that the attention mechanism, despite being invented for natural language processing tasks, 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.

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: Boundary value inverse problems aim to recover the internal structure or distribution of multiple media inside an object (2D reconstruction) based on only the data available on the boundary (1D signal input), which arise from many imaging techniques, e.g., electrical impedance tomography (EIT) (Holder, 2004), diffuse optical tomography (DOT)
Revised: Boundary value inverse problems aim to recover the internal structure or distribution of multiple media inside an object (2D reconstruction) based on only the data available on the boundary (1D signal input), which arise from many imaging techniques, e.g., electrical impedance tomography (EIT) (Holder, 2004), diffuse optical tomography (DOT)

Original: (Culver et al., 2003), magnetic induction tomography (MIT)
Revised: (Culver et al., 2003), magnetic induction tomography (MIT)

Original: (Griffiths et al., 1999).
Revised: (Griffiths et al., 1999).

Original: Not needing any internal data renders these techniques generally non-invasive, safe, cheap, and thus quite suitable for monitoring applications.
Revised: Not needing any internal data renders these techniques generally non-invasive, safe, cheap, and thus quite suitable for monitoring applications.

Original: In this work, we shall take EIT as an example to illustrate how a more structure-conforming neural network architecture leads to better results in certain physics-based tasks.
Revised: In this work, we shall take EIT as an example to illustrate how a more structure-conforming neural network architecture leads to better results in certain physics-based tasks.

Original: Given a 2D bounded domain Ω and an inclusion D , the forward model is the following partial differential equation (PDE)
Revised: Given a 2D bounded domain Ω and an inclusion D , the forward model is the following partial differential equation (PDE)

Original: [Equation]
Revised: [Equation]

Original: where σ 0 and σ 1 are two (approximately) known constants, e.g., σ 0 = 1 and σ 1 = 10 , but the shape of the inclusion D buried in Ω is unknown.
Revised: where σ 0 and σ 1 are two (approximately) known constants, e.g., σ 0 = 1 and σ 1 = 10 , but the shape of the inclusion D buried in Ω is unknown.

Original: The goal is to recover the shape of D using only the boundary data on ∂ Ω (Figure 1).
Revised: The goal is to recover the shape of D using only the boundary data on ∂ Ω (Figure 1).

Original: Specifically, by exerting a current g on the boundary, one solves (1) with the Neumann boundary condition σ ∇ u · n | ∂ Ω = g  to get a unique u on the whole domain Ω .
Revised: Specifically, by exerting a current g on the boundary, one solves (1) with the Neumann boundary condition σ ∇ u · n | ∂ Ω = g , where n is the outwards unit normal direction of ∂ Ω , to get a unique u on the whole domain Ω .

Original: However, what can be measured  is only the Dirichlet boundary value representing the voltages u | ∂ Ω on the boundary.
Revised: What can be measured in practice is only the Dirichlet boundary value representing the voltages u | ∂ Ω on the boundary.

Original: This procedure is called Neumann-to-Dirichlet (NtD) mapping (for various notations and the Sobolev space formalism we refer readers to Appendix A):
Revised: This procedure is called Neumann-to-Dirichlet (NtD) mapping:

Original: [Equation]
Revised: [Equation]

Revised: For various notations and the Sobolev space formalism we refer readers to Appendix A; for a brief review of the theoretical background of EIT we refer readers to Appendix B.

Original: The NtD map  in (2) can be expressed as
Revised: The NtD map above in (2) can be expressed as

Original: [Equation]
Revised: [Equation]

Original:  where g and f are (infinite dimensional) vector representations of functions g and f relative to a chosen basis, and A σ is the matrix representation of Λ σ (see Appendix B for an example).[Figure]
Revised: [Figure] where g and f are (infinite dimensional) vector representations of functions g and f relative to a chosen basis, and A σ is the matrix representation of Λ σ (see Appendix B for an example).

Original: The original mathematical setup of EIT is to use the NtD map Λ σ in (2) to recover σ , referred to as the case of full measurement (Calderón, 2006).
Revised: The original mathematical setup of EIT is to use the NtD map Λ σ in (2) to recover σ , referred to as the case of full measurement (Calderón, 2006).

Original: In this case, the forward and inverse operators associated with EIT can be formulated as
Revised: In this case, the forward and inverse operators associated with EIT can be formulated as

Original: [Equation]
Revised: [Equation]

Original: Fix a set of basis { g l } ∞ l =1 of the corresponding Hilbert space containing all admissible currents.
Revised: Fix a set of basis { g l } ∞ l =1 of the corresponding Hilbert space containing all admissible currents.

Original: Then, mathematically speaking, “knowing the operator Λ σ ” means that one can measure all the current-to-voltage pairs { g l , f l := Λ σ g l } ∞ l =1 and construct the infinite  matrix A σ .
Revised: Then, mathematically speaking, “knowing the operator Λ σ ” means that one can measure all the current-to-voltage pairs { g l , f l := Λ σ g l } ∞ l =1 and construct the infinite dimensional matrix A σ .

Original: However, as infinitely many boundary data pairs is not attainable in practice, the problem of more practical interests is to use only a few data pairs { ( g l , f l ) } Ll =1 for reconstruction.
Revised: However, as infinitely many boundary data pairs is not attainable in practice, the problem of more practical interests is to use only a few data pairs { ( g l , f l ) } Ll =1 for reconstruction.

Original: In this case, the forward and inverse problems can be formulated as
Revised: In this case, the forward and inverse problems can be formulated as

Original: [Equation]
Revised: [Equation]

Original: and
Revised: and

Original: [Equation]
Revised: [Equation]

Original: For limited data pairs, the inverse operator above is extremely ill-posed or even not well-defined (Isakov & Powell, 1990; Barceló et al., 1994; Kang & Seo, 2001; Lionheart, 2004); namely, the same boundary measurements may correspond to different σ .
Revised: For limited data pairs, the inverse operator F − 1 L is extremely ill-posed or even not well-defined (Isakov & Powell, 1990; Barceló et al., 1994; Kang & Seo, 2001; Lionheart, 2004); namely, the same boundary measurements may correspond to different σ .

Original: In view of the matrix representation A σ , L being small (very limited data pairs) is not enough to yield any reasonably good approximation of

Original:  A σ in (3). For example, when g l = e l , l = 1 , ..., L , with e l being unit vectors of a chosen basis, ( f 1 , ..., f L ) only gives the first L columns of A σ .
Revised: In view of the matrix representation A σ , for g l = e l , l = 1 , ..., L , with e l being unit vectors of a chosen basis, ( f 1 , ..., f L ) only gives the first L columns of A σ .

Original: It is possible that two matrices
Revised: It is possible that two matrices

Original: A σ and A ˜ σ have similar first L columns but ∥ σ − ˜ σ ∥ is large.
Revised: A σ and A ˜ σ have similar first L columns but ∥ σ − ˜ σ ∥ is large.

Original: Hence, seeking an effective and efficient approximation of the operator F − 1 L is by nature a very challenging problem and is the target of this work.

Original: How to deal with this “ill-posedness” is a central theme in theories for boundary value inverse problems.
Revised: How to deal with this “ill-posedness” is a central theme in theories for boundary value inverse problems.

Original: The operator learning approach has the potential to tame the ill-posedness by approximating
Revised: The operator learning approach has the potential to tame the ill-posedness by restricting

Original: F − 1 Lonly at a set of sampled data D := { σ ( k ) } Nk =1 , where the problem becomes to approximate
Revised: F − 1 L at a set of sampled data D := { σ ( k ) } Nk =1 , with different shapes and locations following certain distribution. Then the problem becomes to approximate

Original: [Equation]
Revised: [Equation]

Original: The fundamental assumption here is that this map is a “well-defined” enough to be regarded as a high-dimensional interpolation (learning) problem on a compact data submanifold (Ghattas &
Revised: The fundamental assumption here is that this map is a “well-defined” enough to be regarded as a high-dimensional interpolation (learning) problem on a compact data submanifold (Ghattas &

Original: Willcox, 2021), and the learned approximate mapping can be evaluated at newly incoming σ ’s.
Revised: Willcox, 2021), and the learned approximate mapping can be evaluated at newly incoming σ ’s.

Original: We refer readers to Appendix B for a brief review of the theoretical background of EIT.

Original: Here we emphasize that, compared with the linear inverse problems y = A x + ϵ in computer vision and signal processing, e.g., Marroquin et al. (1987), to recover a signal x from measurement y with noise ϵ , the fundamental difference is that F ( · ) itself is highly nonlinear and involves boundary value PDEs.
Revised: The incomplete information of Λ σ due to small L for one single σ is compensated by a large N ≫sampling of different σ ’s.

Original:  B ACKGROUND , RELATED WORK , AND CONTRIBUTIONS
Revised:  B ACKGROUND , RELATED WORK , AND CONTRIBUTIONS

Original: Classical iterative methods.
Revised: Classical iterative methods.

Original: There are in general two types of methodology to solve inverse problems.
Revised: There are in general two types of methodology to solve inverse problems.

Original: The first one is a large family of iterative or optimization-based methods (Dobson &
Revised: The first one is a large family of iterative or optimization-based methods (Dobson &

Original: Santosa, 1994; Martin & Idier, 1997; Chan & Tai, 2003; Vauhkonen et al., 1999; Guo et al., 2018;
Revised: Santosa, 1994; Martin & Idier, 1997; Chan & Tai, 2003; Vauhkonen et al., 1999; Guo et al., 2018;

Original: Rondi & Santosa, 2001; Chen et al., 2020).
Revised: Rondi & Santosa, 2001; Chen et al., 2020).

Original: One usually looks for an approximated σ by solving a minimization problem with a regularization R ( σ ) to alleviate the ill-posedness, say
Revised: One usually looks for an approximated σ by solving a minimization problem with a regularization R ( σ ) to alleviate the ill-posedness, say

Original: [Equation]
Revised: [Equation]

Original: The design of regularization R ( σ ) plays a critical role in a successful reconstruction (Tarvainen et al., 2008; Tehrani et al., 2012; Wang et al., 2012).
Revised: The design of regularization R ( σ ) plays a critical role in a successful reconstruction (Tarvainen et al., 2008; Tehrani et al., 2012; Wang et al., 2012).

Original: For almost all iterative methods, due to the ill-posedness, the computation generally takes numerous iterations to converge, and the reconstruction is highly sensitive to noise.
Revised: For almost all iterative methods, due to the ill-posedness, the computation generally takes numerous iterations to converge, and the reconstruction is highly sensitive to noise.

Original: Besides, the forward operator F ( · ) needs to be evaluated at each iteration, which is itself expensive as it requires solving forward PDE models.
Revised: Besides, the forward operator F ( · ) needs to be evaluated at each iteration, which is itself expensive as it requires solving forward PDE models.

Original: Classical direct methods.
Revised: Classical direct methods.

Original: The second methodology is to develop a well-defined mapping G θ parametrized by θ , empirically constructed to approximate the inverse map itself, say G θ ≈ F − 1 .
Revised: The second methodology is to develop a well-defined mapping G θ parametrized by θ , empirically constructed to approximate the inverse map itself, say G θ ≈ F − 1 .

Original: These methods are referred to as non-iterative or direct methods in the literature.
Revised: These methods are referred to as non-iterative or direct methods in the literature.

Original: Distinguished from iterative approaches, direct methods are in general highly problem-specific, as they are designed based on specific mathematical structures of their respective inverse operators.
Revised: Distinguished from iterative approaches, direct methods are in general highly problem-specific, as they are designed based on specific mathematical structures of their respective inverse operators.

Original: For instance, methods in EIT and DOT include factorization methods (Kirsch & Grinberg, 2007; Azzouz et al., 2007; Brühl, 2001; Hanke & Brühl, 2003), MUSIC-type algorithms (Cheney, 2001; Ammari & Kang, 2004; 2007;
Revised: For instance, methods in EIT and DOT include factorization methods (Kirsch & Grinberg, 2007; Azzouz et al., 2007; Brühl, 2001; Hanke & Brühl, 2003), MUSIC-type algorithms (Cheney, 2001; Ammari & Kang, 2004; 2007;

Original: Lee et al., 2011), and the D-bar methods (Knudsen et al., 2007; 2009) based on a Fredholm integral equation (Nachman, 1996), among which are the direct sampling methods (DSM) being our focus in this work (Chow et al., 2014; 2015; Kang et al., 2018;
Revised: Lee et al., 2011), and the D-bar methods (Knudsen et al., 2007; 2009) based on a Fredholm integral equation (Nachman, 1996), among which are the direct sampling methods (DSM) being our focus in this work (Chow et al., 2014; 2015; Kang et al., 2018;

Original: Ito et al., 2013; Ji et al., 2019; Harris &
Revised: Ito et al., 2013; Ji et al., 2019; Harris &

Original: Kleefeld, 2019; Ahn et al., 2020).
Revised: Kleefeld, 2019; Ahn et al., 2020).

Original: These methods generally have a closed-form G θ for approximation, and the parameters θ represent model-specific mathematical objects.
Revised: These methods generally have a closed-form G θ for approximation, and the parameters θ represent model-specific mathematical objects.

Original: For each fixed θ , this procedure is usually much more stable than iterative approaches with respect to the input data.
Revised: For each fixed θ , this procedure is usually much more stable than iterative approaches with respect to the input data.

Original: Furthermore, the evaluation for each given boundary data pair is distinctly fast as no optimization is needed.
Revised: Furthermore, the evaluation for each given boundary data pair is distinctly fast as no optimization is needed.

Original: However, a simple closed-form G θ admitting efficient execution may not be available in practice since some mathematical assumptions and derivation may not hold.
Revised: However, a simple closed-form G θ admitting efficient execution may not be available in practice since some mathematical assumptions and derivation may not hold.

Original: For instance, MUSIC-type and
Revised: For instance, MUSIC-type and

Original: D-bar methods generally require an accurate approximation to Λ σ , while DSM poses restrictions on the boundary data, domain geometry, etc., see Appendix D for details.
Revised: D-bar methods generally require an accurate approximation to Λ σ , while DSM poses restrictions on the boundary data, domain geometry, etc., see Appendix D for details.

Original: Boundary value inverse problems.
Revised: Boundary value inverse problems.

Original: For most cases of boundary value inverse problems in 2D, one key difference, e.g., with animage inverse problem, is that data are only available on 1D manifolds, which are used to reconstruct 2D targets.
Revised: For most cases of boundary value inverse problems in 2D, the major difference, e.g., with an inverse problem in computer vision (Marroquin et al., 1987), is that data are only available on 1D manifolds, which are used to reconstruct 2D targets.

Revised: When comparing (4) with a linear inverse problem in signal processing y =

Revised: A x + ϵ , to recover a signal x from measurement y with noise ϵ , the difference is more fundamental in that F ( · ) itself is highly nonlinear and involves boundary value PDEs.

Original: The boundary data themselves generally involve certain input-output structures (NtD maps), which adds more complexity.
Revised: Moreover, the boundary data themselves generally involve certain input-output structures (NtD maps), which adds more complexity.

Original: In Adler & Guardo (1994); Fernández-Fuentes et al.
Revised: In Adler & Guardo (1994); Fernández-Fuentes et al.

Original: ; Feng et al.
Revised: ; Feng et al.

Original: (2018) boundary measurements are collected and directly input into feedforward fully connected networks.
Revised: (2018) boundary measurements are collected and directly input into feedforward fully connected networks.

Original: As the data reside on different manifolds, special treatments are made to the input data, such as employing pre-reconstruction stages to generate rough 2D input to CNNs (Ben Yedder et al., 2018;
Revised: As the data reside on different manifolds, special treatments are made to the input data, such as employing pre-reconstruction stages to generate rough 2D input to CNNs (Ben Yedder et al., 2018;

Original: Ren et al., 2020).
Revised: Ren et al., 2020).

Original: Deep neural network and inverse problems.
Revised: Deep neural network and inverse problems.

Original: Solving an inverse problem is essentially to give a satisfactory approximation to F − 1 but based on finitely many measurements.
Revised: Solving an inverse problem is essentially to give a satisfactory approximation to F − 1 but based on finitely many measurements.

Original: The emerging deep learning (DL) based on Deep Neural Networks (DNN) to emulate operators directly resembles greatly the aforementioned classical direct methods.
Revised: The emerging deep learning (DL) based on Deep Neural Networks (DNN) to emulate operators directly resembles greatly the aforementioned classical direct methods.

Original: However, operator learners by DNNs are generally considered as black boxes.
Revised: However, operator learners by DNNs are generally considered as black boxes.

Original: A natural question to ask is how the a priori mathematical knowledge can be exploited to design more physics-compatible DNN architectures.
Revised: A natural question to ask is how the a priori mathematical knowledge can be exploited to design more physics-compatible DNN architectures.

Original: In pursuing the answer to this question, we aim to provide a supportive example that bridges deep learning techniques and classical direct methods improving the reconstruction.
Revised: In pursuing the answer to this question, we aim to provide a supportive example that bridges deep learning techniques and classical direct methods improving the reconstruction.

Original: Operator learners.
Revised: Operator learners.

Original: Operator learning has become an active research field for inverse problems in recent years, especially related to image reconstruction where CNN plays a central role, see e.g,
Revised: Operator learning has become an active research field for inverse problems in recent years, especially related to image reconstruction where CNN plays a central role, see e.g,

Original: Kłosowski & Rymarczyk (2017); Nguyen et al.
Revised: Kłosowski & Rymarczyk (2017); Nguyen et al.

Original: Tan et al.
Revised: Tan et al.

Original: ; Jin et al.
Revised: ; Jin et al.

Original: ; Kang et al.
Revised: ; Kang et al.

Original: ; Barbastathis et al.
Revised: ; Barbastathis et al.

Original: ; Latif et al.
Revised: ; Latif et al.

Original: Zhu et al.
Revised: Zhu et al.

Original: ; Chen et al.
Revised: ; Chen et al.

Original: Coxson et al. (2022).
Revised: Coxson et al. (2022).

Original: Notable examples of efforts to couple classical reconstruction methods and
Revised: Notable examples of efforts to couple classical reconstruction methods and

Original: CNN include Hamilton et al.
Revised: CNN include Hamilton et al.

Original: ; Hamilton & Hauptmann (2018), where a CNN post-processes images obtained by the classical D-bar methods, and Fan et al.
Revised: ; Hamilton & Hauptmann (2018), where a CNN post-processes images obtained by the classical D-bar methods, and Fan et al.

Original: ; Fan & Ying (2020)
Revised: ; Fan & Ying (2020)

Original: where
Revised: where

Original: BCR-Net is developed to mimic pseudo-differential operators appearing in many inverse problems.
Revised: BCR-Net is developed to mimic pseudo-differential operators appearing in many inverse problems.

Original: A deep direct sampling method is proposed in Guo & Jiang (2020); Jiang et al.
Revised: A deep direct sampling method is proposed in Guo & Jiang (2020); Jiang et al.

Original: (2021) that learns local convolutional kernels mimicking the gradient operator of DSM.
Revised: (2021) that learns local convolutional kernels mimicking the gradient operator of DSM.

Original: Another example is radial basis function neural networks seen in Hrabuska et al.
Revised: Another example is radial basis function neural networks seen in Hrabuska et al.

Original: ; Michalikova et al.
Revised: ; Michalikova et al.

Original: Wang et al.
Revised: Wang et al.

Original: (2021a).
Revised: (2021a).

Original: Nevertheless, convolutions in CNNs use kernels whose receptive fields involve only a small neighborhood of a pixel.
Revised: Nevertheless, convolutions in CNNs use kernels whose receptive fields involve only a small neighborhood of a pixel.

Original: Thus, layer-wise speaking, CNN does not align well with the non-local nature of inverse problems.
Revised: Thus, layer-wise speaking, CNN does not align well with the non-local nature of inverse problems.

Original: More recently, the learning of PDE-related forward problems using global kernel has gained attraction, most notably the Fourier Neural Operator (FNO) (Li et al., 2021a).
Revised: More recently, the learning of PDE-related forward problems using global kernel has gained attraction, most notably the Fourier Neural Operator (FNO) (Li et al., 2021a).

Original: FNO takes the unique advantage of the low-rank nature of certain problems, and proposes to train a local kernel in the frequency domain yet global in the spatial-temporal domain, mimicking the solution’s kernel integral form.
Revised: FNO takes the unique advantage of the low-rank nature of certain problems, and proposes to train a local kernel in the frequency domain yet global in the spatial-temporal domain, mimicking the solution’s kernel integral form.

Original: Others include DeepONets (Lu et al., 2021;
Revised: Others include DeepONets (Lu et al., 2021;

Original: Wang et al., 2021b; Jin et al., 2022) and Transformers (Kissas et al., 2022;
Revised: Wang et al., 2021b; Jin et al., 2022) and Transformers (Kissas et al., 2022;

Original: Li et al., 2022; Cao, 2021).
Revised: Li et al., 2022; Cao, 2021).

Original: Related studies on Transformers.
Revised: Related studies on Transformers.

Original: The attention mechanism-based models have become the state of the art in many areas since Vaswani et al.
Revised: The attention mechanism-based models have become the state of the art in many areas since Vaswani et al.

Original: One of the most important and attractive aspects of the attention mechanism is its unparalleled capability to model non-local long-range interactions (Tay et al., 2021) through many efficient variants (Katharopoulos et al., 2020; Choromanski et al., 2021; Nguyen et al., 2021).
Revised: One of the most important and attractive aspects of the attention mechanism is its unparalleled capability to model non-local long-range interactions (Tay et al., 2021) through many efficient variants (Katharopoulos et al., 2020; Choromanski et al., 2021; Nguyen et al., 2021).

Original: The relation of the attention with kernel learning is first studied in
Revised: The relation of the attention with kernel learning is first studied in

Original: Tsai et al.
Revised: Tsai et al.

Original: (2019) and later connected with random feature (Peng et al., 2021).
Revised: (2019) and later connected with random feature (Peng et al., 2021).

Original: Connecting the non-PDE-based integral kernels and the attention mechanism has been seen in Hutchinson et al.
Revised: Connecting the non-PDE-based integral kernels and the attention mechanism has been seen in Hutchinson et al.

Original: (2021); Guibas et al.
Revised: (2021); Guibas et al.

Original: Among inverse problems, Transformers have been applied in medical imaging applications including segmentation (Zhou et al., 2021;
Revised: Among inverse problems, Transformers have been applied in medical imaging applications including segmentation (Zhou et al., 2021;

Original: Hatamizadeh et al., 2022; Petit et al., 2021), X-Ray (Tanzi et al., 2022), magnetic resonance imaging (MRI)
Revised: Hatamizadeh et al., 2022; Petit et al., 2021), X-Ray (Tanzi et al., 2022), magnetic resonance imaging (MRI)

Original: (He et al., 2022), ultrasound (Perera et al., 2021), optical coherence tomography (OCT) (Song et al., 2021), etc.
Revised: (He et al., 2022), ultrasound (Perera et al., 2021), optical coherence tomography (OCT) (Song et al., 2021), etc.

Original: To our best knowledge, there is no work in the literature that establishes an architectural connection between the attention mechanism in Transformer and the mathematical structure of PDE-based inverse problems.
Revised: To our best knowledge, there is no work in the literature that establishes an architectural connection between the attention mechanism in Transformer and the mathematical structure of PDE-based inverse problems.

Original: 2. C ONTRIBUTIONS
Revised: 2. C ONTRIBUTIONS

Original: • A structure-conforming network architecture.
Revised: • A structure-conforming network architecture.

Original: Inspired by the EIT theory and classic DSM, we decompose the approximation of the inverse operator into a harmonic extension and an integral operator with learnable non-local kernels that has an attention-like structure.
Revised: Inspired by the EIT theory and classic DSM, we decompose the approximation of the inverse operator into a harmonic extension and an integral operator with learnable non-local kernels that has an attention-like structure.

Original: Additionally, the attention architecture is reinterpreted through a Fredholm integral operator to rationalize the application of the Transformer to the boundary value inverse problem.
Revised: Additionally, the attention architecture is reinterpreted through a Fredholm integral operator to rationalize the application of the Transformer to the boundary value inverse problem.

Original: • Theoretical and experimental justification for the advantage of Transformer.
Revised: • Theoretical and experimental justification for the advantage of Transformer.

Original: We have proved that, in Transformers, a modified attention is able to represent target functions exhibiting higher frequency natures from lower frequency input features.
Revised: We have proved that, in Transformers, a modified attention is able to represent target functions exhibiting higher frequency natures from lower frequency input features.

Original: In the experiments, a comparative study further demonstrates a favorable match between the Transformer and the benchmark problem.
Revised: In the experiments, a comparative study further demonstrates a favorable match between the Transformer and the benchmark problem.

Original:  I NTERPLAY BETWEEN MATHEMATICS AND NEURAL ARCHITECTURES
Revised:  I NTERPLAY BETWEEN MATHEMATICS AND NEURAL ARCHITECTURES

Original: In this section, we try to articulate that the triple tensor product in the attention mechanism matches extremely well with representing a solution in the inverse operator theory of EIT.
Revised: In this section, we try to articulate that the triple tensor product in the attention mechanism matches extremely well with representing a solution in the inverse operator theory of EIT.

Original: In pursuing this end goal, this study tries to answer the following motivating questions:
Revised: In pursuing this end goal, this study tries to answer the following motivating questions:

Original: ( Q1 )
Revised: ( Q1 )

Original: What is an appropriate finite dimensional data format as inputs to the neural network?
Revised: What is an appropriate finite dimensional data format as inputs to the neural network?

Original: ( Q2 )
Revised: ( Q2 )

Original: Is there a suitable neural networkG θ approximating (6) matching the mathematical structure?
Revised: Is there a suitable neural network matching the mathematical structure?

Original: 3. F ROM EIT TO O PERATOR L EARNING
Revised: 3. F ROM EIT TO O PERATOR L EARNING

Original: In the case of full measurement, the operator F − 1 can be well approximated through a large number of ( σ, A σ ) data pairs.
Revised: In the case of full measurement, the operator F − 1 can be well approximated through a large number of ( σ, A σ ) data pairs.

Original: This mechanism essentially results in a tensor2tensor mapping/operator from A σ to the imagery data representing σ .
Revised: This mechanism essentially results in a tensor2tensor mapping/operator from A σ to the imagery data representing σ .

Original: In particular, the BCR-Net (Fan & Ying, 2020) is a
Revised: In particular, the BCR-Net (Fan & Ying, 2020) is a

Original: DNN approximation falling into this category.
Revised: DNN approximation falling into this category.

Original: However, when there are very limited boundary data pairs accessible, the task of learning the full matrix A σ becomes obscure, which complicates the development of a tensor2tensor pipeline for operator learning.
Revised: However, when there are very limited boundary data pairs accessible, the task of learning the full matrix A σ becomes obscure, which complicates the development of a tensor2tensor pipeline for operator learning.

Original: Operator learning problems for EIT.
Revised: Operator learning problems for EIT.

Original: We first introduce several attainable approximations of infinite dimensional spaces by finite dimensional counterparts for the proposed method.
Revised: We first introduce several attainable approximations of infinite dimensional spaces by finite dimensional counterparts for the proposed method.

Original: (1) Spatial discretization.
Revised: (1) Spatial discretization.

Original: Let Ω h be a mesh of Ω with the mesh spacing h and let { z j } Mj =1 :=
Revised: Let Ω h be a mesh of Ω with the mesh spacing h and let { z j } Mj =1 :=

Original: M be the set of grid points to represent the 2D discretization of continuous signals.
Revised: M be the set of grid points to represent the 2D discretization of continuous signals.

Original: Then a function u defined almost everywhere 
Revised: Then a function u defined almost everywhere in Ω can be approximated by a vector u h ∈ R M .

Original: (2) Sampling of D .
Revised: (2) Sampling of D .

Original: We generate N samples of D with different shapes and locations following certain distribution.
Revised: We generate N samples of D with different shapes and locations following certain distribution.

Original: For example, elliptical inclusions with random semi-axes and centers are generated as a benchmark (see Appendix C.1 for details).
Revised: For example, elliptical inclusions with random semi-axes and centers are generated as a benchmark (see Appendix C.1 for details).

Original: With the known σ 0 and σ 1 , set the corresponding data set D = { σ (1) , σ (2) , ..., σ ( N ) } .
Revised: With the known σ 0 and σ 1 , set the corresponding data set D = { σ (1) , σ (2) , ..., σ ( N ) } .

Original: N is usually large enough to represent field applications of interest.
Revised: N is usually large enough to represent field applications of interest.

Original: (3) Sampling of NtD maps.
Revised: (3) Sampling of NtD maps.

Original: For the k -th sample of D , we generate L pairs of boundary data { ( g ( k ) l , f ( k ) l ) } Ll =1 by solving PDE (1), which can be thought of as sampling of columns of the infinite matrix A σ representing the NtD map.
Revised: For the k -th sample of D , we generate L pairs of boundary data { ( g ( k ) l , f ( k ) l ) } Ll =1 by solving PDE (1), which can be thought of as sampling of columns of the infinite matrix A σ representing the NtD map.

Original: By the proposed method, L can be chosen to be very small ( ≤ 3 ) to yield satisfactory results.
Revised: By the proposed method, L can be chosen to be very small ( ≤ 3 ) to yield satisfactory results.

Original: Our task is to find a parameterized mapping G θ to approximate F − 1 L, D (6) by minimizing
Revised: Our task is to find a parameterized mapping G θ to approximate F − 1 L, D (6) by minimizing

Original: [Equation]
Revised: [Equation]

Original: for a suitable norm ∥ · ∥ .
Revised: for a suitable norm ∥ · ∥ .

Original: Hyper-parameters N, h, L will affect the finite dimensional approximation to the infiniteness in the following way: h determines the resolution to approximate D ; N affects the representativity of the training data set; L decides how much of a finite portion of the infinite spectral information of Λ σ can be accessed.
Revised: Hyper-parameters N, h, L will affect the finite dimensional approximation to the infiniteness in the following way: h determines the resolution to approximate D ; N affects the representativity of the training data set; L decides how much of a finite portion of the infinite spectral information of Λ σ can be accessed.

Original: The incomplete information of Λ σ due to small L for one single σ is compensated by a large N ≫ 1 sampling of different σ ’s.

Original: 3. F ROM HARMONIC EXTENSION TO TENSOR - TO - TENSOR
Revised: 3. F ROM HARMONIC EXTENSION TO TENSOR - TO - TENSOR

Original: Many mathematical works have made efforts to derive a well-defined operator that estimates σ instead of an exact or accurate reconstruction (Brühl, 2001;

Original: Chow et al., 2014; Dunlop & Stuart, 2015) even for a single measurement, i.e., L = 1 .

Original: Such effort could benefit modern operator learning methods.

Original: To establish the connection between the problem of interest with the attention used in the Transformers, we first construct higher-dimensional tensors from the 1D boundary data.
Revised: To establish the connection between the problem of interest with the attention used in the Transformers, we first construct higher-dimensional tensors from the 1D boundary data.

Original: The key is a harmonic extension of the boundary data that can be viewed as a PDE-based feature map.
Revised: The key is a harmonic extension of the boundary data that can be viewed as a PDE-based feature map.

Original: We begin with a theorem to motivate it.
Revised: We begin with a theorem to motivate it.

Original: Let I D be the characteristic function of D  , i.e., I D ( x )
Revised: Let I D be the characteristic function of D named index function , i.e., I D ( x )

Original: = [-
-] if x ∈ D
Revised: = [-
-]1 if x ∈ D

Original: and I D ( x ) = 

Revised: and I D ( x ) =

Original: if x / ∈ D .
Revised: if x / ∈ D .

Original: Thus, σ can be directly identified by the shape of D through the formula σ = σ 1 I D + σ 0 (1 − I D ) .
Revised: Thus, σ can be directly identified by the shape of D through the formula σ = σ 1 I D + σ 0 (1 − I D ) .

Original: In this setup, to reconstruct σ is equivalent to reconstructing I D .
Revised: In this setup, reconstructing σ is equivalent to reconstructing I D .

Original: Without loss of generality, we let σ 1 > σ 0 .
Revised: Without loss of generality, we let σ 1 > σ 0 .

Original: The NtD map Λ σ 0 for the background medium σ 0 is considered as known, and Λ σ 0 g can be readily computed.
Revised: The NtD map Λ σ 0 for the background medium σ 0 is considered as known, and Λ σ 0 g can be readily computed.

Original: Then f − Λ σ 0 g =
Revised: Then f − Λ σ 0 g =

Original: (Λ σ − Λ σ 0 )
Revised: (Λ σ − Λ σ 0 )

Original: g measures the difference between the NtD mappings, and encodes the information of σ .
Revised: g measures the difference between the NtD mappings, and encodes the information of σ .

Original: The operator Λ σ − Λ σ 0 is positive definite, and it has eigenvalues { λ l } ∞ l =1 with λ 1 > λ 2 > · · · > 0 (Cheng et al., 1989).
Revised: The operator Λ σ − Λ σ 0 is positive definite, and it has eigenvalues { λ l } ∞ l =1 with λ 1 > λ 2 > · · · > 0 (Cheng et al., 1989).

Original: Theorem 1.
Revised: Theorem 1.

Original: Suppose that the 1D boundary data g l is the eigenfunction of Λ σ − Λ σ 0 corresponding to the l -th eigenvalue λ l , and let the 2D data functions ϕ l be obtained by solving 
Revised: Suppose that the 1D boundary data g l is the eigenfunction of Λ σ − Λ σ 0 corresponding to the l -th eigenvalue λ l , and let the 2D data functions ϕ l be obtained by solving − ∆ ϕ l = 0 in Ω ,

Original: [Equation]
Revised: [Equation]

Original: for l = 1 , 2 , . . . .
Revised: for l = 1 , 2 , . . . .

Original: Define the space (cid:101)
Revised: Define the space (cid:101)

Original: S L = Span { ∂ x 1 ϕ l ∂ x 2 ϕ l : l = 1 , . . .
Revised: S L = Span { ∂ x 1 ϕ l ∂ x 2 ϕ l : l = 1 , . . .

Original: , L } , and the dictionary
Revised: , L } , and the dictionary

Original: S L = { a 1 + a 2 arctan( a 3 v ) : v ∈ (cid:101) S L , a 1 , a 2 , a 3 ∈ R } .
Revised: S L = { a 1 + a 2 arctan( a 3 v ) : v ∈ (cid:101) S L , a 1 , a 2 , a 3 ∈ R } .

Original: Then, for any ϵ > 0 , there exists a sufficiently large L such that sup
Revised: Then, for any ϵ > 0 , there exists a sufficiently large L such that sup

Original: [Equation]
Revised: [Equation]

Original: The full proof of Theorem 1 can be found in Appendix E.
Revised: The full proof of Theorem 1 can be found in Appendix E.

Original: This theorem gives a constructive approach for approximating F − 1 and justifies the practice of approximating I D when L is large enough.
Revised: This theorem gives a constructive approach for approximating F − 1 and justifies the practice of approximating I D when L is large enough.

Original: The function ϕ l is called the harmonic extension of f l − Λ σ 0 g l .
Revised: The function ϕ l is called the harmonic extension of f l − Λ σ 0 g l .

Original: On the other hand, it relies on “knowing” the entire NtD map Λ σ to construct I DL explicitly; namely the coefficients of ∂ x 1 ϕ l ∂ x
Revised: On the other hand, it relies on “knowing” the entire NtD map Λ σ to construct I DL explicitly; namely the coefficients of ∂ x 1 ϕ l ∂ x

Original: 2 ϕ l depend on a big chunk of spectral information (eigenvalues and eigenfunctions) of Λ σ , which may not be available in practice.
Revised: 2 ϕ l depend on a big chunk of spectral information (eigenvalues and eigenfunctions) of Λ σ , which may not be available in practice.

Original: Thus, the mathematics itself in this theorem does not provide us with an architectural hint on how to build a structure-conforming DNN.
Revised: Thus, the mathematics itself in this theorem does not provide us with an architectural hint on how to build a structure-conforming DNN.

Original: To further dig out the hidden structure, we focus on the case of a single measurement, i.e., L = 1 .
Revised: To further dig out the hidden structure, we focus on the case of a single measurement, i.e., L = 1 .

Original: With this setting, it is possible to derive an explicit and simple formula to approximate I D which is achieved by the classical direct sampling methods (DSM) (Chow et al., 2014; 2015; Kang et al., 2018;
Revised: With this setting, it is possible to derive an explicit and simple formula to approximate I D which is achieved by the classical direct sampling methods (DSM) (Chow et al., 2014; 2015; Kang et al., 2018;

Original: Ito et al., 2013; Ji et al., 2019; Harris & Kleefeld, 2019; Ahn et al., 2020).
Revised: Ito et al., 2013; Ji et al., 2019; Harris & Kleefeld, 2019; Ahn et al., 2020).

Original: For EIT,
Revised: For EIT,

Original: [Equation]
Revised: [Equation]

Revised: (10) is derived in Chow et al.

Revised: (2014), where (see a much more detailed formulation in Appendix D)

Original: • ϕ is the harmonic extension of f − Λ σ 

Revised: • ϕ is the harmonic extension of f − Λ σ

Original: g with certain noise f − Λ σ 0 g + ξ ; • d ( x ) is called a probing direction and can be chosen empirically as d ( x ) =
Revised: g with certain noise f − Λ σ 0 g + ξ ; • d ( x ) is called a probing direction and can be chosen empirically as d ( x ) =

Original: ∇ ϕ
Revised: ∇ ϕ

Original: ( x ) / ∥∇ ϕ
Revised: ( x ) / ∥∇ ϕ

Original: ( x ) ∥ ; • R ( x )
Revised: ( x ) ∥ ; • R ( x )

Original: =
Revised: =

Original: ( ∥ f − Λ σ 0 g
Revised: ( ∥ f − Λ σ 0 g

Original: ∥ ∂
Revised: ∥ ∂

Original: Ω | η x | Y ) − 1 , where η x is a function of d ( x ) and measured in | · | Y semi-norm on boundary ∂ Ω .
Revised: Ω | η x | Y ) − 1 , where η x is a function of d ( x ) and measured in | · | Y semi-norm on boundary ∂ Ω .

Original: Both ϕ and η x can be computed effectively by traditional fast PDE solvers, such as finite difference or finite element methods based on Ω h in Section 3.1.
Revised: Both ϕ and η x can be computed effectively by traditional fast PDE solvers, such as finite difference or finite element methods based on Ω h in Section 3.1.

Original: However, the reconstruction accuracy is much limited by a single measurement, the nonparametric ansatz, and empirical choices of d ( x ) and | · | Y .
Revised: However, the reconstruction accuracy is much limited by a single measurement, the nonparametric ansatz, and empirical choices of d ( x ) and | · | Y .

Original: These restrictions leave room for DL methodology.
Revised: These restrictions leave room for DL methodology.

Original: See Appendix D for a detailed discussion.
Revised: See Appendix D for a detailed discussion.

Original: Constructing harmonic extension (2D features) from boundary data (1D signal input with limited depth) can contribute to the desired high-quality reconstruction.
Revised: Constructing harmonic extension (2D features) from boundary data (1D signal input with limited depth) can contribute to the desired high-quality reconstruction.

Original: First, harmonic functions are highly smooth away from the boundary, of which the solution automatically smooths out the noise on the boundary due to PDE theory (Gilbarg & Trudinger, 2001, Chapter 8), and thus make the reconstruction highly robust with respect to the noise (e.g., see Figure 3 in Appendix C.1).
Revised: First, harmonic functions are highly smooth away from the boundary, of which the solution automatically smooths out the noise on the boundary due to PDE theory (Gilbarg & Trudinger, 2001, Chapter 8), and thus make the reconstruction highly robust with respect to the noise (e.g., see Figure 3 in Appendix C.1).

Original: Second, in terms of using certain backbone networks to generate features for downstream tasks, harmonic extensions can be understood as a problem-specific way to design higher dimensional feature maps (Álvarez et al., 2012), which renders samples more separable in a higher dimensional data manifold than the one with merely boundary data.
Revised: Second, in terms of using certain backbone networks to generate features for downstream tasks, harmonic extensions can be understood as a problem-specific way to design higher dimensional feature maps (Álvarez et al., 2012), which renders samples more separable in a higher dimensional data manifold than the one with merely boundary data.

Original: See Figure 1 for the illustration of this procedure.
Revised: See Figure 1 for the illustration of this procedure.

Original: The information of σ is deeply hidden in ϕ .
Revised: The information of σ is deeply hidden in ϕ .

Original: As shown in Figure 1 (see also Appendix C), one cannot observe any pattern of σ directly from ϕ .
Revised: As shown in Figure 1 (see also Appendix C), one cannot observe any pattern of σ directly from ϕ .

Original: It is different from and much more difficult than the inverse problems studied in (Bhattacharya et al., 2021; Khoo et al., 2021) that aim to reconstruct 2D targets from the much more informative 2D internal data of u .
Revised: It is different from and much more difficult than the inverse problems studied in (Bhattacharya et al., 2021; Khoo et al., 2021) that aim to reconstruct 2D targets from the much more informative 2D internal data of u .

Original: In summary, both Theorem 1 and the formula of DSM (10) offer inspiration to give a potential answer to (Q1): the harmonic extension ϕ (2D features) of f − Λ σ 0 g (1D measurements) naturally encodes the information of the true characteristic function I D (2D targets).
Revised: In summary, both Theorem 1 and the formula of DSM (10) offer inspiration to give a potential answer to (Q1): the harmonic extension ϕ (2D features) of f − Λ σ 0 g (1D measurements) naturally encodes the information of the true characteristic function I D (2D targets).

Original: As there is a pointwise correspondence between the harmonic extensions and the targets at 2D grids, a tensor representation of ∇ ϕ l at these grid points can then be used as the input to a tensor2tensor -type DNN to learn I D , and naturally the grids are explicitly set as the positional embedding.
Revised: As there is a pointwise correspondence between the harmonic extensions and the targets at 2D grids, a tensor representation of ∇ ϕ l at these grid points can then be used as the input to a tensor2tensor -type DNN to learn I D , and naturally the grids are explicitly set as the positional embedding.

Original: In comparison, the positional information are buried more deeply in 1D measurements.
Revised: In comparison, the positional information are buried more deeply in 1D measurements.

Original: As shown in Figure 1, G θ can be nicely decoupled into a composition of a learnable neural network operator T θ and a non-learnable PDE-based feature map
Revised: As shown in Figure 1, G θ can be nicely decoupled into a composition of a learnable neural network operator T θ and a non-learnable PDE-based feature map

Original: H , i.e., G θ
Revised: H , i.e., G θ

Original: =
Revised: =

Original: T θ ◦ H .
Revised: T θ ◦ H .

Original: The architecture of T θ shall be our interest henceforth.
Revised: The architecture of T θ shall be our interest henceforth.

Original: 3. F ROM CHANNELS IN ATTENTION TO BASIS IN INTEGRAL TRANSFORM
Revised: 3. F ROM CHANNELS IN ATTENTION TO BASIS IN INTEGRAL TRANSFORM

Original: In this subsection, a modified attention mechanism is proposed as the basic block in the tensor2tensortype mapping introduced in the next two subsections.
Revised: In this subsection, a modified attention mechanism is proposed as the basic block in the tensor2tensortype mapping introduced in the next two subsections.

Original: Its reformulation conforms with one of the most used tools in applied mathematics: the integral transform.
Revised: Its reformulation conforms with one of the most used tools in applied mathematics: the integral transform.

Original: In many applications such as inverse problems, the interaction (kernel) does not have any explicit form, which meshes well with DL methodology philosophically.
Revised: In many applications such as inverse problems, the interaction (kernel) does not have any explicit form, which meshes well with DL methodology philosophically.

Original: In fact, this is precisely the situation of the EIT problem considered.
Revised: In fact, this is precisely the situation of the EIT problem considered.

Original: Let the input of an encoder attention block be x h ∈ R M × n with n channels, then the query Q , key
Revised: Let the input of an encoder attention block be x h ∈ R M × c with c channels, then the query Q , key

Original: K , value V are generated by three learnable projection matrices θ := { W Q , W K , W V } ⊂ R n × n : ⋄ = x h W ⋄ , ⋄ ∈ { Q, K, V } .
Revised: K , value V are generated by three learnable projection matrices θ := { W Q , W K , W V } ⊂ R c × c : ⋄ = x h W ⋄ , ⋄ ∈ { Q, K, V } .

Original: Here n ≫ L is the number of expanded channels for the latent representations.
Revised: Here c ≫ L is the number of expanded channels for the latent representations.

Original: A modified dot-product attention is proposed as follows:
Revised: A modified dot-product attention is proposed as follows:

Original: [Equation]
Revised: [Equation]

Original:  where nl Q ( · ) and nl K ( · ) are two learnable normalizations.
Revised: (11) where nl Q ( · ) and nl K ( · ) are two learnable normalizations.

Original: Different from Nguyen & Salazar (2019)
Revised: Different from Nguyen & Salazar (2019)

Original: ; Xiong et al.
Revised: ; Xiong et al.

Original: (2020), this pre-inner-product normalization is applied right before the matrix multiplication of query and key, which takes inspiration from the normalization in the index map kernel integral (10) and (20), see also Boyd (2001) where the normalization for orthogonal bases essentially uses the (pseudo)inverse of the Gram matrices.
Revised: (2020), this pre-inner-product normalization is applied right before the matrix multiplication of query and key, which takes inspiration from the normalization in the index function kernel integral (10) and (20), see also Boyd (2001) where the normalization for orthogonal bases essentially uses the (pseudo)inverse of the Gram matrices.

Original: In practice, its cheap alternative is chosen to be layer normalization (Ba et al., 2016) or batch normalization (Ioffe & Szegedy, 2015).
Revised: In practice, its cheap alternative is chosen to be layer normalization (Ba et al., 2016) or batch normalization (Ioffe & Szegedy, 2015).

Original:  α = h 2 is a mesh-based weight such that the summation becomes an approximation to an integral.
Revised: Constant α = h 2 is a mesh-based weight such that the summation becomes an approximation to an integral.

Original: To elaborate these rationales, the j -th column of the i -th row
Revised: To elaborate these rationales, the j -th column of the i -th row

Original: U i of U is ( U i )
Revised: U i of U is ( U i )

Original: j = α A i • · V j , in which the i -th row A
Revised: j = α A i • · V j , in which the i -th row A

Original: i • =
Revised: i • =

Original: ( (cid:101) Q (cid:101) K ⊤ )
Revised: ( (cid:101) Q (cid:101) K ⊤ )

Original: i • and  V j :=
Revised: i • and the j -th column V j :=

Original: V • j .
Revised: V • j .

Original: Thus, applying this to every column 1 ≤ j ≤ n , attention (11) becomes a basis expansion representation for U
Revised: Thus, applying this to every column 1 ≤ j ≤ c , attention (11) becomes a basis expansion representation for U

Original: i
Revised: i

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: Here, αA i • contains the coefficients for the linear combination of { V m } Mm =1 .
Revised: Here, αA i • contains the coefficients for the linear combination of { V m } Mm =1 .

Original: This set { V m } Mm =1 form the V ’s row space, and it further forms each row of the output U by multiplying with A .
Revised: This set { V m } Mm =1 form the V ’s row space, and it further forms each row of the output U by multiplying with A .

Original: A ( · , · ) in (12) stands for the attention kernel, which aggregates the pixel-wise feature maps to measure how the projected latent representations interact.
Revised: A ( · , · ) in (12) stands for the attention kernel, which aggregates the pixel-wise feature maps to measure how the projected latent representations interact.

Original: Moreover, the latent representation U i in an encoder layer is spanned by the row space of V , and is being nonlinearly updated layer-wise.
Revised: Moreover, the latent representation U i in an encoder layer is spanned by the row space of V , and is being nonlinearly updated layer-wise.

Original: For x h , U, Q, K, V , a set of feature maps are assumed to exist: for example u ( · ) maps R 2 → R 1 × n , i.e., U i =
Revised: For x h , U, Q, K, V , a set of feature maps are assumed to exist: for example u ( · ) maps R 2 → R 1 × c , i.e., U i =

Original: u ( z i ) =
Revised: u ( z i ) =

Original: [ u 1 ( z i ) , · · · , u n ( z i )] , e.g., see Choromanski et al.
Revised: [ u 1 ( z i ) , · · · , u c ( z i )] , e.g., see Choromanski et al.

Original: (2021), then an instancedependent kernel κ θ ( · , · ) : R 2 × R 2 → R can be defined by
Revised: (2021), then an instancedependent kernel κ θ ( · , · ) : R 2 × R 2 → R can be defined by

Original: [Equation]
Revised: [Equation]

Original: Now the discrete kernel A ( · , · ) with tensorial input is rewritten to this kernel κ θ ( · , · ) , thus the dot-product attention is expressed as a nonlinear integral transform for the l -th channel:
Revised: Now the discrete kernel A ( · , · ) with tensorial input is rewritten to this kernel κ θ ( · , · ) , thus the dot-product attention is expressed as a nonlinear integral transform for the l -th channel:

Original: [Equation]
Revised: [Equation]

Original: Through certain minimization such as (8), the backpropagation updates θ , which further lead a new set of latent representations.
Revised: Through certain minimization such as (8), the backpropagation updates θ , which further lead a new set of latent representations.

Original: This procedure can be viewed as an iterative method to update the basis residing in each channel by solving the Fredholm integral equation of the first kind in (14).
Revised: This procedure can be viewed as an iterative method to update the basis residing in each channel by solving the Fredholm integral equation of the first kind in (14).

Original: To connect attention with inverse problems, the multiplicative structure in a kernel integral form for attention (14) is particularly useful.
Revised: To connect attention with inverse problems, the multiplicative structure in a kernel integral form for attention (14) is particularly useful.

Original: (14) is a type of Pincherle-Goursat (degenerate) kernels (Kress, 1999, Chapter 11), and approximates the full kernel using only a finite number of bases.
Revised: (14) is a type of Pincherle-Goursat (degenerate) kernels (Kress, 1999, Chapter 11), and approximates the full kernel using only a finite number of bases.

Original: The number of learned basis functions in expansion (12) depends on the number of channels n .
Revised: The number of learned basis functions in expansion (12) depends on the number of channels n .

Original: Here we show the following theorem, heuristically it says that: given enough but finite channels of latent representations, the attention kernel integral is able to “bootstrap” in frequency domain, that is, generating an output representation with higher frequencies than the input.
Revised: Here we show the following theorem, heuristically it says that: given enough but finite channels of latent representations, the attention kernel integral is able to “bootstrap” in frequency domain, that is, generating an output representation with higher frequencies than the input.

Original: Similar approximation result is impossible for a layer-wise propagation in CNN if opting for the usual framelet/wavelet interpretation (Ye et al., 2018), for example, a single layer of CNN filters without nonlinearity cannot learn weights to extract edges if there are no edge-like local features in the input (see for an empirical evidence in Figureand Figure 10).
Revised: Similar approximation result is impossible for a layer-wise propagation in CNN if opting for the usual framelet/wavelet interpretation (Ye et al., 2018), for example, a single layer of CNN filters without nonlinearity cannot learn weights to extract edges if there are no edge-like local features in the input (see for an empirical evidence in Figureand Figure 10).

Original: The full proof with a more rigorous setting is in Appendix F.
Revised: The full proof with a more rigorous setting is in Appendix F.

Original: Theorem 2 (Frequency bootstrapping) .
Revised: Theorem 2 (Frequency bootstrapping) .

Original: Suppose there exists a channel l in V such that ( V i ) l = sin( az i ) for some a ∈ Z + , the current finite-channel sum kernel A ( · , · ) approximates a non-separable kernel (e.g., Fourier-type sin( xz ) ) to an error of O ( ϵ ) under certain norm ∥ · ∥ X .
Revised: Suppose there exists a channel l in V such that ( V i ) l = sin( az i ) for some a ∈ Z + , the current finite-channel sum kernel A ( · , · ) approximates a non-separable kernel (e.g., Fourier-type sin( xz ) ) to an error of O ( ϵ ) under certain norm ∥ · ∥ X .

Original: Then, there exists a set of weights such that certain channel k ′ in the output of (12) approximates sin( a ′ z ) , Z + ∋ a ′ > a with an error of O ( ϵ ) under the same norm.
Revised: Then, there exists a set of weights such that certain channel k ′ in the output of (12) approximates sin( a ′ z ) , Z + ∋ a ′ > a with an error of O ( ϵ ) under the same norm.

Original: The considered inverse problem is essentially to recover higher-frequency eigenpairs of Λ σ based on lower-frequency data, see e.g. Figure 1.
Revised: The considered inverse problem is essentially to recover higher-frequency eigenpairs of Λ σ based on lower-frequency data, see e.g. Figure 1.

Original: Λ σ together with all its spectral information can be determined by the recovered inclusion shape, thus the existence result in Theorem 2 partially justifies the advantages to adopt the attention mechanism for the considered problem.
Revised: Λ σ together with all its spectral information can be determined by the recovered inclusion shape, thus the existence result in Theorem 2 partially justifies the advantages to adopt the attention mechanism for the considered problem.

Original: 3. F ROM INDEX MAP INTEGRAL TO T RANSFORMER
Revised: 3. F ROM INDEX FUNCTION INTEGRAL TO T RANSFORMER

Original: In (10), the probing direction d ( x ) , the inner product d ( x ) · ∇ ϕ ( x ) , and the norm | · | Y are used as ingredients to form certain non-local instance-based learnable kernel integration.
Revised: In (10), the probing direction d ( x ) , the inner product d ( x ) · ∇ ϕ ( x ) , and the norm | · | Y are used as ingredients to form certain non-local instance-based learnable kernel integration.

Original: This non-localness is a fundamental trait for many inverse problems, in that I D ( x ) depends on the entire data function.
Revised: This non-localness is a fundamental trait for many inverse problems, in that I D ( x ) depends on the entire data function.

Original: Then, the discretization of the modified index function is shown to match the multiplicative structure of the modified attention mechanism in (11).
Revised: Then, the discretization of the modified index function is shown to match the multiplicative structure of the modified attention mechanism in (11).

Original: In the forthcoming derivations, K ( x, y ) , Q ( x, y ) , and a self-adjoint positive definite linear operator
Revised: In the forthcoming derivations, K ( x, y ) , Q ( x, y ) , and a self-adjoint positive definite linear operator

Original: V : L 2 ( ∂ Ω) →
Revised: V : L 2 ( ∂ Ω) →

Original: L 2 ( ∂ Ω) , are shown to yield the emblematic Q - K - V structure of attention.
Revised: L 2 ( ∂ Ω) , are shown to yield the emblematic Q - K - V structure of attention.

Original: To this end, we make the following modifications and assumptions to the original index map in (10).
Revised: To this end, we make the following modifications and assumptions to the original index function in (10).

Original: • The reformulation of the index function is motivated by the heuristics that the agglomerated global information of ϕ could be used as “keys” to locate a point x .
Revised: • The reformulation of the index function is motivated by the heuristics that the agglomerated global information of ϕ could be used as “keys” to locate a point x .

Original: [Equation]
Revised: [Equation]

Original: If an ansatz K  x, y ) =
Revised: If an ansatz K ( x, y ) =

Original: δ x ( y ) is adopted, then (15) reverts to the original one in (10).
Revised: δ x ( y ) is adopted, then (15) reverts to the original one in (10).

Original: • The probing direction d ( x ) as “query” is reasonably assumed to have a global dependence on ϕ
Revised: • The probing direction d ( x ) as “query” is reasonably assumed to have a global dependence on ϕ

Original: [Equation]
Revised: [Equation]

Original: If Q ( x, y )
Revised: If Q ( x, y )

Original: =
Revised: =

Original: δ x ( y ) / ∥∇ ϕ
Revised: δ x ( y ) / ∥∇ ϕ

Original: ( x ) ∥ , then d ( x ) =
Revised: ( x ) ∥ , then d ( x ) =

Original: ∇ ϕ
Revised: ∇ ϕ

Original: ( x ) / ∥∇ ϕ
Revised: ( x ) / ∥∇ ϕ

Original: ( x ) ∥ which is the choice of the probing direction in (Ikehata, 2000; Ikehata & Siltanen, [Equation] Ikehata, 2007).
Revised: ( x ) ∥ which is the choice of the probing direction in (Ikehata, 2000; Ikehata & Siltanen, 2000; Ikehata, 2007).

Original: • In the quantity R ( x ) in (10), the key is | · | Y which is assumed to have the following form:
Revised: • In the quantity R ( x ) in (10), the key is | · | Y which is assumed to have the following form:

Original: [Equation]
Revised: [Equation]

Original: In Chow et al.
Revised: In Chow et al.

Original: (2014), it is shown that if V induces a kernel with sharply peaked Gaussian-like distribution, the index function in (10) can achieve maximum values for points inside D .
Revised: (2014), it is shown that if V induces a kernel with sharply peaked Gaussian-like distribution, the index function in (10) can achieve maximum values for points inside D .

Original: Based on the assumptions from (15) to (17), we derive a matrix representation approximating the new index function on a grid, which accords well with an attention-like architecture.
Revised: Based on the assumptions from (15) to (17), we derive a matrix representation approximating the new index function on a grid, which accords well with an attention-like architecture.

Original: Denote by• ϕ n : the vector that interpolates ∂ x n ϕ at the grid points { z j } , n = 1 , 2 .
Revised: Denote by ϕ n : the vector that interpolates ∂ x n ϕ at the grid points { z j } , n = 1 , 2 .

Original: • B : the finite element/finite difference discretization of − ∆ on Ω h (a discrete Laplacian) coupled with the Neumann boundary condition and the zero integral normalization condition in (9).

Original: • R : the matrix that projects a vector defined at interior grids to the one defined on ∂ Ω .

Original: Here, we sketch the outline of the derivation, and present the detailed derivation in Appendix D.
Revised: Here, we sketch the outline of the derivation, and present the detailed derivation in Appendix D.

Original: We shall discretize the variable x by grid points
Revised: We shall discretize the variable x by grid points

Original: z i in (15) and obtain an approximation to the integral:
Revised: z i in (15) and obtain an approximation to the integral:

Original: [Equation]
Revised: [Equation]

Revised: [Equation]

Original: where { ω j } are some integration quadrature weights.
Revised: where { ω j } are some integration quadrature weights.

Original: We then consider (16) and focus on one component d n ( x ) of d ( x ) .
Revised: We then consider (16) and focus on one component d n ( x ) of d ( x ) .

Original: With a suitable approximated integral, it can be rewritten as
Revised: With a suitable approximated integral, it can be rewritten as

Original: [Equation]
Revised: [Equation]

Original: Note that the self-adjoint positive definite operator V in (17) can be parameterized by a symmetric positive definite (SPD) matrix denoted by V .
Revised: Note that the self-adjoint positive definite operator V in (17) can be parameterized by a symmetric positive definite (SPD) matrix denoted by V .

Original: There exist vectors v n,idepending on the matrices B , R and V such that | η z i | 2 Y ≈ (cid:80) n ϕ Tn v n,i v Tn,i ϕ n .
Revised: There exist vectors v n,i such that | η z i | 2 Y ≈ (cid:80) n ϕ Tn v n,i v Tn,i ϕ n .

Original: Then, with the modified indicator function can be written as
Revised: Then, with the modified indicator function can be written as

Original: [Equation]
Revised: [Equation]

Original: Now, using the notation from Section 3.3, we denote the learnable kernel matrices and an input vector: for ⋄ ∈ { Q, K, V } , and u ∈ { q , k , v }
Revised: Now, using the notation from Section 3.3, we denote the learnable kernel matrices and an input vector: for ⋄ ∈ { Q, K, V } , and u ∈ { q , k , v }

Original: [Equation]
Revised: [Equation]

Original: Then, we are able to rewrite (20) as
Revised: Then, we are able to rewrite (20) as

Original: [Equation]
Revised: [Equation]

Original: (22) where C f,g = ∥
Revised: (22) where C f,g = ∥

Original: f − Λ σ 0 g ∥ − 1 ∂ Ω is a normalization weight, and both ∗ and / are element-wise.
Revised: f − Λ σ 0 g ∥ − 1 ∂ Ω is a normalization weight, and both ∗ and / are element-wise.

Original: Here, we may define Q = x h W Q , K = x h W K , and V = x h W V as the query, keys, and values.
Revised: Here, we may define Q = x h W Q , K = x h W K , and V = x h W V as the query, keys, and values.

Original: We can see that, the right matrix multiplications (11) in the attention mechanism are low-rank approximations to the ones above.
Revised: We can see that, the right matrix multiplications (11) in the attention mechanism are low-rank approximations to the ones above.

Original: Hence, based on (22), essentially we need to find a function I resulting in a vector approximation to the true characteristic function {I D ( z j ) }
Revised: Hence, based on (22), essentially we need to find a function I resulting in a vector approximation to the true characteristic function {I D ( z j ) }

Original: [Equation]
Revised: [Equation]

Original: Moreover, when there are L data pairs, the data functions ϕ l are generated by computing their harmonic extensions as in (9).
Revised: Moreover, when there are L data pairs, the data functions ϕ l are generated by computing their harmonic extensions as in (9).

Original: Then, each ϕ l is then treated as a channel of the input data x h .
Revised: Then, each ϕ l is then treated as a channel of the input data x h .

Original: In summary, the expressions in (22) and (23) reveal that a Transformer may be able to further generalize the classical non-parametrized DSM formula in (10) to non-local learnable kernels, and has an intrinsic architectural advantage to take multiple data pairs.
Revised: In summary, the expressions in (22) and (23) reveal that a Transformer may be able to further generalize the classical non-parametrized DSM formula in (10) to non-local learnable kernels, and has an intrinsic architectural advantage to take multiple data pairs.

Original: In the subsequent experiments with regard to the actual EIT benchmark, we provide a potential answer to the question (Q2); namely, the attention architecture is better suited for the reconstruction task as it conforms more with the underlying mathematical structure.
Revised: In the subsequent experiments with regard to the actual EIT benchmark, we provide a potential answer to the question (Q2); namely, the attention architecture is better suited for the reconstruction task as it conforms more with the underlying mathematical structure.

Original: Its non-local kernel interpretation to learn global interactions matches the long range dependence nature of inverse problems.
Revised: Its non-local kernel interpretation to learn global interactions matches the long range dependence nature of inverse problems.

Original:  E XPERIMENTS
Revised:  E XPERIMENTS

Original: In this section we present some experimental results to show the quality of the reconstruction using a single channel ( L = 1 ) of the 2D harmonic extension feature from the 1D signal input.
Revised: In this section we present some experimental results to show the quality of the reconstruction using a single channel ( L = 1 ) of the 2D harmonic extension feature from the 1D signal input.

Original: There are several baseline models to compare: the CNN-based U-Nets (Ronneberger et al., 2015; Guo & Jiang, 2020); the state-of-the-art operator learner Fourier Neural Operator (FNO) (Li et al., 2021a) and its variant with a token-mixing layer (Guibas et al., 2022); MultiWavelet Neural Operator (MWO) (Gupta et al.,2021); Deep Operator Network (DeepONet) (Lu et al., 2021).
Revised: There are several baseline models to compare: the CNN-based U-Nets (Ronneberger et al., 2015; Guo & Jiang, 2020); the state-of-the-art operator learner Fourier Neural Operator (FNO) (Li et al., 2021a) and its variant with a token-mixing layer (Guibas et al., 2022); MultiWavelet Neural Operator (MWO) (Gupta et al., 2021).

Original: The Transformer model of interest is a drop-in replacement of the baseline U-Net, and it is named by U-Integral Transformer (UIT).
Revised: The Transformer model of interest is a drop-in replacement of the baseline U-Net, and it is named by U-Integral Transformer (UIT).

Original: UIT uses the kernel integral inspired attention (11), and we also compare UIT with the linear attention-based Hybrid U-Transformer in Gao et al.
Revised: UIT uses the kernel integral inspired attention (11), and we also compare UIT with the linear attention-based Hybrid U-Transformer in Gao et al.

Original: (2021), as well as a Hadamard product-based cross-attention U-Transformer in Wang et al.
Revised: (2021), as well as a Hadamard product-based cross-attention U-Transformer in Wang et al.

Original: An ablation study is also conducted by replacing the convolution layers in the U-Net with attention (11) on the coarsest level.
Revised: An ablation study is also conducted by replacing the convolution layers in the U-Net with attention (11) on the coarsest level.

Original: For more details of the data setup, training, evaluation in the all experiments please refer to Appendix C.
Revised: For more details of the data setup, training, evaluation in the all experiments please refer to Appendix C.

Original: The comparison result can be found in Table 1.
Revised: The comparison result can be found in Table 1.

Original: Due to the fact that FNO (AFNO, MWO) keeping only the lower modes in spectra, it performs relatively poor in this EIT benchmark where one needs to recover traits that consist of higher modes (sharp boundary edges of inclusion) from lower modes (smooth harmonic extension).
Revised: Due to the fact that FNO (AFNO, MWO) keeping only the lower modes in spectra, it performs relatively poor in this EIT benchmark where one needs to recover traits that consist of higher modes (sharp boundary edges of inclusion) from lower modes (smooth harmonic extension).

Original: Attention-based models are capable to recover “high frequency target from low frequency data”, and in general outperform the CNN-based U-Nets despite having only 1 /of the parameters.
Revised: Attention-based models are capable to recover “high frequency target from low frequency data”, and in general outperform the CNN-based U-Nets despite having only 1 /of the parameters.

Original: Another highlight is that the proposed models are extremely robust to noise thanks to the unique PDE-based feature map through harmonic extension.
Revised: Another highlight is that the proposed models are extremely robust to noise thanks to the unique PDE-based feature map through harmonic extension.

Original: The proposed models can recover the buried domain under a moderately large noise (5%) and an extreme amount of noise (20%) which can be disastrous for many classical methods.
Revised: The proposed models can recover the buried domain under a moderately large noise (5%) and an extreme amount of noise (20%) which can be disastrous for many classical methods.

Revised: τ : the normalized relative strength of noises added in the boundary data before the harmonic extension, see Appendix C for details.

Revised: L 2 -error and cross entropy: the closer to 0 the better; Dice coefficient: the closer to 1 the better

Original: [Table]
Revised: [Table]

Original:  C ONCLUSION
Revised:  C ONCLUSION

Original: For a boundary value inverse problem, we propose a novel operator learner based on the mathematical structure of the inverse operator and Transformer.
Revised: For a boundary value inverse problem, we propose a novel operator learner based on the mathematical structure of the inverse operator and Transformer.

Original: The proposed architecture consists of two components: the first one is a harmonic extension of boundary data (a PDE-based feature map), and the second one is a modified attention mechanism derived from the classical DSM by introducing some learnable non-local integral kernels.
Revised: The proposed architecture consists of two components: the first one is a harmonic extension of boundary data (a PDE-based feature map), and the second one is a modified attention mechanism derived from the classical DSM by introducing some learnable non-local integral kernels.

Original: The evaluation accuracy on the benchmark problems surpasses the current widely-used CNN-based U-Net and the best operator learner FNO.
Revised: The evaluation accuracy on the benchmark problems surpasses the current widely-used CNN-based U-Net and the best operator learner FNO.

Original: This research strengthens the insights that the attention is an adaptable neural architecture that can incorporate a priori mathematical knowledge to design more physics-compatible DNN architectures.
Revised: This research strengthens the insights that the attention is an adaptable neural architecture that can incorporate a priori mathematical knowledge to design more physics-compatible DNN architectures.

Original: However, we acknowledge some limitations: similar to other operator learners, the data manifold on which the operator is learned is assumed to exhibit certain low-dimensional attributes that can be reasonably well approximated by a fixed number of bases.
Revised: However, we acknowledge some limitations: similar to other operator learners, the data manifold on which the operator is learned is assumed to exhibit certain low-dimensional attributes that can be reasonably well approximated by a fixed number of bases.

Revised: In this study, σ to be recovered relies on a piecewise constant assumption.

Revised: For many EIT applications in medical imaging and industrial monitoring, σ may involve non-sharp transitions or even contain highly anisotropic/multiscale behaviors; see Appendix

Revised: G for more discussion on the possible approaches.

Original: R EPRODUCIBILITY S TATEMENT
Revised: R EPRODUCIBILITY S TATEMENT

Original: This paper is reproducible.
Revised: This paper is reproducible.

Original: Experimental details about all empirical results described in this paper are provided in Appendix C. Additionally, we provide the PyTorch (Paszke et al., 2019) code for reproducing in the supplemental material.
Revised: Experimental details about all empirical results described in this paper are provided in Appendix C. Additionally, we provide the PyTorch (Paszke et al., 2019) code for reproducing in the supplemental material.

Original: The dataset used in this paper is available at https://www.
Revised: The dataset used in this paper is available at https://www.

Original: kaggle.com/datasets/anonymousauthor25/eit-transformer .
Revised: kaggle.com/datasets/anonymousauthor25/eit-transformer .

Original: Formal proofs under a rigorous setting of all our theoretical results are provided in Appendices E-F.
Revised: Formal proofs under a rigorous setting of all our theoretical results are provided in Appendices E-F.

Original: A T ABLE OF N OTATIONS
Revised: A T ABLE OF N OTATIONS

Original: [Table]
Revised: [Table]

Original: normal derivative of u , measures the rate of change along the direction of n Λ σ
Revised: normal derivative of u , measures the rate of change along the direction of n Λ σ

Original: NtD map from Neumann data g := ∇ u · n (how fast the solution changes toward the outward normal direction) to
Revised: NtD map from Neumann data g := ∇ u · n (how fast the solution changes toward the outward normal direction) to

Original: Dirichlet data f := u | ∂ Ω (the solution’s value along the tangential direction)
Revised: Dirichlet data f := u | ∂ Ω (the solution’s value along the tangential direction)

Original: [Table]
Revised: [Table]

Original: the Sobolev space of functions
Revised: the Sobolev space of functions

Original: [Table]
Revised: [Table]

Original: the bounded linear functional defined on H s
Revised: the bounded linear functional defined on H s

Original: [Table]
Revised: [Table]

Original: Ω)
Revised: Ω)

Original: [Table]
Revised: [Table]

Original: all u
Revised: all u

Original: [Table]
Revised: [Table]

Original: H s
Revised: H s

Original: [Table]
Revised: [Table]

Original: Ω) such that u ’s integral on Ω vanishes
Revised: Ω) such that u ’s integral on Ω vanishes

Original: [Table]
Revised: [Table]

Original: the seminorm
Revised: the seminorm

Original: [Table]
Revised: [Table]

Original: for
Revised: for

Original: [Table]
Revised: [Table]

Original: in Y
Revised: in Y

Original: B B ACKGROUND OF EIT
Revised: B B ACKGROUND OF EIT

Original: For EIT
Revised: For EIT

Original: [Table]
Revised: [Table]

Original: an immediate question is whether F − 1 and F − 1 L in (4) and (5) are well-defined, namely whether σ can be uniquely determined.
Revised: an immediate question is whether F − 1 and F − 1 L in (4) and (5) are well-defined, namely whether σ can be uniquely determined.

Original: In fact, for the case of full measurements ( L = ∞ ), the uniqueness for F − 1 has been well established, (Brühl, 2001; Hanke & Brühl, 2003; Astala &
Revised: In fact, for the case of full measurements ( L = ∞ ), the uniqueness for F − 1 has been well established, (Brühl, 2001; Hanke & Brühl, 2003; Astala &

Original: Päivärinta, 2006a;b; Nachman, 1996; Kohn & Vogelius, 1984; Sylvester & Uhlmann, 1987).
Revised: Päivärinta, 2006a;b; Nachman, 1996; Kohn & Vogelius, 1984; Sylvester & Uhlmann, 1987).

Original: It is worthwhile to point out that, in this case, σ is not necessarily a piecewise constant function.
Revised: It is worthwhile to point out that, in this case, σ is not necessarily a piecewise constant function.

Original: In (1), we present a simplified case for purposes of illustrating as well as benchmarking.
Revised: In (1), we present a simplified case for purposes of illustrating as well as benchmarking.

Original: In general, with the full spectral information of the NtD map, σ can be uniquely determined as a general positive function.
Revised: In general, with the full spectral information of the NtD map, σ can be uniquely determined as a general positive function.

Original: In contrast to the “full measurement” (infinitely many eigen-pairs known), a more challenging and practical problem is to recover σ from only finitely many boundary data pairs.
Revised: In contrast to the “full measurement” (infinitely many eigen-pairs known), a more challenging and practical problem is to recover σ from only finitely many boundary data pairs.

Original: A common practice for the theoretical study for finite measurements is the assumption of σ being a piecewise constant function, and the task is usually set to recover the shape and location of the inclusion D .
Revised: A common practice for the theoretical study for finite measurements is the assumption of σ being a piecewise constant function, and the task is usually set to recover the shape and location of the inclusion D .

Original: Otherwise, the problem is too ill-posed.
Revised: Otherwise, the problem is too ill-posed.

Original: With finite measurements, the uniqueness of the inclusion remains a long-standing theoretical open problem, and it can be only established for several special classes of the inclusion shape, such as the convex cylinders in Isakov & Powell (1990) or convex polyhedrons in Barceló et al.
Revised: With finite measurements, the uniqueness of the inclusion remains a long-standing theoretical open problem, and it can be only established for several special classes of the inclusion shape, such as the convex cylinders in Isakov & Powell (1990) or convex polyhedrons in Barceló et al.

Original: We refer readers some counter-examples in Kang & Seo (2001) where a twoor three-dimensional ball may not be identified uniquely by one single measurement if the values of σ 0 and σ 1 are unknown.
Revised: We refer readers some counter-examples in Kang & Seo (2001) where a twoor three-dimensional ball may not be identified uniquely by one single measurement if the values of σ 0 and σ 1 are unknown.

Original: Furthermore, here we provide one example to illustrate the difficulty in the reconstruction procedure (Pidcock et al., 1995).
Revised: Furthermore, here we provide one example to illustrate the difficulty in the reconstruction procedure (Pidcock et al., 1995).

Original: Let Ω be a unit circle, let D be a circle with the radius ρ < 1 , and define
Revised: Let Ω be a unit circle, let D be a circle with the radius ρ < 1 , and define

Original: [Equation]
Revised: [Equation]

Original: with σ 1 < 1 being an arbitrary constant.
Revised: with σ 1 < 1 being an arbitrary constant.

Original: In this case, the eigenpairs of Λ σ can be explicitly calculated
Revised: In this case, the eigenpairs of Λ σ can be explicitly calculated

Original: [Equation]
Revised: [Equation]

Original: with µ = (1 − √ σ 1 ) / (1 + √ σ 1 ) , which are exactly the Fourier modes in a unit circle.
Revised: with µ = (1 − √ σ 1 ) / (1 + √ σ 1 ) , which are exactly the Fourier modes in a unit circle.

Original: In this case, if the set of basis { g l } ∞ l =1 is just chosen as { cos( θ ) , sin( θ ) , cos(2 θ ) , sin(2 θ ) , ... } , the matrix representation A σ in (3) can be written as an infinite diagonal matrix
Revised: In this case, if the set of basis { g l } ∞ l =1 is just chosen as { cos( θ ) , sin( θ ) , cos(2 θ ) , sin(2 θ ) , ... } , the matrix representation A σ in (3) can be written as an infinite diagonal matrix

Original: [Equation]
Revised: [Equation]

Original: Thanks to this special geometry, eigenvalues in (25) can clearly determine ρ and σ 1 as follows:
Revised: Thanks to this special geometry, eigenvalues in (25) can clearly determine ρ and σ 1 as follows:

Original: [Equation]
Revised: [Equation]

Original: However, in practice A σ does not have such a simple structure.
Revised: However, in practice A σ does not have such a simple structure.

Original: Approximating A σ itself requires a large number of data pairs which are not available in the considered case.
Revised: Approximating A σ itself requires a large number of data pairs which are not available in the considered case.

Original: Besides, computing the eigenvalues of A σ accurately is also very expensive.
Revised: Besides, computing the eigenvalues of A σ accurately is also very expensive.

Original: Furthermore, for complex inclusion shapes, two eigenvalues are not sufficient to exactly recover the shape and conductivity values.
Revised: Furthermore, for complex inclusion shapes, two eigenvalues are not sufficient to exactly recover the shape and conductivity values.

Original: C E XPERIMENT S ET - UP C. D ATA GENERATION AND TRAINING
Revised: C E XPERIMENT S ET - UP C. D ATA GENERATION AND TRAINING

Original: In the numerical examples, the data generation mainly follows a standard practice in theoretical prototyping for solving EIT problems, see e.g.,Chow et al.
Revised: In the numerical examples, the data generation mainly follows a standard practice in theoretical prototyping for solving EIT problems, see e.g.,Chow et al.

Original: ; Michalikova et al.
Revised: ; Michalikova et al.

Original: ; Hamilton & Hauptmann (2018); Guo & Jiang (2020);
Revised: ; Hamilton & Hauptmann (2018); Guo & Jiang (2020);

Original: Fan & Ying (2020).
Revised: Fan & Ying (2020).

Original: For examples please refer to Figure 2.
Revised: For examples please refer to Figure 2.

Original: The computational domain is set to be Ω :=
Revised: The computational domain is set to be Ω :=

Original: ( − 1 , 1) 2 , and the two media with the different conductivities are with σ 1 = 10 (inclusion) and σ 0 = 1 (background).
Revised: ( − 1 , 1) 2 , and the two media with the different conductivities are with σ 1 = 10 (inclusion) and σ 0 = 1 (background).

Original: The inclusions are generated by four random ellipses with the length of the semi-major axis and semi-minor axis sampled from
Revised: The inclusions are generated by four random ellipses with the length of the semi-major axis and semi-minor axis sampled from

Original: U (0 . 1 , 0 . 2) and U (0 . 2 , 0 . 4) , respectively.
Revised: U (0 . 1 , 0 . 2) and U (0 . 2 , 0 . 4) , respectively.

Original: The rotation angle sampled from U (0 , 2 π ) .
Revised: The rotation angle sampled from U (0 , 2 π ) .

Original: There are 10800 samples in the training set, of which 20% are reserved as validation, and 2000 in the testing set for evaluation.
Revised: There are 10800 samples in the training set, of which 20% are reserved as validation, and 2000 in the testing set for evaluation.

Original: The noise ξ = ξ ( x ) below (10) is assumed to be
Revised: The noise ξ = ξ ( x ) below (10) is assumed to be

Original: [Equation]
Revised: [Equation]

Original: (28) where τ specifies the percentage of noise, and G ( x ) is a normal Gaussian distribution independent with respect to x .
Revised: (28) where τ specifies the percentage of noise, and G ( x ) is a normal Gaussian distribution independent with respect to x .

Original: As ξ ( x ) is merely pointwise imposed, the boundary data can be highly rough even though the true data is chosen to be smooth.
Revised: As ξ ( x ) is merely pointwise imposed, the boundary data can be highly rough even though the true data is chosen to be smooth.

Original: Nevertheless, the harmonic extension makes the noise from boundary data to have impact on the overall reconstruction thanks for the smoothing property of the inverse of the Laplacian operator ( − ∆) − 1 , for an example please see Figure 3.
Revised: Nevertheless, the harmonic extension makes the noise from boundary data to have impact on the overall reconstruction thanks for the smoothing property of the inverse of the Laplacian operator ( − ∆) − 1 , for an example please see Figure 3.

Original: Thanks to the position-wise binary nature of I D , another choice of the loss function during training can be the binary cross entropy L ( · , · ) , applied for a function in P , to measure the distance between the ground truth and the network’s prediction
Revised: Thanks to the position-wise binary nature of I D , another choice of the loss function during training can be the binary cross entropy L ( · , · ) , applied for a function in P , to measure the distance between the ground truth and the network’s prediction

Original: [Equation]
Revised: [Equation]

Original: Thanks for the Pinsker inequality (e.g., see (Cover, 1999, Section 11.6)), L ( p h , u h ) serves as a good upper bound for the square of the total variation, which can be further bounded below by the L 2 -error given the boundedness of the position-wise value.
Revised: Thanks for the Pinsker inequality (e.g., see (Cover, 1999, Section 11.6)), L ( p h , u h ) serves as a good upper bound for the square of the total variation, which can be further bounded below by the L 2 -error given the boundedness of the position-wise value.

Original: −0.
Revised: −0.

Original: −0. −0.
Revised: −0. −0.

Original: −0.
Revised: −0.

Original: The training uses 1cycle (Smith & Topin, 2019) learning rate strategy with a warm-up phase.
Revised: The training uses 1cycle (Smith & Topin, 2019) learning rate strategy with a warm-up phase.

Original: A mini-batch ADAM iterations are run for a total number of 50 epochs with no extra regularization such as weight decay.
Revised: A mini-batch ADAM iterations are run for a total number of 50 epochs with no extra regularization such as weight decay.

Original: The evaluated model is taken from the epoch that has the best validation metric.
Revised: The evaluated model is taken from the epoch that has the best validation metric.

Original: The learning rate starts and ends with 10 − 3 · lr max , and reaches the maximum of lr max at the end of the 10 -th epoch.
Revised: The learning rate starts and ends with 10 − 3 · lr max , and reaches the maximum of lr max at the end of the 10 -th epoch.

Original: The lr max = 10 − 3 .
Revised: The lr max = 10 − 3 .

Original: The result demonstrated is obtained from fixing the random number generator seed.
Revised: The result demonstrated is obtained from fixing the random number generator seed.

Original: The testing results for a randomly chosen sample can be seen in Figure 6.
Revised: The testing results for a randomly chosen sample can be seen in Figure 6.

Original: All models are trained on an RTX 3090 or an A4000.
Revised: All models are trained on an RTX 3090 or an A4000.

Original: The codes to replicate the experiments are open-source and publicly available.
Revised: The codes to replicate the experiments are open-source and publicly available.

Original: C. N ETWORK ARCHITECTURE
Revised: C. N ETWORK ARCHITECTURE

Original: [Figure]
Revised: [Figure]

Original: The difference in architectural hyperparameters, together with training and evaluation costs comparison for all the models compared in the task of EIT reconstruction can be found in Table 3.
Revised: The difference in architectural hyperparameters, together with training and evaluation costs comparison for all the models compared in the task of EIT reconstruction can be found in Table 3.

Original: U-Integral Transformer
Revised: U-Integral Transformer

Original: • Overall architecture.
Revised: • Overall architecture.

Original: The U-Integral-Transformer architecture is a drop-in replacement of the standard CNN-based U-Net baseline model (7.7m) in Table 1.
Revised: The U-Integral-Transformer architecture is a drop-in replacement of the standard CNN-based U-Net baseline model (7.7m) in Table 1.

Original: Same with the baseline U-Net, the UIT has total 3 downsampling layers.
Revised: Same with the baseline U-Net, the UIT has total 3 downsampling layers.

Original: The downsampling layers map m × m latent representations to m/ 2 × m/ 2 , and expand the number of channels from C to 2 C .
Revised: The downsampling layers map m × m latent representations to m/ 2 × m/ 2 , and expand the number of channels from C to 2 C .

Original: UIT has 3 upsampling layers, which map m/ 2 × m/ 2 latent representations to m × m , and shrink the number of channels from 2 C to C .
Revised: UIT has 3 upsampling layers, which map m/ 2 × m/ 2 latent representations to m × m , and shrink the number of channels from 2 C to C .

Original: An attention block is applied the coarsest level, as well as in upsampling layers to compute the interaction between the latent representations on both coarse and find grids (see below).
Revised: An attention block is applied the coarsest level, as well as in upsampling layers to compute the interaction between the latent representations on both coarse and find grids (see below).

Original: For a high level encoder-decoder schematics please see Figure 8.
Revised: For a high level encoder-decoder schematics please see Figure 8.

Original: • Double convolution block.
Revised: • Double convolution block.

Original: The double convolution block is modified from that commonly seen in Computer Vision (CV) models, such as ResNet (He et al., 2016).
Revised: The double convolution block is modified from that commonly seen in Computer Vision (CV) models, such as ResNet (He et al., 2016).

Original: We modify this block such that upon being used in an attention block, the batch normalization (Ioffe & Szegedy, 2015) shall be replaced by the layer normalization (Ba et al., 2016) which can be understood as a learnable approximation to the Gram matrices’ inverse by a diagonal matrix.
Revised: We modify this block such that upon being used in an attention block, the batch normalization (Ioffe & Szegedy, 2015) shall be replaced by the layer normalization (Ba et al., 2016) which can be understood as a learnable approximation to the Gram matrices’ inverse by a diagonal matrix.

Original: • Positional embedding.
Revised: • Positional embedding.

Original: At each resolution, The 2D Euclidean coordinates of an m × m regular Cartesian grid are applied a channel expansion through a learnable linear layer, and then are added to each latent representation.
Revised: At each resolution, The 2D Euclidean coordinates of an m × m regular Cartesian grid are applied a channel expansion through a learnable linear layer, and then are added to each latent representation.

Original: This choice of positional embedding enables a bilinear interpolation between the coarse and fine grids or vice versa (see below).
Revised: This choice of positional embedding enables a bilinear interpolation between the coarse and fine grids or vice versa (see below).

Original: • Mesh-normalized attention.
Revised: • Mesh-normalized attention.

Original: The scaled dot-product attention in the network is chosen to be a softmax-free integral kernel attention in (11) with a mesh-based normalization.
Revised: The scaled dot-product attention in the network is chosen to be a softmax-free integral kernel attention in (11) with a mesh-based normalization.

Original: For a diagram in a single attention head please refer to Figure 7.
Revised: For a diagram in a single attention head please refer to Figure 7.

Original: • Interpolation.
Revised: • Interpolation.

Original: Instead of max pooling used in the standard CNN-based U-Net, we opt for a bilinear interpolation on the Cartesian grid to map a latent representation from the fine grid to the coarse grid or vice versa.
Revised: Instead of max pooling used in the standard CNN-based U-Net, we opt for a bilinear interpolation on the Cartesian grid to map a latent representation from the fine grid to the coarse grid or vice versa.

Original: Note that, in the upsampling layers, the interpolation’s outputs are directly fed into an attention block that computes the interaction of latent representations between coarse and fine grids (see below).
Revised: Note that, in the upsampling layers, the interpolation’s outputs are directly fed into an attention block that computes the interaction of latent representations between coarse and fine grids (see below).

Original: [Figure]
Revised: [Figure]

Original: = = =
Revised: = = =

Original: Norm Norm
Revised: Norm Norm

Original: [Figure]
Revised: [Figure]

Revised: =

Revised: [Figure]

Revised: [Table]

Original: • Coarse-fine attention in up blocks.
Revised: • Coarse-fine attention in up blocks.

Original: The convolution layer on the coarsest level is replaced by the attention with pre-inner-product normalization in Section 3.3.
Revised: The convolution layer on the coarsest level is replaced by the attention with pre-inner-product normalization in Section 3.3.

Original: The skip connection from the encoder latent representations to the ones in the decoder are generated using an architecture similar to the cross attention used in (Petit et al., 2021).
Revised: The skip connection from the encoder latent representations to the ones in the decoder are generated using an architecture similar to the cross attention used in (Petit et al., 2021).

Original: Q and K are generated from the latent representation functions on the same coarser grids, such that the attention kernel to measure the interaction between different channels is built from on the coarse grid.
Revised: Q and K are generated from the latent representation functions on the same coarser grids, such that the attention kernel to measure the interaction between different channels is built from on the coarse grid.

Original: V is associated with a finer grid.
Revised: V is associated with a finer grid.

Original: The major differences of ours with the one in Petit et al.
Revised: The major differences of ours with the one in Petit et al.

Original: (2021) are that ours are inspired by the kernel integral for a PDE problem, thus the modified attention in our method has (1) no softmax normalization or (2) no Hadamard product-type skip connection.
Revised: (2021) are that ours are inspired by the kernel integral for a PDE problem, thus the modified attention in our method has (1) no softmax normalization or (2) no Hadamard product-type skip connection.

Original: Other operator learners compared
Revised: Other operator learners compared

Original: • Fourier Neural Operator (FNO) and variants.
Revised: • Fourier Neural Operator (FNO) and variants.

Original: Fourier Neural Operator (FNO2d) learns convolutional filters in the frequency domain for some pre-selected modes, which efficiently captures globally-supported spatial interactions for these modes.
Revised: Fourier Neural Operator (FNO2d) learns convolutional filters in the frequency domain for some pre-selected modes, which efficiently captures globally-supported spatial interactions for these modes.

Original: The weight filter in the frequency domain is multiplied to the lowest modes in the latent representations (four corners in the FFT).
Revised: The weight filter in the frequency domain is multiplied to the lowest modes in the latent representations (four corners in the FFT).

Original: The Adaptive Fourier Neural Operator (AFNO2d) adds a token-mixing layer, as seen in Figure 2 in Guibas et al.
Revised: The Adaptive Fourier Neural Operator (AFNO2d) adds a token-mixing layer, as seen in Figure 2 in Guibas et al.

Original: , appending every spectral convolution layer in the baseline FNO2d model.
Revised: , appending every spectral convolution layer in the baseline FNO2d model.

Original: • Multi-Wavelet Neural Operator (MWO).
Revised: • Multi-Wavelet Neural Operator (MWO).

Original: The MultiWavelet Neural Operator (MWO) is proposed in Gupta et al.
Revised: The MultiWavelet Neural Operator (MWO) is proposed in Gupta et al.

Original: (2021), which introduces a multilevel structure into the FNO architecture.
Revised: (2021), which introduces a multilevel structure into the FNO architecture.

Original: On each level, MWO still follows FNO’s practice by pre-selecting the lowest modes.Deep
Revised: On each level, MWO still follows FNO’s practice by pre-selecting the lowest modes.

Original: Operator Network (DeepONet).

Original: The Deep Operator Network (DeepONet) is proposed in Lu et al. DeepONet’s architecture leverages a learnable basis expansion to approximate nonlinear operators (Chen & Chen, 1995), where the bases and the coefficients are learned in two individual fully-connected neural networks (branch and trunk) which have no cross-layer communications. However, we do acknowledge that the original DeepONet is not a tensor2tensor neural network, as the number of parameters depend on the number of “sensors” (discretization grid points).
Revised: [Figure]

Original: In the comparison, the branch DNN is changed from a fully-connected NN to a

Original: DCNN.

Original: D F ROM DSM TO T RANSFORMER
Revised: D F ROM DSM TO T RANSFORMER

Original: In this section, we present a more detailed presentation of the attention-like operator being derived from (15) with learnable kernels.
Revised: In this section, we present a more detailed presentation of the attention-like operator being derived from (15) with learnable kernels.

Original: We begin with recalling the original indicator function from (10):
Revised: We begin with recalling the original indicator function from (10):

Original: [Equation]
Revised: [Equation]

Original: where C f,g = ∥
Revised: where C f,g = ∥

Original: f − Λ σ 0 g ∥ − 1 L 2 ( ∂ Ω) is a constant, and the equations of the functions ϕ and η x are : 
Revised: f − Λ σ 0 g ∥ − 1 L 2 ( ∂ Ω) is a constant, and the equations of the functions ϕ and η x are : −

Original: [Equation]
Revised: [Equation]

Revised: ϕ

Original: [Table]
Revised: [Equation]

Revised: 0 in Ω ,

Original: [Figure]
Revised: [Equation]

Original: : 3 × 3 convolution + ReLU; : layer normalization or batch normalization; : bilinear interpolation from the fine grid to the coarse grid; : cross attention from the coarse grid to the fine grid; : input and output discretized functions in certain Hilbert spaces.

Original: In Chow et al.
Revised: In Chow et al.

Original: (2014), it has been shown that I D ( x ) can be written as a sum of Gaussian-like distributions which attain maximal values for x ∈ D or close to D .
Revised: (2014), it has been shown that I D ( x ) can be written as a sum of Gaussian-like distributions which attain maximal values for x ∈ D or close to D .

Original: However, the accuracy is much limited by some empirical choices of quantities in (30), for example d ( x ) =
Revised: However, the accuracy is much limited by some empirical choices of quantities in (30), for example d ( x ) =

Original: ∇ ϕ
Revised: ∇ ϕ

Original: ( x ) / ∥∇ ϕ
Revised: ( x ) / ∥∇ ϕ

Original: ( x ) ∥ and s = 3 / 2 .
Revised: ( x ) ∥ and s = 3 / 2 .

Original: In addition, the frequency of the boundary data plays an important role in reconstruction, see the derivation in (Chow et al., 2014, Section 5) for circular Ω .
Revised: In addition, the frequency of the boundary data plays an important role in reconstruction, see the derivation in (Chow et al., 2014, Section 5) for circular Ω .

Original: What’s more, only for a single data pair, such a simple formula can be derived.
Revised: What’s more, only for a single data pair, such a simple formula can be derived.

Original: Henceforth, these “empirical chosen quantities” are made to be learnable from data by introducing two undetermined kernels K ( x, y ) , Q ( x, y ) , and a self-adjoint positive definite linear operator V , the modified indicator function is written as
Revised: Henceforth, these “empirical chosen quantities” are made to be learnable from data by introducing two undetermined kernels K ( x, y ) , Q ( x, y ) , and a self-adjoint positive definite linear operator V , the modified indicator function is written as

Original: [Equation]
Revised: [Equation]

Original: 33) with
Revised: with

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: Applying certain quadrature rule to (33) with the quadrature points z i , i.e., the grid points of Ω h , and weights { ω j } , we obtain an approximation to the integral:
Revised: Applying certain quadrature rule to (33) with the quadrature points z i , i.e., the grid points of Ω h , and weights { ω j } , we obtain an approximation to the integral:

Original: [Equation]
Revised: [Equation]

Original:  i.e., q Ti is the vector of [ ω j K ( z i , z j )] j .
Revised: (36) i.e., q Ti is the vector of [ ω j K ( z i , z j )] j .

Original: For (34), we consider one component d n ( x ) of d ( x ) .
Revised: For (34), we consider one component d n ( x ) of d ( x ) .

Original: With the same rule to compute the integral, (16) can be written as
Revised: With the same rule to compute the integral, (16) can be written as

Original: [Equation]
Revised: [Equation]

Original: i.e., q Ti is the vector of [ ω j Q ( z i , z j )] j .
Revised: i.e., q Ti is the vector of [ ω j Q ( z i , z j )] j .

Original: Next, we proceed to express | η
Revised: Next, we proceed to express | η

Original: z i | Y by discretizing the variational form in (32) using a linear finite element method (FEM).
Revised: z i | Y by discretizing the variational form in (32) using a linear finite element method (FEM).

Original: Applying integration by parts, the weak form of (32) at x =
Revised: Applying integration by parts, the weak form of (32) at x =

Original: z i is
Revised: z i is

Original: [Equation]
Revised: [Equation]

Original: for any test function ψ ∈ H 10 (Ω) .
Revised: for any test function ψ ∈ H 10 (Ω) .

Original: Here, we let { ψ ( j ) } Mj =1 be the collection of the finite element basis functions, and for the fixed z i we further let ψ n,i be the vector approximating [ ∂ x n ψ ( j ) ( z i )]
Revised: Here, we let { ψ ( j ) } Mj =1 be the collection of the finite element basis functions, and for the fixed z i we further let ψ n,i be the vector approximating [ ∂ x n ψ ( j ) ( z i )]

Original: Mj =1 .
Revised: Mj =1 .

Original: Denote η i as the vector approximating { η z i (
Revised: Denote η i as the vector approximating { η z i (

Original: z j ) } Mj =1 .
Revised: z j ) } Mj =1 .

Revised: Introduce the matrices

Revised: • B : the finite element/finite difference discretization of − ∆ on Ω h (a discrete Laplacian) coupled with the Neumann boundary condition

Revised: and

Revised: the zero integral normalization

Original:  Then, the finite element discretization of (38) yields the linear system:
Revised: condition in (9). • R : the matrix that projects a vector defined at interior grids to the one defined on ∂ Ω . Then, the finite element discretization of (38) yields the linear system:

Original: [Equation]
Revised: [Equation]

Original:  where we have used (37).
Revised: (39) where we have used (37).

Original: Then, the trace of η z i on ∂ Ω admits the following approximation
Revised: Then, the trace of η z i on ∂ Ω admits the following approximation

Original: [Equation]
Revised: [Equation]

Original: [Equation]

Original: Now, we can discretize (35).
Revised: Now, we can discretize (35).

Original: Note that the trace of a linear finite element space on ∂ Ω is still a continuous piecewise linear space which is defined as S h ( ∂ Ω) .
Revised: Note that the trace of a linear finite element space on ∂ Ω is still a continuous piecewise linear space which is defined as S h ( ∂ Ω) .

Original: Then, the self-adjoint positive definite operator V can be parameterized by a symmetric positive definite (SPD) matrix denoted by
Revised: Then, the self-adjoint positive definite operator V can be parameterized by a symmetric positive definite (SPD) matrix denoted by

Original: V operating on the space S h ( ∂ Ω) .
Revised: V operating on the space S h ( ∂ Ω) .

Original: We can approximate | η
Revised: We can approximate | η

Original: z i | 2 Y as
Revised: z i | 2 Y as

Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: ) where ψ Tn,i B − 1 R T V RB − 1 ψ n,i ≥ 0 as V is SPD.
Revised: where ψ Tn,i B − 1 R T V RB − 1 ψ n,i ≥ 0 as V is SPD.

Original: Define
Revised: Define

Revised: [Equation]

Revised: n,

Original: [Equation]
Revised: [Equation]

Original:  which can be considered as another learnable vector since the coefficient of q i comes from the learnable matrix V .
Revised: ) which can be considered as another learnable vector since the coefficient of q i comes from the learnable matrix V .

Original: Then, (41) reduces to
Revised: Then, (41) reduces to

Original: [Equation]
Revised: [Equation]

Original: Putting (36), (37) and (43) into (15), we have
Revised: Putting (36), (37) and (43) into (15), we have

Original: [Equation]
Revised: [Equation]

Original: Now, using the notation in (21), we get the desired representation (22).
Revised: Now, using the notation in (21), we get the desired representation (22).

Original: E P ROOF OF T HEOREM
Revised: E P ROOF OF T HEOREM

Original: Lemma 1.
Revised: Lemma 1.

Original: Suppose the boundary data g l is the eigenfunction of Λ σ − Λ σ 0 corresponding to the l -th eigenvalue λ l , and let ϕ l be the data functions generated by harmonic extensions − ∆ ϕ l = 0 in Ω ,
Revised: Suppose the boundary data g l is the eigenfunction of Λ σ − Λ σ 0 corresponding to the l -th eigenvalue λ l , and let ϕ l be the data functions generated by harmonic extensions − ∆ ϕ l = 0 in Ω ,

Original: [Equation]
Revised: [Equation]

Original: where l = 1 , 2 ,
Revised: where l = 1 , 2 ,

Original: Let d be an arbitrary direction in R N , define a function
Revised: Let d be an arbitrary direction in R N , define a function

Original: [Equation]
Revised: [Equation]

Original: Then, there holds
Revised: Then [Equation] there holds

Original: [Equation]
Revised: [Equation]

Original: Proof.
Revised: Proof.

Original: See Theorem 4.1 in (Guo & Jiang, 2020), and also see (Brühl, 2001; Hanke & Brühl, 2003).
Revised: See Theorem 4.1 in (Guo & Jiang, 2020), and also see (Brühl, 2001; Hanke & Brühl, 2003).

Original: Theorem 1 (A finite dimensional approximation of the index map) .
Revised: Theorem 1 (A finite dimensional approximation of the index function) .

Original: Suppose the boundary data g l is the eigenfunction of Λ σ − Λ σ 0 corresponding to the l -th eigenvalue λ l , and let ϕ l be the data functions generated by harmonic extensions given in (9) .
Revised: Suppose the boundary data g l is the eigenfunction of Λ σ − Λ σ 0 corresponding to the l -th eigenvalue λ l , and let ϕ l be the data functions generated by harmonic extensions given in (9) .

Original: Define the space:
Revised: Define the space:

Original: [Equation]
Revised: [Equation]

Original: and the dictionary:
Revised: and the dictionary:

Original: [Equation]
Revised: [Equation]

Original: Then, for any ϵ > 0 , there exists a sufficiently large L such that
Revised: Then, for any ϵ > 0 , there exists a sufficiently large L such that

Original: [Equation]
Revised: [Equation]

Original: Proof.
Revised: Proof.

Original: Consider the function Θ L ( x ) from Lemma 1.
Revised: Consider the function Θ L ( x ) from Lemma 1.

Original: As Θ L ( x ) > 0 , it is increasing with respect to
Revised: As Θ L ( x ) > 0 , it is increasing with respect to

Original: L .
Revised: L .

Original: Then, there is a constant ρ such that ρ > Θ L ( x ) , ∀ x ∈ D .
Revised: Then, there is a constant ρ such that ρ > Θ L ( x ) , ∀ x ∈ D .

Original: Given any ϵ > 0 , there is an integer L such that Θ L ( x ) > 4 ρϵ − 2 /π 2 , ∀ x / ∈ D .
Revised: Given any ϵ > 0 , there is an integer L such that Θ L ( x ) > 4 ρϵ − 2 /π 2 , ∀ x / ∈ D .

Original: Define
Revised: Define

Original: [Equation]
Revised: [Equation]

Original: Note the fundamental inequality z > arctan( z ) ≥ π 2 − z − 1 , ∀ z > 0 .
Revised: Note the fundamental inequality z > arctan( z ) ≥ π 2 − z − 1 , ∀ z > 0 .

Original: Then, if x ∈ D , there holds
Revised: Then, if x ∈ D , there holds

Original: [Equation]
Revised: [Equation]

Original: if x / ∈ D , there holds
Revised: if x / ∈ D , there holds

Original: [Equation]
Revised: [Equation]

Original: Therefore, the function in (51) fulfills (50).
Revised: Therefore, the function in (51) fulfills (50).

Original: F P ROOF OF T HEOREM
Revised: F P ROOF OF T HEOREM

Original: In presenting Theorem 2 in Section 3.3, we use the term “multiplicative” to describe the fact that two latent representations are multiplied in the attention mechanism, and, in contrast, there is no such operation in, e.g., a pointwise FFN or a convolution layer.
Revised: In presenting Theorem 2 in Section 3.3, we use the term “multiplicative” to describe the fact that two latent representations are multiplied in the attention mechanism, and, in contrast, there is no such operation in, e.g., a pointwise FFN or a convolution layer.

Original: Heuristically speaking, the main result in
Revised: Heuristically speaking, the main result in

Original: Theorem 2 states that the output latent representations can be of a higher “frequency” than the input if the neural network architecture has “multiplicative” layers in it.
Revised: Theorem 2 states that the output latent representations can be of a higher “frequency” than the input if the neural network architecture has “multiplicative” layers in it.

Original: The input latent representations are discretizations of certain functions, and they are combined using matrix dot product as the one used in attention.
Revised: The input latent representations are discretizations of certain functions, and they are combined using matrix dot product as the one used in attention.

Original: If it is assumed that this discretization can represent functions of such a frequency with certain approximation error, then the resulting matrix/tensor can be an approximation of a function with higher frequency than the existing latent representation under the same discretization.
Revised: If it is assumed that this discretization can represent functions of such a frequency with certain approximation error, then the resulting matrix/tensor can be an approximation of a function with higher frequency than the existing latent representation under the same discretization.

Original: For an empirical evidence of this phenomenon for the latent representation please see Figure 9 and Figure 10: with completely smooth input (harmonic extensions), attention-based learner is able to generate latent representations with multiple peaks and valleys.
Revised: For an empirical evidence of this phenomenon for the latent representation please see Figure 9 and Figure 10: with completely smooth input (harmonic extensions), attention-based learner is able to generate latent representations with multiple peaks and valleys.

Original: Theorem 2 (Frequency-bootstrapping for multiplicative neural architectures) .
Revised: Theorem 2 (Frequency-bootstrapping for multiplicative neural architectures) .

Original: Consider Ω = (0 , π ) which has a uniform discretization of { z i } Mi =1 of size h , and N ≥ 1 is the number of channels in the attention layer of interest, assume that (i) the current latent representation p h ∈ R M × N consists the discretization of the first N Legendre polynomials { p j ( · ) } Nj =1 such that ( p h ) ij =
Revised: Consider Ω = (0 , π ) which has a uniform discretization of { z i } Mi =1 of size h , and N ≥ 1 is the number of channels in the attention layer of interest, assume that (i) the current latent representation p h ∈ R M × N consists the discretization of the first N Legendre polynomials { p j ( · ) } Nj =1 such that ( p h ) ij =

Original: p j ( z i ) , (ii) p h is normalized and the normalization weights α ≡ 1 in (14) , (iii) the discretization satisfies that | (cid:80) M i
Revised: p j ( z i ) , (ii) p h is normalized and the normalization weights α ≡ 1 in (14) , (iii) the discretization satisfies that | (cid:80) M i

Original: =1 hf ( z i ) − (cid:82) Ω f ( x ) d x | ≤ C h .
Revised: =1 hf ( z i ) − (cid:82) Ω f ( x ) d x | ≤ C h .

Original: Then, for v ( x ) = sin( ax ) for some a ∈ R + , there exists a set of attention weights { W Q , W K , W V } such that for u ( x ) = sin( a ′ x ) with a ′ >
Revised: Then, for v ( x ) = sin( ax ) for some a ∈ R + , there exists a set of attention weights { W Q , W K , W V } such that for u ( x ) = sin( a ′ x ) with a ′ >

Original: a
Revised: a

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: where ˜ u and ˜ κ ( · , · ) are defined as the output of and the kernel of the attention formulation in (14) , respectively; ε ( x ) :
Revised: where ˜ u and ˜ κ ( · , · ) are defined as the output of and the kernel of the attention formulation in (14) , respectively; ε ( x ) :

Original: = ∥ κ ( x, · ) − ˜ κ ( x, · )
Revised: = ∥ κ ( x, · ) − ˜ κ ( x, · )

Original: ∥
Revised: ∥

Original: L 2 (Ω) is the error function for the kernel approximation.
Revised: L 2 (Ω) is the error function for the kernel approximation.

Original: Proof.
Revised: Proof.

Original: Without loss of generality, it is assumed that a = 1 and a ′ = 2 .
Revised: Without loss of generality, it is assumed that a = 1 and a ′ = 2 .

Original: The essential technical tools used suggest the validity for any a ′ > a > 0 ( a ′ , a ∈ Z + ).
Revised: The essential technical tools used suggest the validity for any a ′ > a > 0 ( a ′ , a ∈ Z + ).

Original: Consider a simple non-separable smooth kernel function
Revised: Consider a simple non-separable smooth kernel function

Original: [Equation]
Revised: [Equation]

Original: it is straightforward to verify that for v ( x
Revised: it is straightforward to verify that for v ( x

Original: [Equation]
Revised: [Equation]

Original: sin
Revised: sin

Original: [Equation]
Revised: [Equation]

Original: As is shown, it suffices to show that the matrix multiplication (a separable kernel) in the attention mechanism approximates this non-separable kernel with an error related to the number of channels.
Revised: As is shown, it suffices to show that the matrix multiplication (a separable kernel) in the attention mechanism approximates this non-separable kernel with an error related to the number of channels.

Original: To this end, taking the Taylor expansion, centered at a z 0 ∈ Ω of κ ( x, · ) with respect to the second variable at each x ∈ Ω , we have
Revised: To this end, taking the Taylor expansion, centered at a z 0 ∈ Ω of κ ( x, · ) with respect to the second variable at each x ∈ Ω , we have

Original: [Equation]
Revised: [Equation]

Original: It is straightforward to check that
Revised: It is straightforward to check that

Original: [Equation]
Revised: [Equation]

Original: By the assumptions on κ ( · , · ) , and a simple calculus we have
Revised: By the assumptions on κ ( · , · ) , and a simple calculus we have

Original: [Equation]
Revised: [Equation]

Original: Next, denote q l ( z ) :=
Revised: Next, denote q l ( z ) :=

Original: ( z − z 0 ) l − 1 / ( l − 1)!
Revised: ( z − z 0 ) l − 1 / ( l − 1)!

Original: and k l ( x ) :
Revised: and k l ( x ) :

Original: = ∂ l − 1 κ/∂z l − 1 ( x, z 0 ) for 1 ≤ l ≤ N , i.e., κ N ( x, z ) =
Revised: = ∂ l − 1 κ/∂z l − 1 ( x, z 0 ) for 1 ≤ l ≤ N , i.e., κ N ( x, z ) =

Original: N (cid:88) l = q l ( x ) k l ( z ) .
Revised: N (cid:88) l = q l ( x ) k l ( z ) .

Original: By the choice of the latent representation space, q l ∈ Y = span { p j } , thus there exists a set of weights { w Ql ∈ R L } Nl =1 such that q l ( · ) =
Revised: By the choice of the latent representation space, q l ∈ Y = span { p j } , thus there exists a set of weights { w Ql ∈ R L } Nl =1 such that q l ( · ) =

Original: (cid:80) lj
Revised: (cid:80) lj

Original: =
Revised: =

Original: 1 w Ql,j p j ( · ) =:
Revised: 1 w Ql,j p j ( · ) =:

Original: ˜ q l ( · ) .
Revised: ˜ q l ( · ) .

Original: This is to say, Q = p h W Q ∈ R M × N with the l -th column of Q being the discretization of ˜ q l ( · ) .
Revised: This is to say, Q = p h W Q ∈ R M × N with the l -th column of Q being the discretization of ˜ q l ( · ) .

Original: For the key matrix, by standard polynomial approximation estimate, there exists a set of weights {
Revised: For the key matrix, by standard polynomial approximation estimate, there exists a set of weights {

Original: w Kl ∈ R N } Nl =1 , such that k l ( · ) ≈ (cid:80) Nj =
Revised: w Kl ∈ R N } Nl =1 , such that k l ( · ) ≈ (cid:80) Nj =

Original: 1 w Kl,j p j ( · )
Revised: 1 w Kl,j p j ( · )

Original: =:
Revised: =:

Original: ˜ k l ( · ) , i.e., K = p h W K ∈ R M × N with the l -th column of K being the discretization of ˜ k l ( · ) .
Revised: ˜ k l ( · ) , i.e., K = p h W K ∈ R M × N with the l -th column of K being the discretization of ˜ k l ( · ) .

Original: Moreover, it can approximate k l ( · )
Revised: Moreover, it can approximate k l ( · )

Original: [Equation]
Revised: [Equation]

Original: Similarly, for v ( · ) := v 1 ( · ) which can be chosen as the 1st channel of V defined earlier, we have { w Vl ∈ R N } such that v ( · ) ≈ (cid:80) Nj =
Revised: Similarly, for v ( · ) := v 1 ( · ) which can be chosen as the 1st channel of V defined earlier, we have { w Vl ∈ R N } such that v ( · ) ≈ (cid:80) Nj =

Original: 1 w K 1 ,j p j ( · ) =:
Revised: 1 w K 1 ,j p j ( · ) =:

Original: ˜ v ( · )
Revised: ˜ v ( · )

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: Now, to approximate the frequency bootstrapping in (54), define
Revised: Now, to approximate the frequency bootstrapping in (54), define

Original: [Equation]
Revised: [Equation]

Original: with ˜
Revised: with ˜

Original: [Equation]
Revised: [Equation]

Original: N
Revised: N

Original: [Equation]
Revised: [Equation]

Original: x
Revised: x

Original: [Equation]
Revised: [Equation]

Original: z
Revised: z

Original: [Equation]
Revised: [Equation]

Original: N
Revised: N

Original: [Equation]
Revised: [Equation]

Original: =
Revised: =

Original: [Equation]
Revised: [Equation]

Original: Then
Revised: Then

Original: [Equation]
Revised: [Equation]

Original: we have for any z ∈ Ω
Revised: we have for any z ∈ Ω

Original: [Equation]
Revised: [Equation]

Original: Thus, we have
Revised: Thus, we have

Original: [Equation]
Revised: [Equation]

Original: Now, by triangle inequality, q l = ˜ q l , the definitions above (53) implying | k l ( · ) | H N (Ω) ≤ c 2 N and ∥
Revised: Now, by triangle inequality [Equation] q l = ˜ q l , the definitions above (53) implying | k l ( · ) | H N (Ω) ≤ c 2 N and ∥

Original: q l ∥ L 2 (Ω) ≤ cπ N / ( √ NN !)
Revised: q l ∥ L 2 (Ω) ≤ cπ N / ( √ NN !)

Original: [Equation]
Revised: [Equation]

Original: and the estimate in (59)
Revised: and the estimate in (59)

Original: [Equation]
Revised: [Equation]

Original: Notice this is the same order with the estimate of ∥ κ ( x, · ) − κ N ( x, · )
Revised: Notice this is the same order with the estimate of ∥ κ ( x, · ) − κ N ( x, · )

Original: ∥
Revised: ∥

Original: L 2 (Ω) .
Revised: L 2 (Ω) .

Original: For the term ∥ ˜ κ N ( x, · ) ∥
Revised: For the term ∥ ˜ κ N ( x, · ) ∥

Original: L 2 (Ω) , a simple triangle inequality trick can be used:
Revised: L 2 (Ω) , a simple triangle inequality trick can be used:

Original: [Equation]
Revised: [Equation]

Original: which can be further estimate reusing the argument in (64).
Revised: which can be further estimate reusing the argument in (64).

Original: Lastly, using the following argument and the estimate for ∥ u − ˜ u
Revised: Lastly, using the following argument and the estimate for ∥ u − ˜ u

Original: ∥ L ∞ (Ω) yield the desired result:
Revised: ∥ L ∞ (Ω) yield the desired result:

Original: [Equation]
Revised: [Equation]

Original: G L IMITATIONS , E XTENSIONS , AND F UTURE WORK
Revised: G L IMITATIONS , E XTENSIONS , AND F UTURE WORK

Original: In this study, the σ to be recovered relies on a piecewise constant assumption.
Revised: In this study, the σ to be recovered relies on a piecewise constant assumption.

Original: This assumption is commonly seen in the theoretical study of the original DSM.
Revised: This assumption is commonly seen in the theoretical study of the original DSM.

Original: For many EIT applications in medical imaging and industrial monitoring, σ may involve non-sharp transitions or even contain highly anisotropic/multiscale behaviors making it merely an L ∞ function.
Revised: For many EIT applications in medical imaging and industrial monitoring, σ may involve non-sharp transitions or even contain highly anisotropic/multiscale behaviors making it merely an L ∞ function.

Original: If the boundary data pairs are still quite limited, i.e., only a few electric modes are placed on the boundary ∂ Ω , the proposed model alone is not expected to perform as well as in benchmark problems.
Revised: If the boundary data pairs are still quite limited, i.e., only a few electric modes are placed on the boundary ∂ Ω , the proposed model alone is not expected to perform as well as in benchmark problems.

Original: Nevertheless, it can still contribute in achieving reconstruction with relatively higher accuracy, if certain a priori knowledge of the problem is accessible.
Revised: Nevertheless, it can still contribute in achieving reconstruction with satisfactory accuracy, if certain a priori knowledge of the problem is accessible.

Original: End2end-wise, the modification can be to employ a suitable data set, in which the sampling of { σ ( k ) } represent the true σ ’s distribution a posteriori to a certain degree.
Revised: End2end-wise, the modification can be to employ a suitable data set, in which the sampling of { σ ( k ) } represent the true σ ’s distribution a posteriori to a certain degree.

Original: However, to reconstruct non-piecewise constant conductivities, more boundary data pairs or even the entire NtD map is demanded from a theoretical perspective (Astala & Päivärinta, 2006a;b; Nachman, 1996; Kohn & Vogelius, 1984; Sylvester & Uhlmann, 1987).
Revised: However, to reconstruct non-piecewise constant conductivities, more boundary data pairs or even the entire NtD map is demanded from a theoretical perspective (Astala & Päivärinta, 2006a;b; Nachman, 1996; Kohn & Vogelius, 1984; Sylvester & Uhlmann, 1987).

Revised: For fewer data pairs and more complicated conductivity set-up, there has been efforts in this direction using matrix completition in a hierarchical way (Bui-Thanh et al., 2022).

Original: In the case considered, a Fredholm integral equation needs to be solved for reconstruction, see Nachman (1996, Theorem 4.1), which itself is strongly related to the modified attention mechanism (14) of the proposed Transformer.
Revised: In the case considered, a Fredholm integral equation needs to be solved for reconstruction, see Nachman (1996, Theorem 4.1), which itself is strongly related to the modified attention mechanism (14) of the proposed Transformer.

Original: The architectural resemblance may lead to future explorations in this direction.
Revised: The architectural resemblance may lead to future explorations in this direction.

Original: From the perspective of improving the reconstruction for a single instance, inspired by the classical iterative methods, as well as a novel adaption by the authors of FNO (Li et al., 2021b), an optimization with regularization can be applied for the instance of interest (fine-tune), while the initial guess is the reconstruction by the operator learner trained in the end2end pipeline (pre-train).
Revised: From the perspective of improving the reconstruction for a single instance, inspired by the classical iterative methods involving adaptivity (Jin & Xu, 2019), as well as a novel adaption by the authors of FNO (Li et al., 2021b), an optimization with regularization can be applied for the instance of interest (fine-tune), while the initial guess is the reconstruction by the operator learner trained in the end2end pipeline (pre-train).

Original: [Figure]
Revised: [Figure]

Original: ) (b) (c) (d) (e) (f) (g) (h) (i) (j) (k) (l)
Revised: ) (b) (c) (d) (e) (f) (g) (h) (i) (j) (k) (l)

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Figure] [Figure]
Revised: [Figure] [Figure]