Given a source of prior knowledge, Gelly and Silver [3] proposed two directions to bootstrap UCT:
1.
Sample text:```The merging is based on the increase in the weighted-bycounts entropy [1] and is stopped by a threshold indicating the minimum number of training samples required to estimate a weight distribution.```
Sample intent: method
Sample text:```Because previous studies indicated that hexapeptides bind the junction core (29, 32), we tested two junctions, one with an AT-rich core and the other with a GC-rich core (Fig.```
Sample intent: result



Sample text:```…methods rely on some additional and often heuristic step to generate an initial solution, such as adversarially-trained neural networks [Conneau et al., 2018, Zhang et al., 2017a,b], robust self-learning [Artetxe et al., 2018b] or
5This can be easily verified by noting that the…```
Sample intent: background



Sample text:```This study supports the theory of a tumor origin from multipotential progenitor cells.(14) Reports of the Ki67 labeling index have demonstrated great variety.```
Sample intent: result



Sample text:```Our results confi rm previous studies that reached the same conclusion (Boushey et al 1994; Vermeulen et al 2000; Till et al 2005; Marcucci et al 2005).```
Sample intent: result



Sample text:```Following past work, we show that such basis models can be learned from 2D annotations using techniques adapted from nonrigid structure from motion (SFM) [20, 19].```
Sample intent: method
Sample text:```Note that in their pioneering paper Calvet and Fisher (2002) proposed the simplified version of the construction of Mannersalo et al (2002).```
Sample intent: method



Sample text:```Our results confi rm previous studies that reached the same conclusion (Boushey et al 1994; Vermeulen et al 2000; Till et al 2005; Marcucci et al 2005).```
Sample intent: result



Sample text:```We use BLEU (up to 4-grams) (Papineni et al., 2002) as evaluation metric, which computes the precision of n-grams in generated summaries with gold-standard abstracts as the reference.```
Sample intent: background



Sample text:```On the other hand, there are research works on the design of graph-based routing algorithms [3], [16], [17], [18], [19], [20], [21], [22], [23] to deal with the void problem.```
Sample intent: method



Sample text:```The merging is based on the increase in the weighted-bycounts entropy [1] and is stopped by a threshold indicating the minimum number of training samples required to estimate a weight distribution.```
Sample intent: method



Sample text:```The above estimator generalizes the estimator in Sriperumbudur et al., 2017 to conditional densities.```
Sample intent: method



Sample text:```In this sense, accidentally encountered information is also always algorithmically framed and often personalised by for example previous searches and geographical location (e.g. Abel et al., 2011; Feuz et al., 2011; Hannak et al., 2013).```
Sample intent: background



Sample text:```For seeking the optimal value of Wh of the sub-problems which corresponds to the h-th level, we can solve the problem by the smoothing proximal gradient (SPG) method [6] fortunately.```
Sample intent: background



Sample text:```This study supports the theory of a tumor origin from multipotential progenitor cells.(14) Reports of the Ki67 labeling index have demonstrated great variety.```
Sample intent: result



Sample text:```…methods rely on some additional and often heuristic step to generate an initial solution, such as adversarially-trained neural networks [Conneau et al., 2018, Zhang et al., 2017a,b], robust self-learning [Artetxe et al., 2018b] or
5This can be easily verified by noting that the…```
Sample intent: background