Title: RECURRENT INFERENCE MACHINES FOR SOLVING INVERSE PROBLEMS

Abstract: Inverse problems are typically solved by first defining a model and then choosing an inference procedure. With this separation of modeling from inference, inverse problems can be framed in a modular way. For example, variational inference can be applied to a broad class of models. The modularity, however, typically goes away after model parameters have been trained under a chosen inference procedure. During training, model and inference often interact in a way that the model parameters will ultimately be adapted to the chosen inference procedure, posing the two components inseparable after training. But if model and inference become inseperable after training, why separate them in the first place? We propose a novel learning framework which abandons the dichotomy between model and inference. Instead, we introduce Recurrent Inference Machines (RIM), a class of recurrent neural networks (RNN), that directly learn to solve inverse problems. We demonstrate the effectiveness of RIMs in experiments on various image reconstruction tasks. We show empirically that RIMs exhibit the desirable convergence behavior of classical inference procedures, and that they can outperform state-ofthe-art methods when trained on specialized inference tasks. Our approach bridges the gap between inverse problems and deep learning, providing a framework for fast progression in the field of inverse problems.

1. INTRODUCTION:

Inverse Problems are a broad class of problems which can be encountered in all scientific disciplines, from the natural sciences to engineering. The task in inverse problems is to reconstruct a signal from observations that are subject to a known (or inferred) corruption process known as the forward model. A typical example of an inverse problem is the linear measurement problem

EQUATION

where x is the signal of interest, A is an m × d corruption matrix, n is an additive noise vector, and y is the actual measurement. If A is a wide matrix such that m d, this problem is typically ill-posed. Many signal reconstruction problems can be phrased in terms of the linear measurement problem such as image denoising, super-resolution, deconvolution and so on. The general form of A typically defines the problem class. If A is an identity matrix the problem is a denoising problem, while in tomography A represents a Fourier transform and a consecutive sub-sampling of the Fourier coefficients.

Inverse problems are often formulated as an optimization problem of the form min

EQUATION

where d(y, Ax) is the data fidelity term that enforces x to satisfy the observations y, and R(x) is a regularization term which restricts the solution to comply with a predefined model over x.

The difficulties that arise in this framework are two-fold: (1) it is difficult to choose R(x) such that it is an appropriate model for complex signals such as natural images, and (2) even under a well chosen R(x) the optimization procedure might become difficult.

Compressed sensing approaches give up on a versatile R(x) in order to define a convex optimization procedure. The idea is that the signal x has a sparse representation in some basis Ψ such that x = Ψu and that the optimization problem can be rephrased as

EQUATION

where • 1 is the sparsity inducing L1-norm (Donoho, 2006a) . Under certain classes of d(y, AΨu) such as quadratic errors the optimization problem becomes convex. Results from the compressed sensing literature offer provable bounds on the reconstruction performance for sparse signals of this form (Candès et al., 2006; Donoho, 2006b) . The basis Ψ can also be learned from data (Aharon et al., 2006; Elad & Aharon, 2006) .

Other approaches interpret equation ( 2) in terms of probabilities such that finding the solution is a matter of performing maximum a posteriori (MAP) estimation (Figueiredo et al., 2007) . In those cases d(y, AΨu) takes the form of a log-likelihood and R(x) takes the form of a parametric logprior log p θ (x) over variable x such that the minimization becomes:

EQUATION

This allows for more expressiveness of R(x) and for the possibility of learning the prior p θ (x) from data. However, with more expressive priors optimization will become more difficult as well. In fact, only for a few trivial prior-likelihood pairs will inference remain convex. In practice one often has to resort to approximations of the objective and to approximate double-loop algorithms in order to allow for scalable inference (Nickisch & Seeger, 2009; Zoran & Weiss, 2011) .

In this work we take a radically different approach to solving inverse problems. We move away from the idea that it is beneficial to separate learning a prior (regularizer) from the optimization to do the reconstruction. The usual thinking is that this separation allows for greater modularity and the possibility to interchange one of these two complementary components in order to build new algorithms. In practice however, we observe that the optimization procedure almost always has to be adapted to the model choice to achieve good performance (Aharon et al., 2006; Elad & Aharon, 2006; Nickisch & Seeger, 2009; Zoran & Weiss, 2011) . In fact, it is well known that the optimization procedure used for training should match the one used during testing because the model has adapted itself to perform well under that optimization procedure (Kumar et al., 2005; Wainwright, 2006) .

