RandomNet: Towards Fully Automatic Neural Architecture Design for Multimodal Learning

Almost all neural architecture search methods are evaluated in terms of performance (i.e. test accuracy) of the model structures that it finds. Should it be the only metric for a good autoML approach? To examine aspects beyond performance, we propose a set of criteria aimed at evaluating the core of autoML problem: the amount of human intervention required to deploy these methods into real world scenarios. Based on our proposed evaluation checklist, we study the effectiveness of a random search strategy for fully automated multimodal neural architecture search. Compared to traditional methods that rely on manually crafted feature extractors, our method selects each modality from a large search space with minimal human supervision. We show that our proposed random search strategy performs close to the state of the art on the AV-MNIST dataset while meeting the desirable characteristics for a fully automated design process.


Introduction
Recent advances in deep learning have shown significant improvement in traditionally difficult tasks such as the recognition of images (He et al. 2016), videos Baccouche et al. 2011) andspeech (He et al. 2019). The design of neural network architectures often plays an important role in the performance of these tasks, and developing state-of-the-art neural architectures requires significant engineering efforts. The concept of AutoML (Mendoza et al. 2016) aims at developing efficient and off-theshelf learning systems that are designed to avoid the tedious tasks of manually selecting the correct neural architecture. For instance, the Neural Architecture Search (NAS) algorithm (Zoph and Le 2016) designs an image classification network automatically through the use of a recurrent neural network trained with reinforcement learning. A key observation in that context is that random architecture search has a surprisingly strong performance (Zoph and Le 2016;Cai et al. 2018) and it is only outperformed by highly complex search strategies.
This observation can also be made in the general multimodal setting. In that context, individual modalities are traditionally designed manually, trained separately and merged * Canada CIFAR AI Chair later through fusion layers. The approaches that explicitly merge the modalities at the deepest layers are known as late fusion (Snoek, Worring, and Smeulders 2005). MFAS (Pérez-Rúa et al. 2019) is a recent work that automatically design the connections in the fusion layers. Despite the strong performance of MFAS, the random search results reported by the authors is once again very competitive (within 0.5% test accuracy difference).
Naturally, this raises two questions: is random search always competitive with respect to more complex strategies? How much difference does the additional complexity in the search strategy brings (especially knowing that it can be less robust to variations in the setting)? Lastly, how can we take into account the above questions and evaluate a search method more comprehensively? In this work, we aim to address these questions by examining a random search agent in the multimodal setting with respect to a novel evaluation strategy.
Furthermore, existing work in the multimodal setting such as (Valentin Vielzeuf 2018) assume well-designed architectures are available for each modality. MFAS further requires the use of pre-trained feature-extractors. In practice, finding a properly designed and pre-trained neural network for each modality is a challenging task especially when the input modality moves away from common tasks such as image classification or voice recognition. In this work, we propose to design multimodal architectures completely from scratch, which includes the selection of architectures for each modality and the fusion network. In this way, not only is requirement for expert knowledge minimized in the process, but unimodal architectures designed specifically for a given dataset can be discovered (as opposed to using generic architectures).
Quantitatively evaluating the amount of human intervention required by different NAS methods is challenging. Nonetheless, we believe it is an important step towards a more robust evaluation of multimodal autoML methods. Indeed, while test accuracy is an important indicator for the performance of a method, other factors need to be taken into account for real world deployment. For example, approaches with similar test accuracy can differ greatly in terms of how easily they can be applied to different modalities, how much expertise is required to design their search space, and the availability of code. This paper aims at discussing the flaws of current multimodal NAS evaluation metrics.
Contributions (1) We analyze current multimodal NAS evaluation strategies and propose a set of criteria that take into account the difficulty of applying a NAS method into real world scenarios.
(2) Relying on the proposed evaluation criteria, we show that a simple search strategy such as random search can be preferred when scaling to new modalities for real world complex applications. (3) To the best of our knowledge, our proposed approach is the first fully automated neural architecture search method for multimodal learning. Unimodal architectures as well as the fusion network are designed from scratch. (4) We evaluate our proposed method on the AV MNIST dataset and achieves competitive performance relative to the current state-of-the-art methods.

