Title: METAPIX: FEW-SHOT VIDEO RETARGETING

Abstract: We address the task of retargeting of human actions from one video to another. We consider the challenging setting where only a few frames of the target is available. The core of our approach is a conditional generative model that can transcode input skeletal poses (automatically extracted with an off-the-shelf pose estimator) to output target frames. However, it is challenging to build a universal transcoder because humans can appear wildly different due to clothing and background scene geometry. Instead, we learn to adapt -or personalize -a universal generator to the particular human and background in the target. To do so, we make use of meta-learning to discover effective strategies for on-the-fly personalization. One significant benefit of meta-learning is that the personalized transcoder naturally enforces temporal coherence across its generated frames; all frames contain consistent clothing and background geometry of the target. We experiment on in-the-wild internet videos and images and show our approach improves over widely-used baselines for the task.

1. INTRODUCTION:

One of the hallmarks of human intelligence is the ability to imagine. For example, given an image of a never-before-seen person, one can easily imagine them performing different actions. To do so, we make use of years of experience watching humans act and interact with the world. We implicitly encode the rules of physical transformations of humans, objects, clothing and so on. Crucially, we effortlessly adapt or retarget those universal rules to a specific human and environment -a child on a playground will likely move differently than an adult walking into work. Our goal in this work is to develop models that similarly learn to generate human motions by specializing universal knowledge to a particular target human and target environment, given only a few samples of the target.

It is attractive to tackle such video generation tasks using the framework of generative (adversarial) neural networks (GANs). Past work has cast the core computational problem as one of conditional image generation where input source poses (automatically extracted with an off-the-shelf pose estimator) are transcoded into image frames (Balakrishnan et al., 2018; Siarohin et al., 2018; Ma et al., 2017) . However, it is notoriously challenging to build generative models that are capable of synthesizing diverse, in-the-wild imagery. Notable exceptions make use of massively-large networks trained on large-scale compute infrastructure (Brock et al., 2019) . However, modestly-sized generative networks perform quite well at synthesis of targeted domains (such as faces (Bansal et al., 2018) or facades (Isola et al., 2017) ). A particularly successful approach to generating from pose-to-image is training of specialized -or personalized -models to particular scenes. These often require large-scale target datasets, such as 20 minutes of footage in a target lab setting (Chan et al., 2018) The above approaches make use of personalization as an implicit but crucial ingredient, by on-the-fly training of a generative model tuned to the particular target domain of interest. Often, personalization is operationalized by fine-tuning a generic model on the specific target frames of interest. Our key insight is recasting personalization as an explicit component of a video-retargeting engine, allowing us to make use of meta-learning to learn how best to fine-tune (or personalize) a generic model to a particular target domain. We demonstrate that (meta)learning-to-fine-tune is particularly effective in the few-shot regime, where few target frames are available. From a technical perspective, one of our contributions is extending meta-learning to GANs, which is nontrivial because both a generator and discriminator need to be adversarially fine-tuned. Figure 1 : Video retargeting on a budget. Our goal is to retarget a source video to a target, quickly (running a few, T , iterations for adaptation) and efficiently (given a few, K, frames from the target domain). We achieve that by (meta)learning a model θ that is able to quickly and efficiently adapt to a given target video.