What we need is a single framework which allows us to backpropagate through the optimization procedure when we learn the free parameters. Hence, We propose to look at inverse problems as a direct mapping from observations to estimated signal,

EQUATION

where x is an estimate of signal x from observations (A, y). Here we define φ as a set of learnable parameters which define the inference algorithm as well as constraints on x. The goal is thus to define map whose parameters are directly optimized for solving the inverse problem itself. It has the benefits of both having high expressive power (if the map f φ is complex enough) as well as being fast at inference time.

This paradigm shift allows us to learn and combine the effect of a prior, the reconstruction fidelity and an inference method without the need to explicitly define the functional form of all components. The whole procedure is simply interpreted as a single RNN. As a result, there is no need for sparsity assumptions, the introduction of model constraints to allow for convexity, or even for double-loop algorithms (Gregor & LeCun, 2010) . In fact the proposed framework allows for use of current deep learning approaches which have high expressive power without trading off scalability. It further allows us to move all the manual parameter tuning -which is still common in traditional approaches (Zoran & Weiss, 2011) -away from the inference phase and into the learning phase. We believe this framework can be an important asset to introduce deep learning into the domain of inverse problems. Here we have added an additional state variable which represents information that is carried over time, but is not directly subjected to constraints through the likelihood term p(y|x). During training, estimates at each time step are subject to an error signal from the ground truth signal x (dashed two-sided arrows) in order to perform backpropagation. The intermittent error signal will force the model to perform well as soon as possible during iterations. At test time, there is no error signal from x.

2. RECURRENT INFERENCE MACHINES:

The goal of this work is to find an inverse model as described in equation ( 5). Often, however, it will be intractable to find (5) directly, even with modern non-linear function approximators. For high-dimensional y and x, which are typically considered in inverse problems, it will simply not be possible to fit matrix A into memory explicitly, but instead matrix A will be replaced by an operator that acts on x. An example is the Discrete Fourier Transform (DFT). Instead of using a Fourier matrix which is quadratic in the size of x, DFTs are typically performed using the Fast Fourier Transform (FFT) algorithm which reduces computational cost and memory consumption significantly. The use of operators, however, does not allow us to feed A into (5) anymore, but instead we will have to resort to an iterative approach that alternates between updates of x and evaluation of Ax. This is precisely what is typically done in gradient-based inference methods, and we will motivate our framework from there.

2.1. GRADIENT-BASED INFERENCE:

Recall from equation ( 4) that inverse problems can be interpreted in terms of probability such that optimization is an iterative approach to MAP inference. In its most simple form each consecutive estimate of x is then computed through a recursive function of the form

EQUATION

where we make use of the fact that p(x|A, y) ∝ p(y|A, x)p θ (x) and γ t is the step size or learning rate at iteration t. Further, A is a (partially-)observable covariate, p(y|A, x) is the likelihood function for a given inference problem, and p θ (x) is a prior over signal x. In many cases where either the likelihood term or the prior term deviate from standard models, optimization will not be convex.

In constrast, the approach presented in this work is completely freed from ideas about convexity, as will be shown in the next section.

2.2. RECURRENT FUNCTION DEFINITION:

The central insight of this work is that update equation ( 6) can be generalized such that

EQUATION

) where we denote ∇ log p(y|A, x)(x t ) by ∇ y|x for readability and φ is a set of learnable parameters that govern the updates of x. In this representation, prior parameters θ and learning rate parameters γ have been merged into one set of trainable parameters φ.

To recover the original update equation ( 6), g φ (∇ y|x , x t ) is written as

g φ (∇ y|x , x t ) = γ t ∇ y|x + ∇ x

(8) where we make use of ∇ x to denote ∇ log p θ (x)(x t ). It will be useful to dissect the terms on the right-hand side of (8) to make sense of the usefulness of the modification.

First notice, that in equation ( 6) we never explicitly evaluate the prior, but only evaluate its gradient in order to perform updates. If never used, learning a prior appears to be unnecessary, and instead it appears more reasonable to directly learn a gradient function ∇ x = f θ (x t ) ∈ R d . The advantage of working solely with gradients is that they do no require the evaluation of an (often) intractable normalization constant of p θ (x).

A second observation is that the step sizes γ t are usually subject to either a chosen schedule or chosen through a deterministic algorithm such as a line search. That means the step sizes are always chosen according to a predefined model Γ. Interestingly, this model is usually not learned. In order to make inference faster and improve performance we suggest to learn the model Γ as well.

