This work ensures stability in POD basis interpolation for pMOR in hyperelasticity.
problem Stability of POD basis interpolation on Grassmann manifolds for pMOR in hyperelasticity.
method Stability conditions derived from Grassmannian Exponential map and principal angles.
result Explicit stability conditions for practical pMOR applications and non-monotonic error behavior.
This work proposes a novel method for interpolating ROMs without solving FEM models.
problem Interpolating ROMs for unseen parameter values without solving FEM models.
method Non-intrusive Space-Time POD interpolation on compact Stiefel manifolds.
result Robust ROMs derived for unseen parameter values with strong correlations to high-fidelity simulations.
This paper proposes a new method to adapt ROMs for new parameter settings.
problem ROMs lack robustness when applied to new parameter settings.
method Regression trees on Grassmann Manifold to learn the mapping between parameters and POD bases.
result The proposed method is capable of establishing the mapping between parameters and POD bases, thus adapting ROMs for new parameters.
Adapts POD basis for parametric ROMs using pGP.
problem Updating POD basis for accurate system behavior over parameter space.
method Formulates problem as supervised statistical learning, uses pGP to learn mapping between parameter space and Grassmann manifold.
result Proposes pGP for optimal estimation of POD basis parameters and quantifies uncertainty.
Paper uses autoencoders for efficient reduced-order modeling of eigenvalue problems.
problem Efficiently modeling eigenvalue problems in high dimensions.
method Autoencoder-based reduced-order modeling for eigenvalue problems.
result Autoencoder-based models outperform standard POD-Galerkin methods in neutron diffusion applications.
Paper reduces expensive financial risk simulations through efficient MOR.
problem Expensive simulations of financial risk models.
method Model order reduction (MOR) using proper orthogonal decomposition (POD) with adaptive greedy sampling.
result MOR approach reduces computational cost for financial risk analysis.
In this paper, we present a new nonintrusive reduced basis method when a cheap low-fidelity model and expensive high-fidelity model are available. The method relies on proper orthogonal decomposition (POD) to generate the high-fidelity reduced basis and a shallow multilayer perceptron to learn the high-fidelity reduced…
Lower bounds show OLS outperforms basis pursuit in overparameterized linear regression.
problem Excess risk of sparse interpolating procedures in overparameterized linear regression.
method Proved lower bounds on excess risk for OLS and basis pursuit.
result Excess risk of basis pursuit can converge at an exponentially slower rate than OLS.
Convolutional networks predict turbulence from wall quantities.
problem Predicting turbulence fields from wall-shear-stress components and wall pressure.
method Two CNN models: FCN and FCN-POD, trained on DNS data.
result FCN and FCN-POD models outperform EPOD in predicting turbulence fields.
A new method uses neural networks to improve POD-Galerkin models for complex systems.
problem Improving computational efficiency and accuracy in solving non-linear high-dimensional systems.
method Deep learning-based closure modeling using neural networks to approximate POD-Galerkin operators.
result The CD-ROM approach produces more accurate and stable models for complex systems.
This paper presents an efficient algorithm for evolving point cloud data on smooth manifolds using B-Splines.
problem Evolution of point cloud data on smooth manifolds in higher dimensions.
method Lagrangian approach using adaptive B-Spline interpolation.
result Demonstrates the convergence of geometric quantities and the effectiveness of the approach.
A new method combines POD and PCE for predicting multidimensional physical fields.
problem Predicting multidimensional non-linear fields from limited data.
method Combines Proper Orthogonal Decomposition (POD) and Polynomial Chaos Expansion (PCE).
result Demonstrates improved prediction accuracy and interpretability.
Efficient surrogate modeling for complex PDEs with physical laws.
problem High computational cost of repeated PDE simulations.
method LC-prior Gaussian process with POD and RBF-FD.
result Significantly reduced computational cost and improved accuracy.
Surrogate models improve tidal model calibration efficiency.
problem Efficiently calibrate complex tidal models for climate change scenarios.
method Proposes two surrogate-based methods to replace complex models: PODEn3DVAR and POD-PCE-3DVAR.
result Both methods show superior convergence and robustness to noise compared to classical 3DVAR.
Reduced-order model improves LES for atmospheric pollutant dispersion.
problem Accurate near-field pollutant concentration tracking in urban areas.
method Combining POD and GPR for non-intrusive reduced-order modeling.
result Component-by-component optimization captures spatial scales in high-order modes.
This paper presents a physics-based data-driven method to learn predictive reduced-order models (ROMs) from high-fidelity simulations, and illustrates it in the challenging context of a single-injector combustion process. The method combines the perspectives of model reduction and machine learning. Model reduction brin…
Study tightens bounds for interpolating noisy data using minimum l1-norm.
problem Predicting noisy data with minimum l1-norm interpolation.
method Provided matching upper and lower bounds for prediction error.
result Tight consistency up to negligible terms for d≫n. Uniform convergence of interpolators proven for Gaussian data.
problem Interpolation learning in high-dimensional linear regression with Gaussian data.
method Generic uniform convergence guarantee in terms of Gaussian width.
result Consistency of interpolators for minimum-norm and near-minimal-norm cases.
There is an observed basis between repo discounting, implied from market repo rates, and bond discounting, stripped from the market prices of the underlying bonds. Here, this basis is explained as a convexity effect arising from the decorrelation between the discount rates for derivatives and bonds. Using a Hull-White …
A model order reduction framework reduces financial risk analysis models efficiently.
problem Simulating high-dimensional financial risk models.
method Adaptive greedy sampling based on POD and surrogate modeling.
result Reduced models provide significant speedup with excellent accuracy.
Review and compare model order reduction methods for process engineering.
problem Creating computationally efficient yet accurate models for real-time applications.
method Nonlinear model order reduction methods, including general-purpose and tailored approaches for chemical processes.
result Comparison of eight model order reduction methods applied to an air separation process model.
In this study the Voronoi interpolation is used to interpolate a set of points drawn from a topological space with higher homology groups on its filtration. The technique is based on Voronoi tessellation, which induces a natural dual map to the Delaunay triangulation. Advantage is taken from this fact calculating the p…
A physics-based method improves data interpolators and regression tasks.
problem Improving accuracy and efficiency in function learning.
method Inspired by statistical mechanics, introduces corrections to minimize energy.
result Improves performance in interpolation and regression tasks, especially in high-dimensional spaces.
Nonlinear dimensionality reduction embeddings computed from datasets do not provide a mechanism to compute the inverse map. In this paper, we address the problem of computing a stable inverse map to such a general bi-Lipschitz map. Our approach relies on radial basis functions (RBFs) to interpolate the inverse map ever…
New basis for quantum gl_N invariants derived from Macdonald polynomials.
problem Constructing new bases for quantum gl_N invariants.
method Using interpolation Macdonald polynomials and Okounkov's results.
result Cyclotomic expansions for gl_N invariants and knot invariants.
Optimized GAN discriminator using polyharmonic interpolation.
problem Optimizing the discriminator in GANs with higher-order gradient regularization.
method Polyharmonic interpolation and variational calculus.
result The optimal discriminator is a polyharmonic radial basis function.
The study tests inferences about neural network optimization from linear interpolation of loss landscapes.
problem Understanding the difficulty of neural network optimization problems.
method Linear interpolation of neural network loss landscapes, systematic evaluation of various factors.
result Linear interpolation does not correlate with model performance, challenging prior intuition.
Study assesses neural nets for optimization problems, highlighting SiLU's effectiveness.
problem Using neural nets for optimization problems, especially for accurate approximations.
method Determined best activation function (SiLU) for nonlinear optimization problems. Analyzed function approximations using neural networks and interpolation/regression models.
result Neural nets can deliver competitive zero- and first-order approximations but underperform on second-order approximations.
Level-set optimization formulations with data-driven constraints minimize a regularization functional subject to matching observations to a given error level. These formulations are widely used, particularly for matrix completion and sparsity promotion in data interpolation and denoising. The misfit level is typically …
BayPOD-AL learns reduced-order models from high-fidelity data efficiently.
problem Capturing dynamics of complex systems with large training datasets.
method Bayesian active learning based on uncertainty-aware POD.
result BayPOD-AL reduces computational cost and improves model accuracy.
We consider the class of affine LIBOR models with multiple curves, which is an analytically tractable class of discrete tenor models that easily accommodates positive or negative interest rates and positive spreads. By introducing an interpolating function, we extend the affine LIBOR models to a continuous tenor and de…
Algorithm solves American options with regime-switching using multigrid and compact finite difference.
problem Pricing American put options with regime-switching.
method Multigrid iterative algorithm based on compact finite difference schemes and Hermite interpolation.
result The algorithm provides a fast and efficient tool for pricing American put options with regime-switching.
Signal processing tasks as fundamental as sampling, reconstruction, minimum mean-square error interpolation and prediction can be viewed under the prism of reproducing kernel Hilbert spaces. Endowing this vantage point with contemporary advances in sparsity-aware modeling and processing, promotes the nonparametric basi…
Our paper aims to model supply and demand curves of electricity day-ahead auction in a parsimonious way. Our main task is to build an appropriate algorithm to present the information about electricity prices and demands with far less parameters than the original one. We represent each curve using mesh-free interpolatio…
The annihilating filter-based low-rank Hankel matrix approach (ALOHA) is one of the state-of-the-art compressed sensing approaches that directly interpolates the missing k-space data using low-rank Hankel matrix completion. The success of ALOHA is due to the concise signal representation in the k-space domain thanks to…
Neural networks can approximate functionals on RKHS with error bounds.
problem Approximating functionals on RKHS using neural networks.
method Interpolating orthogonal projections in RKHS using point evaluations.
result Explicit error bounds for various kernels (inverse multiquadric, Gaussian, Sobolev).
We present a numerical method for the frequent pricing of financial derivatives that depends on a large number of variables. The method is based on the construction of a polynomial basis to interpolate the value function of the problem by means of a hierarchical orthogonalization process that allows to reduce the numbe…
DeepKriging uses neural networks for spatio-temporal interpolation and forecasting.
problem Non-Gaussianity and nonstationarity in real-world data.
method Two-stage model: DNN for interpolation, LSTM for forecasting.
result DeepKriging provides probabilistic forecasts without stationarity assumptions.
New optimization algorithm for mixed-variable problems improves efficiency.
problem Optimizing functions with both continuous and categorical variables.
method Combines radial basis function and metric stochastic response surface methods with modifications for categorical variables and parallel processing.
result Numerical experiments show the effectiveness of the proposed modifications.
The paper explores how different network architectures learn logical functions under GOTU, finding that a min-degree-interpolator is learned.
problem Learning logical functions with a focus on generalization on the unseen.
method Study of different network architectures trained by SGD under GOTU.
result For sparse functions and certain network models, a min-degree-interpolator is learned on the unseen.
Reconstruction of density functions and their characteristic functions by radial basis functions with scattered data points is a popular topic in the theory of pricing of basket options. Such functions are usually entire or admit an analytic extension into an appropriate tube and "bell-shaped" with rapidly decaying tai…
The aim of this chapter is to show how option prices in jump-diffusion models can be computed using meshless methods based on Radial Basis Function (RBF) interpolation. The RBF technique is demonstrated by solving the partial integro-differential equation (PIDE) in one-dimension for the American put and the European va…
The study optimizes Gaussian process approximations for finite-rank models.
problem Posterior behavior of finite-rank approximations differs from parent GP priors.
method Locally supported basis expansions with dependent Gaussian coefficients.
result Finite-rank expansions inherit the same posterior contraction rate as parent GP priors.
Enhanced autoencoders improve ROMs for PDEs by capturing essential properties.
problem Autoencoders struggle to capture essential properties for accurate ROMs.
method Introduced symmetric Convolutional AutoEncoders (CAEs) that preserve manifold properties.
result Symmetric CAEs yield more accurate latent trajectories and robust models.
The paper compares machine learning methods with traditional techniques for pricing and sensitivities of financial products with path-dependent structures.
problem Evaluating financial products with early-termination clauses, especially those with path-dependent structures.
method The paper compares regression methods including randomized recurrent and feed-forward neural networks, and a novel approach using signatures of the underlying price process, with traditional polynomial basis functions for pricing and sensitivities.
result Machine learning algorithms often match the accuracy and efficiency of traditional methods for Asian and look-back options, while randomized neural networks are best for callable certificates.
Efficiently trains BERT on academic GPUs in 12 days.
problem Training large-scale BERT models is expensive and time-consuming.
method Optimizes training on multiple GPUs and nodes, reducing costs.
result Trains BERT on academic GPUs in 12 days, not requiring expensive hardware.
The objective of this paper is to investigate how noisy and incomplete observations can be integrated in the process of building a reduced-order model. This problematic arises in many scientific domains where there exists a need for accurate low-order descriptions of highly-complex phenomena, which can not be directly …
Method interpolates option prices and volatilities without arbitrage.
problem Interpolating option prices and volatilities without arbitrage.
method Sparse modeling approach based on integral equations and SVD.
result Flexible and efficient framework for arbitrage-free interpolation.