Performance of Neural and Polynomial Operator Surrogates

• URL: http://arxiv.org/abs/2604.00689v1
• Date: Wed, 01 Apr 2026 09:46:25 GMT
• Title: Performance of Neural and Polynomial Operator Surrogates
• Abstract summary: Polynomial surrogates achieve substantially better data efficiency for smooth input fields.<n>For rough inputs, the Fourier neural operator displays the fastest convergence rates.<n> ative-informed training consistently improves data efficiency over standard $L2_$ training.
• Score: 0.822469542459168
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of constructing surrogate operators for parameter-to-solution maps arising from parametric partial differential equations, where repeated forward model evaluations are computationally expensive. We present a systematic empirical comparison of neural operator surrogates, including a reduced-basis neural operator trained with $L^2_μ$ and $H^1_μ$ objectives and the Fourier neural operator, against polynomial surrogate methods, specifically a reduced-basis sparse-grid surrogate and a reduced-basis tensor-train surrogate. All methods are evaluated on a linear parametric diffusion problem and a nonlinear parametric hyperelasticity problem, using input fields with algebraically decaying spectral coefficients at varying rates of decay $s$. To enable fair comparisons, we analyze ensembles of surrogate models generated by varying hyperparameters and compare the resulting Pareto frontiers of cost versus approximation accuracy, decomposing cost into contributions from data generation, setup, and evaluation. Our results show that no single method is universally superior. Polynomial surrogates achieve substantially better data efficiency for smooth input fields ($s \geq 2$), with convergence rates for the sparse-grid surrogate in agreement with theoretical predictions. For rough inputs ($s \leq 1$), the Fourier neural operator displays the fastest convergence rates. Derivative-informed training consistently improves data efficiency over standard $L^2_μ$ training, providing a competitive alternative for rough inputs in the low-data regime when Jacobian information is available at reasonable cost. These findings highlight the importance of matching the surrogate methodology to the regularity of the problem as well as accuracy demands and computational constraints of the application.

Related papers

• Sharper Analysis of Single-Loop Methods for Bilevel Optimization [81.36947969465848]
  We establish sharper convergence results for single-loop approximate implicit differentiation (AID) and iterative differentiation (ITD) methods.<n>We prove that the error is $mathcalO(2)$, exactly matching the known lower bound and improving upon the previous $mathcalO(3)$ guarantee.
  arXiv  Detail & Related papers  (2026-07-11T11:41:42Z)
• Machine Learning Surrogate Modeling for Homogenization of Hyperelastic Materials with Boolean Microstructures [0.0]
  Data-driven surrogate models are an alternative to numerical homogenization of heterogeneous materials.<n>A neural network is trained on combinations of scalar and curve-wise statistical descriptors.<n>Additional data representing limiting cases of the parameter space are incorporated to stabilize training and improve extrapolation behavior.
  arXiv  Detail & Related papers  (2026-05-31T00:51:52Z)
• Nonparametric Estimation of Isotropic Covariance Function [6.456477445670593]
  A nonparametric model is constructed to approximate arbitrary isotropic covariance functions valid in $mathbbRinfty$.<n>A sieve maximum likelihood (sML) estimation is then developed to estimate the unknown isotropic covaraince function valid in $mathbbRinfty$.<n>Our approach outperforms the parametric methods in reducing bias due to model misspecification and also the nonparametric methods in terms of having significantly lower values of expected $L_infty$ and $L$ norms.
  arXiv  Detail & Related papers  (2026-04-24T07:51:27Z)
• Communication-Efficient Gluon in Federated Learning [89.94131981227609]
  We investigate Gluon, which is an extension of Muon under the more general layer-wise $(L0, L1)$-smooth setting.<n>In order to reduce the compression error, we employ the variance reduced technique in SARAH in our compressed methods.
  arXiv  Detail & Related papers  (2026-04-12T15:30:28Z)