In (7) we have made the prior p θ (x) and the the step size model Γ implicit in function g φ (∇ y|x , η t ). We explicitly keep ∇ y|x as an input to (7) because -as opposed to Λ and p θ (x) -it represents extrinsic information that is injected into the model. It allows for changes in the likelihood model p(y|x) without the need to retrain parameters φ of the inference model g φ . Figure 1 gives a visual summary of the insights from this section.

2.3. OUTPUT CONSTRAINTS:

In many problem domains the range of values for variable x is naturally constraint. For example, images typically have pixels with strictly positive values. In order to model this constraint we make use of nonlinear link functions as they are typically used in neural networks, such that x = Ψ(η) (9) where Ψ(•) is any differentiable link function and η is the space in which RIMs iterate such that update equation ( 7) is replaced by η t+1 = η t + g φ (∇ y|η , η t ) (10) As a result x can be constraint to a certain range of values through Ψ(•), whereas iterations are performed in the unconstrained space of η

2.4. RECURRENT NETWORKS:

A useful extension of ( 7) is to introduce a latent state variable s t into the procedure. This latent variable is typically used as a utility in recurrent neural networks to learn temporal dependencies in data processing. With an additional latent variable the update equations become

EQUATION

s t+1 = h * φ ∇ y|η , η t , s t (12) where h * φ (•)

is the update model for state variable s. The variable s will allow the procedure to have memory in order to track progression, curvature, approximate a preconditioning matrix T t (such as in BFGS) and determine a stopping criterion among other things. The concept of a temporal memory is quite limited in classical inference methods, which will allow RIMs to have a potential advantage over these methods.

2.5. TRAINING:

In order to learn a step-wise inference procedure it will be necessary to simulate the inference steps during training. I.e. during training, an RIM will perform a number of inference steps T . At each step the model will produce a prediction as depicted in figure Figure 1 . Each of those predictions is then subject to a loss, which encourages the model to produce predictions that improve over time. In it's simplest form we can define a loss which is simply a weighted sum of the individual prediction losses at each time step such that

EQUATION

is the total loss. Here, L(•) is a base loss function such as the mean square error, w t is a positive scalar and x t (φ) is a prediction at time t. In this work we follow Andrychowicz et al. (2016) in setting w t = 1 for all time steps.

3. RELATED WORK:

The RIM framework can be seen as an auto-encoder framework in which only the decoder is trained, whereas the encoder is given by a known corruption process. In terms of the training procedure this makes RIMs very similar to denoising auto-encoders (Vincent et al., 2008) . Though initially with the objective of regularization in mind, denoising auto-encoders have been shown to be effectively used as generative models (Vincent et al., 2010) There have been approaches in the past which aim to formulate a framework in which an inference procedure is learned. One of the best known frameworks is LISTA (Gregor & LeCun, 2010) which aims to learn a model that reconstructs sparse codes from data. LISTA models try to fit into the classical framework of doing inference as described in 1, whereas RIMs are completely removed from assumptions about sparsity. A recent paper by Andrychowicz et al. (2016) aims to train RNNs as optimizers for non-convex optimization problems. Though introduced with a different intention, RIMs can be seen as a generalization of this approach, in which the model -in addition to the gradient information -is aware about the absolute position of a prediction in variable space(see equation ( 7)).

4. EXPERIMENTAL RESULTS:

We evaluate our method on various kinds of image restoration tasks which can each be formulated in terms of linear measurement problems as described in equation ( 1). We first analyze the properties of our proposed method on a set of restoration tasks from random projections. Later we compare our model on two well known image restoration tasks: image denoising and image super-resolution.

4.1. MODELS:

If not specified otherwise we use the same RNN architecture for all experiments presented in this work. The chosen RNN consists of three convolutional hidden layers and a final convolutional output layer. All convolutional filters were chosen to be of size 3 x 3 pixels. The first hidden layer consists of convolutions with stride 2 (64 features), subsequent batch normalization and a tanh nonlinearity.

The second hidden layer represents the RNN part of the model. We chose a gated recurrent unit (GRU) (Chung et al., 2014) with 256 features. The third hidden layer is a transpose convolution layer with 64 features which aims to recover the original image dimensions of the signal, followed again by a batch normalization layer and a tanh nonlinearity. All models have been trained on a fixed number of iterations of 20 steps. All methods were implemented in Tensorflow1 .

4.2. DATA:

All experiments were run on the BSD-300 data set (Martin et al., 2001) 2 . For training we extracted patches of size 32 x 32 pixels with stride 4 from the 200 training images available in the data set. In total this amounts to a data set of about 400 thousand image patches with highly redundant information. All models were trained over only two epochs, i.e. each unique image patch was seen by a model only twice during training. Validation was performed on a held-out data set of 1000 image patches.

For testing we either used the whole test set of 100 images from BSDS-300 or we used only a subset of 68 images which was introduced by Roth & Black (2005) and which is commonly used in the image restoration community3 .

4.3. IMAGE RESTORATION:

All tasks addressed in this work assume a linear measurement problem of the form as described in equation ( 1) with additive (isotropic) Gaussian noise. In this case the gradient of the likelihood takes the form

∇ y|x = 1 σ 2 A T (y -Ax) (14)

where σ 2 is the noise variance. For very small σ this gradient diverges. In order to make the gradient more stable also for small σ we chose to rewrite it as

EQUATION

where = softplus(φ ) and φ is a trainable parameter. As a link function Ψ (see ( 9)) we chose the logistic sigmoid nonlinearity4 and we used the mean square error as training loss.

4.4. MULTI-TASK LEARNING WITH RANDOM PROJECTIONS:

To analyze the properties of our proposed framework in terms of convergence and to test whether all components of the model are useful, we first trained the model to reconstruct image patches from noisy random projections of grayscale image patches. We consider three types of random projection matrices: (1) Gaussian ensembles with elements drawn from a standard normal distribution, (2) binary ensembles with entries of values {-1, 1} drawn from a Bernulli distribution with p = 0.5, and (3) Fourier ensembles with randomly sampled rows from a Fourier matrix (see Donoho (2006b) ).

We trained three models on these tasks: (1) a Recurrent Inference Machine (RIM) as described in 2, (2) a gradient-descent network (GDN) which does not use the current estimate as an input (compare 2016)), and (3) a feed-forward network (FFN) which uses the same inputs as the RIM but where we replaced the GRU unit with a ReLu layer in order to remove state-dependence. Model (2) and (3) are simplifications of RIM in order to test the influence of each of the removed model components on prediction performance.

Figure 2 shows the reconstruction performance of all three models on random projections. In all tasks the RIM clearly outperforms both other models, showing overall consistent convergence behavior. The FFN performs well on easier tasks but starts to show degrading performance over time on more difficult tasks. This suggests that the state information of RIM plays an important role on the convergence behavior as well as overall performance. The GDN shows worst performance among all three models. For all tasks, the performance of GDN starts to degrade clearly after the 20 time steps that were used during training. We hypothesize that the model is able to compensate some of the missing information about the current estimate of x through state variable s during training, but the model is not able to transfer this ability to episodes with more iterations.

These results suggests that both the current estimate as well as the recurrent state carry useful information for performing inference. We will therefor only consider fully fledged RIMs from here on.

4.5. IMAGE DENOISING:

After evaluating our model on 32 x 32 pixel image patches we wanted to see how reconstruction performance generalizes to full sized images and to an out of domain problem. We chose to reuse the RIM that was trained on the random projections task to perform image denoising. In this section we will call this model RIM-3task. To test the hypothesis that inference should be trained task specific, we further trained a model RIM-denoise solely on the denoising task. Table 2 shows the denoising performance through the mean PSNR on the BSD-300 test set for both models as compared to state-of-the-art methods in image denoising. The RIM-3task model shows very competitive results with other methods on all noise levels. This exemplifies that the model indeed has learned something reminiscent of a prior, as it was never directly trained on this task. The RIM-denoise model further improves upon the performance of RIM-3task and it outperforms most other methods on all noise levels. This is to say that the same RIM was used to perform denoising on different noise levels, and this model does not require any hand tuning after training. Table 1 : Color denoising. Denoising performance on the 68 images for σ = 25 after 8-bit quantization. Results for RTF-5 (Schmidt et al., 2016) and CBM3D (Dabov et al., 2007b) adopted from Schmidt et al. (2016) . In parenthesis are results for the full 100 test images.

Table 2 shows denoising perfomance on image that have been 8-bit quantized after adding noise(see Schmidt et al. (2016) ). In this case performance slightly deteriorates for both models, though still making competitive with stateof-the-art methods. This effect could possibly be accommodated through further training, or by adjusting the forward model. Figure 3 gives some qualitative results on the denoising performance for one of the test images from BSD-300 as compared to the method from Zoran & Weiss (2011) . RIM is able to produce more naturalistic images with less visible artifacts. The state variable in our RIM model allows for a growing receptive field size over time, which could explain the good long range interactions that the model shows.