Q f a d D Q r o z r 2 P p v G 9 2 8 H Q m j c O j I = " > A A A B 6 H i c b V D L S g N B E O y N r x h f U Y 9 e B o P g K e x G Q Y 9 B L 4 K X B M w D k i X M T n q T M b O z y 8 y s E E K + w I s H R b z 6 S d 7 8 G y f J H j S x o K G o 6 q a 7 K 0 g E 1 8 Z 1 v 5 3 c 2 v r G 5 l Z + u 7 C z u 7 d / U D w 8 a u o 4 V Q w b L B a x a g d U o + A S G 4 Y b g e 1 E I Y 0 C g a 1 g d D v z W 0 + o N I / l g x k n 6 E d 0 I H n I G T V W q t / 3 i i W 3 7 M 5 B V o m X k R J k q P W K X 9 1 + z N I I p W G C a t 3 x 3 M T 4 E 6 o M Z w K n h W 6 q M a F s R A f Y s V T S C L U / m R 8 6 J W d W 6 Z M w V r a k I X P 1 9 8 S E R l q P o 8 B 2 R t Q M 9 b I 3 E / / z O q k J r / 0 J l 0 l q U L L F o j A V x M R k 9 j X p c 4 X M i L E l l C l u b y V s S B V l x m Z T s C F 4 y y + v k m a l 7 F 2 U K / X L U v U m i y M P J 3 A K 5 + D B F V T h D m r Q A A Y I z / A K b 8 6 j 8 + K 8 O x + L 1 p y T z R z D H z i f P 6 N T j N M = < / l a t e x i t > ✓ < l a t e x i t s h a 1 _ b a s e 6 4 = " V R b F N f U 2 y J r h x T i o H N G 9 u 2 e Q 2 2 g = " > A A A B 7 X i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 m q o M e i F 4 8 V 7 A e 0 o W y 2 m 3 b t Z h N 2 J 0 I J / Q 9 e P C j i 1 f / j z X / j t s 1 B W x 8 M P N 6 b Y W Z e k E h h 0 H W / n c L a + s b m V n G 7 t L O 7 t 3 9 Q P j x q m T j V j D d Z L G P d C a j h U i j e R I G S d x L N a R R I 3 g 7 G t z O / / c S 1 E b F 6 w E n C / Y g O l Q g F o 2 i l V g 9 H H G m / X H G r 7 h x k l X g 5 q U C O R r / 8 1 R v E L I 2 4 Q i a p M V 3 P T d D P q E b B J J + W e q n h C W V j O u R d S x W N u P G z + b V T c m a V A Q l j b U s h m a u / J z I a G T O J A t s Z U R y Z Z W 8 m / u d 1 U w y v / U y o J E W u 2 G J R m E q C M Z m 9 T g Z C c 4 Z y Y g l l W t h b C R t R T R n a g E o 2 B G / 5 5 V X S q l W 9 i 2 r t /

To that end, we propose MetaPix, a novel approach to personalization for video retargeting. Our formulation treats personalization as a few-shot learning problem, where the task is to adapt a generic generative model of human actions to a specific person given a few samples of their appearance. Our formulation is agnostic to the actual generative model used, and is compatible with both poseconditioned transfer (Balakrishnan et al., 2018) or generative (Chan et al., 2018) approaches. Taking inspiration from the recent successes of meta-learning approaches for few-shot tasks (Nichol et al., 2018; Finn et al., 2017) , we propose a novel formulation by adapting the popular first-order metalearning algorithm Reptile (Nichol et al., 2018) for jointly learning initial weights for both the generator and discriminator. Hence, our model is optimized for efficient adaptation (personalization), given only a few samples and on a computational budget, and obtains stronger performance compared to a model not optimized in this form. Interestingly, we find this personalized model naturally enforces strong temporal coherence in the generated frames, even though it is not explicitly optimized for that task.

2. RELATED WORK:

Deep generative modeling. There has been a growing interest in using deep networks for generative modeling of visual data, particularly images. Popular techniques include Variational Auto-Encoders (VAEs) (Kingma & Welling, 2014) and Generative Adversarial Networks (GANs) (Goodfellow et al., 2014) . Particularly, GAN based techniques have shown strong performance for various tasks such as conditional image generation (Brock et al., 2019) , image-to-image translation (Isola et al., 2017; Wang et al., 2018b; Zhu et al., 2017; Balakrishnan et al., 2018) , unsupervised translation (Zhu et al., 2017) and domain adaptation (Hoffman et al., 2018) . More recently, these techniques have been extended to video tasks, such as generation (Vondrick et al., 2016) , future prediction (Finn et al., 2016) and translation (Bansal et al., 2018; Wang et al., 2018a) . Our work explores generative modeling from a few samples, with our main focus being the task of video translation. There has been some prior work in this direction (Zakharov et al., 2019) , though is largely limited to faces and portrait images.

