Develops a new solver for path-dependent PDEs using signature kernels.
problem Solving path-dependent PDEs (PPDEs) efficiently and accurately.
method Uses signature kernels to solve PPDEs by approximating the solution with minimal norm in a reproducing kernel Hilbert space.
result Proves the consistency of the numerical scheme, ensuring convergence to PPDE solutions as the number of collocation points increases.
PINNACLE optimizes point selection for PINNs, improving accuracy.
problem Challenges in selecting points for training Physics-Informed Neural Networks (PINNs).
method Introduces PINNACLE, an algorithm that jointly optimizes collocation and experimental points selection, adjusting point proportions dynamically.
result PINNACLE outperforms existing methods in forward, inverse, and transfer learning problems.
We propose kernel-based collocation methods for numerical solutions to Heath-Jarrow-Morton models with Musiela parametrization. The methods can be seen as the Euler-Maruyama approximation of some finite dimensional stochastic differential equations, and allow us to compute the derivative prices by the usual Monte Carlo…
Develops a new method for learning ODEs from sparse data.
problem Learning systems of ODEs from scarce, partial, and noisy data.
method Combines sparse recovery and RKHS techniques.
result Significant gains in accuracy, sample efficiency, and robustness to noise.
Paper improves stochastic collocation for local volatility models.
problem Improving local volatility models for assets with boundaries.
method Applied stochastic collocation to lognormal distributions, derived analytical local volatility.
result Simple analytical Dupire local volatility derived from option prices.
Unified framework solves nonlinear PDEs and IPs using Gaussian processes.
problem Solving and identifying parameters in nonlinear PDEs and inverse problems.
method Gaussian process framework approximating solutions as MAP estimators, reducing to finite-dimensional optimization problem.
result Unified method converges in a small number of iterations for various PDEs.
Revisits stochastic collocation with exponential splines for option pricing.
problem Improving the accuracy of option price interpolation using stochastic collocation.
method Uses exponential quadratic splines and optimizes abscissae or parameters of B-splines.
result Shows that fixing abscissae and optimizing parameters leads to better interpolation accuracy.
Scalable solver reduces PDE uncertainty with active learning.
problem High computational cost in solving PDEs.
method Stochastic dual descent and clustering-based active learning.
result Solver scales to large number of collocation points.
Paper optimizes portfolios for absolute return funds with constraints.
problem Optimizing portfolios with constraints for absolute return funds.
method Stochastic control framework with numerical solution using kernel-based collocation method.
result Leverage is necessary to achieve the target level.
PINNs can learn trivial solutions; new approach improves performance.
problem PINNs fail to learn non-trivial solutions in data-scarce settings.
method Developed an alternative sampling approach and new penalty term.
result PINNs can be improved to learn non-trivial solutions with up to 80% fewer collocation points.
New method samples from time-integrated stochastic bridges using neural networks.
problem Sampling from time-integrated stochastic bridges with high accuracy and speed.
method Polynomial chaos expansion and artificial neural networks.
result Robust, data-driven Monte Carlo sampling with thousands of samples in milliseconds.
Unified kernel framework extends to stochastic systems, improving numerical stability.
problem Extending kernel methods to stochastic dynamical systems with diffusion.
method Unified kernel framework, Feynman-Kac path-integral representations, collocation-based computational framework.
result Kernel equivalence under uniform ellipticity assumptions and improved numerical stability with moderate diffusion.
Study methods to recover unknown processes in PDEs from data.
problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.
DAS-PINNs uses deep learning to solve complex PDEs more accurately.
problem Solving high-dimensional PDEs with high accuracy.
method Deep neural networks and generative models for adaptive sampling.
result DAS-PINNs significantly improves solution accuracy for low regularity and high-dimensional problems.
Adaptive neural network approximates stochastic system densities.
problem Approximating high-dimensional stochastic dynamical systems.
method Temporal KRnet (tKRnet) trained with adaptive collocation points and temporal decomposition.
result Improves density approximation for stochastic systems without curse of dimensionality.
New method for pricing discrete Asian and Lookback options under Heston model.
problem Efficient pricing of discrete Asian and Lookback options under Heston model.
method Data-driven approach using artificial neural networks and stochastic collocation points.
result High accuracy and significant computational time reduction compared to classical methods.
Word embedding maps words into a low-dimensional continuous embedding space by exploiting the local word collocation patterns in a small context window. On the other hand, topic modeling maps documents onto a low-dimensional topic space, by utilizing the global word collocation patterns in the same document. These two …
ADDA-KR uses KRnets for solving high-dimensional Fokker-Planck equations.
problem High-dimensional, unbounded Fokker-Planck equations.
method KRnet for density approximation, adaptive sampling for stochastic collocation.
result ADDA-KR efficiently approximates high-dimensional density functions.
Deep learning accelerates Monte Carlo SDE simulations with large time steps.
problem Accurate simulation of SDEs with large time steps.
method Polynomial chaos expansion with neural network learned stochastic collocation points.
result Data-driven scheme achieves strong convergence in Monte Carlo simulations.
New RL approach handles non-exponential discounting for sequential decisions.
problem Modeling human discounting in sequential decision-making tasks.
method Generalized model-based reinforcement learning with arbitrary discount functions, using Hamilton-Jacobi-Bellman equation and collocation method.
result Validated approach on simulated problems, showing applicability to human discounting.
A new method uses deep learning to efficiently solve complex physics equations in high dimensions.
problem Efficiently solving high-dimensional time-dependent PDEs with dynamic solutions.
method Deep adaptive sampling framework for PINNs extended to spacetime domains using normalizing flows.
result The method effectively identifies and tracks high-residual regions in both space and time.
Sparse grids reduce xVA exposure evaluations by up to 6000 times.
problem Efficiently computing exposures for xVA in large portfolios with many risk factors.
method Sparse Grid Method combined with Stochastic Collocation and Smolyak's extension.
result Significant reduction in the number of portfolio evaluations, up to 6000 times.
Develops a new Gaussian process method for efficient Bayesian inference of plant root parameters in the Richards equation.
problem Estimating unknown parameters in nonlinear PDEs for agricultural studies.
method Gaussian process collocation with importance sampling and Bayesian optimization.
result Our method yields robust estimates with uncertainty quantification for plant root parameters.
In this paper, a complete Lie symmetry analysis of the damped wave equation with time-dependent coefficients is investigated. Then the invariant solutions and the exact solutions generated from the symmetries are presented. Moreover, a Lie algebraic classifications and the optimal system are discussed. Finally, using C…
New method uses dynamic sampling to improve PINNs efficiency.
problem Improving sample efficiency and performance of PINNs.
method pdPINN, inspired by Eulerian formulation, uses dynamic Monte Carlo sampling from particle positions.
result Higher sample efficiency and improved performance of PINNs.
In this contribution we present an intrinsic description of time-variant Port Hamiltonian systems as they appear in modeling and control theory. This formulation is based on the splitting of the state bundle and the use of appropriate covariant derivatives, which guarantees that the structure of the equations is invari…
Discover equations from data using neural networks with constraints.
problem Discover equations from noisy data without theoretical derivation.
method Solve constrained optimization problem with penalty or trust-region barrier methods.
result Constrained method outperforms penalty method for higher noise levels or fewer collocation points.
Ontology learning is a critical task in industry, dealing with identifying and extracting concepts captured in text data such that these concepts can be used in different tasks, e.g. information retrieval. Ontology learning is non-trivial due to several reasons with limited amount of prior research work that automatica…
PMI-Masking improves MLM pretraining by masking correlated spans efficiently.
problem Uniform token masking leads to inefficient and suboptimal performance in MLMs.
method PMI-Masking uses Pointwise Mutual Information to mask n-grams with high collocation.
result PMI-Masking reaches half the training time and improves performance.
Unified physics-informed learning method improves generalization performance.
problem Lack of theoretical analysis for hybrid settings with incomplete physical constraints.
method Unified residual form unifying collocation and variational methods, establishing generalization performance governed by affine variety dimension.
result Generalization performance is determined by affine variety dimension, not just the number of parameters.
FlowKac solves high-dimensional Fokker-Planck equations efficiently.
problem Intractability of Fokker-Planck equation solutions in high dimensions.
method Reformulates Fokker-Planck using Feynman-Kac, adaptive stochastic sampling, and normalizing flows.
result Significant computational efficiency and accuracy improvements over existing methods.
Adaptive PINNs improve accuracy by adding points where solutions are uncertain.
problem Inadequate sampling in PINNs leads to inaccurate solutions, especially near singularities.
method FI-PINNs use failure probability to dynamically add points, improving numerical accuracy.
result FI-PINNs achieve better accuracy through adaptive sampling, as proven by rigorous error bounds.
In an effort to better understand meaning from natural language texts, we explore methods aimed at organizing lexical objects into contexts. A number of these methods for organization fall into a family defined by word ordering. Unlike demographic or spatial partitions of data, these collocation models are of special i…
DCK improves air quality index prediction with probabilistic spatial models.
problem Non-Gaussian, complex spatial structure of air quality index.
method Deep classifier kriging (DCK) for non-Gaussian, nonlinear spatial prediction.
result DCK outperforms conventional methods in predictive accuracy and uncertainty quantification.
Improves FI-PINNs by combining re-sampling and subset simulation for better failure probability estimation.
problem Estimating failure probability in physics-informed neural networks (PINNs).
method Adaptive sampling with re-sampling and subset simulation, using cosine-annealing for uniform to adaptive transition.
result Significant improvement in estimating failure probability and generating new training points in the failure region.
CMCO provides robust uncertainty estimates for neural operators without retraining.
problem Uncertainty quantification in deep learning for real-time virtual sensing.
method Unified Monte Carlo dropout and split conformal prediction in DeepONet.
result Near-nominal empirical coverage in diverse applications.
Enhances PCE surrogates using transfer learning for expensive simulations.
problem Over-sampling in PCE for expensive forward models.
method Transfer learning from similar tasks to a new task with limited training data.
result Improves scalability and accuracy of PCE surrogates.
Paper improves PINNs' extrapolation by TL and adaptive AFs.
problem PINNs' poor extrapolation performance and sensitivity to AFs.
method Transfer learning within an extended domain and adaptive activation functions.
result Average 40% reduction in relative L2 error and 50% in mean absolute error in extrapolation domain.
Unified framework improves option pricing accuracy and stability.
problem Combining structured knowledge with data for better financial modeling.
method Structured-Knowledge-Informed Neural Networks (SKINNs) that embed theoretical insights into neural networks.
result SKINNs improve out-of-sample valuation and hedging performance in financial applications.
New model solves PDEs using probabilistic random grids.
problem Solving parametric PDEs with probabilistic collocation grids.
method Random Grid Neural Processes (RGNPs) with GICNets.
result Significant computational advantages and improved predictive capabilities.
Tackles dynamic subsurface flow via GAN with physical theory constraints.
problem Deep learning of dynamic subsurface flow with heterogeneous parameters.
method Theory-guided generative adversarial network (TgGAN) for PDEs.
result TgGAN predicts future subsurface flow responses robustly and efficiently.
Many unsupervised kernel methods rely on the estimation of the kernel covariance operator (kernel CO) or kernel cross-covariance operator (kernel CCO). Both kernel CO and kernel CCO are sensitive to contaminated data, even when bounded positive definite kernels are used. To the best of our knowledge, there are few well…
Survey of kernels, RKHS, and their applications in machine learning.
problem Understanding kernels and their applications in machine learning.
method Review of historical context, mathematical definitions, and practical applications of kernels.
result Comprehensive overview of kernels, RKHS, and their applications.
To the best of our knowledge, there are no general well-founded robust methods for statistical unsupervised learning. Most of the unsupervised methods explicitly or implicitly depend on the kernel covariance operator (kernel CO) or kernel cross-covariance operator (kernel CCO). They are sensitive to contaminated data, …
Deep neural kernels and Laplace kernel have equivalent RKHS on spheres.
problem Comparing RKHS of deep neural tangent and Laplace kernels.
method Proof of RKHS equivalence using sphere restrictions and kernel properties.
result RKHS of deep neural tangent kernel and Laplace kernel are the same on Sd−1. Kernel methods linked to feature subspaces and maximal correlation kernels.
problem Understanding kernel methods and their relationship to feature extraction.
method Established a correspondence between feature subspaces and kernels, introduced maximal correlation kernels, and demonstrated their optimality.
result Kernel SVM on maximal correlation kernel achieves minimum prediction error.
PGF kernels analyze spherical data using generalized RBF kernels.
problem Analysis of spherical data.
method Introduced PGF kernels and a semi-parametric learning algorithm.
result PGF kernels generalize RBF kernels for spherical data.
Adapts manifold structure for better clustering performance.
problem Lack of consideration for local manifold structure in existing multiple kernel k-means methods.
method Adopts manifold adaptive kernel to integrate local manifold structure of kernels.
result Proposed method outperforms state-of-the-art methods.