Many denoising algorithms are solely tested on gray-scale images. Sometimes this is due to additional difficulties that multi-channel problems bring for some inference approaches. To show that it is straightforward to apply RIMs to multi-channel problems we trained a model to denoise RGB images. The denoising performance can be seen in table 1. The model is able to exploit correlations across color channels which allows for an additional boost in reconstruction performance.

4.6. IMAGE SUPER-RESOLUTION:

We further tested our approach on the well known image super-resolution task. We trained a single RIM5 on 36 x 36 pixel image patches from the BSD-300 training set to perform image super- Roth & Black (2005) , and numbers in parenthesis correspond to performance on all 100 test images from BSD-300. 68 image performance for KSVD (Elad & Aharon, 2006) , FoE (Roth & Black, 2005) , BM3D (Dabov et al., 2007a) , LSSC (Mairal et al., 2009) , EPLL (Zoran & Weiss, 2011) , and opt-MRF (Chen et al., 2013) adopted from Chen et al. (2013) . Performances on 100 images adopted from Burger et al. (2013) . 68 image performance on MLP (Burger et al., 2012) , RTF-5 (Schmidt et al., 2016) and all quantized results adopted from Schmidt et al. (2016) . resolution for factors 2, 3, and 46 . We followed the same testing protocol as in Huang et al. (2015) , and we used the test images that were retrieved from their website7 . Table 3 shows a comparison with some state-of-the-art methods on super-resolution for the BSD-300 test set. Figure 4 shows a qualitative example of super-resolution performance. The other deep learning method in this comparison, SRCNN Dong et al. (2014) , is outperformed by RIM on all scales. Interestingly SRCNN was trained for each scale independently whereas we only trained one RIM for all scales. The chosen RIM has only about 500.000 parameters which amounts to about 2MB of disk space, which makes this architecture very attractive also for mobile computing. 2004). Standard deviation of the mean was estimated from 10.000 boostrap samples. Test protocol and images taken from Huang et al. (2015) . Only the three best performing methods from Huang et al. (2015) were chosen for comparison: SRCNN Dong et al. (2014) , A+ Timofte et al. (2015) , SelfExSR Huang et al. (2015) . Best mean values in bold.

5. DISCUSSION:

In this work, we introduce a general learning framework for solving inverse problems with deep learning approaches. We establish this framework by abandoning the traditional separation between model and inference. Instead, we propose to learn both components jointly without the need to define their explicit functional form. This paradigm shift enables us to bridge the gap between the fields of deep learning and inverse problems. We believe that this framework can have a major impact on many inverse problems, for example in medical imaging and radio astronomy. Although we have focused on linear image reconstruction tasks in this work, the framework can be applied to inverse problems of all kinds, such as non-linear inverse problems.

:

https://www.tensorflow.org

https://www2.eecs.berkeley.edu/Research/Projects/CS/vision/bsds/

http://www.visinf.tu-darmstadt.de/vi research/code/foe.en.jsp

All training data was rescaled to be in the range[0, 1]

The architecture of this model was slightly simplified in comparison to the previous problems. Instead of strided convolutions, we chose a trous convolutions. This model is more flexible and used only about 500.000 parameters. Previous experiments will be updated with the same model architecture.

We reimplemented MATLABs bicubic interpolation kernel in order to apply a forward model (subsampling) in TensorFlow which agrees with the forward model inHuang et al. (2015).

7 https://sites.google.com/site/jbhuang0604/publications/struct sr

Figures and Tables:

Figure 1: (A) Graphical illustration of the recurrent structure of MAP estimation (compare equation (6)). The three boxes represent likelihood model p(y|x) (A omitted), prior p θ (x), and update function Γ, respectively. In each iteration, likelihood and prior collect the current estimate of x, to send a gradient to update function Γ (see text). Γ then produces a new estimate of x. Typically, prior p θ (x) and update function Γ are modeled as two distinct model components. Here they are both depicted in gray boxes because they each represent model internal information which we wish to be transferable between different observations, i.e. they are observation independent. Likelihood term p(y|x) is depicted in blue to emphasize it as a model extrinsic term, some aspects of the likelihood term can change from one observation to the other (such as matrix A). The likelihood term is observation-dependent. (B) Model simplification. The central insight of this work is to merge prior p θ (x) and update function Γ into one model with trainable parameters φ. The model then iteratively produces new estimates through feedback from likelihood model p(y|x) and previous updates. (C) A Recurrent Inference Machine unrolled in time.Here we have added an additional state variable which represents information that is carried over time, but is not directly subjected to constraints through the likelihood term p(y|x). During training, estimates at each time step are subject to an error signal from the ground truth signal x (dashed two-sided arrows) in order to perform backpropagation. The intermittent error signal will force the model to perform well as soon as possible during iterations. At test time, there is no error signal from x.