Evaluating the Evaluation of Multimodal NAS
Recent methods evaluate the effectiveness of an architecture search procedure in terms of test accuracy and computational cost Pérez-Rúa et al. 2019;Zoph and Le 2016;Cai et al. 2018). These metrics provide an estimate of what results can be expected when a given method is applied. However, the difficulty of applying these methods to a real world setting and the amount of human expertise required to apply said methods is not evaluated. In the following, we propose an in-depth evaluation of neural architecture search methods, with a focus on the multimodal domain. To the best of our knowledge, together with the recent work by (Lindauer and Hutter 2019), this is one of the first attempts at discussing the limitation of current NAS evaluation procedures.
Variance on Performance Results presented in neural architecture search literature are often hard to replicate. Among other factors, variance in performance due to stochasticity is a significant concern when quantitatively evaluating NAS methods. Despite this, recent methods are rarely evaluated across multiple runs of the search procedure. For example, MFAS (Pérez-Rúa et al. 2019) only reports variance and standard deviation of accuracy for the top K sampled architectures for a given random seed. To make replication of the result more difficult, the random seed used in the experiments is not always provided, effectively making it impossible to exactly replicate the presented results. Evaluating the variance across multiple runs is especially important when the architecture budget is limited (see Table  3): what variance can be expected when running the same method, constrained a limited architecture budget, with a different random seed?
Degree of Human Intervention Minimization of human intervention is the motivation for AutoML. However, the evaluations proposed by recent methods often only focuses on performance. They have not taken into account factors such as how much domain knowledge is needed to apply the method and how much effort is needed to adapt to a different dataset or to a different task. Existing methods significantly differ in these factors and it is thus an important point of discussion. Unique to the multimodal domain, evaluation of the adaptability to different modalities is needed. In light of these considerations, we propose a novel evaluation strategy: • Requirements: Does the method require pre-defined, pretrained features extractors for each modality? This emphasizes the ability of the method to adapt to modalities for which publicly available models are few in numbers.
In which case, human experts are required to craft specific feature extractors beforehand. • Search space design: Does the proposed search procedure rely on non-standard hand-crafted search spaces? Utilization of standard search spaces disentangles the effect of the search strategy from the superiority of the search space. • Training procedure: Are sampled networks trained in a standard way or a more specific training strategy is used? Similarly to the type of search space used, this question also aims at disentangling the final performance from domain specific training strategies or tricks. • Adaptation to new modalities: What is the computational cost of adding, removing or changing modalities? Does the search procedure need to be repeated from scratch or can previous knowledge be reused through transfer learning, policy transfer or other approaches? • Code availability: NAS methods are particularly hard to reproduce and their performance is strongly tied to implementation details which are often poorly documented or omitted. Therefore, code availability is an important factor to measure how much expert effort is needed to apply a NAS method.

Methodology
To analyze the performance of multimodal neural architectures designed by random search, we focus on the task of bi-modal classification. The training samples are composed of tuples (x, y; z) where x, y represent the first and second input modalities and z the classification labels respectively. Note that while we only experiment with bi-modal classification, our method can be straightforwardly extended to any number of input modalities for which a search space can be defined.