Motion transfer and video retargeting. This refers to the task of driving a video of a person or a cartoon character given another video (Gleicher, 1998) . While there exist some unsupervised techniques (Bansal et al., 2018) to do so, most successful approaches for articulated bodies involve using pose as an intermediate supervision. Recently, there have been two broad categories of approaches that have been employed for this task: 1) Learning to transform an image into another, given pose as input, either in 2D (Zhou et al., 2019; Balakrishnan et al., 2018; Siarohin et al., 2018; Ma et al., 2017) or 3D (Liu et al., 2018; Neverova et al., 2018; Walker et al., 2017) . And 2) Learning a model to directly generate images given a pose as input (or, Pose2Im) (Chan et al., 2018) . The former approaches tend to be more sophisticated, separately generating foreground and background pixels, and tend to perform slightly better than the latter. However, they typically learn a generic model across datasets that can transfer from a single frame, whereas the latter can learn a more holistic reconstruction by learning a specific model for a video. Our approach is complementary to such transfer approaches, and be applied on top of either, as we discuss in Section 3. Meta Learning. The goal of metalearning is to learn models that are good at learning, similar to how humans are able to quickly and efficiently learn to do a new task. Many different approaches have been explored to that end. One direction involves learning weights through recurrent networks like LSTM (Hochreiter et al., 2001; Santoro et al., 2016; Duan et al., 2016) . More commonly, meta-learning has been used as a way to learn an initialization for a network, that is finetuned at test time on a new task. A popular approach in this direction is MAML (Finn et al., 2017) , where the parameters are directly optimized for the test time performance of the task it needs to adapt to. This is performed by backpropagating through the finetuning process by computing second order gradients. They and others (Andrychowicz et al., 2016) have also proposed first-order methods like FOMAML that forego the need to compute second order gradients, making it more efficient at empirically small drop in performance. However, most of these works still tend to have the requirement of SGD to be used as the task optimizer. A recently proposed meta-learning algorithm, Reptile (Nichol et al., 2018) , forgoes that constraint by proposing a much simpler first order meta learning algorithm that is compatible with any black box optimizer.

✓ ✓ ⇤ 1 ✓ ⇤ 2 ✓ ⇤ 3 rL 1 rL 2 rL 3 ✓ ⇤ 1 ✓ ⇤ 2 ✓ ⇤ 3 ✓ = (✓ D , ✓ G ) Meta-

3. OUR APPROACH:

We now describe MetaPix in detail. To reiterate, our goal is to learn a generic model of human motion, parameterized by θ, that can quickly and efficiently be personalized for a specific person. We define speed and efficiency requirements in terms of two parameters: computation/iterations (T ) and the number samples required for personalization (K), respectively. We now describe the base architecture, MetaPix training setup, and the implementation details.

Base retargeting architecture. We build upon popular video retargeting architectures. Notably, there are two common approaches in literature:1) Learning a transformation from one image to another, conditioned on the pose (Zhou et al., 2019; Balakrishnan et al., 2018) and 2) Learning a mapping from pose to RGB (Pose2Im), like (Chan et al., 2018) . Both obtain strong performance and amenable to the speed and efficiency constraints we are interested in. For example in K-shot setting (i.e. to learn a model using K frames), one can train the Pose2Im mapping using the K frames in the former case, or use the C K 2 pairs from K frames to learn a transformation function from one of the 

, θ G = Pix2PixHD T K (θ D , θ G ), for K images and T iterations Update θ D = θ D -( θ D -θ D ) Update θ G = θ G -( θ G -θ G ) end for

K images to another in the latter case. They are also both compatible with our MetaPix optimization discussed next.

Pose2Im (Chan et al., 2018) approaches essentially build upon image-to-image translation methods (Isola et al., 2017; Wang et al., 2018b) , where the input is a rendering of the body joints, and the output is an RGB image. The model consists of an encoder-decoder style generator G. It is trained using a combination of perceptual reconstruction losses (Johnson et al., 2016) , implemented using an L 1 penalty over VGG (Simonyan & Zisserman, 2015) features and discriminator losses, where we train a separate discriminator network D that is trained to differentiate the generated images from real images. The reconstruction loss forces it to be close to the ground truth, potentially leading to blurry outputs. Adding the discriminator helps fix that, as it forces the output onto the manifold of real images. Given its strong performance, we use Pix2PixHD (Wang et al., 2018b) as our base architecture for Pose2Im. For brevity, we skip a complete description of the model architecture, and refer the reader to (Wang et al., 2018b ) for more details.