Figure2: Reconstruction performance over time on random projections. Shown are results of the three reconstruction tasks from random projections (see text) on 5000 random patches from the BSD-300 test set. Value of p represent the the reduction in dimensionality through the random projection. Noise standard deviation was chosen to be σ = 1. Solid lines correspond to the mean peak signal-to-noise-ration (PSNR) over time, and shaded areas correspond to one standard deviation around the mean. Vertical dashed lines mark the last time step that was used during training.

Figure 3: Denoising performance on example image use in Zoran & Weiss (2011). σ = 50. Noisy image was 8-bit quantized before reconstruction.

Figure 4: Super-resolution example with factor 3. Comparison with the same methods as in table 3. Reported numbers are PSNR/SSIM. Best results in bold.

An exception is the work fromGregor et al. (2016) which is conceptually strongly related to RIMs. There, an RNN model is used to generate static data by drawing on a fixed canvas. An error signal is propagated throughout the generation process.

Table content: <table/>

Denoising performance on gray-scale images from BSD-300 test set. Shown are mean PSNR values for different noise values. Number outside of parenthesis correspond to test performance on the 68 test images from

Table content: <table/>

± 0.0078 0.8835 ± 0.0062 0.8862 ± 0.0063 0.8855 ± 0.0064 0.8885 ± 0.0062 3x 0.7382 ± 0.0114 0.7794 ± 0.0102 0.7836 ± 0.0104 0.7843 ± 0.0104 0.7888 ± 0.0101 4x 0.6672 ± 0.0131 0.7018 ± 0.0125 0.7089 ± 0.0125 0.7108 ± 0.0124 0.7156 ± 0.0125

Table content: <table><tr><td colspan="2">Metric Scale</td><td>Bicubic</td><td>SRCNN</td><td>A+</td><td>SelfExSR</td><td>RIM (Ours)</td></tr><tr><td/><td>2x</td><td>29.55 ± 0.35</td><td>31.11 ± 0.39</td><td>31.22 ± 0.40</td><td>31.18 ± 0.39</td><td>31.39 ± 0.39</td></tr><tr><td>PSNR</td><td>3x</td><td>27.20 ± 0.33</td><td>28.20 ± 0.36</td><td>28.30 ± 0.37</td><td>28.30 ± 0.37</td><td>28.51 ± 0.37</td></tr><tr><td/><td>4x</td><td>25.96 ± 0.33</td><td>26.70 ± 0.34</td><td>26.82 ± 0.35</td><td>26.85 ± 0.36</td><td>27.01 ± 0.35</td></tr><tr><td/><td>2x</td><td>0.8425</td><td/><td/><td/><td/></tr><tr><td>SSIM</td><td/><td/><td/><td/><td/><td/></tr></table>

Image super-resolution performance on RGB images from BSD-300 test set. Mean and standard deviation (of the mean) of Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index (SSIM) Wan (

Table content: <table/>

Peer review (iclr2017):
This paper proposes the RIMs that unrolls variational inference procedure. The author claims that the novelty lies in the separation of the model and inference procedure, making the MAP inference as an end-to-end approach. The effectiveness is shown in image restoration experiments. While unrolling the inference is not new, the author does raise an interesting perspective towards the `model-free* configuration, where model and inference are not separable and can be learnt jointly. However I do not quite agree the authors* argument regarding [1] and [2]. Although both [1] and [2] have pre-defined MAP inference problem. It is not necessarily that a separate step is required. In fact, both do not have either a pre-defined prior model or an explicit prior evaluation step as shown in Fig. 1(a). I believe that the implementation of both follows the same procedure as the proposed, that could be explained through Fig. 1(c). That is to say, the whole inference procedure eventually becomes a learnable neural network and the energy is implicitly defined through learning the parameters. Moreover, the RNN block architecture (GRU) and non-linearity (tanh) restrict the flexibility and implicitly form the inherent family of variational energy and inference algorithm. This is also similar with [1] and [2]. Based on that fact, I have the similar feeling with R1 that the novelty is somewhat limited. Also some discussions should be added in terms of the architecture and nonlinearity that you have chosen.