Neural operator discovery from heterogeneous trajectories

• URL: http://arxiv.org/abs/2607.23337v1
• Date: Sat, 25 Jul 2026 19:20:25 GMT
• Title: Neural operator discovery from heterogeneous trajectories
• Abstract summary: We introduce a factorized latent-conditioning formulation that jointly learns a neural operator and a low-dimensional latent representation.<n>Across diverse systems, the learned latent representation captures the intrinsic dimensionality of system variation.<n>Results establish an interpretable paradigm for operator learning in the absence of explicit factor supervision.
• Score: 3.174604660846279
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Neural operators provide data-driven mappings for modeling dynamical systems. Extending them to families of systems typically requires explicit conditioning variables such as physical parameters, geometries, or boundary conditions. In many real-world settings, these quantities are unobserved. Here, we formulate neural operator discovery (NOD) as the problem of learning both shared solution operators and system-specific variation directly from heterogeneous trajectories without access to labeled governing factors. We introduce a factorized latent-conditioning formulation that jointly learns a neural operator and a low-dimensional latent representation through factorized prediction, trajectory-decoupled sampling, and dimension selection. Across diverse systems, the learned latent representation captures the intrinsic dimensionality of system variation and organizes system instances in a smooth and approximately invertible latent structure aligned with the underlying governing factors. This organization enables generalization to previously unseen system instances, including zero-shot extrapolation across regimes and stable long-horizon prediction. These results establish an interpretable paradigm for operator learning in the absence of explicit factor supervision.

Related papers

• Local gradient neural operator [12.997669738865484]
  We propose a lightweight and interpretable alternative for field temporal evolution prediction and source identification in typical mechanical problems.<n>The method builds on priors from nonlinear gradient discretization and uses multilayer perceptron convolutional layers to learn translation-invariant local kernels.<n>We evaluate the method on PDE benchmarks covering linear and nonlinear, static and dynamic, and low and high dimensional cases.
  arXiv  Detail & Related papers  (2026-09-07T16:53:47Z)
• Approximation Theory of Laplacian-Based Neural Operators for Reaction-Diffusion System [4.86840788259762]
  We study neural operators applied to the solution mapping from initial conditions to time-dependent solutions of a generalized Gierer-Meinhardt-diffusion system.<n>Our main results establish explicit approximation error bounds in terms of network depth, width, and spectral rank.<n>We show that Laplacian eigenfunction-based neural architectures alleviate the curse of parametric complexity encountered in generic operator learning.
  arXiv  Detail & Related papers  (2026-05-12T12:13:04Z)
• Separable neural architectures as a primitive for unified predictive and generative intelligence [0.7318787399845128]
  We formalise a representational class that unifies additive, quadratic and tensor-decomposed neural models.<n>SNAs impose a structural inductive bias that factorises high-dimensional mappings into low-composed components.<n>These results establish the separable neural architecture as the domain-agnostic primitive for predictive and generative intelligence.
  arXiv  Detail & Related papers  (2026-03-12T17:56:54Z)
• KoopGen: Koopman Generator Networks for Representing and Predicting Dynamical Systems with Continuous Spectra [65.11254608352982]
  We introduce a generator-based neural Koopman framework that models dynamics through a structured, state-dependent representation of Koopman generators.<n>By exploiting the intrinsic Cartesian decomposition into skew-adjoint and self-adjoint components, KoopGen separates conservative transport from irreversible dissipation.
  arXiv  Detail & Related papers  (2026-02-15T06:32:23Z)
• How deep is your network? Deep vs. shallow learning of transfer operators [0.4473327661758546]
  We propose a randomized neural network approach called RaNNDy for learning transfer operators and their spectral decompositions from data.<n>The main advantage is that without a noticeable reduction in accuracy, this approach significantly reduces the training time and resources.<n>We present results for different dynamical operators, including Koopman and Perron-Frobenius operators, which have important applications in analyzing the behavior of complex dynamical systems.
  arXiv  Detail & Related papers  (2025-09-24T09:38:42Z)
• Disentangled Representation Learning for Parametric Partial Differential Equations [31.240283037552427]
  We propose a new paradigm for learning disentangled representations from neural operator parameters. DisentangO is a novel hyper-neural operator architecture designed to unveil and disentangle the latent physical factors of variation embedded within the black-box neural operator parameters. We show that DisentangO effectively extracts meaningful and interpretable latent features, bridging the divide between predictive performance and physical understanding in neural operator frameworks.
  arXiv  Detail & Related papers  (2024-10-03T01:40:39Z)
• Diffusion models as probabilistic neural operators for recovering unobserved states of dynamical systems [49.2319247825857]
  We show that diffusion-based generative models exhibit many properties favourable for neural operators.<n>We propose to train a single model adaptable to multiple tasks, by alternating between the tasks during training.
  arXiv  Detail & Related papers  (2024-05-11T21:23:55Z)
• Capturing Actionable Dynamics with Structured Latent Ordinary Differential Equations [68.62843292346813]
  We propose a structured latent ODE model that captures system input variations within its latent representation. Building on a static variable specification, our model learns factors of variation for each input to the system, thus separating the effects of the system inputs in the latent space.
  arXiv  Detail & Related papers  (2022-02-25T20:00:56Z)
• Data-driven emergence of convolutional structure in neural networks [83.4920717252233]
  We show how fully-connected neural networks solving a discrimination task can learn a convolutional structure directly from their inputs. By carefully designing data models, we show that the emergence of this pattern is triggered by the non-Gaussian, higher-order local structure of the inputs.
  arXiv  Detail & Related papers  (2022-02-01T17:11:13Z)
• Supervised DKRC with Images for Offline System Identification [77.34726150561087]
  Modern dynamical systems are becoming increasingly non-linear and complex. There is a need for a framework to model these systems in a compact and comprehensive representation for prediction and control. Our approach learns these basis functions using a supervised learning approach.
  arXiv  Detail & Related papers  (2021-09-06T04:39:06Z)
• Provably Efficient Neural Estimation of Structural Equation Model: An Adversarial Approach [144.21892195917758]
  We study estimation in a class of generalized Structural equation models (SEMs) We formulate the linear operator equation as a min-max game, where both players are parameterized by neural networks (NNs), and learn the parameters of these neural networks using a gradient descent. For the first time we provide a tractable estimation procedure for SEMs based on NNs with provable convergence and without the need for sample splitting.
  arXiv  Detail & Related papers  (2020-07-02T17:55:47Z)

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.