Pose Transfer (Balakrishnan et al., 2018; Zhou et al., 2019) , on the other hand, takes a source image of a person and a target pose, and generates an image of the source person in that target pose. These approaches typically segment the limbs, transform their position as in the target pose, and generate the target image by combining the transformed limbs and segmented background by using a generative network like a U-Net (Ronneberger et al., 2015) . These approaches can leverage learning to move pixels instead of having to generate color and background image from a learned representation. We utilize the Posewarp method (Balakrishnan et al., 2018) as our base Pose Transfer architecture due to available implementation.

MetaPix. MetaPix builds upon the base retargeting architecture by optimizing it for few-shot and fast adaptation for personalization. We achieve that by taking inspiration from the literature on few-shot learning, where meta-learning has shown promising results. We use a recently introduced first-order meta-learning technique, Reptile (Nichol et al., 2018) . As compared to the more popular technique, MAML (Finn et al., 2017) , it is more efficient as it does not compute a second gradient and is amenable to work with arbitrary optimizers as it does not need to backpropagate through the optimization process. Given that GAN architectures are hard to optimize, Reptile suits our purposes of its ability to use Adam (Kingma & Ba, 2015), the default optimizer for Pix2PixHD, as our task optimizer. Figure 2 illustrates the high level idea of our approach, which we describe in detail next.

We start with either a Pose2Im or a Pose Transfer trained base model. We then finetune this model as described in Algorithm 1. Note that Pix2PixHD is based on a GAN, so has two network weights to be optimized, the generator (θ G ) and discriminator (θ D ). In each meta-iteration, we sample a task: in our case a set of K frames from a new video to personalize to. We then finetune the current model parameter to that video over T iterations, and update the model parameters in the direction of the personalized parameters using a meta learning rate . We optimize both θ D and θ G jointly at each step. Note that Posewarp employs a more complicated two-stage training procedure, and we metalearn only the first stage (which has no discriminator) for simplicity.

Implementation Details. We implement MetaPix for the Pose2Im base model by building upon a public Pix2PixHD implementation1 in PyTorch, and perform all experiments on a 4 TITAN-X or GTX 1080Ti GPU node. We follow the hyperparameter setup as proposed in (Wang et al., 2018b) . We represent the pose using a multi-channel heatmap image, and input and output are 512 × 512px RGB images. The generator consists of 16 convolutional and deconvolutional layers, and is trained with a equally weighted combination of GAN, Feature Matching, and VGG losses. Initially, we pretrain the model on a large corpus of videos to learn a generic Pose2Im model as described in Section 4. During this pretraining stage, the model is trained on all of the training frames for 10 epochs using learning rate of 0.0002 and batch size of 8 distributed over the 4 GPUs. We experimented with multiple learning rates including 0.2, 0.02, 0.002; however, we observed that higher learning rates caused the training to diverge. When finetuning for personalization, given K frames and a computational budget T , we train the first T 2 iterations using a constant learning rate of 0.0002, and the remaining iterations using a linear decay to 0, following (Wang et al., 2018b) . The batch size is fixed to 8, and for K < 8, we repeat the frames to get 8 images for the batch. For the metalearning, we set the meta learning rate, = 1 with a linear decay to 0, and train 300 meta-iterations. We also experiment with meta learning rate, = 0.1, however, was much slower to converge. To potentially stabilize metatraining, we experiment with differing numbers of updates to the generator and discriminator during iterations of Alg. 1, as well as simplified objective functions. Recall that the GAN loss adds significant complexity due to the presence of a discriminator that need also be adversarially finetuned. In total, our metalearning takes 1 day of training time on 4 GPUs. For the Pose Transfer base model, we apply MetaPix in a similar fashion on top of Posewarp 2 , using the author provided pretrained weights. We will release the MetaPix source code for details.

4. EXPERIMENTS:

We now experimentally evaluate MetaPix. We start by describing the datasets used and evaluation metrics. We then describe our base Pose2Im and Pose Transfer setup, followed by training that model using MetaPix. Finally, we analyze and ablate the various design choices in MetaPix.

4.1. DATASETS AND EVALUATION:

We train and evaluate our approach on in-the-wild internet videos. Due to the lack of a standard benchmark for such retargeting tasks, we use the dataset as described in (Zhou et al., 2019) as our test set. These are a set of 8 videos downloaded from youtube, each 4-12 minutes long. We refer the reader to Figure 1 in (Zhou et al., 2019) for sample frames from this dataset. Additionally, we collect a set of 10 more dance videos from YouTube (distinct from the above 8), as our pre-training and meta-learning corpus. We provide the list of YouTube video IDs for both in the supplementary. Our models are only trained on these videos, and videos from (Zhou et al., 2019) are only used for personalization (using K frames) and evaluation. Figure 3 shows sample frames from these newly collected videos.

Evaluation and Metrics: Similar to (Zhou et al., 2019) , we split each of the 8 test videos into a training and test sequence in 0.85:0.15 ratio, and sample K training and 2000 test frames from the test sequence. We use the same metrics as in (Zhou et al., 2019) for ease of comparison: Mean Squared Error (MSE), Structured Similarity Index (SSIM) and Peak Signal-to-Noise Ratio (PSNR). Each of these are averaged over the 2000 test frames from each of the 8 test videos. To compare our baselines and our method, pose retargeting as a task aims to minimize MSE and maximize SSIM and PSNR. Table 1 : Adding MetaPix. We compare the Pix2PixHD and Posewarp models' performance. The models are initialized either at random, pretrained on the entire training set of videos, or meta-learned with MetaPix.

Constraining the amount of frames and compute used at test time leads to a drop in performance as expected. In general, Pix2PixHD performs well with large training sets because it can learn to model subtle dependancies between pose and appearance. In contrast, Posewarp performs better with smaller training sets because it directly transfers pixels from the background and foreground. However, in both cases, meta-learning with MetaPix produces better performance, given the exact same test time constraints. We compare these methods qualitatively in Figure 4 . Specifically, we use all the frames from the first 85% of each video, and train it for 10 epochs. We report the performance of this model in first section of Table 1 and show sample generations in second column of Figure 4 . Since this model gets strong quantitative and qualitative performance, we stick with it as our base retargeting architecture through the rest of the experiments. We also employ a baseline retargeting model based on Posewarp for evaluation, but we focus on Pose2Im for further experimentation due to its relative simplicity. Now we evaluate the performance of our model in constrained settings, where we want to learn to personalize given a few samples and in a constrained computational budget. Hence, we use a pretrained model on train set and a random model, and we personalize them by finetuning on each test video. As Table 1 shows, applying constraints leads to a drop in performance in all methods, as expected from using only 5 frames finetuned over 20 iterations. Finally, we compare that to the MetaPix model: in that case, we start from the pre-trained model, and do meta-learning on top of those parameters to optimize them for the transfer task as described in Section 3. That leads to a significant improvement over the pretrained model, showing the strength of MetaPix for this task.

Method Init K T SSIM PSNR MSE Pix2PixHD Random ∞ ∞ 0.

In Figure 4 3 , we visualize the predictions using the unconstrained model, as well as the constrained models trained using MetaPix and without, i.e. with simple pretraining. It is interesting to note that the meta-learned model is able to adapt to the color of the clothing and the background much better than a pretrained model, given the same frames for personalization. This reinforces MetaPix is a much better initialization for few-shot personalization than directly finetuning from a generic pretrained model. We further explore this quality of coherence in the next section.

4.3. ABLATIONS:

We now ablate the key design choices in our MetaPix formulation. One of the strengths of our formulation is the explicit control on the supervision provided and computation the model is allowed to perform, and depending on the use-case, those parameters can easily be tweaked. We explore the effect of MetaPix on those parameters next on the Pose2Im base retargeting architecture.

Variation in K::

