Fix a few issues in Retiarii

nni/retiarii/nn/pytorch/component.py

@@ -72,7 +72,7 @@ def _replicate_and_instantiate(blocks, repeat):
 
 class Cell(nn.Module):
     """
-    Cell structure [1]_ [2]_ that is popularly used in NAS literature.
+    Cell structure [zophnas]_ [zophnasnet]_ that is popularly used in NAS literature.
 
     A cell consists of multiple "nodes". Each node is a sum of multiple operators. Each operator is chosen from
     ``op_candidates``, and takes one input from previous nodes and predecessors. Predecessor means the input of cell.
@@ -95,8 +95,8 @@ class Cell(nn.Module):
 
     References
     ----------
-    .. [1] Barret Zoph, Quoc V. Le, "Neural Architecture Search with Reinforcement Learning". https://arxiv.org/abs/1611.01578
-    .. [2] Barret Zoph, Vijay Vasudevan, Jonathon Shlens, Quoc V. Le,
+    .. [zophnas] Barret Zoph, Quoc V. Le, "Neural Architecture Search with Reinforcement Learning". https://arxiv.org/abs/1611.01578
+    .. [zophnasnet] Barret Zoph, Vijay Vasudevan, Jonathon Shlens, Quoc V. Le,
         "Learning Transferable Architectures for Scalable Image Recognition". https://arxiv.org/abs/1707.07012
     """
 

nni/retiarii/nn/pytorch/mutator.py

@@ -15,7 +15,7 @@
 
 class LayerChoiceMutator(Mutator):
     def __init__(self, nodes: List[Node]):
-        super().__init__()
+        super().__init__(label=nodes[0].operation.parameters['label'])
         self.nodes = nodes
 
     def mutate(self, model):
@@ -40,7 +40,7 @@ def mutate(self, model):
 
 class InputChoiceMutator(Mutator):
     def __init__(self, nodes: List[Node]):
-        super().__init__()
+        super().__init__(label=nodes[0].operation.parameters['label'])
         self.nodes = nodes
 
     def mutate(self, model):
@@ -56,7 +56,7 @@ def mutate(self, model):
 
 class ValueChoiceMutator(Mutator):
     def __init__(self, nodes: List[Node], candidates: List[Any]):
-        super().__init__()
+        super().__init__(label=nodes[0].operation.parameters['label'])
         self.nodes = nodes
         self.candidates = candidates
 
@@ -69,7 +69,8 @@ def mutate(self, model):
 
 class ParameterChoiceMutator(Mutator):
     def __init__(self, nodes: List[Tuple[Node, str]], candidates: List[Any]):
-        super().__init__()
+        node, argname = nodes[0]
+        super().__init__(label=node.operation.parameters[argname].label)
         self.nodes = nodes
         self.candidates = candidates
 
@@ -84,7 +85,7 @@ def mutate(self, model):
 class RepeatMutator(Mutator):
     def __init__(self, nodes: List[Node]):
         # nodes is a subgraph consisting of repeated blocks.
-        super().__init__()
+        super().__init__(label=nodes[0].operation.parameters['label'])
         self.nodes = nodes
 
     def _retrieve_chain_from_graph(self, graph: Graph) -> List[Node]:

nni/retiarii/strategy/_rl_impl.py

@@ -1,6 +1,7 @@
 # This file might cause import error for those who didn't install RL-related dependencies
 
 import logging
+import threading
 from multiprocessing.pool import ThreadPool
 
 import gym
@@ -18,6 +19,7 @@
 
 
 _logger = logging.getLogger(__name__)
+_thread_lock = threading.Lock()
 
 
 class MultiThreadEnvWorker(EnvWorker):
@@ -100,7 +102,8 @@ def step(self, action):
                 if self.cur_step < self.num_steps else self.action_dim
         }
         if self.cur_step == self.num_steps:
-            model = get_targeted_model(self.base_model, self.mutators, self.sample)
+            with _thread_lock:
+                model = get_targeted_model(self.base_model, self.mutators, self.sample)
             _logger.info(f'New model created: {self.sample}')
             submit_models(model)
             wait_models(model)

nni/retiarii/strategy/bruteforce.py

@@ -62,7 +62,7 @@ def run(self, base_model, applied_mutators):
         search_space = dry_run_for_search_space(base_model, applied_mutators)
         for sample in grid_generator(search_space, shuffle=self.shuffle):
             _logger.debug('New model created. Waiting for resource. %s', str(sample))
-            if query_available_resources() <= 0:
+            while query_available_resources() <= 0:
                 time.sleep(self._polling_interval)
             submit_models(get_targeted_model(base_model, applied_mutators, sample))
 
@@ -113,6 +113,6 @@ def run(self, base_model, applied_mutators):
             search_space = dry_run_for_search_space(base_model, applied_mutators)
             for sample in random_generator(search_space, dedup=self.dedup):
                 _logger.debug('New model created. Waiting for resource. %s', str(sample))
-                if query_available_resources() <= 0:
+                while query_available_resources() <= 0:
                     time.sleep(self._polling_interval)
                 submit_models(get_targeted_model(base_model, applied_mutators, sample))

nni/retiarii/strategy/tpe_strategy.py

@@ -40,6 +40,18 @@ def choice(self, candidates, mutator, model, index):
 
 
 class TPEStrategy(BaseStrategy):
+    """
+    The Tree-structured Parzen Estimator (TPE) [bergstrahpo]_ is a sequential model-based optimization (SMBO) approach.
+    SMBO methods sequentially construct models to approximate the performance of hyperparameters based on historical measurements,
+    and then subsequently choose new hyperparameters to test based on this model.
+
+    References
+    ----------
+
+    .. [bergstrahpo] Bergstra et al., "Algorithms for Hyper-Parameter Optimization".
+        https://papers.nips.cc/paper/4443-algorithms-for-hyper-parameter-optimization.pdf
+    """
+
     def __init__(self):
         self.tpe_sampler = TPESampler()
         self.model_id = 0