Multimodal Search Space
In this work, we divide our search strategy into two major components: feature extractors and fusion network.
Feature extractors To design effective feature extractors, we adopt the micro-architecture search paradigm (Zoph et al. 2018;Pham et al. 2018). That is, instead of searching over the entire architecture our method first designs cells and the final architecture is obtained by stacking these cells.
To design cells, we adopt the graph structure and operations set of ENAS (Pham et al. 2018). Each cell is a direct acyclic graph (DAG) and each node is composed by an operation O and an activation A. Edges forming skip connections are part of the search process. We use the standard operation set from (Pham et al. 2018) where |O| = 6 and the operations are: 3 × 3 and 5 × 5 convolutions, 3 × 3 and 5 × 5 Linear layer (size of concatenate selected features) ; end depthwise-separable convolutions, max-pooling and average pooling. Furthermore, we set |A| = 4 with A = {ReLU, Tanh, Identity, Sigmoid}. Let L be the number of layers inside a cell, the resulting number of possible cells for each modality is 6 L × 4 L × 2 L(L−1)/2 . In our experiments, we fix L = 5 resulting in 8 × 10 9 unique cells for each modality. Cells are then stacked C m times, where the subscript m indexes the modality and is empirically fixed to C 1 = C 2 = 3.
Fusion network To fuse the multimodal features extracted by feature extractors for final classification, we design the fusion network following the method described in (Pérez-Rúa et al. 2019). That is, fully connected layers are used and the search space is composed of activations A and connections. The activations used for feature extractors are also employed here. Different from (Pérez-Rúa et al. 2019) where each fusion layer can only be connected to one layer from each feature extractor, we do not impose such constraints. Therefore, we allow a fusion layer at a given depth d with d = 1, . . . , D and D ≥ C to connect to any cell C at a lower or equal depth. More formally, a fusion layer f d is defined by the following equation: where σ d ∈ A, W d indicates the trainable fusion layer Algorithm 2: Multimodal architecture search Parameters: C 1 , C 2 : number of cells for each modality, E: number of architectures to search, S: training steps per architecture Output: Best architecture a * a * ← None ; for e = 1, . . . , E do C e1 ← Sample cell structure for first modality ; C e2 ← Sample cell structure for second modality ; F e ← Sample fusion network ; a e ← Assemble multimodal architecture ; for s = 1, . . . , S do a e ← Train(a e ) ; end accuracy ← Eval(a e ) ; if accuracy(a e ) ≥ accuracy(a * ) then a * ← a e ; end end weights and x d is a vector where the probability of each element being present is sampled from a Bernoulli distribution with p = 0.5. y d is obtained in a similar fashion, and the features x i , y i are mapped to the same dimension through global pooling. In the case of d = 1, i.e. the first fusion layer, the term f d−1 in Eq. (1) is omitted. The resulting number of

Search Procedure
To evaluate the effectiveness of a random search strategy, we do not rely on any trainable search strategy such as the ones discussed in the introduction. Instead, given the search space defined above, decisions in the design of children networks are determined by a random policy. First, a cell type is sampled for each modality and repeated C m times. Note that cells for each modality are sampled individually and can be extended to use different search spaces (e.g. 1-d convolutions instead of 2-d to process 1-d inputs instead of images). Once all modalities are built, the fusion network is designed by sampling features from each cell and choosing which activation function to use. Global pooling is used to make every sampled feature map into a fixed size. Algorithm 1 provides an overview of this process.
To obtain the best architecture among the sampled ones in a timely fashion, we rely on two main strategies to reduce the training time of sampled architectures: parameter sharing and early stopping. Parameter sharing has been shown to be a beneficial technique when searching over multiple architectures since it can significantly reduce training time by reusing weights learned in the previous iterations. Since the goal of the search phase is to obtain an estimate of each architecture's performance, we do not need to train sampled networks to convergence. For this reason, we only train a sampled architecture for a limited number of batches S Accuracy (%) Search Time Modality Architecture Budget Automatic LeNet-3 (LeCun et al. 1990) 74.52 -Images -No LeNet-5 (LeCun et al. 1990) 66 which we empirically fix to 10% of the dataset. Algorithm 2 provides a schema of the training procedure. The accuracy of sampled architectures are evaluated on a separate validation set similar to (Cai et al. 2018). Children networks are trained using a cross entropy loss with Adam optimizer (Kingma and Ba 2014). The learning rate is set to be 10 −4 for S steps, while the final best architecture is trained for 50 epochs.

