Martingale Neural Operators: Learning Stochastic Marginals via Doob-Meyer Factorization

• URL: http://arxiv.org/abs/2605.15806v1
• Date: Fri, 15 May 2026 10:00:21 GMT
• Title: Martingale Neural Operators: Learning Stochastic Marginals via Doob-Meyer Factorization
• Abstract summary: Doob-Meyer theorem establishes that any semimartingale fundamentally decomposes into a predictable drift and an unpredictable, zero-mean martingale.<n>We introduce the Martingale Neural Operator (MNO), which maps an initial condition directly to the conditional mean and covariance of the terminal law.<n>MNO reduces Wasserstein distance by up to $120times$ on $4$ field theory and $68times$ on Burgers, evaluating $sim 3times$ faster than a conditional diffusion baseline matched at wall-clock training budgets.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Neural operators excel as deterministic surrogates, but inevitably collapse to the conditional mean when applied to stochastic PDEs, discarding the variance and tail structure upon which uncertainty quantification depends. Recovering this structure typically requires Monte Carlo rollouts or grafted generative models, both of which surrender the one-shot efficiency and resolution invariance that define the operator paradigm. To resolve this, we draw on the Doob-Meyer theorem, which establishes that any semimartingale fundamentally decomposes into a predictable drift and an unpredictable, zero-mean martingale. Translating this theorem into an architectural prior, we introduce the Martingale Neural Operator (MNO). MNO maps an initial condition directly to the conditional mean and covariance of the terminal law, parameterized by a drift-like mean and a low-rank factor $B_φ$ with $B_φ^\top B_φ$ positive semi-definite by construction. For our experiments, we use a Gaussian residual instantiation. Across 1D SPDEs, rough volatility, and 2D operator tasks, MNO reduces Wasserstein distance by up to $120\times$ on $φ^4$ field theory and $68\times$ on stochastic Burgers, evaluating $\sim 3\times$ faster than a conditional diffusion baseline at matched wall-clock training budgets. On 2D tasks, MNO is comparable to FNO on zero-shot resolution transfer and turbulent flow, while quasi-deterministic systems such as Gray-Scott remain a failure mode.

Related papers

• A Constitutive Markov Physics-Informed Neural Operator (MPNO) for Autoregressive Stability in Transient Dynamics [14.04953000698584]
  We propose a Markov physics-informed neural operator (MPNO) modeling one-step evolution as a propagation operator.<n>MPNO rolls out stably with bounded error on all test seeds at 100/135/165 m/s; the single-step relative L2 error is 0.7304 +/- 0.0008, better than WNO and comparable to FNO at about one quarter of FNO's parameters.<n>With about 20K parameters, MPNO delivers roughly 105x inference speedup over LS-DYNA.
  arXiv  Detail & Related papers  (2026-08-26T12:54:37Z)
• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions [13.856153548136826]
  Flow Matching has recently emerged as a popular class of generative models for simulating a target distribution.<n>We study two DFM models on $mathbbZ_md = 0,ldots,m-1d$, sampled through time discretization.<n>We derive non-asymptotic bounds in Kullback--Leibler divergence for the early-stopped version of the target distribution.
  arXiv  Detail & Related papers  (2026-05-09T11:06:33Z)
• Learning operators on labelled conditional distributions with applications to mean field control of non exchangeable systems [3.441021278275805]
  We study the approximation of operators acting on probability measures on a product space with prescribed marginal.<n>Our main theoretical result establishes a universal approximation theorem for continuous operators on $cal M_$.<n>We introduce a sampling strategy for generating training measures in $cal M_$, enabling practical learning of such conditional mean-field operators.
  arXiv  Detail & Related papers  (2026-03-23T08:13:21Z)
• Wiener Chaos Expansion based Neural Operator for Singular Stochastic Partial Differential Equations [58.188204772101756]
  This paper explores how our recently developed Wiener Chaos Expansion (WCE)-based neural operator (NO) can be applied to singular partial differential equations.<n>We leverage feature-wise linear modulation (FiLM) to appropriately capture the dependency between the solution of singular SPDE and its smooth remainder.<n>The resulting WCE-FiLM-NO shows excellent performance on $boldsymbol4$, as measured by relative $L$ loss, out-of-distribution and autocorrelation score.
  arXiv  Detail & Related papers  (2026-03-09T10:50:30Z)
• Optimal Unconstrained Self-Distillation in Ridge Regression: Strict Improvements, Precise Asymptotics, and One-Shot Tuning [61.07540493350384]
  Self-distillation (SD) is the process of retraining a student on a mixture of ground-truth and the teacher's own predictions.<n>We show that for any prediction risk, the optimally mixed student improves upon the ridge teacher for every regularization level.<n>We propose a consistent one-shot tuning method to estimate $star$ without grid search, sample splitting, or refitting.
  arXiv  Detail & Related papers  (2026-02-19T17:21:15Z)
• Differentiable Sparsity via $D$-Gating: Simple and Versatile Structured Penalization [22.883367233817836]
  We show that $D$-Gating is theoretically equivalent to solving the original group sparsity problem.<n>We validate our theory across vision, language, and tasks, where $D$-Gating consistently delivers strong performance-sparsity tradeoffs.
  arXiv  Detail & Related papers  (2025-09-28T14:08:29Z)
• Neural Brownian Motion [2.1756081703276]
  This paper introduces the Neural-Brownian Motion (NBM), a new class of processes for modeling dynamics under learned uncertainty.<n>The volatility function $nu_theta$ is not postulated a priori but is implicitly defined by the constraint $g_theta(t, M_t, nu_theta(t, M_t)) = 0.<n>The character of this measure whether pessimistic or optimistic is endogenously determined by the learned $theta, providing a rigorous foundation for models where the attitude towards uncertainty is a discoverable feature.
  arXiv  Detail & Related papers  (2025-07-19T06:09:52Z)
• LLMs are Bayesian, in Expectation, not in Realization [0.0]
  Large language models adapt to new tasks without parameter updates.<n>Recent empirical findings reveal a fundamental contradiction: transformers systematically violate the martingale property.<n>This violation challenges the theoretical foundations underlying uncertainty quantification in critical applications.
  arXiv  Detail & Related papers  (2025-07-15T22:20:11Z)
• Non-asymptotic bounds for forward processes in denoising diffusions: Ornstein-Uhlenbeck is hard to beat [49.1574468325115]
  This paper presents explicit non-asymptotic bounds on the forward diffusion error in total variation (TV)<n>We parametrise multi-modal data distributions in terms of the distance $R$ to their furthest modes and consider forward diffusions with additive and multiplicative noise.
  arXiv  Detail & Related papers  (2024-08-25T10:28:31Z)
• Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models [49.81937966106691]
  We develop a suite of non-asymptotic theory towards understanding the data generation process of diffusion models. In contrast to prior works, our theory is developed based on an elementary yet versatile non-asymptotic approach.
  arXiv  Detail & Related papers  (2023-06-15T16:30:08Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)

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.