Plug-and-Play Regularization
A group of regularization terms that can not be directly written down as function are learned plug-and-play (PnP) priors. These are terms based on deep neural networks, which are trainted to implement the proximal map corresponding to the regularization term. Such a PnP prior can be used in the same way as any other regularization term.
The following example shows how to use a PnP prior in the context of the Kaczmarz solver.
using RegularizedLeastSquares
A = randn(32, 16)
x = randn(16)
b = A*x;For the documentation we will just use the identity function as a placeholder for the PnP prior.
model = identityidentity (generic function with 1 method)In practice, you would replace this with a neural network:
using Flux
model = Flux.loadmodel!(model, ...)The model can then be used together with the PnPRegularization term:
reg = PnPRegularization(1.0; model = model, shape = [16]);Since models often expect a specific input range, we can use the MinMaxTransform to normalize the input:
reg = PnPRegularization(1.0; model = model, shape = [16], input_transform = RegularizedLeastSquares.MinMaxTransform);Custom input transforms can be implemented by passing something callable as the input_transform keyword argument. For more details see the PnPRegularization documentation.
The regularization term can then be used in the solver:
solver = createLinearSolver(Kaczmarz, A; reg = reg, iterations = 32)
x_approx = solve!(solver, b)16-element Vector{Float64}:
0.3676149926239396
0.19667820361837252
0.19439929839813463
2.2308763102599256
1.7499683376670077
0.36622452469653943
1.0319004766448052
0.4367913466221862
2.274249423090547
0.3219254335644446
-0.03337959619676023
-0.40155060619565774
0.757753358402804
0.36839815476762605
0.23747333437293316
-1.2523839651364077This page was generated using Literate.jl.