We vary the amount of supervision for personalization, K, and evaluate its effect on the metrics in Figure 5 . We compare the following models: a) Randomly initialized, b) Pretrained Figure 5 : Personalization using K frames. We find that while all initializations get better with increasing K, and using MetaPix consistently outperforms simple pretraining. Moreover we note that even using a model trained with MetaPix for K = 5 works well at any K value used at test time, showing the generalizability of MetaPix. It is worth noting that the biggest gap is seen at lower values of K, showing our method is most useful in cases where one has little data for personalization. on the train set, c) Trained using MetaPix for each value of K and tested with the same K, and d) Trained using MetaPix for K = 5 and tested at each value of K. The last one tests the generalizability of MetaPix to different values of K at train and test time. We find that the MetaPix trained models consistently perform better than a simple pretrained model on all metrics. Notably, the model only trained for K = 5 is still able to obtain strong performance at different K values, showing the MetaPix trained model can generalize beyond the specific setup it is optimized for. The gap between the MetaPix trained model and the pretrained model tends to reduce with higher K, which is as expected: more data for personalization would likely reduce the importance of the initialization. However, there is a clear and significant gap for lower values of K, showing that MetaPix is highly effective for retargeting from few samples. In fact, we find that meta-learning is most effective for K = 1, corresponding to the challenging scenario of video-to-image retargeting.

Variation in T : Similar to variation in supervision, we experiment with varying the computation, or T , in Figure 6 . We experiment with a similar set of baselines as in the case for K, and again observe that the MetaPix model consistently outperforms random initialization or pretraining on all metrics. Also, we see similar generalizability, as the model metatrained for T = 20 is able to perform well for other T values at test time too. The ability for MetaPix to generalize across K and T implies cost-effective strategies for training. The computational cost for training a meta-learner is dominated by fine-tuning, which scales linearly with K and T . Training with smaller values of both can result in significant speedups -up to 10× in our experiments.

Variation of meta learning rate : We also experimented with changing the meta learning rate. At = 0.1 (K = 5, T = 200), we obtained SSIM=0.47, similar to what the pretrained model gets. Using our default = 1.0, improves performance to 0.51. Hence, a higher meta learning rate was imperative to see improvements with MetaPix. Figure 7 demonstrates that such factored representations are easier to fine-tune, and result in more temporally stable generated videos.

a Video visualization is available at https://youtu.be/zFoT8VcbwsU

:

https://github.com/NVIDIA/pix2pixHD/

https://github.com/balakg/posewarp-cvpr2018

Video visualization at https://youtu.be/NlUmsd9aU-4

Video visualization at https://youtu.be/bxJJXCK4IoQ

Figures and Tables:

t e x i t s h a 1 _ b a s e 6 4 = " H

r J S v 8 n j K M I J n M I 5 e H A F d b i D B j S B w S M 8 w y u 8 O b H z 4 r w 7 H 4 v W g p P P H M M f O J 8 / p U W P L A = = < / l a t e x i t >

Figure 2: Meta-learning for video retargeting. Our goal is to learn a generic retargeting model θ (parameters of a Pix2PixHD (Wang et al., 2018b) in our case), such that it can be efficiently personalized for a specific person given only a few samples/frames of their appearance. We achieve it using meta-learning, where our model is optimized for personalization to a new person, given only K samples of their appearance, and being trained for T iterations.

Few-shot learning. Low shot learning paradigms attempt to learn a model using very small amount of training data(Thrun, 1996), typically for visual recognition tasks. Classical approaches build generative models that share priors across the various categories (Fei-Fei et al., 2006; Salakhutdinov et al., 2012). Another category of approaches attempt to learn feature representations invariant to intra-class variations by using hallucinated data (Hariharan & Girshick, 2017; Wang et al., 2018c) or specialized training procedures/loss functions (Wang & Hebert, 2016a; Bart & Ullman, 2005). More recently, it has been framed as a 'learning-to-learn' or a meta-learning problem. The key idea is to directly optimize the model, for the eventual few-shot adaptation task, where the model is finetuned using a few examples (Finn et al., 2017). Alternatively, it has also been explored in form of directly predicting classifier weights (Bertinetto et al., 2016; Wang & Hebert, 2016b; Wang et al., 2017; Misra et al., 2017).

