Neural Expectation Operators

• Neural Expectation Operators are non-linear conditional expectation models defined by BSDE drivers parameterized via neural networks to capture ambiguity and model risk.
• They ensure well-posedness under quadratic growth and local Lipschitz conditions, with architecture designs that enforce monotonicity and convexity.
• The framework extends to Neural-Brownian Motion and learned measure changes, enabling robust applications in finance, stochastic control, and mean-field dynamics.

Neural Expectation Operators are non-linear conditional expectations induced by backward stochastic differential equations whose drivers are parameterized by neural networks. Within the paradigm of Measure Learning, they provide a probabilistic model of ambiguity—uncertainty over probability laws—by encoding attitude toward model misspecification directly in the BSDE driver. In the associated theory of Neural Brownian Motion, the same operator, written $\varepsilon^\theta$, becomes the martingale notion relative to which a canonical stochastic process is defined, linking learned ambiguity to endogenous volatility and learned changes of measure (Qi, 13 Jul 2025, Qi, 19 Jul 2025).

1. BSDE definition and non-linear expectation structure

In its simplest form, a Neural Expectation Operator is induced by a neural BSDE

$$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$

where the driver $f_\theta$ is computed by a neural network with parameters $\theta$. In the general setting, the driver also depends on a forward state process $X$:

$$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$

The operator acts as a non-linear conditional expectation via $Y_t = E[\xi\mid F_t]$. In the notation used for Neural Brownian Motion, one defines

$$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$

and sets $\varepsilon^\theta[\xi \mid F_t] := Y_t$ (Qi, 13 Jul 2025).

The economic and probabilistic content of the construction is that $f_\theta$ compactly represents the structure of ambiguity. Quadratic growth in the martingale component $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$0 encodes risk and ambiguity aversion. Under suitable convexity and independence assumptions, the operator admits a dual representation over a family of measures related by Girsanov transforms: for drivers of the form $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$1, independent of $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$2 and convex in $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$3,

$$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$4

with $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$5 and $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$6 the (negative) Fenchel–Legendre transform of $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$7 in $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$8. In that sense, the non-linear expectation evaluates $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$9 under a worst-case change of measure from a learned universe of plausible models (Qi, 13 Jul 2025).

Classical linear conditional expectation is recovered when $f_\theta$0. In that case the BSDE reduces to the martingale representation with $f_\theta$1, so the neural construction is a strict generalization rather than a replacement of standard expectation.

2. Well-posedness under quadratic growth and local Lipschitz structure

The foundational well-posedness theorem is formulated for drivers satisfying continuity in $f_\theta$2, quadratic growth in $f_\theta$3, uniform local Lipschitz continuity in $f_\theta$4, and monotonicity in the sense that $f_\theta$5 is non-increasing. The terminal condition is required to satisfy exponential integrability, and the random part of the driver induced by the forward state $f_\theta$6 must satisfy an exponential integrability condition of the form

$f_\theta$7

The main theorem states that if $f_\theta$8, then there exists a unique adapted solution

$f_\theta$9

so $\theta$0 is essentially bounded and $\theta$1 is a BMO-martingale (Qi, 13 Jul 2025).

A notable feature of the result is that it circumvents the classical global Lipschitz assumption in the state variable $\theta$2. The theorem is explicitly described as applicable to common neural network architectures, including architectures with ReLU activations, and the exponential integrability condition on terminal data is described as the sharp condition for this setting. A priori estimates are obtained by comparison with dominating quadratic BSDEs. With auxiliary upper and lower generators, one shows

$\theta$3

which yields boundedness of $\theta$4 and BMO control of $\theta$5; uniqueness follows by strict comparison in $\theta$6 and identification of $\theta$7 via martingale representation (Qi, 13 Jul 2025).

A recurrent misconception is that neural parameterization necessarily weakens analytical control. The constructive objective of the theory is the opposite: it builds a bridge between the abstract assumptions of quadratic BSDE theory and concrete, verifiable neural network designs. In that sense, the learned operator is not an unconstrained black box, but a BSDE object whose solvability is tied to explicit structural hypotheses.

3. Architectural constraints and axiomatic properties