• Variational Entropic Optimal Transport [67.76725267984578]
  We propose Variational Entropic Optimal Transport (VarEOT) for domain translation problems.<n>VarEOT is based on an exact variational reformulation of the log-partition $log mathbbE[exp(cdot)$ as a tractable generalization over an auxiliary positive normalizer.<n> Experiments on synthetic data and unpaired image-to-image translation demonstrate competitive or improved translation quality.
  arXiv  Detail & Related papers  (2026-02-02T15:48:44Z)
• Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum [78.27945336558987]
  Decentralized server (DFL) eliminates reliance on client-client architecture.<n>Non-smooth regularization is often incorporated into machine learning tasks.<n>We propose a novel novel DNCFL algorithm to solve these problems.
  arXiv  Detail & Related papers  (2025-04-17T08:32:25Z)
• Multivariate root-n-consistent smoothing parameter free matching estimators and estimators of inverse density weighted expectations [51.000851088730684]
  We develop novel modifications of nearest-neighbor and matching estimators which converge at the parametric $sqrt n $-rate.<n>We stress that our estimators do not involve nonparametric function estimators and in particular do not rely on sample-size dependent parameters smoothing.
  arXiv  Detail & Related papers  (2024-07-11T13:28:34Z)
• Stochastic Optimization Algorithms for Instrumental Variable Regression with Streaming Data [17.657917523817243]
  We develop and analyze algorithms for instrumental variable regression by viewing the problem as a conditional optimization problem. In the context of least-squares instrumental variable regression, our algorithms neither require matrix inversions nor mini-batches. We derive rates of convergence in expectation, that are of order $mathcalO(log T/T)$ and $mathcalO (1/T1-iota)$ for any $iota>0$.
  arXiv  Detail & Related papers  (2024-05-29T19:21:55Z)
• Optimal Cross-Validation for Sparse Linear Regression [5.156484100374059]
  We use k-fold cross-validation to select sparsity and robustness of linear regressors.<n>Cross-validation substantially increases the computational cost of sparse regression.<n>We improve upon this state of affairs by solving 50-80% fewer mixed-integer optimization problems.
  arXiv  Detail & Related papers  (2023-06-26T17:02:45Z)
• Residual-Based Error Corrector Operator to Enhance Accuracy and Reliability of Neural Operator Surrogates of Nonlinear Variational Boundary-Value Problems [0.0]
  This work focuses on developing methods for approximating the solution operators of a class of parametric partial differential equations via neural operators. The unpredictability of the accuracy of neural operators impacts their applications in downstream problems of inference, optimization, and control.
  arXiv  Detail & Related papers  (2023-06-21T06:30:56Z)
• Improved Convergence Rates for Sparse Approximation Methods in Kernel-Based Learning [48.08663378234329]
  Kernel-based models such as kernel ridge regression and Gaussian processes are ubiquitous in machine learning applications. Existing sparse approximation methods can yield a significant reduction in the computational cost. We provide novel confidence intervals for the Nystr"om method and the sparse variational Gaussian processes approximation method.
  arXiv  Detail & Related papers  (2022-02-08T17:22:09Z)
• Permutation Compressors for Provably Faster Distributed Nonconvex Optimization [68.8204255655161]
  We show that the MARINA method of Gorbunov et al (2021) can be considered as a state-of-the-art method in terms of theoretical communication complexity. Theory of MARINA to support the theory of potentially em correlated compressors, extends to the method beyond the classical independent compressors setting.
  arXiv  Detail & Related papers  (2021-10-07T09:38:15Z)
• Variational Inference with NoFAS: Normalizing Flow with Adaptive Surrogate for Computationally Expensive Models [7.217783736464403]
  Use of sampling-based approaches such as Markov chain Monte Carlo may become intractable when each likelihood evaluation is computationally expensive. New approaches combining variational inference with normalizing flow are characterized by a computational cost that grows only linearly with the dimensionality of the latent variable space. We propose Normalizing Flow with Adaptive Surrogate (NoFAS), an optimization strategy that alternatively updates the normalizing flow parameters and the weights of a neural network surrogate model.
  arXiv  Detail & Related papers  (2021-08-28T14:31:45Z)
• Reducing the Variance of Gaussian Process Hyperparameter Optimization with Preconditioning [54.01682318834995]
  Preconditioning is a highly effective step for any iterative method involving matrix-vector multiplication. We prove that preconditioning has an additional benefit that has been previously unexplored. It simultaneously can reduce variance at essentially negligible cost.
  arXiv  Detail & Related papers  (2021-07-01T06:43:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.