Figure 3: Training data. Frames from the additional training data we collected. We download 10 videos from YouTube, distinct from the ones used for personalization and evaluation.

Figure 4: Qualitative comparison. Here we compare MetaPix with baselines and network architectures. The Pix2PixHD K = ∞ model is an upper bound tuned on all available frames for personalization. The last four columns compare the constrained setting, where at test time only K = 5 frames are used for personalization, over T = 20 iterations of fine-tuning. We visualize results of challenging pose-image test pairs that include rare poses not commonly scene in training. In this case, the pre-trained baseline tends to copy clothing and backgrounds from the training set, while MetaPix is much better at personalizing to the fine-tuning frames. The last two columns show that Posewarp is a more accurate base architecture than Pix2PixHD, but meta-learning on top of it still produces more accurate images with less blur.

Figure6: Personalization after T iterations. We compare performance on increasing the computational budget for personalization. As expected all initializations improve with T , though MetaPix consistently outperforms random or pretraining. Again we see strong generalizability, as a MetaPix model trained for T = 20 performs well at other T values used at test time.

Figure8: Qualitative Variation in K. We compare the MetaPix-trained models (MT) with their pretrained counterparts (PT) for K =[3, 5, 10, 20]. We fix the base architecture to Pix2PixHD and T = 20. With higher K, both methods generate good images, but with lower K, MetaPix generates backgrounds and clothing that better match the ground-truth. Our results illustrate that meta-learning excels in the few-shot regime.

Algorithm 1 Meta-learning for video re-targeting for the Pose2Im setup. Initialize θ D , θ G from pretrained weights for iteration = 1, 2, ... do Sample K pose image pairs from the same shot randomly Compute θ D

Table content: <table/>

We start by building our baseline retargeting model, based on Pix2PixHD(Wang et al., 2018b;Chan et al., 2018). To get a sense of the upper bound performance of our model, we train the model for each test video with no constraints on T or K, starting from the model pre-trained on our train set.

Table content: <table><tr><td/><td/><td/><td/><td>68</td><td colspan="2">19.56 2, 427.18</td></tr><tr><td/><td colspan="3">Pretrain ∞ ∞</td><td>0.69</td><td colspan="2">19.31 2, 673.40</td></tr><tr><td/><td>Random</td><td>5</td><td>20</td><td>0.08</td><td>9.51</td><td>7, 801.19</td></tr><tr><td/><td>Pretrain</td><td>5</td><td>20</td><td>0.35</td><td colspan="2">12.00 5, 576.28</td></tr><tr><td/><td>MetaPix</td><td>5</td><td>20</td><td>0.39</td><td colspan="2">13.73 4, 696.00</td></tr><tr><td/><td colspan="3">Pretrain ∞ ∞</td><td>0.58</td><td colspan="2">17.51 2, 901.13</td></tr><tr><td>Posewarp</td><td>Random</td><td>5</td><td>20</td><td>0.40</td><td colspan="2">12.25 4, 670.81</td></tr><tr><td/><td>Pretrain</td><td>5</td><td>20</td><td>0.55</td><td colspan="2">16.53 3, 140.91</td></tr><tr><td/><td>MetaPix</td><td>5</td><td>20</td><td>0.56</td><td colspan="2">16.94 2, 962.67</td></tr><tr><td>4.2 EVALUATING METAPIX</td><td/><td/><td/><td/><td/></tr></table>

Peer review (iclr2020):
This submission proposes an application of meta-learning to video frame generation modeling conditioned on human pose information, in order to allow the model to adapt to the context of each video. This context is provided in the form of a support set of K pairs of pose/frame images for the video. Reptile is used as the meta-learning method, and applied to two recently proposed video-frame generative networks (Pix2PixHD and Posewarp). In both cases, results show that Reptile is able to produce better adaptive models, i.e. models that when fine-tuned on the support set produce better image frames. Though the originality of the work is somewhat weak (it*s a relatively straightforward application of Reptile to Pix2PixHD and Posewarp), the problem setting is novel and I find the demonstration that Reptile works well in this setting interesting and valuable. The paper is also clearly written and easy to follow. For these reasons, I*m personally leaning towards recommending to accept this submission.