## NeuralOperators.jl

DeepONets, (Fourier) Neural Operators, Physics-Informed Neural Operators, and more in Julia
Popularity
151 Stars
Updated Last
1 Year Ago
Started In
May 2021

# NeuralOperators

Ground Truth Inferenced

The demonstration showing above is Navier-Stokes equation learned by the `MarkovNeuralOperator` with only one time step information. Example can be found in `example/FlowOverCircle`.

## Abstract

Neural operator is a novel deep learning architecture. It learns a operator, which is a mapping between infinite-dimensional function spaces. It can be used to resolve partial differential equations (PDE). Instead of solving by finite element method, a PDE problem can be resolved by training a neural network to learn an operator mapping from infinite-dimensional space (u, t) to infinite-dimensional space f(u, t). Neural operator learns a continuous function between two continuous function spaces. The kernel can be trained on different geometry, which is learned from a graph.

Fourier neural operator learns a neural operator with Dirichlet kernel to form a Fourier transformation. It performs Fourier transformation across infinite-dimensional function spaces and learns better than neural operator.

Markov neural operator learns a neural operator with Fourier operators. With only one time step information of learning, it can predict the following few steps with low loss by linking the operators into a Markov chain.

DeepONet operator (Deep Operator Network) learns a neural operator with the help of two sub-neural net structures described as the branch and the trunk network. The branch network is fed the initial conditions data, whereas the trunk is fed with the locations where the target(output) is evaluated from the corresponding initial conditions. It is important that the output size of the branch and trunk subnets is same so that a dot product can be performed between them.

## Usage

### Fourier Neural Operator

```model = Chain(
# lift (d + 1)-dimensional vector field to n-dimensional vector field
# here, d == 1 and n == 64
Dense(2, 64),
# map each hidden representation to the next by integral kernel operator
OperatorKernel(64 => 64, (16,), FourierTransform, gelu),
OperatorKernel(64 => 64, (16,), FourierTransform, gelu),
OperatorKernel(64 => 64, (16,), FourierTransform, gelu),
OperatorKernel(64 => 64, (16,), FourierTransform),
# project back to the scalar field of interest space
Dense(64, 128, gelu),
Dense(128, 1))```

Or one can just call:

```model = FourierNeuralOperator(ch = (2, 64, 64, 64, 64, 64, 128, 1),
modes = (16,),
σ = gelu)```

And then train as a Flux model.

```loss(𝐱, 𝐲) = l₂loss(model(𝐱), 𝐲)
opt = Flux.Optimiser(WeightDecay(1.0f-4), Flux.Adam(1.0f-3))
Flux.@epochs 50 Flux.train!(loss, params(model), data, opt)```

### DeepONet

```# tuple of Ints for branch net architecture and then for trunk net,
# followed by activations for branch and trunk respectively
model = DeepONet((32, 64, 72), (24, 64, 72), σ, tanh)```

Or specify branch and trunk as separate `Chain` from Flux and pass to `DeepONet`

```branch = Chain(Dense(32, 64, σ), Dense(64, 72, σ))
trunk = Chain(Dense(24, 64, tanh), Dense(64, 72, tanh))
model = DeepONet(branch, trunk)```

You can again specify loss, optimization and training parameters just as you would for a simple neural network with Flux.

```loss(xtrain, ytrain, sensor) = Flux.Losses.mse(model(xtrain, sensor), ytrain)
evalcb() = @show(loss(xval, yval, grid))

learning_rate = 0.001
parameters = params(model)
Flux.@epochs 400 Flux.train!(loss, parameters, [(xtrain, ytrain, grid)], opt, cb = evalcb)```

## Examples

PDE training examples are provided in `example` folder.

### One-dimensional Fourier Neural Operator

Burgers' equation

### DeepONet implementation for solving Burgers' equation

Burgers' equation

Double Pendulum

### Markov Neural Operator

Time dependent Navier-Stokes equation

### Super Resolution with MNO

Super resolution on time dependent Navier-Stokes equation

## References

### Required Packages

View all packages

### Used By Packages

No packages found.