A general method for analytic inversion in integral geometry is proposed. All classical and some new reconstruction formulas of Radon-John type are obtained by this method. No harmonic analysis and PDE is used.
FM4PDE learns PDE solutions from sparse data.
problem Reconstructing PDE solutions from limited observations.
method Flow-matching generative framework that learns PDE coefficients and solutions.
result Error guarantees for guided procedures, including deterministic and stochastic samplers.
Revisits geometric PDE uniqueness in Riemannian and CR geometry.
problem Uniqueness of solutions to geometric PDEs in Riemannian and CR geometry.
method New proofs and reconstruction of Jerison-Lee identity.
result Stronger uniqueness result in CR geometry.
Cake wavelets minimize orientation score uncertainty.
problem Minimizing uncertainty in orientation scores.
method Axiomatically derived wavelets for orientation score lifting.
result Uncertainty gap of cake wavelets is less than 1.1.
Data-efficient PDE operator learning without expensive simulations.
problem Expensive numerical PDE solutions limit data efficiency in machine learning.
method Unsupervised pretraining and in-context learning.
result Highly data-efficient and more generalizable than conventional models.
We present a project of classification of a certain class of bihamiltonian 1+1 PDEs depending on a small parameter. Our aim is to embed the theory of Gromov - Witten invariants of all genera into the theory of integrable systems. The project is focused at describing normal forms of the PDEs and their local bihamiltonia…
Partial differential equations (PDEs) are indispensable for modeling many physical phenomena and also commonly used for solving image processing tasks. In the latter area, PDE-based approaches interpret image data as discretizations of multivariate functions and the output of image processing algorithms as solutions to…
GeoFunFlow tackles inverse problems on complex geometries with efficient learning.
problem Challenges in inverse problems governed by PDEs, especially on irregular geometries.
method Combines geometric function autoencoder and latent diffusion model trained via rectified flow.
result Achieves state-of-the-art reconstruction accuracy and efficient inference.
Bayesian framework optimizes 3D view selection for specific tasks.
problem Optimizing 3D view selection for specific tasks in reconstruction.
method Bayesian decision theory, prior and posterior distributions, stochastic surface reconstruction.
result Framework achieves superior performance with fewer views.
New method uses diffusion models for inverse problems without approximations.
problem Solving complex inverse problems in high dimensions.
method Ensemble-based algorithm using diffusion models without approximations.
result Empirically validated method gives more accurate reconstructions.
New method uses random features and Tikhonov regularization for operator learning from noisy data.
problem Accurate approximation of mappings between infinite-dimensional function spaces with reduced training time.
method Regularized random Fourier features (RRFF) coupled with finite element reconstruction (RRFF-FEM).
result The method achieves improved performance with reduced training time and noise robustness.
Framework uses deep learning and statistical models to solve PDEs with discontinuous coefficients.
problem Solving PDEs with discontinuous coefficients.
method Two-stage physics-informed deep learning and statistical mixture models.
result Framework achieves adaptability and accurate parameter identification.
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.
An efficient method to construct Hamiltonian structures for nonlinear evolution equations is described. It is based on the notions of variational Schouten bracket and l*-covering. The latter serves the role of the cotangent bundle in the category of nonlinear evolution PDEs. We first consider two illustrative examples …
Reliable training of generative adversarial networks (GANs) typically require massive datasets in order to model complicated distributions. However, in several applications, training samples obey invariances that are \textit{a priori} known; for example, in complex physics simulations, the training data obey universal …
Jet bundles as higher-order polarised k-contact manifolds
problem Recognizing finite-order jet bundles as polarised Nπr-contact manifolds method Introducing new classes of polarisations for k-contact distributions result Main recognition theorem
A new method infers parameters from PDEs using Gaussian processes.
problem Estimating unknown parameters in PDEs from noisy data.
method PDE-Informed Gaussian Process (PIGP) method.
result The method bypasses numerical solvers for PDEs and provides uncertainty quantification.
Neural-PDE learns PDEs from data using LSTM, outperforming traditional methods.
problem Solving time-dependent PDEs numerically is challenging.
method Bidirectional LSTM encoder to learn governing rules from data.
result Neural-PDE efficiently predicts PDE dynamics with minimal parameters.
New method stabilizes machine learning for physics-informed inverse problems.
problem Reconstructing physical quantities from PDE-compliant measurements.
method Physics-informed learning with smooth inductive bias.
result PDE operators stabilize variance and prevent overfitting in fixed dimensions.
Modeling wind dynamics in Saudi Arabia using deep learning and stochastic PDEs.
problem Accurately modeling spatio-temporal wind patterns in a large, diverse, and understudied region.
method Energy distance-based spatial reduction, sparse stochastic Echo State Network, non-stationary stochastic PDE reconstruction.
result Produces more accurate wind speed and energy forecasts, saving $1 million annually.
Neural Q-learning tackles high-dimensional PDEs.
problem Solving high-dimensional PDEs is computationally challenging.
method Adapting Q-learning from reinforcement learning to solve PDEs.
result The neural network approximator converges to the PDE solution as the network width increases.
Partial differential equations (PDEs) are commonly derived based on empirical observations. However, recent advances of technology enable us to collect and store massive amount of data, which offers new opportunities for data-driven discovery of PDEs. In this paper, we propose a new deep neural network, called PDE-Net …
PDE-DKL combines NNs and GPs for high-dimensional PDE problems.
problem High-dimensional PDE problems with scarce data.
method PDE-constrained Deep Kernel Learning (PDE-DKL) framework.
result High accuracy with reduced data requirements.
Solves second-order PDEs using quotients and differential invariants.
problem Solving second-order PDEs with first-order quotients.
method Solve the quotient PDE using differential invariants, then add new constraints to solve the original PDE.
result New method for solving second-order scalar PDEs with infinite-dimensional symmetry algebras.
PRISMA uses PDE residuals for fast, robust, and accurate inference.
problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.
Meta-learning base distributions for efficient PDE solutions.
problem Efficiently solving parametric parabolic PDEs across different scenarios.
method Meta-learning base distributions to compute PDE solutions.
result Improves generalization to new parameter regimes.
Kernel method learns PDEs from noisy data.
problem Discovering and solving PDEs from noisy data.
method Kernel smoothing, regression, and operator learning.
result Competitive performance compared to state-of-the-art algorithms.
Solves a PDE for Landsberg surfaces using new Finsler surface insights.
problem Solving the Landsberg's PDE for Finsler surfaces.
method Reduces the system of non-linear PDEs to a single PDE, the Landsberg's PDE, and solves it.
result Obtains a class of solutions for the Landsberg's PDE.
Survey on conservation laws for geometric PDEs.
problem Modeling polyharmonic maps.
method Conservation law approach.
result Overview of conservation laws in geometric PDEs.
Using the theory of the symmetry group for PDEs [15, 17], we derive the symmetry group G associated to surfaces PDE. Several group invariant solutions of the surfaces PDE are given by solving a reduced system of partial differential equations.
PDE-based G-CNNs add geometric symmetries to CNNs without augmentation.
problem Designing CNNs with built-in symmetries like rotation.
method Formulate CNN layers as PDE solvers on homogeneous spaces.
result PDE-G-CNNs achieve better performance with fewer parameters.
Develops arithmetic PDE geometry concepts like curvature and cohomology.
problem Creating a geometry framework for arithmetic PDEs.
method Introducing arithmetic analogues of Levi-Civita and Chern connections, then developing curvature and characteristic classes.
result Arithmetic analogues of curvature and characteristic classes have been developed.
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.
The paper presents a PDE method for xVA incorporation in financial derivatives.
problem Incorporating value adjustments (xVA) in financial derivative pricing.
method Analytical solution of PDEs in the Black-Scholes framework.
result New semi-closed formulas for xVA are derived and compared to Monte-Carlo and numerical methods.
New PDEs of mixed type emerge in fluid mechanics and geometry.
problem Analysis of nonlinear PDEs of mixed type.
method Through historical problems and recent trends.
result Many PDEs are of mixed type, requiring new analysis.
PDE-NetGen converts physical equations to neural networks for various scientific problems.
problem Bridging physics and deep learning for efficient neural network architectures.
method Combines symbolic calculus and neural network generation to translate PDEs into NN architectures.
result Generates compact, computationally-efficient physics-informed NN architectures.
Automated PDE discovery from multiple noisy experiments.
problem Inherent variability in experiments makes single experiment inference unreliable.
method Randomised adaptive group Lasso sparsity estimator in deep learning framework.
result More generalizable PDEs found from multiple datasets.
Improved neural PDEs trained on augmented data enhance model accuracy and efficiency.
problem Training neural PDEs on limited data to accurately represent complex systems.
method Space-filling sampling of local states to generate augmented training data.
result Data-augmented neural PDEs outperform traditional emulators in accuracy and stability.
In recent years, data-driven methods have been developed to learn dynamical systems and partial differential equations (PDE). The goal of such work is discovering unknown physics and the corresponding equations. However, prior to achieving this goal, major challenges remain to be resolved, including learning PDE under …
Meta-learning neural networks to solve diverse PDEs efficiently.
problem Efficiently solving new PDE problems with minimal training.
method Neural network meta-learning of PDE problem representations.
result Meta-learned neural networks predict PDE solutions with high accuracy.
It is shown that the characteristic vector field associated to a first order PDE has the same form of an infinitesimal generator of an odd-symplectic transformation with contact Hamiltonian the given PDE. It is considered under which condition such PDE has a characteristic vector field commuting with a generator of an …
In this paper, we present an initial attempt to learn evolution PDEs from data. Inspired by the latest development of neural network designs in deep learning, we propose a new feed-forward deep network, called PDE-Net, to fulfill two objectives at the same time: to accurately predict dynamics of complex systems and to …
New formula for portfolio risk management using conditional PDEs.
problem Optimal diversification and risk management of portfolios.
method Closed-form formula for conditional probability, Gaussian copulas, conditional risk-neutral PDE.
result Dynamic monitoring of portfolio volatilities and weights from PDEs.
We consider the problem of computing the integrable sub-distributions of the non-integrable Vessiot distribution of multi-dimensional second order partial differential equations (PDEs). We use Vessiot theory and solvable structures to find the largest integrable distributions contained in the Vessiot distribution assoc…
Novel neural network solves PDEs with multi-scale resolution.
problem Solving time-dependent PDEs with varying spatial and temporal scales.
method Multi-scale message passing neural network with temporal and spatial gating modules.
result Outperforms baselines on PDEs with diverse scales.
Error estimates for nonlinear PDEs using kernel/GP methods.
problem Error analysis of kernel/GP methods for nonlinear and parametric PDEs.
method Sobolev space error estimates based on minimizing norm property of the solution.
result Dimension-benign convergence rates for smooth solutions.
Adapts PDE method to prove L∞ estimates for complex Hessian equations.
problem Proving L∞ estimates for complex Hessian equations on transverse Kähler manifolds. method Adapts PDE approach of Guo-Phong-Tong and Guo-Phong-Tong-Wang [17, 18].
result Obtains L∞ estimate for transverse complex Monge-Ampère equations. Paper introduces a new method to solve complex PDEs efficiently.
problem Solving high-dimensional semilinear PDEs and BSDEs.
method Decomposes PDEs into linear and nonlinear parts, uses Deep BSDE solver with control variate method.
result Errors of the new method are much smaller than those of the original Deep BSDE solver.