Eran Treister
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Eran Treister has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
Moshe Eliasof
Univ Cambridge, Dept Appl Math & Theoret Phys, Cambridge, England
12 shared publicationsEldad Haber
University of British Columbia, Vancouver V6T 1Z4, BC, Canada
8 shared publications- Eldad Haber
University of British Columbia
6 shared publications Irad Yavneh
6 shared publications- Moshe Eliasof
Computer Science Department Ben-Gurion University of the Negev Beer Sheva Israel
6 shared publications - Moshe Eliasof
University of Cambridge, Cambridge, CB2 1TN, United Kingdom
5 shared publications
Latest Publications
- Open Access
- 17 October 2026
- Published by Elsevier in SSRN Electronic Journal
Dispersion-corrected compact finite difference discretizations for the elastic Helmholtz equation in two and three dimensions
We develop a family of compact, dispersion-corrected marker-and-cell (MAC)-based finite-difference discretizations for the elastic Helmholtz equation. While dispersion correction is well established for scalar Helmholtz problems, fewer approaches exist for the elastic problems, and most use non-compact stencils. To this end, we introduce a generalized MAC (GMAC) framework that enables compact discretization of the elastic Helmholtz equation. We prove that even though GMAC is non-symmetric, this discretization produces no numerical dissipation and no shear-mode separation. For certain weights, GMAC has lower polarization error than standard MAC. We also introduce an elastic dispersion correction (EDC) process, extending real-shifted-wavenumber dispersion correction methods from acoustic to elastic Helmholtz problems. We prove and demonstrate numerically that GMAC is second-order accurate. Furthermore, we show that EDC substantially reduces dispersion for standard MAC and can provide additional correction in some instances of GMAC. Dispersion analysis shows that the resulting method outperforms existing compact finite-difference discretizations in dispersion accuracy and is competitive with some non-compact schemes. We give numerical evidence for improved phase alignment in mildly heterogeneous media.
- 17 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDispersion-corrected compact finite difference discretizations for the elastic Helmholtz equation in two and three dimensions
We develop a family of compact, dispersion-corrected marker-and-cell (MAC)-based finite-difference discretizations for the elastic Helmholtz equation. While dispersion correction is well established for scalar Helmholtz problems, fewer approaches exist for the elastic problems, and most use non-compact stencils. To this end, we introduce a generalized MAC (GMAC) framework that enables compact discretization of the elastic Helmholtz equation. We prove that even though GMAC is non-symmetric, this discretization produces no numerical dissipation and no shear-mode separation. For certain weights, GMAC has lower polarization error than standard MAC. We also introduce an elastic dispersion correction (EDC) process, extending real-shifted-wavenumber dispersion correction methods from acoustic to elastic Helmholtz problems. We prove and demonstrate numerically that GMAC is second-order accurate. Furthermore, we show that EDC substantially reduces dispersion for standard MAC and can provide additional correction in some instances of GMAC. Dispersion analysis shows that the resulting method outperforms existing compact finite-difference discretizations in dispersion accuracy and is competitive with some non-compact schemes. We give numerical evidence for improved phase alignment in mildly heterogeneous media.
- 17 July 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (4) , A1898-A1924
A Block-Acoustic Preconditioner for the Elastic Helmholtz Equation
We present a novel block-preconditioner for the elastic Helmholtz equation, based on a reduction to acoustic Helmholtz equations. Both versions of the Helmholtz equations are challenging numerically. The elastic Helmholtz equation is larger, as a system of PDEs, and harder to solve due to its more complicated physics. It was recently suggested that the elastic Helmholtz equation can be reformulated as a generalized saddle-point system, opening the door to the current development. Utilizing the approximate commutativity of the underlying differential operators, we suggest a block-triangular preconditioner whose diagonal blocks are acoustic Helmholtz operators. Thus, we enable the solution of the elastic version using virtually any existing solver for the acoustic version as a black-box. We prove a sufficient condition for the convergence of our method, that sheds light on the long questioned role of the commutator in the convergence of approximate commutator preconditioners. We show scalability of our preconditioner with respect to the Poisson ratio and with respect to the grid size. We compare our approach, combined with multigrid solve of each block, to a recent monolithic multigrid method for the elastic Helmholtz equation. The block-acoustic multigrid achieves a lower computational cost for various heterogeneous media, and a significantly lower memory consumption, compared to the monolithic approach. It results in a fast solution method for wave propagation problems in challenging heterogeneous media in two dimensions and three dimensions.
- 17 July 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (4) , A1898-A1924
A Block-Acoustic Preconditioner for the Elastic Helmholtz Equation
We present a novel block-preconditioner for the elastic Helmholtz equation, based on a reduction to acoustic Helmholtz equations. Both versions of the Helmholtz equations are challenging numerically. The elastic Helmholtz equation is larger, as a system of PDEs, and harder to solve due to its more complicated physics. It was recently suggested that the elastic Helmholtz equation can be reformulated as a generalized saddle-point system, opening the door to the current development. Utilizing the approximate commutativity of the underlying differential operators, we suggest a block-triangular preconditioner whose diagonal blocks are acoustic Helmholtz operators. Thus, we enable the solution of the elastic version using virtually any existing solver for the acoustic version as a black-box. We prove a sufficient condition for the convergence of our method, that sheds light on the long questioned role of the commutator in the convergence of approximate commutator preconditioners. We show scalability of our preconditioner with respect to the Poisson ratio and with respect to the grid size. We compare our approach, combined with multigrid solve of each block, to a recent monolithic multigrid method for the elastic Helmholtz equation. The block-acoustic multigrid achieves a lower computational cost for various heterogeneous media, and a significantly lower memory consumption, compared to the monolithic approach. It results in a fast solution method for wave propagation problems in challenging heterogeneous media in two dimensions and three dimensions.
- Open Access
- 20 February 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 453
A SIMPLE-based preconditioned solver for the direct-forcing immersed boundary method
- 20 February 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 453
Open AccessA SIMPLE-based preconditioned solver for the direct-forcing immersed boundary method
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Foundations of Data Science
- Vol. 7 (1) , 50-71
An over complete deep learning method for inverse problems
Obtaining meaningful solutions for inverse problems has been a major challenge with many applications in science and engineering. Recent machine learning techniques based on proximal and diffusion-based methods have shown promising results. However, as we show in this work, they can also face challenges when applied to some exemplary problems. We show that, similar to previous works on over-complete dictionaries, it is possible to overcome these shortcomings by embedding the solution into higher dimensions. The novelty of the work proposed is that we jointly design and learn the embedding and the regularizer for the embedding vector. We demonstrate the merit of this approach on several exemplary and common inverse problems.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Foundations of Data Science
- Vol. 7 (1) , 50-71
An over complete deep learning method for inverse problems
Obtaining meaningful solutions for inverse problems has been a major challenge with many applications in science and engineering. Recent machine learning techniques based on proximal and diffusion-based methods have shown promising results. However, as we show in this work, they can also face challenges when applied to some exemplary problems. We show that, similar to previous works on over-complete dictionaries, it is possible to overcome these shortcomings by embedding the solution into higher dimensions. The novelty of the work proposed is that we jointly design and learn the embedding and the regularizer for the embedding vector. We demonstrate the merit of this approach on several exemplary and common inverse problems.
- Top Cited Papers
- 31 October 2024
- Published by Springer Nature
- p. 363-380
Wavelet Convolutions for Large Receptive Fields
- 31 October 2024
- Published by Springer Nature
- p. 363-380
Top Cited PapersWavelet Convolutions for Large Receptive Fields
- Open Access
- 21 October 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 40 (12) , 125003
Physics-guided full waveform inversion using Encoder-Solver convolutional neural networks
Full Waveform Inversion (FWI) is an inverse problem for estimating the wave velocity distribution in a given domain, based on observed data on the boundaries. The inversion is computationally demanding because we are required to solve multiple forward problems, either in time or frequency domains, to simulate data that are then iteratively fitted to the observed data. We consider FWI in the frequency domain, where the Helmholtz equation is used as a forward model, and its repeated solution is the main computational bottleneck of the inversion process. To ease this cost, we integrate a learning process of an Encoder-Solver preconditioner that is based on convolutional neural networks (CNNs). The Encoder-Solver is trained to effectively precondition the discretized Helmholtz operator given velocity medium parameters. Then, by re-training the CNN between the iterations of the optimization process, the Encoder-Solver is adapted to the iteratively evolving velocity medium as part of the inversion. Without retraining, the performance of the solver deteriorates as the medium changes. Using our light retraining procedures, we obtain the forward simulations effectively throughout the process. We demonstrate our approach to solving FWI problems using 2D geophysical models with high-frequency data.
- 21 October 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 40 (12) , 125003
Open AccessPhysics-guided full waveform inversion using Encoder-Solver convolutional neural networks
Full Waveform Inversion (FWI) is an inverse problem for estimating the wave velocity distribution in a given domain, based on observed data on the boundaries. The inversion is computationally demanding because we are required to solve multiple forward problems, either in time or frequency domains, to simulate data that are then iteratively fitted to the observed data. We consider FWI in the frequency domain, where the Helmholtz equation is used as a forward model, and its repeated solution is the main computational bottleneck of the inversion process. To ease this cost, we integrate a learning process of an Encoder-Solver preconditioner that is based on convolutional neural networks (CNNs). The Encoder-Solver is trained to effectively precondition the discretized Helmholtz operator given velocity medium parameters. Then, by re-training the CNN between the iterations of the optimization process, the Encoder-Solver is adapted to the iteratively evolving velocity medium as part of the inversion. Without retraining, the performance of the solver deteriorates as the medium changes. Using our light retraining procedures, we obtain the forward simulations effectively throughout the process. We demonstrate our approach to solving FWI problems using 2D geophysical models with high-frequency data.
- Open Access
- 16 October 2024
- Published by IOS Press
- p. 2508-2515
Every Node Counts: Improving the Training of Graph Neural Networks on Node Classification
Graph Neural Networks (GNNs) are prominent in handling sparse and unstructured data efficiently and effectively. Specifically, GNNs were shown to be highly effective for node classification tasks, where labelled information is available for only a fraction of the nodes. Typically, the optimization process, through the objective function, considers only labelled nodes while ignoring the rest. In this paper, we propose novel objective terms for the training of GNNs for node classification, aiming to exploit all the available data and improve accuracy. Our first term seeks to maximize the mutual information between node and label features, considering both labelled and unlabelled nodes in the optimization process. Our second term promotes anisotropic smoothness in the prediction maps. Lastly, we propose a cross-validating gradients approach to enhance the learning from labelled data. Our proposed objectives are general and can be applied to various GNNs, and require no architectural modifications. Extensive experiments demonstrate our approach using popular GNNs like Graph Convolutional Networks (e.g., GCN and GCNII), and Graph Attention Networks (e.g., GAT), reading a consistent and significant accuracy improvement on 10 real-world node classification datasets.
- 16 October 2024
- Published by IOS Press
- p. 2508-2515
Open AccessEvery Node Counts: Improving the Training of Graph Neural Networks on Node Classification
Graph Neural Networks (GNNs) are prominent in handling sparse and unstructured data efficiently and effectively. Specifically, GNNs were shown to be highly effective for node classification tasks, where labelled information is available for only a fraction of the nodes. Typically, the optimization process, through the objective function, considers only labelled nodes while ignoring the rest. In this paper, we propose novel objective terms for the training of GNNs for node classification, aiming to exploit all the available data and improve accuracy. Our first term seeks to maximize the mutual information between node and label features, considering both labelled and unlabelled nodes in the optimization process. Our second term promotes anisotropic smoothness in the prediction maps. Lastly, we propose a cross-validating gradients approach to enhance the learning from labelled data. Our proposed objectives are general and can be applied to various GNNs, and require no architectural modifications. Extensive experiments demonstrate our approach using popular GNNs like Graph Convolutional Networks (e.g., GCN and GCNII), and Graph Attention Networks (e.g., GAT), reading a consistent and significant accuracy improvement on 10 real-world node classification datasets.
- Open Access
- 10 September 2024
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 19 (9) , e0307997
Comparison and development of cross-study normalization methods for inter-species transcriptional analysis
Performing joint analysis of gene expression datasets from different experiments can present challenges brought on by multiple factors—differences in equipment, protocols, climate etc. “Cross-study normalization” is a general term for transformations aimed at eliminating such effects, thus making datasets more comparable. However, joint analysis of datasets from different species is rarely done, and there are no dedicated normalization methods for such inter-species analysis. In order to test the usefulness of cross-studies normalization methods for inter-species analysis, we first applied three cross-study normalization methods, EB, DWD and XPN, to RNA sequencing datasets from different species. We then developed a new approach to evaluate the performance of cross-study normalization in eliminating experimental effects, while also maintaining the biologically significant differences between species and conditions. Our results indicate that all normalization methods performed relatively well in the cross-species setting. We found XPN to be better at reducing experimental differences, and found EB to be better at preserving biological differences. Still, according to our in-silico experiments, in all methods it is not possible to enforce the preservation of the biological differences in the normalization process. In addition to the study above, in this work we propose a new dedicated cross-studies and cross-species normalization method. Our aim is to address the shortcoming mentioned above: in the normalization process, we wish to reduce the experimental differences while preserving the biological differences. We term our method as CSN, and base it on the performance evaluation criteria mentioned above. Repeating the same experiments, the CSN method obtained a better and more balanced conservation of biological differences within the datasets compared to existing methods. To summarize, we demonstrate the usefulness of cross-study normalization methods in the inter-species settings, and suggest a dedicated cross-study cross-species normalization method that will hopefully open the way to the development of improved normalization methods for the inter-species settings.
- 10 September 2024
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 19 (9) , e0307997
Open AccessComparison and development of cross-study normalization methods for inter-species transcriptional analysis
Performing joint analysis of gene expression datasets from different experiments can present challenges brought on by multiple factors—differences in equipment, protocols, climate etc. “Cross-study normalization” is a general term for transformations aimed at eliminating such effects, thus making datasets more comparable. However, joint analysis of datasets from different species is rarely done, and there are no dedicated normalization methods for such inter-species analysis. In order to test the usefulness of cross-studies normalization methods for inter-species analysis, we first applied three cross-study normalization methods, EB, DWD and XPN, to RNA sequencing datasets from different species. We then developed a new approach to evaluate the performance of cross-study normalization in eliminating experimental effects, while also maintaining the biologically significant differences between species and conditions. Our results indicate that all normalization methods performed relatively well in the cross-species setting. We found XPN to be better at reducing experimental differences, and found EB to be better at preserving biological differences. Still, according to our in-silico experiments, in all methods it is not possible to enforce the preservation of the biological differences in the normalization process. In addition to the study above, in this work we propose a new dedicated cross-studies and cross-species normalization method. Our aim is to address the shortcoming mentioned above: in the normalization process, we wish to reduce the experimental differences while preserving the biological differences. We term our method as CSN, and base it on the performance evaluation criteria mentioned above. Repeating the same experiments, the CSN method obtained a better and more balanced conservation of biological differences within the datasets compared to existing methods. To summarize, we demonstrate the usefulness of cross-study normalization methods in the inter-species settings, and suggest a dedicated cross-study cross-species normalization method that will hopefully open the way to the development of improved normalization methods for the inter-species settings.
- 1 August 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (4) , C399-C420
Graph Neural Reaction Diffusion Models
The integration of graph neural networks (GNNs) and neural ordinary and partial differential equations has been extensively studied in recent years. GNN architectures powered by neural differential equations allow us to reason about their behavior, and develop GNNs with desired properties such as controlled smoothing or energy conservation. In this paper we take inspiration from Turing instabilities in a reaction diffusion (RD) system of partial differential equations, and propose a novel family of GNNs based on neural RD systems, called RDGNN. We show that our RDGNN is powerful for the modeling of various data types, from homophilic, to heterophilic, and spatiotemporal datasets. We discuss the theoretical properties of our RDGNN, its implementation, and show that it improves or offers competitive performance to state-of-the-art methods.
- 1 August 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (4) , C399-C420
Graph Neural Reaction Diffusion Models
The integration of graph neural networks (GNNs) and neural ordinary and partial differential equations has been extensively studied in recent years. GNN architectures powered by neural differential equations allow us to reason about their behavior, and develop GNNs with desired properties such as controlled smoothing or energy conservation. In this paper we take inspiration from Turing instabilities in a reaction diffusion (RD) system of partial differential equations, and propose a novel family of GNNs based on neural RD systems, called RDGNN. We show that our RDGNN is powerful for the modeling of various data types, from homophilic, to heterophilic, and spatiotemporal datasets. We discuss the theoretical properties of our RDGNN, its implementation, and show that it improves or offers competitive performance to state-of-the-art methods.
- 24 June 2024
- Published by Elsevier in Pattern Recognition Letters
- Vol. 184, 103-110
Global-local graph neural networks for node-classification
- 24 June 2024
- Published by Elsevier in Pattern Recognition Letters
- Vol. 184, 103-110
Global-local graph neural networks for node-classification