Experimental Results
In this section we evaluate our proposed random search approach on the Audio-Visual MNIST dataset (Valentin Vielzeuf 2018), a bi-modal dataset composed of images and audio. The first modality corresponds to 28 × 28 grey scale images from the MNIST dataset where 75% energy reduction through PCA has been performed (Abdi and Williams 2010). The second one features pronounced digits from the Free Spoken Digits dataset (Jackson 2017), perturbed by adding random noises sampled from the ESC-50 dataset (Piczak 2015). As a comparable preprocessing step to (Pérez-Rúa et al. 2019), 112 × 112 spectrograms are computed from these audio samples and used as input for our method. Overall, the AV-MNIST dataset contains 55,000 training samples, 5,000 validation samples and 10,000 test samples.
We show that, under the same resource budget, random search can compete with more complex search strategies while tackling the bigger problem of end-to-end multimodal architecture search. We evaluate our method on the following metrics: test accuracy, search time and architecture budget. Table 1 reports the results of this evaluation. Despite simply relying on random search, Ran-domNet surpasses unimodal networks by a significant margin and achieves comparable performance to both state of the art hand-crafted multimodal methods such as Central-Net (Valentin Vielzeuf 2018) and the semi-automatically designed network from (Pérez-Rúa et al. 2019). More importantly, it does so with a limited budget and exploring a vastly larger search space where the feature extractors and the fusion network are designed jointly. Figure 1 depicts the best architecture found during our search. For both input modalities, the best performance is achieved by cells that feed inputs and lower layers' features to deeper layers, a finding in line with what was shown by recent approaches such as residual networks (He et al. 2016). Concerning the fusion network, unsurprisingly the method favors a highly connected graph sampling features from most of the unimodal cells and resulting in an architecture extremely similar to the one presented in (Valentin Vielzeuf 2018). Note that while the two architectures share major similarities, our final multimodal network is simply trained using a standard cross-entropy loss while CentralNet benefits from a more complex training procedure where multiple losses are employed. While the already small gap in accuracy could be addressed by using a similar training pipeline, the focus of this work is to provide an analysis of the (surprisingly competitive) performance of random search in fully automated multimodal architecture search.
Understanding the robustness of architecture search under different random seeds is an important step in evaluating how suitable a method is for real world deployment. To evaluate how stable RandomNet is in these conditions, we perform the following experiment: the search is repeated 5 times, with the same architecture budget and hyperparameters but under different random seeds. Table 3 reports the results of this evaluation. As it can be seen, three out of five runs exhibit an accuracy in line with our initial findings, with two of them obtaining sub-par performance. Interestingly, four runs out of five resulted in the same number of fusion parameters: while the connectivity in these fusion networks is different, this shows that the best performing model found during each run is often the one where the connectivity of the fusion network is around 50%. That is, out of 12 possible connections between fusion layers and cells (see Figure  1.c), experiments 2 to 5 sampled 5 connections.
Finally, we compare RandomNet to MFAS (Pérez-Rúa et al. 2019) using the criteria proposed above and report the results in Table 2. Notice that while the two methods perform similarly in terms of test accuracy and search cost, Ran-domNet appears more suitable for real world applications. Its main advantage is its ability to automatically design unimodal feature extractors, while MFAS requires them to be available beforehand. Furthermore, RandomNet relies on a simpler and more straightforward training pipeline. Realworld performance is often a trade-off between accuracy, complexity and scalability and, in the case of multimodal NAS, real world application could involve input modalities for which a state of the art is not well established. If this is the case, one could see that, given this evaluation, the small loss in test accuracy of RandomNet can be offset by its ability to seamlessly deal with new input modalities.

Conclusions
In this paper we presented an analysis of the evaluation strategies for multimodal neural architecture search. We argued that while accuracy is an important metric, autoML    methods should also minimize the effort for real-world deployment. In particular, we proposed a checklist that aims at evaluating the amount of human intervention required to apply a multimodal NAS method to different settings or modalities. Furthermore, we proposed a fully automatic method for deriving multimodal architectures and showed that a simple random search strategy can achieve competitive results.
To the best of our knowledge, this is the first time fully automated multimodal neural architecture search is addressed. While this initial attempt confirmed the competitive performance of random search, we present a brief discussion of what are the necessary steps to achieve end-to-end, fully automated multimodal architecture search with minimal human intervention. For future work, we first plan on adopting a learned search strategy to explore the vast search space of multimodal networks in a more structured manner. For instance, reinforcement learning based multi-agent systems have been recently shown to be beneficial to neural architecture search and could be employed here. Second, to reduce the restrictions for the number of layers per cell and the number of cell repetitions, we plan to implement an incremental architecture growth strategy. Intuitively, the search method would grow the network until a given metric, e.g. accuracy, stops improving. This would automatically design neural networks that best fit a given dataset or modality.