The theory includes constructive neural architectures that enforce the analytical assumptions required by quadratic BSDEs. A separable driver

$\theta$8

satisfies the uniform local Lipschitz property in $\theta$9 when $X$0 is locally Lipschitz, and monotonicity when $X$1 is chosen non-increasing. A bounded-interaction form

$X$2

yields local Lipschitz continuity in $X$3 provided $X$4 is uniformly bounded and $X$5 is locally Lipschitz (Qi, 13 Jul 2025).

Monotonicity can also be enforced directly by sign constraints. In a feed-forward network with non-decreasing activations, one imposes non-positive weights from $X$6 to the first hidden layer and non-negative weights in subsequent hidden layers and in the output layer. A simple induction then gives $X$7 everywhere, hence monotonicity. Convexity in $X$8 can be imposed with Input-Convex Neural Networks. In that case convexity of the operator $X$9 is guaranteed, and under convexity and monotonicity Jensen’s inequality holds:

$$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$0

The same framework is described as encoding economically meaningful axioms such as monotonicity, time consistency, and, via ICNNs, convexity (Qi, 13 Jul 2025).

These constructions are important because they make the analytical hypotheses inspectable at the level of weights and activations. The operator’s qualitative properties are therefore not merely postulated; they can be enforced by architectural design.

4. Fully coupled forward–backward systems and mean-field asymptotics

The framework extends to fully coupled forward–backward stochastic differential equations of the form

$$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$1

Under continuity and global Lipschitz conditions on $$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$2, $$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$3, and $$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$4, together with the quadratic-growth, monotone-in-$$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$5, and local-Lipschitz-in-$$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$6 conditions on $$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$7, and a small-time or small-Lipschitz condition $$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$8, the system admits a unique adapted solution

$$Y_s = \xi + \int_s^T f_\theta(r, X_r, Y_r, Z_r)\,dr - \int_s^T Z_r\,dW_r, \quad s\in[t,T].$$9

for any $Y_t = E[\xi\mid F_t]$0 (Qi, 13 Jul 2025).

The proof follows the four-step scheme. One identifies a quasilinear parabolic PDE for $Y_t = E[\xi\mid F_t]$1, with the quadratic $Y_t = E[\xi\mid F_t]$2-dependence entering through $Y_t = E[\xi\mid F_t]$3; one then uses viscosity solution theory and comparison to obtain a unique spatially Lipschitz solution $Y_t = E[\xi\mid F_t]$4; finally one reconstructs $Y_t = E[\xi\mid F_t]$5 by the Markovian ansatz $Y_t = E[\xi\mid F_t]$6 and $Y_t = E[\xi\mid F_t]$7 (Qi, 13 Jul 2025).

The same program is pushed to interacting particle systems. For exchangeable particles with empirical law $Y_t = E[\xi\mid F_t]$8, the theory establishes a Law of Large Numbers, described as propagation of chaos, and a Central Limit Theorem. The LLN states that, for each particle index $Y_t = E[\xi\mid F_t]$9,

$$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$0

Under differentiability of the coefficients in $$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$1 and Lions differentiability in the measure argument, the centered fluctuations converge in law to the unique solution of a linear McKean–Vlasov FBSDE. Because the fluctuation dynamics are linear and driven by Brownian inputs, the limit law is Gaussian (Qi, 13 Jul 2025).

5. Self-referential martingales and canonical Neural-Brownian Motion

A particularly distinctive development is the use of the Neural Expectation Operator to define a new martingale notion. For self-referential processes, the driver is specialized by identifying the value and state variables with the process itself:

$$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$2

A one-dimensional process $$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$3 is then called a Neural-Brownian Motion if it is continuous, $$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$4, and is an $$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$5-martingale it generates:

$$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$6

It is canonical if it has zero drift under the physical measure $$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$7 (Qi, 19 Jul 2025).

If $$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$8 is an Itô process

$$- dY_s = f_\theta(s, X_s, Y_s, Z_s) ds - Z_s dW_s, \qquad Y_T = \xi,$$9

then $\varepsilon^\theta[\xi \mid F_t] := Y_t$0 is an $\varepsilon^\theta[\xi \mid F_t] := Y_t$1-martingale if and only if

$\varepsilon^\theta[\xi \mid F_t] := Y_t$2

for almost every $\varepsilon^\theta[\xi \mid F_t] := Y_t$3. The canonical condition $\varepsilon^\theta[\xi \mid F_t] := Y_t$4 therefore implies the algebraic constraint

$\varepsilon^\theta[\xi \mid F_t] := Y_t$5

so the volatility is characterized as a root of $\varepsilon^\theta[\xi \mid F_t] := Y_t$6 rather than postulated a priori. Under the implicit volatility assumption that, for each $\varepsilon^\theta[\xi \mid F_t] := Y_t$7, the equation $\varepsilon^\theta[\xi \mid F_t] := Y_t$8 has a unique positive root $\varepsilon^\theta[\xi \mid F_t] := Y_t$9, that the root is regular, and that $f_\theta$0 has global linear growth, the canonical Neural-Brownian Motion exists and is the unique strong solution of

$f_\theta$1

The regular root condition yields $f_\theta$2 regularity of $f_\theta$3 via the Implicit Function Theorem, and local Lipschitz continuity in $f_\theta$4 follows immediately (Qi, 19 Jul 2025).

This produces a learned stochastic calculus in which the infinitesimal generator is

$f_\theta$5

The volatility $f_\theta$6 is endogenous: it emerges as the unique positive root of $f_\theta$7 and is therefore learned from the ambiguity structure encoded by the driver. The process is correspondingly no longer characterized by stationary independent increments; its volatility is state- and driver-dependent, learned from data (Qi, 19 Jul 2025).

6. Learned measure changes, sensitivity, applications, and related notions

In the quadratic specialized case

$f_\theta$8

with $f_\theta$9 and $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$00, the canonical constraint yields a constant volatility

$$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$01

Under $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$02,

$$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$03

so $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$04 is a scaled Brownian motion. Defining a new measure $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$05 by the Radon–Nikodym density with kernel $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$06,

$$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$07

one obtains a Girsanov-type theorem: $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$08 is a $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$09-Brownian motion and

$$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$10

Thus a canonical Neural-Brownian Motion acquires a drift under the learned measure. The sign of $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$11 determines the interpretation: $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$12 corresponds to a convex driver and is interpreted as ambiguity aversion, whereas $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$13 corresponds to a concave driver and is interpreted as ambiguity seeking (Qi, 19 Jul 2025).

From the computational side, the framework is designed for learning from data. Neural Expectation Operators are computed by solving the BSDE for $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$14 given $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$15 and $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$16, and training $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$17 is described as well-posed because the theory provides a sensitivity BSDE that yields exact gradients for $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$18. If $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$19 and the driver is differentiable in $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$20, then the gradient processes $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$21 solve the linear BSDE

$$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$22

with $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$23, which enables principled gradient-based learning with SGD or Adam (Qi, 13 Jul 2025).

The stated application domain includes stochastic control, robust finance, and macro models of systemic ambiguity. A concrete example is the Merton portfolio problem under the driver $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$24, which is described as consistent with the theory and as predicting ambiguity-induced caution; the optimal policy is wealth-dependent and strictly more conservative than the classical Merton strategy, with the ambiguity parameter $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$25 estimable from data via the sensitivity machinery. In the Neural-Brownian Motion formulation, the same learned-volatility mechanism is presented as opening principled applications such as consistent implicit-volatility models in finance, while also opening a path to mean-field limits when interactions are introduced through measure-dependent drivers (Qi, 13 Jul 2025, Qi, 19 Jul 2025).

Neural Expectation Operators should be distinguished from methods that estimate linear expectations through PDE surrogates. The Feynman–Kac Operator Expectation Estimator, for example, estimates $$Y_t = \xi + \int_t^T f_\theta(s,Y_s,Z_s)\,ds - \int_t^T Z_s\,dW_s,$$26 by combining diffusion bridge models with approximation of the Feynman–Kac operator using Physically Informed Neural Networks. That construction is an expectation estimator for a target mathematical expectation, whereas Neural Expectation Operators define a non-linear conditional expectation itself through a BSDE driver and are expressly designed to model ambiguity (Li et al., 2024).